Older Noon Lectures
2005
|
15. 12. 2005
at 12:20 |
Stephan Mertens: Graph isomorphism: statistical physics methods | abstract |
|
8. 12. 2005
at 12:20 |
Omer Gimenez: Asymptotic enumeration of labelled planar graphs | abstract |
|
1. 12. 2005
at 12:20 |
Martin Kochol: Applications of superposition in graph theory | abstract |
|
24. 11. 2005
at 12:20 |
Anna de Mier: The lattice of cyclic flats of a matroid | abstract |
|
3. 11. 2005
at 12:20 |
Martin Mareš: Internet meets Combinatorics | abstract |
|
20. 10. 2005
at 12:20 |
Ricky Pollack: A New Methodology in Geometric Transversal Theory | abstract |
|
13. 10. 2005
at 12:20 |
Iain Moffatt: Knot Homologies and Graph Polynomials | abstract |
|
10. 10. 2005
at 12:20 |
Nina Lehmann: Evolution of networks | abstract |
2006
|
21. 12. 2006
at 12:20 |
Jean-Sébastien Sereni: Circular choosability of graphs | abstract |
|
14. 12. 2006
at 12:20 |
Tobias Muller: Identifying codes in (random) unit disk graphs | abstract |
|
7. 12. 2006
at 12:20 |
Jan van den Heuvel: Circular Arboricity of Graphs | abstract |
|
4. 12. 2006
at 12:20 |
Jan van den Heuvel: On the Diameter of the Transportation Polytope | abstract |
|
30. 11. 2006
at 12:20 |
Zsolt Tuza: Generalizations of mixed hypergraphs | abstract |
|
27. 11. 2006
at -- |
: | abstract |
|
23. 11. 2006
at 12:20 |
Frederic Havet: Directed star arboricity | abstract |
|
16. 11. 2006
at 12:20 |
Martin Pergel: On Recognition of PC-graphs | abstract |
|
9. 11. 2006
at 12:20 |
: HOMONOLO | abstract |
|
1. 11. 2006
at 9:00 |
: | abstract |
|
1. 11. 2006
at 9:50 |
: | abstract |
|
30. 10. 2006
at 12:20 |
Diana Piguet, Maya Stein: On an approximate version of the Loebl-Komlos-Sos conjecture | abstract |
|
26. 10. 2006
at 12:20 |
Lutz G. Lucht: On finite pattern-free sets of integers | abstract |
|
25. 10. 2006
at 10:40 |
Guillermo Pineda Villavicencio: On the Degree/Diameter Problem for both bipartite and non-bipartite graphs | abstract |
|
25. 10. 2006
at 11:30 |
JianMin Tang: Connectivity and Superconnectivity of digraphs with prescribed semigirth | abstract |
|
23. 10. 2006
at 12:00 |
Lutz G. Lucht: Recurrence sequences with arithmetic properties | abstract |
|
19. 10. 2006
at 12:20 |
Dirk Schlatter: Constrained random graph processes | abstract |
|
12. 10. 2006
at 12:20 |
Attila Por: Overlap Graphs | abstract |
|
5. 9. 2006
at 12:20 |
Leonard J. Schulman: Clustering lines: classification of incomplete data | abstract |
|
22. 6. 2006
at 12:20 |
Mark Siggers: The Complexity of Some Restricted H-Colouring Problems | abstract |
|
1. 6. 2006
at 12:20 |
Gabor Hegedus: on Ramsey theory | abstract |
|
25. 5. 2006
at 12:20 |
Gabor Hegedus: Grobner bases | abstract |
|
23. 5. 2006
at 12:20 |
Peter Golovach: Distance constrained labellings for trees | abstract |
|
18. 5. 2006
at 12:20 |
Dieter Kratsch: A Simple $O (2^{0.288 n})$ Independent Set Algorithm | abstract |
|
12. 5. 2006
at 12:20 |
Martin Rubey: Symmetry properties of statistics of lattice paths in ladders | abstract |
|
10. 5. 2006
at 12:20 |
Martin Škoviera: Edge-colourings of cubic graphs and partial Steiner triple | abstract |
|
6. 4. 2006
at 12:20 |
Tetsuo Asano: Mathematical and Algorithmic Approaches to Digital Halftoning | abstract |
|
10. 3. 2006
at 12:20 |
Jose Zamora: Complexity of linear mappings induced by graphs | abstract |
|
9. 3. 2006
at 12:20 |
Anna de Mier: k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams | abstract |
|
2. 3. 2006
at 12:20 |
Jose Soto: Degree matrices | abstract |
|
26. 1. 2006
at 12:20 |
Sotiris Nikoletseas: Design and analysis of algorithms for wireless sensor networks | abstract |
2007
|
20. 12. 2007
at 12:20 |
Standa Zivny: The Expressive Power of Valued Constraints: Hierarchies and Collapses | abstract |
|
13. 12. 2007
at 12:20 |
Miklos Maroti: Weak near-unanimity and constraint satisfaction problems | abstract |
|
29. 11. 2007
at 12:20 |
Francesc Comellas: The Hierarchical Product of Graphs | abstract |
|
15. 11. 2007
at 12.20 |
Petr Golovach: On tractability of Cops and Robbers game | abstract |
|
21. 9. 2007
at 12:10 |
Jerrold R. Griggs: Large families of subsets avoiding a given configuration | abstract |
|
19. 7. 2007
at 12:20 |
Viola Meszaros: The Slope Number of $K_{n,m}$ | abstract |
|
28. 6. 2007
at 12:20 |
Jean-Sébastien Sereni: The Bermond-Thomassen conjecture | abstract |
|
14. 6. 2007
at 12:20 |
Vít Jelínek: Monochromatic triangles in two-colored plane | abstract |
|
7. 6. 2007
at 12:20 |
Milan Hladík: Systems of linear equations inside given intervals | abstract |
|
31. 5. 2007
at 12:20 |
Dmitry Gavinsky: Classical Interaction Cannot Replace a Quantum Message | abstract |
|
24. 5. 2007
at 12:20 |
Michael Rubinstein: Primes, the Riemann Hypothesis, and Random Matrices | abstract |
|
3. 5. 2007
at 12:20 |
Italo Dejter: Dominating sets in graphs | abstract |
|
3. 5. 2007
at 13:00 |
Dániel Marx: On tree width, bramble size, and expansion | abstract |
|
12. 4. 2007
at 12:20 |
Mike Newman: A little about covering arrays, some independent sets and a graph core | abstract |
|
5. 4. 2007
at 12:20 |
Ales Privetivy: How many points can be reconstructed from k projections? | abstract |
|
29. 3. 2007
at 12:20 |
Hossein Teimoori Faal: The ABC-Conjecture: Beyond The Fermat Last Theorem | abstract |
|
22. 3. 2007
at 12:20 |
Petr Skovron: Removing degeneracy may require unbounded dimension increase | abstract |
|
15. 3. 2007
at 12:20 |
Martin Klazar: How many ordered factorizations may n have? | abstract |
|
8. 3. 2007
at 12:20 |
Jan Kratochvil: Exact algorithms for generalized domination | abstract |
|
22. 2. 2007
at 12:20 |
Tomas Bily: Digital cell | abstract |
|
15. 2. 2007
at 12:20 |
Michael Stiebitz: Edge Colourings of Graphs | abstract |
|
8. 2. 2007
at 12:20 |
Jan Foniok: Computing amoebas using semidefinite programming | abstract |
|
1. 2. 2007
at 12:20 |
: | abstract |
|
25. 1. 2007
at 12:20 |
: | abstract |
|
18. 1. 2007
at 12:20 |
Jiří Fink: Perfect Matchings Extend to Hamilton Cycles in Hypercubes | abstract |
|
11. 1. 2007
at 12:20 |
Attila Por: Conway's Angel | abstract |
|
4. 1. 2007
at 12:20 |
: | abstract |
2008
|
18. 12. 2008
at 12:20 |
Natalio Krasnogor: An Evolutionary Algorithm Approach to Guiding the Evolution of Self-Organised Nanostructured Systems | abstract |
|
11. 12. 2008
at 12:20 |
Benoit Larose: The complexity of the list homomorphism problem for graphs | abstract |
|
11. 12. 2008
at 12:20 |
Claude Tardif: Interlacing adjoints of tournaments | abstract |
|
27. 11. 2008
at 12:20 |
Patrice Ossona de Mendez: Restricted dualities for graphs | abstract |
|
20. 11. 2008
at 12:20 |
Louis Esperet: A unified approach to distance-two coloring of graphs on surfaces | abstract |
|
13. 11. 2008
at 12:20 |
Diana Piguet: Schelp's conjecture | abstract |
|
6. 11. 2008
at 12:20 |
Jiří Fiala: On packing coloring for trees and grids | abstract |
|
30. 10. 2008
at 12:20 |
Jorge Ramirez: Frobenius problem: Applications | abstract |
|
23. 10. 2008
at 12:20 |
Peter Golovach: Spanners in sparse graphs | abstract |
|
16. 10. 2008
at 12:20 |
Pavel Skums: Krausz dimension of graphs | abstract |
|
9. 10. 2008
at 12:20 |
Daniel Král: Removal Lemma for systems of linear equations | abstract |
|
11. 9. 2008
at 12:20, |
Mike Fellows: Some New Developments and Open Problems in Parametrized Algorithms and Complexity | abstract |
|
21. 8. 2008
at 15:00 |
Matt DeVos: Seymour-Schrijver conjecture | abstract |
|
19. 6. 2008
at 12:20, |
Andrzej Proskurowski: Computing minimum distortion embeddings into a path | abstract |
|
12. 6. 2008
at 12:20 |
Tobias Mueller: Circular choosability is rational | abstract |
|
5. 6. 2008
at 12:20 |
Jindrich Zapletal: A new Ramsey property on Polish spaces | abstract |
|
15. 5. 2008
at 12:20, |
Jan Kratochvíl: Exact algorithms for Frequency Assignment: Branching versus Dynamic Programming | abstract |
|
17. 4. 2008
at 12:20, |
Frank Ruskey: The mysterious behavior of "meta-Fibonacci" sequences | abstract |
|
3. 4. 2008
at 12:20 |
Stefan Ratschan: Quasi-decidability and its Role in Hybrid Systems Verification | abstract |
|
27. 3. 2008
at 12:20 |
Bernard Anderson: Automorphisms of the truth-table degrees | abstract |
|
20. 3. 2008
at 12:20 |
Hossein Teimoori Faal: Karaji's L-Summing Method | abstract |
|
13. 3. 2008
at 12:20 |
Josef Cibulka: Untangling planar graphs | abstract |
|
6. 3. 2008
at 12:20 |
: University of Alberta | abstract |
|
28. 2. 2008
at 12:20 |
Martin Loebl: Enumeration by matrix integrals | abstract |
|
21. 2. 2008
at 12:20 |
Nicolas Lichiardopol: A new bound for a particular case of the Caccetta-Häggkvist conjecture | abstract |
|
14. 2. 2008
at 12:20 |
Lubos Thoma: On graphs and their orientations | abstract |
|
17. 1. 2008
at 12.20 |
Anastasios Sidiropoulos: Probabilistic Embeddings of Bounded Genus Graphs Into Planar Graphs | abstract |
2009
|
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 |
2010
|
16. 12. 2010
at 12:20 |
Eric Sedgwick: Spirals | abstract |
|
18. 11. 2010
at 12:20 |
Ida Kantor: Large subfamilies with forbidden configurations | abstract |
|
11. 11. 2010
at 12:20 |
Benjamin Matschke: News on the colored Tverberg problem | abstract |
|
4. 11. 2010
at 12:20 |
Xavier Goaoc: Bag of lines models for non-central linear cameras | abstract |
|
2. 11. 2010
at 12:20 |
Ivan Dovica: Robust tail assignment | abstract |
|
26. 10. 2010
at 12:20 |
Stephan Thomasse: Coloring Graphs via VC_dimension | abstract |
|
21. 10. 2010
at 12:20 |
Frantisek Matus: Matroids represented by entropies | abstract |
|
14. 10. 2010
at 12:20 |
Paul Bonsma: Feedback vertex set in mixed graphs | abstract |
|
7. 10. 2010
at 12:20 |
Dan Kral: Perfect matchings in cubic bridgeless graphs | abstract |
|
6. 5. 2010
at 12:20 |
Andrew Goodall: The Tutte polynomial characterizes simple outerplanar graphs | abstract |
|
8. 4. 2010
at 12:20 |
Mathew Francis: Intersection graphs of boxes and cubes | abstract |
|
1. 4. 2010
at 12:20 |
Zuzka Safernová: On the nonexistence of k-reptile tetrahedra | abstract |
|
30. 3. 2010
at 12:20 |
Tomáš Vyskočil: Faithful Representations of Graphs by Islands in the Extended Grid | abstract |
|
25. 3. 2010
at 12:20 |
Christian Scheideler: Stabilizing Consensus With the Power of Two Choices | abstract |
|
11. 2. 2010
at 12:20 |
Francis Sergeraert: Constructive Algebraic Topology | abstract |
|
7. 1. 2010
at 12:20 |
Honza Hladký: Tree packing conjectures; Graceful tree labeling conjecture | abstract |
2011
|
20. 12. 2011
at 12:20 |
Krzysztof Choromanski: The Erdos-Hajnal Conjecture for a new infinite class of tournaments | abstract |
|
15. 12. 2011
at 12:20 |
Daniel Paulusma: Lift Contractions | abstract |
|
13. 12. 2011
at 12:20 |
Pim van 't Hof: Parameterized complexity of vertex deletion into perfect graph classes | abstract |
|
10. 11. 2011
at 12:20 |
Archontia Giannopoulou: LIFO-search on Graphs and Digraphs | abstract |
|
3. 11. 2011
at 12:20 |
Torsten Ueckerdt: Non-crossing Connectors in the Plane | abstract |
|
27. 10. 2011
at 12:20 |
Andrew Treglown: Embedding spanning subgraphs via degree sequence conditions | abstract |
|
20. 10. 2011
at 12:20 |
Anna Gundert: Expansion for 2-complexes | abstract |
|
25. 8. 2011
at 12:20 |
Dmitry Tonkonog: A classification of embeddings of punctured n-manifolds into R^{2n-1} | abstract |
|
18. 8. 2011
at 12:20 |
Ambat Vijayakumar: Graph Operators and Its Dynamics - Some recent studies | abstract |
|
11. 8. 2011
at 12:20 |
Jane Gao: Distribution of certain types of spanning subgraphs in G(n,p) | abstract |
|
2. 8. 2011
at 12:20 |
Jens M. Schmidt: k-angulations on point sets | abstract |
|
30. 6. 2011
at 12:20 |
Asaf Levin: The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature | abstract |
|
30. 6. 2011
at 13:00 |
Ondrej Bojar: Word alignment as a combinatorial task | abstract |
|
28. 6. 2011
at 12:20 |
Sang-il Oum: Vertex-minors and pivot-minors of graphs | abstract |
|
16. 6. 2011
at 12:20 |
Andrew King: Bounding the chromatic index: Exploiting and sidestepping structure | abstract |
|
16. 6. 2011
at 13:00 |
Steven Chaplick: Characterizing Path Graphs and Directed Path Graphs using PR-trees | abstract |
|
9. 6. 2011
at 12:20 |
Peter Horak: Tiling $n$-space by unit cubes. | abstract |
|
2. 6. 2011
at 12:20 |
Carl Yerger: Steinberg's conjecture for higher surfaces | abstract |
|
26. 5. 2011
at 12:20 |
Ondřej Suchý: Feedback vertex set on graphs of low cliquewidth | abstract |
|
19. 5. 2011
at 12:20 |
Katherine Edwards: Packing T-joins in Planar Graphs | abstract |
|
12. 5. 2011
at 12:20 |
Luke Postle: 3-Connected Minor-Minimal Non-Projective Planar Graphs with an Internal 3-Separation | abstract |
|
3. 5. 2011
at 12:20 |
Petr Kolman: Approximate Duality of Multicommodity Multiroute Flows and Cuts | abstract |
|
31. 3. 2011
at 12:20 |
Martin Klazar: Counting paths in the honeycomb lattice | abstract |
|
24. 3. 2011
at 12:20 |
Honza Hladký: Hamilton cycles in dense vertex-transitive graphs | abstract |
|
24. 3. 2011
at 13:00 |
Paul Dorbec: Partitioning graphs into forests of stars | abstract |
|
20. 1. 2011
at 12:20 |
Guillermo Pineda Villavicencio: Hamiltonicity of Cayley, vertex-transitive and certain graph covers | abstract |
2012
|
11. 12. 2012
at 12:20 |
Krysztof Choromanski: The Erdos-Hajnal Conjecture | abstract |
|
29. 11. 2012
at 12:20 |
Pavol Hell: Interval Digraphs | abstract |
|
18. 10. 2012
at 12:20 |
Diana Piguet: Embedding trees in sparse graphs | abstract |
|
5. 6. 2012
at 12:20 |
Jerrold R. Griggs: Supersaturation in the Boolean Lattice | abstract |
|
31. 5. 2012
at 12:20 |
Igor Kříž: Knot theory: a current view | abstract |
|
17. 5. 2012
at 12:20 |
Stefan Ratschan a Peter Franek: Quasi-decidability of a Fragment of the First-order Theory of the Real Numbers and Topological Extension of Maps to the Sphere | abstract |
|
3. 5. 2012
at 12:20 |
Moshe Rosenfeld: The Odd-Distance Graph | abstract |
|
26. 4. 2012
at 12:20 |
Torsten Ueckerdt: Three Ways to Cover a Graph | abstract |
|
12. 4. 2012
at 12:20 |
Joanne Hall: Similarities between mutually unbiased bases and projective planes | abstract |
|
5. 4. 2012
at 12:20 |
Jarett Schwartz: Coalescing Balls and Bins | abstract |
|
2. 4. 2012
at 12:20 |
Tomaž Pisanski: GI graphs and their groups | abstract |
|
9. 3. 2012
at 12:20 |
György Dósa: It's only scheduling and bin packing (but we like it). | abstract |
|
23. 2. 2012
at 12:20 |
Marek Eliáš: Higher-order Erdõs-Szekeres theorems | abstract |
|
9. 2. 2012
at 12:20 |
Maria Saumell: Bounds on the diameter of the flip graph | abstract |
|
2. 2. 2012
at 12:20 |
Florian Pfender: Rainbow Matchings in Graphs | abstract |
|
19. 1. 2012
at 12:20 |
Xavier Goaoc: On the monotonicity of the expected complexity of a random polytope | abstract |
|
12. 1. 2012
at 12:20 |
Laszlo Vegh: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives | abstract |
|
5. 1. 2012
at 12:20 |
Ondra Suchý: The Parameterized Complexity of Local Search for TSP | abstract |
|
3. 1. 2012
at 12:20 |
Bernard Lidický: Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube | abstract |
2013
|
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 |
2014
|
15. 12. 2014
at 12:20 |
Krzysztof Choromanski: Excluding pairs of tournaments | abstract |
|
1. 12. 2014
at 12:20 |
Eli Shamir: Old and new Transformations of Grammars: Structural, Algorithmic and Linguistic Applications | abstract |
|
22. 10. 2014
at 10:40 |
Steve Chaplick: Overlap and Intersection Representations of Planar Graphs by Squares | abstract |
|
25. 9. 2014
at 12:20 |
Orit Raz: On the number of unit-area triangles spanned by points in the plane | abstract |
|
18. 9. 2014
at 12:20 |
Gerth Stølting Brodal: Computing Triplet and Quartet Distances Between Trees | abstract |
|
16. 9. 2014
at 12:20 |
Orit Raz: On the number of unit-area triangles spanned by points in the plane | abstract |
|
11. 9. 2014
at 11:00 |
Arnab Bhattacharyya: Higher-order Fourier analysis and applications | abstract |
|
14. 8. 2014
at 10:40 |
Michael Saks: Two very efficient approximation algorithms for the longest increasing subsequence | abstract |
|
17. 6. 2014
at 11:00 |
Sebastian Ordyniak: Backdoors into Heterogeneous Classes of SAT and CSP | abstract |
|
16. 6. 2014
at 11:00 |
Matthias Mnich: Multivariate Algorithmics for Hard Optimization Problems | abstract |
|
11. 6. 2014
at 12:20 |
Václav Chvátal: Points and lines in metric spaces | abstract |
|
5. 6. 2014
at 12:20 |
Seth Pettie: Sharp Bounds on Davenport-Schinzel Sequences of Every Order | abstract |
|
30. 5. 2014
at 10:00 |
Diana Piguet: An approximate version of the tree packing conjecture for bounded degree | abstract |
|
29. 5. 2014
at 11:00 |
Andreas Feldmann: Network Algorithms for Real-World Graphs | abstract |
|
27. 5. 2014
at 15:00 |
Morteza Monemizadeh: Estimating Streaming Maximum Matching in Planar Graphs and Beyond | abstract |
|
22. 5. 2014
at 12:20 |
Elazar Goldenberg: Direct Sum Testing | abstract |
|
7. 5. 2014
at 12:20 |
Moshe Rosenfeld: Hamiltonian cycles in prisms over graphs | abstract |
|
17. 4. 2014
at 12:20 |
Ronald de Wolf: Fourier analysis and the minimal degree of polynomials for Boolean functions | abstract |
|
13. 3. 2014
at 12:20 |
Ariel Gabizon: Representative sets for multisets | abstract |
|
27. 2. 2014
at 12:20 |
Martin Loebl: A remark on the Alon Tarsi conjecture | abstract |
|
13. 2. 2014
at 12:20 |
Edgardo Roldan Pensado: Hyperplane transversal to coloured sets | abstract |
|
11. 2. 2014
at 12:20 |
Lucas Hosseini: Quantifier-free Convergence of Structures | abstract |
|
6. 2. 2014
at 12:20 |
Iain Moffatt: Graphs are to matroids, as embedded graphs are to what? | abstract |
|
23. 1. 2014
at 12:20 |
Rob van Stee: Dividing connected chores fairly | abstract |
|
9. 1. 2014
at 12:20 |
Jan Volec: Compactness and finitely forcible graphons | abstract |
2015
|
1. 12. 2015
at 12:20 |
Andreas Feldmann: On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree | abstract |
|
12. 11. 2015
at 12:20 |
Liana Yepremyan: The Local Stability Method and the Turán numbers of extensions | abstract |
|
5. 11. 2015
at 12:20 |
Martin Doležal: Cliques in dense inhomogeneous random graphs | abstract |
|
29. 10. 2015
at 13:00 |
Stephen Kobourov: Analyzing the Language of Food on Social Media | abstract |
|
12. 10. 2015
at 12:20 |
MohammadTaghi Hajiaghayi: Parameterized and Promised Streaming: Making Big Data More Accessible | abstract |
|
8. 10. 2015
at 13:10 |
Stephen Kobourov: Proportional Contact Representation of Planar Graphs | abstract |
|
1. 10. 2015
at 12:20 |
Tomáš Masařík: Computational complexity of distance edge labeling | abstract |
|
24. 9. 2015
at 12:20 |
Jonathan Noel: Extremal Bounds for Bootstrap Percolation in the Hypercube | abstract |
|
17. 9. 2015
at 12:20 |
Martin Balko: Drawing graphs using a small number of obstacles | abstract |
|
10. 9. 2015
at 12:20 |
Dan Kral: Analytic representation of large graphs | abstract |
|
3. 9. 2015
at 12:20 |
Ping Hu: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle | abstract |
|
25. 6. 2015
at 12:20 |
Jan Hladký: f-vectors of flag complexes | abstract |
|
4. 6. 2015
at 12:20 |
Alfredo Hubard: Limits of order types | abstract |
|
28. 5. 2015
at 12:20 |
Balazs Patkos: On the number of maximal intersecting k-uniform families | abstract |
|
14. 5. 2015
at 12:20 |
Matěj Stehlík: Colouring quadrangulations of projective spaces | abstract |
|
16. 4. 2015
at 12:20 |
Martin Loebl: Deciding 4-colorability of planar triangulations is polynomial independently of the Four Color Theorem | abstract |
|
9. 4. 2015
at 12:20 |
Rasmus Ibsen-Jensen: Strategy complexity of concurrent games | abstract |
|
2. 4. 2015
at 12:20 |
Moshe Rosenfeld: Moshe Rosenfeld's problem session | abstract |
|
12. 3. 2015
at 12:20 |
Moshe Rosenfeld: The odd-distance graph | abstract |
|
10. 3. 2015
at 14:00 |
Sagnik Mukhopadhyay: Tribes is hard in the message passing model | abstract |
|
19. 2. 2015
at 12:20 |
Ruggero Gabbrielli: Splitting spaces and their representation: Tilings from graphs and vice versa | abstract |
|
8. 1. 2015
at 12:20 |
Jiří Fink: Applied optimization in Smart Grids | abstract |
|
7. 1. 2015
at 12:20 |
Ervin Gyori: 3-uniform hypergraphs with no linear cycles | abstract |
2016
|
22. 12. 2016
at 12:20 |
Matas Šileikis: Concentration of extension counts in random graphs | abstract |
|
15. 12. 2016
at 12:20 |
Petr Glivický: (Un)provability of Fermat's last theorem and Catalan's conjecture in formal arithmetics | abstract |
|
8. 12. 2016
at 12:20 |
Marthe Bonamy: Kempe equivalence of colourings | abstract |
|
6. 12. 2016
at 14:00 |
Lutz Warnke: The phase transition in the random d-process | abstract |
|
1. 12. 2016
at 12:20 |
Torsten Mütze: Trimming and gluing Gray codes | abstract |
|
10. 11. 2016
at 12:20 |
Arnaud de Mesmay: On the complexity of optimal homotopies | abstract |
|
3. 11. 2016
at 12:20 |
Alexandr Kazda: Beyond perfect matchings: Solving edge-CSP for even delta-matroids | abstract |
|
24. 10. 2016
at 14:00 |
Alexandr Kazda: Constraint Satisfaction Problems and the Datalog language (CSI candidate talk) | abstract |
|
21. 10. 2016
at 14:00 |
Pavel Hubáček: Barriers in Algorithmic Game Theory Through the Cryptographic Lens (CSI candidate talk) | abstract |
|
20. 10. 2016
at 12:20 |
Martin Tancer: On Betti numbers of flag complexes with forbidden induced subgraphs (How many holes may a graph have) | abstract |
|
18. 10. 2016
at 12:20 |
Kazuhisa Makino: Posimodular Function Optimization | abstract |
|
13. 10. 2016
at 12:20 |
Martin Mareš: Practical data structures | abstract |
|
2. 9. 2016
at 12:20 |
Bernard Lidicky: Decomposing random d-regular graphs into stars | abstract |
|
25. 8. 2016
at 12:20 |
Michael Saks: The Population Recovery problem | abstract |
|
21. 7. 2016
at 12:20 |
Zvi Lotker: Social Networks and Plays | abstract |
|
21. 6. 2016
at 12:20 |
Zvi Lotker: TBA | abstract |
|
21. 6. 2016
at 12:20 |
Zvi Lotker: TBA | abstract |
|
31. 5. 2016
at 12:12 |
Martin Balko a Josef Cibulka: Recent progress on the Erdős-Szekeres conjecture | abstract |
|
17. 5. 2016
at 12:20 |
Matas Sileikis: Probabilistic botany: from rooted subgraph counts to leaves of random trees (faculty candidate talk) | abstract |
|
12. 5. 2016
at 12:20 |
Tereza Klimošová: Finitely forcible limits of graphs and permutations (faculty candidate talk) | abstract |
|
21. 4. 2016
at 12:20 |
Herbert Fleischner: Hamiltonicity in squares of graphs revisited | abstract |
|
19. 4. 2016
at 12:20 |
Yan Zheng: Coresets for Kernel Density Estimates and the Implications | abstract |
|
7. 4. 2016
at 12:20 |
Matthias Mnich: Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments | abstract |
|
24. 3. 2016
at 12:20 |
Nitin Saurabh: Upper Bounds on Fourier-Entropy | abstract |
|
21. 3. 2016
at 12:20 |
Torsten Mütze: A new combinatorial Gray code for balanced combinations | abstract |
|
17. 3. 2016
at 12:20 |
Torsten Mütze: Some recent developments on the middle levels conjecture | abstract |
|
10. 3. 2016
at 12:20 |
Dušan Knop: Parameterized complexity of length-bounded cuts (Jirka Matoušek Prize talk) | abstract |
|
10. 3. 2016
at 13:00 |
Martin Schmid: Algorithmic Game Theory and Poker (Jirka Matoušek Prize talk) | abstract |
|
3. 3. 2016
at 12:20 |
Martin Balko: Bounds on ordered Ramsey numbers of bounded-degree graphs (Jirka Matoušek Prize talk) | abstract |
|
25. 2. 2016
at 12:20 |
Tereza Klimošová: Edge-partitioning into paths for graphs of low edge-connectivity | abstract |
2017
|
21. 12. 2017
at 12:20 |
Jan Volec: Bounded colorings of graphs and hypergraphs | abstract |
|
14. 12. 2017
at 12:20 |
Martin Böhm: Nested Convex Bodies are Chaseable (J. Matoušek prize talk) | abstract |
|
11. 12. 2017
at 12:20 |
Torsten Mütze: On Hamilton cycles in highly symmetric graphs | abstract |
|
7. 12. 2017
at 12:20 |
Steven Chaplick: Approximation Schemes for Geometric Coverage Problems | abstract |
|
30. 11. 2017
at 12:20 |
Marthe Bonamy: Partitioning the vertices of a torus into isomorphic subgraphs | abstract |
|
24. 11. 2017
at 12:20 |
Martin Balko: Ramsey numbers for restricted colorings | abstract |
|
2. 11. 2017
at 12:20 |
Peter Zeman: On H-topological intersection graphs | abstract |
|
19. 10. 2017
at 12:20 |
Peter Vojtáš: Complexity of the search for a Challenge-Response reduction | abstract |
|
12. 10. 2017
at 12:20 |
Stanislav Nagy: Halfspace depth and the geometry of multivariate quantiles | abstract |
|
13. 6. 2017
at 12:20 |
Lenka Zdeborová: Circular coloring of random graphs: statistical physics investigation | abstract |
|
8. 6. 2017
at 12:20 |
Bernard Lidický: Bounding small Ramsey numbers | abstract |
|
26. 5. 2017
at 12:20 |
Pavel Klavík: Jordan-like characterization of automorphism groups of planar graphs (J. Matoušek prize talk) | abstract |
|
25. 5. 2017
at 12:20 |
Peter Zeman: Jordan-like characterizations of automorphism groups for restricted classes of graphs (J. Matoušek prize talk) | abstract |
|
18. 5. 2017
at 12:20 |
Dmitry Gavinsky: Some examples of exponential advantage in quantum communication | abstract |
|
11. 5. 2017
at 12:20 |
Rajesh Chitnis: Parameterized Streaming Algorithms | abstract |
|
5. 5. 2017
at 12:20 |
Martin Balko: A superlinear lower bound on the number of 5-holes | abstract |
|
4. 5. 2017
at 12:20 |
Martin Balko: Covering lattice points by subspaces and counting point-hyperplane incidences | abstract |
|
27. 4. 2017
at 12:20 |
Vojtěch Kaluža: A direct proof of the strong Hanani-Tutte theorem on the projective plane (J. Matousek prize talk) | abstract |
|
20. 4. 2017
at 12:20 |
Martin Koutecký: Voting and Bribing in Single-Exponential Time (J. Matousek prize talk) | abstract |
|
13. 4. 2017
at 13:00 |
Tom Kelly: Toward a Local Version of Reed's Conjecture on omega, Delta, and chi | abstract |
|
23. 3. 2017
at 12:20 |
Marcin Pilipczuk: Subexponential Parameterized Algorithms for Planar Graphs, Apex-Minor-Free Graphs and Graphs of Polynomial Growth via Low Treewidth Pattern Covering | abstract |
|
9. 3. 2017
at 12:20 |
Anup Rao: Lower bounds on Non-adaptive Data Structures for Median and Predecessor search | abstract |
|
23. 2. 2017
at 12:20 |
Jan Kynčl: Simple realizability of complete abstract topological graphs simplified | abstract |
|
9. 2. 2017
at 12:20 |
Daqing Yang: Generalizations of theorems of Nash-Williams and Hakimi on graph decompositions | abstract |
|
12. 1. 2017
at 12:20 |
Stephan Wagner: Paths vs. stars in the local profile of trees | abstract |
2018
|
6. 12. 2018
at 12:30 |
Manfred Scheucher: Using SAT Solvers in Combinatorics and Geometry | abstract |
|
6. 12. 2018
at 13:20 |
Tomáš Masařík: Colouring (P_r+P_s)-Free Graphs | abstract |
|
15. 11. 2018
at 12:30 |
Raúl González Silva: Kernels, Grundy functions and circulant digraphs | abstract |
|
8. 11. 2018
at 12:30 |
Phablo Moura: Subdivision of digraphs with large minimum out-degree | abstract |
|
24. 9. 2018
at 12:30 |
Rado Fulek: Embeddability of Graphs and 2-dimensional Simplicial Complexes | abstract |
|
13. 9. 2018
at 12:20 |
Jan Volec: The codegree threshold of K4- | abstract |
|
4. 9. 2018
at 12:20 |
Carsten Schütt: Flag numbers and floating bodies | abstract |
|
28. 8. 2018
at 12:20 |
Elisabeth Werner: Floating bodies and approximation of convex bodies by polytopes | abstract |
|
15. 8. 2018
at 12:30 |
Raúl González Silva: Kernels, Grundy functions and circulant digraphs | abstract |
|
15. 8. 2018
at 12:30 |
Raúl González Silva: Kernels, Grundy functions and circulant digraphs | abstract |
|
9. 7. 2018
at 12:00 |
Subir Ghosh: Chromatic art gallery problems for point and vertex guards | abstract |
|
28. 6. 2018
at 12:20 |
Vojtěch Kaluža: Lipschitz mappings of discrete sets in Euclidean spaces (Jirka Matoušek prize talk) | abstract |
|
21. 6. 2018
at 12:20 |
Martin Schmidt: Two Worlds Behind Computers Playing Games and How to Bring Them Together (Jirka Matoušek prize talk) | abstract |
|
19. 6. 2018
at 12:20 |
Seyyed Mahdi Sedaghat: An Efficient and Secure Attribute-Based Signcryption Scheme for Smart Grid Applications | abstract |
|
14. 6. 2018
at 12:20 |
Stephen Kobourov: Multi-Level Steiner Tree | abstract |
|
10. 5. 2018
at 12:20 |
Andreas Feldmann: Recent Advancements at the Intersection of Parameterized and Approximation Algorithms | abstract |
|
3. 5. 2018
at 12:20 |
Tomáš Masařík: Local Dimension of Posets: Lower & Upper Bounds and Removable Theorems | abstract |
|
2. 5. 2018
at 12:20 |
Pavol Hell: Interval-like Graphs and Digraphs | abstract |
|
26. 4. 2018
at 12:20 |
Daniël Paulusma: Colouring Square-Free Graphs without Long Induced Paths | abstract |
|
24. 4. 2018
at 12:20 |
Eric Allender: New Chapters in an Old Story: Circuit Size Minimization and Kolmogorov Complexity | abstract |
|
29. 3. 2018
at 12:20 |
Dan Kráľ: Uniqueness of optimal configurations in extremal combinatorics | abstract |
|
22. 3. 2018
at 12:20 |
Alexandr Kazda: Algebraic Approach to Promise Constraint Satisfaction | abstract |
|
15. 3. 2018
at 12:20 |
Sebastian Siebertz: A tutorial on uniform quasi-wideness | abstract |
|
1. 2. 2018
at 12:20 |
Andrei Asinowski: Enumeration of lattice paths with forbidden patterns | abstract |
2019
|
19. 12. 2019
at 12:30 |
Jan Volec: Forcing quasi-randomness in permutations | abstract |
|
17. 12. 2019
at 10:45 |
Sudatta Bhattacharya: Exploring Closeness Centrality and Related Measures for Sparse and Planar Graphs | abstract |
|
5. 12. 2019
at 12:30 |
Jonathan Narboni: On the 4-color theorem for signed graphs | abstract |
|
7. 11. 2019
at 12:30 |
Carl Feghali: Graph Theory meets Extremal Set Theory | abstract |
|
29. 10. 2019
at 10:40 |
Pavel Hubáček: On Average-Case Hardness of Search Problems with Guaranteed Existence of Solution | abstract |
|
12. 9. 2019
at 12:30 |
Sunil Chandran: Separation Dimension of Graphs and Hyper Graphs | abstract |
|
5. 9. 2019
at 12:30 |
Moslem Zamani: New bounds for quadratic programming | abstract |
|
25. 7. 2019
at 12:30 |
Ali Mili: Absolute Correctness and Relative Correctness | abstract |
|
11. 7. 2019
at S11 |
Torsten Mütze: Combinatorial generation via permutation languages | abstract |
|
20. 6. 2019
at 12:30 |
Cornelius Brand: Extensor-Coding: An algebraic Method for hard Graph problems | abstract |
|
19. 6. 2019
at 12:30 |
Sebastian Ordyniak: Recent Advances on the Parameterized Complexity of Integer Linear Programming | abstract |
|
13. 6. 2019
at 12:30 |
Cemil Dibek: Edge-Extremal Graphs Under Degree and Matching Number Restrictions | abstract |
|
29. 5. 2019
at 12:30 |
Wolfgang Mulzer: Dynamic Maintenance of the Lower Envelope of Pseudo-Lines | abstract |
|
7. 5. 2019
at 12:30 |
Jan Novák: Plabic graphs in physics | abstract |
|
2. 5. 2019
at 12:30 |
Davis Issac: Covering and Partitioning Edges with Complete Bipartite Subgraphs | abstract |
|
2. 5. 2019
at 15:40 |
Manfred Scheucher: On Erdős-Szekeres Type Questions in R^d | abstract |
|
29. 4. 2019
at 12:30 |
Emo Welzl: Connectivity of Triangulation Flip Graphs in the Plane | abstract |
|
25. 4. 2019
at 12:30 |
Michael Elkin: Distributed Exact Shortest Paths Algorithm in Sublinear Time | abstract |
|
23. 4. 2019
at 12:30 |
Debarati Das: Jirka Matoušek Prize Noon lecture: Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time | abstract |
|
4. 4. 2019
at 12:30 |
Matěj Konečný: Jirka Matoušek Prize Noon lecture: Structural Ramsey theory, homomorphism dualities and completions | abstract |
|
28. 3. 2019
at 12:30 |
Tereza Klimošová: Algorithms for graphs without linear forests | abstract |
|
26. 3. 2019
at 12:30 |
Pavel Veselý: A Tight Lower Bound for Quantile Summaries | abstract |
|
19. 3. 2019
at 12:30 |
Matthias Mnich: Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set | abstract |
|
28. 2. 2019
at 12:30 |
Torsten Mütze: On symmetric chains and Hamilton cycles | abstract |
|
17. 1. 2019
at 12:30 |
Carl Feghali: Paths between colourings of sparse graphs | abstract |
2020
|
14. 5. 2020
at 12:20 |
---: AlgoMaNet | abstract |
|
7. 5. 2020
at 12:20 |
---: AlgoMaNet | abstract |
|
16. 4. 2020
at 12:30 |
TBA: Workshop on Deep Learning | abstract |
|
16. 4. 2020
at 12:30 |
Michal Rolinek: Differentiation of Blackbox Combinatorial Solvers | abstract |
|
2. 4. 2020
at 12:30 |
Matěj Konečný: Jirka Matoušek Prize Noon lecture: Extending partial automorphisms | abstract |
|
5. 3. 2020
at 12:30 |
David Chodounský: P-ultrafilters on natural numbers | abstract |
|
27. 2. 2020
at 12:30 |
Jan Kyncl: Counterexample to a variant of the Hanani-Tutte theorem on the surface of genus 4 | abstract |
|
20. 2. 2020
at 12:30 |
Sergei Lando: On a (yet) non-existing polynomial graph invariant | abstract |
|
9. 1. 2020
at 12:30 |
Manfred Scheucher: Topological Drawings meet SAT Solvers and Classical Theorems of Convex Geometry | abstract |
