Jan Kyncl

Jan Soukup

CoRR, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

The $\mathbb {Z}_2$-Genus of Kuratowski Minors.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

On crossing-families in planar point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2022

2020

Minimal Representations of Order Types by Geometric Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

A superlinear lower bound on the number of 5-holes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

On the growth of the Möbius function of permutations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Simple Realizability of Complete Abstract Topological Graphs Simplified.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

2019

Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.

[BibT_eX]

[DOI]

Comb., 2019

Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

The ℤ2-genus of Kuratowski minors.

[BibT_eX]

[DOI]

CoRR, 2018

The hamburger theorem.

[BibT_eX]

[DOI]

Mikio Kano

Comput. Geom., 2018

The Z_2-Genus of Kuratowski Minors.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hanani-Tutte for Approximating Maps of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Peeling Potatoes Near-Optimally in Near-Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Induced Ramsey-type results and binary predicates for point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Irreversible 2-conversion set in graphs of bounded degree.

[BibT_eX]

[DOI]

Bernard Lidický

Tomás Vyskocil

Discret. Math. Theor. Comput. Sci., 2017

Near equipartitions of colored point sets.

[BibT_eX]

[DOI]

Andreas F. Holmsen

Claudiu Valculescu

Comput. Geom., 2017

On the Nonexistence of k-Reptile Simplices in ℝ3 and ℝ4.

[BibT_eX]

[DOI]

Zuzana Patáková

Electron. J. Comb., 2017

Unified Hanani-Tutte Theorem.

[BibT_eX]

[DOI]

Dömötör Pálvölgyi

Electron. J. Comb., 2017

Hardness of Permutation Pattern Matching.

[BibT_eX]

[DOI]

Vít Jelínek

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Better upper bounds on the Füredi-Hajnal limits of permutations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Füredi-Hajnal limits are typically subexponential.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Ramsey numbers of ordered graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n.

[BibT_eX]

[DOI]

Martin Balko

Discret. Comput. Geom., 2015

Saturated simple and k-simple topological graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Clustered Planarity Testing Revisited.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2013

Graph sharing games: Complexity and connectivity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Improvement on the Decay of Crossing Numbers.

[BibT_eX]

[DOI]

Jakub Cerný

Géza Tóth

Graphs Comb., 2013

Improved Enumeration of Simple Topological Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Efficient c-planarity testing algebraically

[BibT_eX]

[DOI]

CoRR, 2013

Crossing numbers and combinatorial characterization of monotone drawings of $K_n$.

[BibT_eX]

[DOI]

Martin Balko

CoRR, 2013

On measurement of synchronous phasors in electrical grids.

[BibT_eX]

[DOI]

Adithya Hariram

Martin Novotný

Proceedings of the 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013), 2013

On planar point sets with the pentagon property.

[BibT_eX]

[DOI]

Pavel Valtr

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Tight bounds on the maximum size of a set of permutations with bounded VC-dimension.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

2011

Simple Realizability of Complete Abstract Topological Graphs in P.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

[BibT_eX]

[DOI]

CoRR, 2011

Education of Digital and Analog Circuits supported by computer algebra system.

[BibT_eX]

[DOI]

Martin Novotný

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2011), 2011

2010

On Three Parameters of Invisibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

6-Critical Graphs on the Klein Bottle.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Daniel Král

Bernard Lidický

SIAM J. Discret. Math., 2009

Logspace reduction of directed reachability for bounded genus graphs to the planar case.

[BibT_eX]

[DOI]

Tomás Vyskocil

Electron. Colloquium Comput. Complex., 2009

On edges crossing few other edges in simple topological complete graphs.

[BibT_eX]

[DOI]

Pavel Valtr

Discret. Math., 2009

Monochromatic triangles in two-colored plane.

[BibT_eX]

[DOI]

Comb., 2009

Solution of Peter Winkler's Pizza Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Ramsey-type constructions for arrangements of segments.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Six-Critical Graphs on the Klein Bottle.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Daniel Král

Bernard Lidický

Electron. Notes Discret. Math., 2008

Long alternating paths in bicolored point sets.

[BibT_eX]

[DOI]

János Pach

Géza Tóth

Discret. Math., 2008

The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property.

[BibT_eX]

[DOI]

Martin Tancer

Electron. J. Comb., 2008

Hamiltonian Alternating Paths on Bicolored Double-Chains.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Probabilistic strategies for the partition and plurality problems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Enumeration of simple complete topological graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

The Complexity of Several Realizability Problems for Abstract Topological Graphs.

[BibT_eX]

[DOI]