| 2026 | WG | High Beer Index Implies Big Hollow Triangles. | Arun Kumar Das, Vt Jelnek, Jan Kyncl, Martin Pergel, Felix Schrder, Peter Stumpf, Pavel Valtr |
| 2025 | IWOCA | Extending Simple Monotone Drawings. | Jan Kyncl, Jan Soukup |
| 2024 | WG | Many Views of Planar Point Sets. | Jan Kyncl, Jan Soukup |
| 2019 | GD | Minimal Representations of Order Types by Geometric Graphs. | Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl |
| 2017 | SODA | Better upper bounds on the Fredi-Hajnal limits of permutations. | Josef Cibulka, Jan Kyncl |
| 2017 | SODA | Hardness of Permutation Pattern Matching. | Vt Jelnek, Jan Kyncl |
| 2015 | GD | Simple Realizability of Complete Abstract Topological Graphs Simplified. | Jan Kyncl |
| 2014 | GD | Clustered Planarity Testing Revisited. | Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dmtr Plvlgyi |
| 2013 | ISCAS | On measurement of synchronous phasors in electrical grids. | Jan Kyncl, Adithya Hariram, Martin Novotn |
| 2012 | SODA | Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. | Josef Cibulka, Jan Kyncl |
| 2011 | ISCAS | Education of Digital and Analog Circuits supported by computer algebra system. | Jan Kyncl, Martin Novotn |
| 2010 | COCOON | On Three Parameters of Invisibility Graphs. | Josef Cibulka, Jan Kyncl, Viola Mszros, Rudolf Stolar, Pavel Valtr |
| 2010 | TAMC | Graph Sharing Games: Complexity and Connectivity. | Josef Cibulka, Jan Kyncl, Viola Mszros, Rudolf Stolar, Pavel Valtr |
| 2009 | IWOCA | Solution of Peter Winkler's Pizza Problem. | Josef Cibulka, Jan Kyncl, Viola Mszros, Rudolf Stolar, Pavel Valtr |
| 2008 | GD | Hamiltonian Alternating Paths on Bicolored Double-Chains. | Josef Cibulka, Jan Kyncl, Viola Mszros, Rudolf Stolar, Pavel Valtr |
| 2007 | GD | Improvement on the Decay of Crossing Numbers. | Jakub Cern, Jan Kyncl, Gza Tth |
| 2007 | GD | The Complexity of Several Realizability Problems for Abstract Topological Graphs. | Jan Kyncl |
| 2005 | GD | On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. | Jan Kyncl, Pavel Valtr |
| 2005 | STACS | Three Optimal Algorithms for Balls of Three Colors. | Zdenek Dvork, Vt Jelnek, Daniel Krl, Jan Kyncl, Michael E. Saks |
| 2004 | GD | Long Alternating Paths in Bicolored Point Sets. | Jan Kyncl, Jnos Pach, Gza Tth |