Noon lecture
list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)
In year 2013, there were the following noon lectures:
|
5. 12. 2013 at 12:20 | David Roberson: Entanglement-assisted homomorphisms ( abstract ) |
|
28. 11. 2013 at 12:20 | Andrea Jiménez: On the directed cycle double cover Conjecture ( abstract ) |
|
21. 11. 2013 at 12:20 | Miklos Ruszinko: Uniform hypergraphs containing no grids ( abstract ) |
|
14. 11. 2013 at 12:20 | Cristian Lenart: A combinatorial model for Kirillov-Reshetikhin crystals and applications ( abstract ) |
|
7. 11. 2013 at 12:20 | Josef Bekesi: Bin Packing: Analysis of Online and Semionline Algorithms ( abstract ) |
|
3. 10. 2013 at 12:20 | Derek Corneill: On the Power of Graph Searching ( abstract ) |
|
12. 9. 2013 at 12:20 | George Mertzios: On the Recognition of Four-Directional Orthogonal Ray Graphs ( abstract ) |
|
29. 8. 2013 at 12:20 | Matthias Mnich: Fixed-parameter algorithms for scheduling problems ( abstract ) |
|
25. 7. 2013 at 12:20 | Jonathan Noel: Choosability of Graphs with Bounded Order ( abstract ) |
|
18. 7. 2013 at 12:20 | Min Chen: (3,1)*-choosability of planar graphs ( abstract ) |
|
20. 6. 2013 at 12:20 | Lukasz Jez: Online Knapsack Revisited ( abstract ) |
|
13. 6. 2013 at 12:20 | Liana Yepremyan: Sparse halves in dense triangle-free graphs ( abstract ) |
|
6. 6. 2013 at 12:20 | Martin Tancer: Recognition of collapsible complexes is NP-complete ( abstract ) |
|
9. 5. 2013 at 12:20 | Igor Køí¾: On algebraic vector bundles over configuration spaces ( abstract ) |
|
2. 5. 2013 at 12:20 | Tereza Klimo¹ová: Forcibility and testability of permutation properties ( abstract ) |
|
11. 4. 2013 at 12:20 | Peter Horák: On Minkowski's conjecture ( abstract ) |
|
4. 4. 2013 at 12:20 | Moshe Rosenfeld: The Odd Distance Graph ( abstract ) |
|
28. 3. 2013 at 12:20 | Pavol Hell: List homomorphisms ( abstract ) |
|
21. 3. 2013 at 12:20 | Mary Inaba: Unified Approach for SAT Solvers to Achieve Efficient Diversification ( abstract ) |
|
14. 3. 2013 at 12:20 | Gábor Kun: Expanders have a large girth Lipschitz spanning subgraphs ( abstract ) |
|
24. 1. 2013 at 12:20 | Gerhard Woeginger: Optimization at the second level ( abstract ) |
|
10. 1. 2013 at 12:20 | Béla Bollobás: Union-Closed Families of Sets ( abstract ) |