Selected Papers
Selected papers which are partly based on works during KAMAK workshops.
- Non-homotopic Loops with a Bounded Number of Pairwise Intersections. V. Blažej, M. Opler, M. Šileikis, P. Valtr
- The 29th International Symposium on Graph Drawing and Network Visualization, GD 2021
- On the Intersections of Non-homotopic Loops. V. Blažej, M. Opler, M. Šileikis, P. Valtr
- The 7th Annual International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021
- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. D. Hartman, A. Pokorná, P. Valtr.
- The 7th Annual International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021
- On 3-Coloring of (2P4, C5)-Free Graphs. V. Jelínek, T. Klimošová, T. Masařík, J. Novotná, A. Pokorná.
- The 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021
- Bears with Hats and Independence Polynomials. V. Blažej, P. Dvořák, M. Opler.
- The 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021
- A 3-edge-coloring algorithm. R. Lukoťka, J. Tětek.
- Bordeaux Graph Workshop, BGW 2019
- On Induced Online Ramsey Number of Paths, Cycles, and Trees. V. Blažej, P. Dvořák and T. Valla.
- The 14th International Computer Science Symposium in Russia, CSR 2019
-
Colouring (P_r+P_s)-Free Graphs. T. Klimošová, J. Malík, T. Masařík, J. Novotná, D. Paulusma, V. Slívová.
- The 29th International Symposium on Algorithms and Computation, ISAAC 2018
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. P. Dvořák, A. E. Feldmann, D. Knop, T. Masařík, T. Toufar and P. Veselý.
- 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018
- On H-Topological Intersection Graphs. S. Chaplick, M. Töpfer, J. Voborník, P. Zeman.
- 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017
- Best student paper
Workshops Problems