Jan Kyncl

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 39

Top Topics

Symmetric Matrices

Engineering Drawings

Top Venues

Discret. Comput. Geom.

Electron. J. Comb.

Publications

Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Spiraling and Folding: The Topological View. Discret. Comput. Geom. 72 (1) (2024)
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG (2023)
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
Drawings of Complete Multipartite Graphs Up to Triangle Flips. CoRR (2023)
Jan Kyncl, Jan Soukup
Extending simple monotone drawings. CoRR (2023)
Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Spiraling and Folding: The Topological View. CoRR (2022)
Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr
On crossing-families in planar point sets. Comput. Geom. 107 (2022)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens. J. Graph Algorithms Appl. 26 (3) (2022)
Radoslav Fulek, Jan Kyncl
The $\mathbb {Z}_2$-Genus of Kuratowski Minors. Discret. Comput. Geom. 68 (2) (2022)
Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr
On Crossing-Families in Planar Point Sets. CoRR (2021)
Vít Jelínek, Ida Kantor, Jan Kyncl, Martin Tancer
On the growth of the Möbius function of permutations. J. Comb. Theory, Ser. A 169 (2020)
Jan Kyncl
Simple Realizability of Complete Abstract Topological Graphs Simplified. Discret. Comput. Geom. 64 (1) (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24 (4) (2020)
Martin Balko, Josef Cibulka, Karel Král, Jan Kyncl
Ramsey Numbers of Ordered Graphs. Electron. J. Comb. 27 (1) (2020)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
A superlinear lower bound on the number of 5-holes. J. Comb. Theory, Ser. A 173 (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. CoRR (2019)
Radoslav Fulek, Jan Kyncl
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. Comb. 39 (6) (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. Graph Drawing (2019)
Radoslav Fulek, Jan Kyncl
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. SoCG (2019)
Radoslav Fulek, Jan Kyncl
Z_2-genus of graphs and minimum rank of partial symmetric matrices. CoRR (2019)
Radoslav Fulek, Jan Kyncl
Hanani-Tutte for Approximating Maps of Graphs. SoCG (2018)
Mikio Kano, Jan Kyncl
The hamburger theorem. Comput. Geom. 68 (2018)
Radoslav Fulek, Jan Kyncl
The Z_2-Genus of Kuratowski Minors. SoCG (2018)
Radoslav Fulek, Jan Kyncl
-genus of Kuratowski minors. CoRR (2018)
Jan Kyncl, Bernard Lidický, Tomás Vyskocil
Irreversible 2-conversion set in graphs of bounded degree. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Andreas F. Holmsen, Jan Kyncl, Claudiu Valculescu
Near equipartitions of colored point sets. Comput. Geom. 65 (2017)
Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz
Induced Ramsey-type results and binary predicates for point sets. Electron. Notes Discret. Math. 61 (2017)
Vít Jelínek, Jan Kyncl
Hardness of Permutation Pattern Matching. SODA (2017)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46 (5) (2017)
Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz
Induced Ramsey-Type Results and Binary Predicates for Point Sets. Electron. J. Comb. 24 (4) (2017)
Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi
Unified Hanani-Tutte Theorem. Electron. J. Comb. 24 (3) (2017)
Radoslav Fulek, Jan Kyncl
Hanani-Tutte for approximating maps of graphs. CoRR (2017)
Josef Cibulka, Jan Kyncl
Better upper bounds on the Füredi-Hajnal limits of permutations. SODA (2017)
Jan Kyncl, Zuzana Patáková
On the Nonexistence of $k$-Reptile Simplices in $\mathbb R^3$ and $\mathbb R^4$. Electron. J. Comb. 24 (3) (2017)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
A Superlinear Lower Bound on the Number of 5-Holes. SoCG (2017)
Radoslav Fulek, Jan Kyncl
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. CoRR (2017)
Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi
Unified Hanani-Tutte theorem. CoRR (2016)
Vít Jelínek, Jan Kyncl
Hardness of Permutation Pattern Matching. CoRR (2016)
Josef Cibulka, Jan Kyncl
Füredi-Hajnal limits are typically subexponential. CoRR (2016)
Jan Kyncl
Simple realizability of complete abstract topological graphs simplified. CoRR (2016)
Martin Balko, Radoslav Fulek, Jan Kyncl
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. Discret. Comput. Geom. 53 (1) (2015)
Roman N. Karasev, Jan Kyncl, Pavel Paták, Zuzana Patáková, Martin Tancer
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. Discret. Comput. Geom. 54 (3) (2015)
Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth
Saturated simple and k-simple topological graphs. Comput. Geom. 48 (4) (2015)
Martin Balko, Josef Cibulka, Karel Král, Jan Kyncl
Ramsey numbers of ordered graphs. Electron. Notes Discret. Math. 49 (2015)
Jan Kyncl
Simple Realizability of Complete Abstract Topological Graphs Simplified. Graph Drawing (2015)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Clustered Planarity Testing Revisited. Electron. J. Comb. 22 (4) (2015)
Jan Kyncl, Bernard Lidický, Tomás Vyskocil
Irreversible 2-conversion set in graphs of bounded degree. CoRR (2014)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling potatoes near-optimally in near-linear time. CoRR (2014)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG (2014)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Clustered Planarity Testing Revisited. Graph Drawing (2014)
Josef Cibulka, Jan Kyncl, Pavel Valtr
On planar point sets with the pentagon property. SoCG (2013)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Efficient c-planarity testing algebraically CoRR (2013)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Graph sharing games: Complexity and connectivity. Theor. Comput. Sci. 494 (2013)
Jan Kyncl
Improved Enumeration of Simple Topological Graphs. Discret. Comput. Geom. 50 (3) (2013)
Jan Kyncl, Adithya Hariram, Martin Novotný
On measurement of synchronous phasors in electrical grids. ISCAS (2013)
Martin Balko, Radoslav Fulek, Jan Kyncl
Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. CoRR (2013)
Jakub Cerný, Jan Kyncl, Géza Tóth
Improvement on the Decay of Crossing Numbers. Graphs Comb. 29 (3) (2013)
Josef Cibulka, Jan Kyncl
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. SODA (2012)
Jan Kyncl
Improved enumeration of simple topological graphs CoRR (2012)
Jan Kyncl
Ramsey-type constructions for arrangements of segments. Eur. J. Comb. 33 (3) (2012)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Graph sharing games: complexity and connectivity CoRR (2012)
Josef Cibulka, Jan Kyncl
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. J. Comb. Theory, Ser. A 119 (7) (2012)
Jakub Cerný, Jan Kyncl, Géza Tóth
Improvement on the decay of crossing numbers CoRR (2012)
Jan Kyncl
Simple Realizability of Complete Abstract Topological Graphs in P. Discret. Comput. Geom. 45 (3) (2011)
Josef Cibulka, Jan Kyncl
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension CoRR (2011)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Universal Sets for Straight-Line Embeddings of Bicolored Graphs CoRR (2011)
Jan Kyncl, Martin Novotný
Education of Digital and Analog Circuits supported by computer algebra system. ISCAS (2011)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Graph Sharing Games: Complexity and Connectivity. TAMC (2010)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
On Three Parameters of Invisibility Graphs. COCOON (2010)
Jan Kyncl, Tomás Vyskocil
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. ACM Trans. Comput. Theory 1 (3) (2010)
Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23 (1) (2009)
Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla
Monochromatic triangles in two-colored plane. Comb. 29 (6) (2009)
Jan Kyncl, Pavel Valtr
On edges crossing few other edges in simple topological complete graphs. Discret. Math. 309 (7) (2009)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Solution of Peter Winkler's Pizza Problem. IWOCA (2009)
Jan Kyncl, Tomás Vyskocil
Logspace reduction of directed reachability for bounded genus graphs to the planar case. Electron. Colloquium Comput. Complex. 16 (2009)
Jan Kyncl
Enumeration of simple complete topological graphs. Eur. J. Comb. 30 (7) (2009)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Solution of Peter Winkler's Pizza Problem CoRR (2008)
Jan Kyncl
Ramsey-type constructions for arrangements of segments. Electron. Notes Discret. Math. 31 (2008)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Hamiltonian Alternating Paths on Bicolored Double-Chains. Graph Drawing (2008)
Jan Kyncl, Martin Tancer
The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. Electron. J. Comb. 15 (1) (2008)
Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31 (2008)
Jan Kyncl, János Pach, Géza Tóth
Long alternating paths in bicolored point sets. Discret. Math. 308 (19) (2008)
Jan Kyncl
Enumeration of simple complete topological graphs. Electron. Notes Discret. Math. 29 (2007)
Jakub Cerný, Jan Kyncl, Géza Tóth
Improvement on the Decay of Crossing Numbers. Graph Drawing (2007)
Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms 30 (1-2) (2007)
Jan Kyncl
The Complexity of Several Realizability Problems for Abstract Topological Graphs. Graph Drawing (2007)
Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
Three Optimal Algorithms for Balls of Three Colors. STACS (2005)
Jan Kyncl, Pavel Valtr
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. Graph Drawing (2005)
Jan Kyncl, János Pach, Géza Tóth
Long Alternating Paths in Bicolored Point Sets. Graph Drawing (2004)