Three Optimal Algorithms for Balls of Three Colors. - Zdenek Dvorák 001; Vít Jelínek; Daniel Král; Jan Kyncl; Michael E. Saks (STACS, 2005)

The Complexity of Several Realizability Problems for Abstract Topological Graphs. - Jan Kyncl (GD, 2007)

Enumeration of simple complete topological graphs. - Jan Kyncl (Electron. Notes Discret. Math., 2007)

Probabilistic strategies for the partition and plurality problems. - Zdenek Dvorák 001; Vít Jelínek; Daniel Král; Jan Kyncl; Michael E. Saks (Random Struct. Algorithms, 2007)

Hamiltonian Alternating Paths on Bicolored Double-Chains. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (GD, 2008)

The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. - Jan Kyncl; Martin Tancer (Electron. J. Comb., 2008)

Long alternating paths in bicolored point sets. - Jan Kyncl; János Pach; Géza Tóth 001 (Discret. Math., 2008)

Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

Ramsey-type constructions for arrangements of segments. - Jan Kyncl (Electron. Notes Discret. Math., 2008)

Solution of Peter Winkler's Pizza Problem. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (IWOCA, 2009)

Monochromatic triangles in two-colored plane. - Vít Jelínek; Jan Kyncl; Rudolf Stolar; Tomás Valla (Comb., 2009)

On edges crossing few other edges in simple topological complete graphs. - Jan Kyncl; Pavel Valtr 001 (Discret. Math., 2009)

Logspace reduction of directed reachability for bounded genus graphs to the planar case. - Jan Kyncl; Tomás Vyskocil (Electron. Colloquium Comput. Complex., 2009)

6-Critical Graphs on the Klein Bottle. - Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (SIAM J. Discret. Math., 2009)

On Three Parameters of Invisibility Graphs. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (COCOON, 2010)

Education of Digital and Analog Circuits supported by computer algebra system. - Jan Kyncl; Martin Novotný (ISCAS, 2011)

Universal Sets for Straight-Line Embeddings of Bicolored Graphs - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (CoRR, 2011)

Simple Realizability of Complete Abstract Topological Graphs in P. - Jan Kyncl (Discret. Comput. Geom., 2011)

Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. - Josef Cibulka; Jan Kyncl (J. Comb. Theory A, 2012)

On planar point sets with the pentagon property. - Josef Cibulka; Jan Kyncl; Pavel Valtr 001 (SoCG, 2013)

On measurement of synchronous phasors in electrical grids. - Jan Kyncl; Adithya Hariram; Martin Novotný (ISCAS, 2013)

Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. - Martin Balko; Radoslav Fulek; Jan Kyncl (CoRR, 2013)

Efficient c-planarity testing algebraically - Radoslav Fulek; Jan Kyncl; Igor Malinovic; Dömötör Pálvölgyi (CoRR, 2013)

Improved Enumeration of Simple Topological Graphs. - Jan Kyncl (Discret. Comput. Geom., 2013)

Improvement on the Decay of Crossing Numbers. - Jakub Cerný; Jan Kyncl; Géza Tóth 001 (Graphs Comb., 2013)

Graph sharing games: Complexity and connectivity. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (Theor. Comput. Sci., 2013)

Clustered Planarity Testing Revisited. - Radoslav Fulek; Jan Kyncl; Igor Malinovic; Dömötör Pálvölgyi (Electron. J. Comb., 2015)

Saturated simple and k-simple topological graphs. - Jan Kyncl; János Pach; Rados Radoicic; Géza Tóth 001 (Comput. Geom., 2015)

Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. - Martin Balko; Radoslav Fulek; Jan Kyncl (Discret. Comput. Geom., 2015)

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. - Roman N. Karasev; Jan Kyncl; Pavel Paták; Zuzana Patáková; Martin Tancer (Discret. Comput. Geom., 2015)

Ramsey numbers of ordered graphs. - Martin Balko; Josef Cibulka; Karel Král 002; Jan Kyncl (Electron. Notes Discret. Math., 2015)

