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 2009, there were the following noon lectures:
|
17. 12. 2009 at 12:20 | František Kardoš: Fractional total colorings of graphs of high girth ( abstract ) |
|
10. 12. 2009 at 12:20 | Lukasz Jez: Online Scheduling of Similarly Ordered Packets ( abstract ) |
|
3. 12. 2009 at 12:20 | Jens M. Schmidt: Construction sequences of 3-connected graphs ( abstract ) |
|
1. 12. 2009 at 12:20 | Ondra Suchý: Parameterized Complexity of Arc-Weighted Directed Steiner Problems ( abstract ) |
|
19. 11. 2009 at 12:20 | Luke Postle: Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs ( abstract ) |
|
12. 11. 2009 at 12:20 | Thomas Erlebach: Computing Minimum Spanning Trees with Uncertainty ( abstract ) |
|
10. 11. 2009 at 12:20 | Martin Kochol: Counterexample to the conjecture of Grunbaum ( abstract ) |
|
5. 11. 2009 at 12:20 | Jiří Matoušek: Minimum and maximum against k lies ( abstract ) |
|
29. 10. 2009 at 12:20 | Jiri Fiala: Finding induced paths in claw-free graphs ( abstract ) |
|
22. 10. 2009 at 12:20 | Andrew Goodall: Graph homomorphisms and contraction-deletion invariants ( abstract ) |
|
8. 10. 2009 at 12:20 | Jae-Sook Cheong: Computing All Form-Closure Grasps of Rectilinear Polyhedra ( abstract ) |
|
6. 10. 2009 at 12:20 | Otfried Cheong: Set systems and families of permutations with small traces ( abstract ) |
|
3. 8. 2009 at 12:20 | Konrad Swanepoel: Maximal equilateral sets ( abstract ) |
|
23. 7. 2009 at 12:20 | John Gimbel: Some defective parameters in graph theory ( abstract ) |
|
26. 6. 2009 at 12:20 | Indra Rajasingh: Exact Wirelength of an Embedding ( abstract ) |
|
26. 6. 2009 at 13:00 | Bharati Rajan: On Minimum Metric Dimension of Architectures ( abstract ) |
|
23. 6. 2009 at 12:20 | Arumugama: TBA ( abstract ) |
|
18. 6. 2009 at 12:20 | Iain Moffatt: Medial graphs and twisted duals ( abstract ) |
|
4. 6. 2009 at 12:20 | Louis Esperet: Perfect matchings in cubic graphs ( abstract ) |
|
21. 5. 2009 at 12:20 | Vít Jelínek: Extending partial plane embeddings ( abstract ) |
|
14. 5. 2009 at 12:20 | Martin Tancer: Non-representability of finite projective planes by convex sets ( abstract ) |
|
12. 5. 2009 at 12:20 | Igor Kříž: Verlinde algebra ( abstract ) |
|
7. 5. 2009 at 12:20 | Martin Škoviera: Real flows on cubic graphs ( abstract ) |
|
4. 5. 2009 at 9 | : ( abstract ) |
|
30. 4. 2009 at 12:20 | Andrew King: Colouring claw-free graphs ( abstract ) |
|
23. 4. 2009 at 12:20 | Daniel Paulusma: The Disconnected Cut problem ( abstract ) |
|
16. 4. 2009 at 12:20 | Marko Berezovsky: A Method to Solve the Weighted Constraint Satisfaction Problem (WCSP) ( abstract ) |
|
9. 4. 2009 at 12:20 | Ignaz Rutter: Computing Large Matchings Fast ( abstract ) |
|
2. 4. 2009 at 12:20 | Peter Golovach: How to Guard a Graph? ( abstract ) |
|
26. 3. 2009 at 12:20 | Mihyun Kang: How to count planar graphs with given numbers of vertices and edges? ( abstract ) |
|
19. 3. 2009 at 12:20 | Ivan Dovica: Approach to Robust Tail Assignment ( abstract ) |
|
5. 3. 2009 at 12:20 | Jiří Witzany: Valuation of Derivatives using Binomial Trees with Infinitesimals ( abstract ) |
|
12. 2. 2009 at 12:20 | Gregor Masbaum: Integral structures in TQFT ( abstract ) |
|
5. 2. 2009 at 12:20 | Jan Hladký: Embedding thin large graphs ( abstract ) |
|
15. 1. 2009 at 12:20 | Milan Hladík: On the interval eigenvalue problem ( abstract ) |
|
8. 1. 2009 at 12:20 | Yared Nigussie: Nesetril dualities are decidable ( abstract ) |