default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Cibulka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j16]Martin Balko
, Josef Cibulka, Karel Král, Jan Kyncl:
Ramsey Numbers of Ordered Graphs. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j15]Martin Balko, Josef Cibulka, Pavel Valtr:
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. Discret. Comput. Geom. 61(2): 325-354 (2019) - 2018
- [j14]Martin Balko, Josef Cibulka, Pavel Valtr:
Drawing Graphs Using a Small Number of Obstacles. Discret. Comput. Geom. 59(1): 143-164 (2018) - 2017
- [j13]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46(5): 1574-1602 (2017) - [c10]Martin Balko, Josef Cibulka, Pavel Valtr:
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. SoCG 2017: 12:1-12:16 - [c9]Josef Cibulka, Jan Kyncl:
Better upper bounds on the Füredi-Hajnal limits of permutations. SODA 2017: 2280-2293 - 2016
- [i12]Josef Cibulka, Jan Kyncl:
Füredi-Hajnal limits are typically subexponential. CoRR abs/1607.07491 (2016) - 2015
- [j12]Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr:
On the Geometric Ramsey Number of Outerplanar Graphs. Discret. Comput. Geom. 53(1): 64-79 (2015) - [j11]Josef Cibulka, Jirí Matousek, Pavel Paták:
Three-Monotone Interpolation. Discret. Comput. Geom. 54(1): 3-21 (2015) - [j10]Martin Balko, Josef Cibulka, Karel Král, Jan Kyncl:
Ramsey numbers of ordered graphs. Electron. Notes Discret. Math. 49: 419-424 (2015) - [c8]Martin Balko, Josef Cibulka, Pavel Valtr:
Drawing Graphs Using a Small Number of Obstacles. GD 2015: 360-372 - 2014
- [j9]Josef Cibulka, Jan Hladký, Michael A. La Croix, David G. Wagner:
A Combinatorial Proof Of Rayleigh Monotonicity For Graphs. Ars Comb. 117: 333-348 (2014) - [c7]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG 2014: 224 - [i11]Josef Cibulka, Jirí Matousek, Pavel Paták:
Three-monotone interpolation. CoRR abs/1404.4731 (2014) - [i10]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling potatoes near-optimally in near-linear time. CoRR abs/1406.1368 (2014) - 2013
- [j8]Josef Cibulka:
Maximum Size of Reverse-Free Sets of Permutations. SIAM J. Discret. Math. 27(1): 232-239 (2013) - [j7]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Graph sharing games: Complexity and connectivity. Theor. Comput. Sci. 494: 49-62 (2013) - [c6]Josef Cibulka, Jan Kyncl, Pavel Valtr:
On planar point sets with the pentagon property. SoCG 2013: 81-90 - [i9]Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr:
On the Geometric Ramsey Number of Outerplanar Graphs. CoRR abs/1310.7004 (2013) - 2012
- [j6]Josef Cibulka, Jan Kyncl:
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. J. Comb. Theory A 119(7): 1461-1478 (2012) - [c5]Josef Cibulka, Jan Kyncl:
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. SODA 2012: 1113-1122 - [i8]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Graph sharing games: complexity and connectivity. CoRR abs/1202.0847 (2012) - [i7]Josef Cibulka:
Maximum size of reverse-free sets of permutations. CoRR abs/1208.2847 (2012) - 2011
- [j5]Anthony Labarre, Josef Cibulka:
Polynomial-time sortable stacks of burnt pancakes. Theor. Comput. Sci. 412(8-10): 695-702 (2011) - [j4]Josef Cibulka:
On average and highest number of flips in pancake sorting. Theor. Comput. Sci. 412(8-10): 822-834 (2011) - [i6]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Universal Sets for Straight-Line Embeddings of Bicolored Graphs. CoRR abs/1102.0874 (2011) - [i5]Josef Cibulka, Jan Kyncl:
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. CoRR abs/1104.5007 (2011) - 2010
- [j3]Josef Cibulka:
Untangling Polygons and Graphs. Discret. Comput. Geom. 43(2): 402-411 (2010) - [c4]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
On Three Parameters of Invisibility Graphs. COCOON 2010: 192-198 - [c3]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Graph Sharing Games: Complexity and Connectivity. TAMC 2010: 340-349 - [i4]Anthony Labarre, Josef Cibulka:
Polynomial-time sortable stacks of burnt pancakes. CoRR abs/1010.0219 (2010)
2000 – 2009
- 2009
- [j2]Josef Cibulka:
On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture. J. Comb. Theory A 116(2): 290-302 (2009) - [c2]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Solution of Peter Winkler's Pizza Problem. IWOCA 2009: 356-367 - [i3]Josef Cibulka:
Average number of flips in pancake sorting. CoRR abs/0901.3119 (2009) - 2008
- [j1]Josef Cibulka:
Untangling polygons and graphs. Electron. Notes Discret. Math. 31: 207-211 (2008) - [c1]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Hamiltonian Alternating Paths on Bicolored Double-Chains. GD 2008: 181-192 - [i2]Josef Cibulka:
Untangling polygons and graphs. CoRR abs/0802.1312 (2008) - [i1]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Solution of Peter Winkler's Pizza Problem. CoRR abs/0812.4322 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