Füredi-Hajnal limits are typically subexponential. - Josef Cibulka; Jan Kyncl (CoRR, 2016)

Better upper bounds on the Füredi-Hajnal limits of permutations. - Josef Cibulka; Jan Kyncl (SODA, 2017)

Hardness of Permutation Pattern Matching. - Vít Jelínek; Jan Kyncl (SODA, 2017)

Unified Hanani-Tutte Theorem. - Radoslav Fulek; Jan Kyncl; Dömötör Pálvölgyi (Electron. J. Comb., 2017)

On the Nonexistence of k-Reptile Simplices in ℝ3 and ℝ4. - Jan Kyncl; Zuzana Patáková (Electron. J. Comb., 2017)

Near equipartitions of colored point sets. - Andreas F. Holmsen; Jan Kyncl; Claudiu Valculescu (Comput. Geom., 2017)

Irreversible 2-conversion set in graphs of bounded degree. - Jan Kyncl; Bernard Lidický; Tomás Vyskocil (Discret. Math. Theor. Comput. Sci., 2017)

Induced Ramsey-type results and binary predicates for point sets. - Martin Balko; Jan Kyncl; Stefan Langerman; Alexander Pilz (Electron. Notes Discret. Math., 2017)

Peeling Potatoes Near-Optimally in Near-Linear Time. - Sergio Cabello; Josef Cibulka; Jan Kyncl; Maria Saumell; Pavel Valtr 001 (SIAM J. Comput., 2017)

Hanani-Tutte for Approximating Maps of Graphs. - Radoslav Fulek; Jan Kyncl (SoCG, 2018)

The Z_2-Genus of Kuratowski Minors. - Radoslav Fulek; Jan Kyncl (SoCG, 2018)

The hamburger theorem. - Mikio Kano; Jan Kyncl (Comput. Geom., 2018)

The ℤ2-genus of Kuratowski minors. - Radoslav Fulek; Jan Kyncl (CoRR, 2018)

Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. - Radoslav Fulek; Jan Kyncl (SoCG, 2019)

Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. - Radoslav Fulek; Jan Kyncl (Comb., 2019)

Simple Realizability of Complete Abstract Topological Graphs Simplified. - Jan Kyncl (Discret. Comput. Geom., 2020)

On the growth of the Möbius function of permutations. - Vít Jelínek; Ida Kantor; Jan Kyncl; Martin Tancer (J. Comb. Theory A, 2020)

A superlinear lower bound on the number of 5-holes. - Oswin Aichholzer; Martin Balko; Thomas Hackl; Jan Kyncl; Irene Parada; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber (J. Comb. Theory A, 2020)

Minimal Representations of Order Types by Geometric Graphs. - Oswin Aichholzer; Martin Balko; Michael Hoffmann 001; Jan Kyncl; Wolfgang Mulzer; Irene Parada; Alexander Pilz; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (J. Graph Algorithms Appl., 2020)

On crossing-families in planar point sets. - Oswin Aichholzer; Jan Kyncl; Manfred Scheucher; Birgit Vogtenhuber; Pavel Valtr 001 (Comput. Geom., 2022)

The $ mathbb {Z}_2$-Genus of Kuratowski Minors. - Radoslav Fulek; Jan Kyncl (Discret. Comput. Geom., 2022)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Jan Kyncl; Irene Parada (J. Graph Algorithms Appl., 2022)

Drawings of Complete Multipartite Graphs up to Triangle Flips. - Oswin Aichholzer; Man-Kwun Chiu; Hung P. Hoang 001; Michael Hoffmann 001; Jan Kyncl; Yannic Maus; Birgit Vogtenhuber; Alexandra Weinberger (SoCG, 2023)

Many Views of Planar Point Sets. - Jan Kyncl; Jan Soukup (WG, 2024)

Spiraling and Folding: The Topological View. - Jan Kyncl; Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Discret. Comput. Geom., 2024)

Extending Simple Monotone Drawings. - Jan Kyncl; Jan Soukup (IWOCA, 2025)