Josef Cibulka

Charles University — Czech Republic

Computer Science · Physical Sciences

10h-index262citations36works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(12), Advanced Graph Theory Research(11), Limits and Structures in Graph Theory(10), graph theory and CDMA systems(6), Advanced Combinatorial Mathematics(5)

Publications36 total

Covering Lattice Points by Subspaces and Counting Point–Hyperplane Incidences
Discrete & Computational Geometry·2018· 6 citedOpen Access
Drawing Graphs Using a Small Number of Obstacles
Discrete & Computational Geometry·2017· 7 cited
Covering lattice points by subspaces and counting point-hyperplane\n incidences
arXiv (Cornell University)·2017Open Access
Better upper bounds on the Füredi-Hajnal limits of permutations
2017· 10 citedOpen Access
Drawing graphs using a small number of obstacles
arXiv (Cornell University)·2016Open Access
Better upper bounds on the Füredi-Hajnal limits of permutations
arXiv (Cornell University)·2016· 1 citedOpen Access
Füredi-Hajnal limits are typically subexponential.
arXiv (Cornell University)·2016· 8 citedOpen Access
Ramsey numbers of ordered graphs
Electronic Notes in Discrete Mathematics·2015· 19 cited
Three-Monotone Interpolation
Discrete & Computational Geometry·2015· 1 citedOpen Access
Drawing Graphs Using a Small Number of Obstacles
Lecture notes in computer science·2015· 5 cited
Peeling Potatoes Near-Optimally in Near-Linear Time
2014· 4 cited
A Combinatorial Proof Of Rayleigh Monotonicity For Graphs.
2014· 2 cited
On planar point sets with the pentagon property
2013· 3 cited
Graph sharing games: Complexity and connectivity
Theoretical Computer Science·2013· 15 citedOpen Access
On planar point sets with the pentagon property
2013
Polynomial bounds on geometric Ramsey numbers of ladder graphs
Scuola Normale Superiore eBooks·2013
Maximum Size of Reverse-Free Sets of Permutations
SIAM Journal on Discrete Mathematics·2013· 8 citedOpen Access
Universal Sets for Straight-Line Embeddings of Bicolored Graphs
2012· 8 citedOpen Access
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A·2012· 27 citedOpen Access
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
2012· 4 cited
page 1 of 2Next →

Frequent Co-authors

Jan Kynčl(16), Pável Valtr(16), Viola Mészáros(8), Rudolf Stolař(7), Martin Balko(6), Jan Hladký(3), Anthony Labarre(2), Karel Král(1), Sergio Cabello(1), Maria Saumell(1), Mathieu Lacroix(1), D.G. Wagner(1), Michael A. La Croix(1), David G. Wagner(1), Jiřı́ Matoušek(1), Pavel Paták(1), Pu Gao(1), Marek Krčál(1), Tomáš Valla(1)