default search action
Jan Kyncl
Person information
- affiliation: Charles University, Prague Czech Republic
- affiliation: Rutgers University, USA
- unicode name: Jan Kynčl
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j40]Jan Kyncl
, Marcus Schaefer
Spiraling and Folding: The Topological View. Discret. Comput. Geom. 72(1): 246-268 (2024) - 2023
- [c24]Oswin Aichholzer
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG 2023: 6:1-6:16 - [i24]Oswin Aichholzer
Drawings of Complete Multipartite Graphs Up to Triangle Flips. CoRR abs/2303.07401 (2023) - [i23]Jan Kyncl, Jan Soukup:
Extending simple monotone drawings. CoRR abs/2312.17675 (2023) - 2022
- [j39]Oswin Aichholzer
On crossing-families in planar point sets. Comput. Geom. 107: 101899 (2022) - [j38]Radoslav Fulek
The $\mathbb {Z}_2$-Genus of Kuratowski Minors. Discret. Comput. Geom. 68(2): 425-447 (2022) - [j37]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. J. Graph Algorithms Appl. 26(3): 381-399 (2022) - [i22]Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Topological View. CoRR abs/2206.07849 (2022) - 2021
- [i21]Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr:
On Crossing-Families in Planar Point Sets. CoRR abs/2109.10705 (2021) - 2020
- [j36]Martin Balko
Ramsey Numbers of Ordered Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j35]Jan Kyncl
Simple Realizability of Complete Abstract Topological Graphs Simplified. Discret. Comput. Geom. 64(1): 1-27 (2020) - [j34]Vít Jelínek
On the growth of the Möbius function of permutations. J. Comb. Theory A 169 (2020) - [j33]Oswin Aichholzer
A superlinear lower bound on the number of 5-holes. J. Comb. Theory A 173: 105236 (2020) - [j32]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020)
2010 – 2019
- 2019
- [j31]Radoslav Fulek
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. Comb. 39(6): 1267-1279 (2019) - [c23]Radoslav Fulek
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. SoCG 2019: 39:1-39:16 - [c22]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [i20]Radoslav Fulek, Jan Kyncl:
Z_2-genus of graphs and minimum rank of partial symmetric matrices. CoRR abs/1903.08637 (2019) - [i19]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 abs/1908.05124 (2019) - 2018
- [j30]Mikio Kano, Jan Kyncl
The hamburger theorem. Comput. Geom. 68: 167-173 (2018) - [c21]Radoslav Fulek
Hanani-Tutte for Approximating Maps of Graphs. SoCG 2018: 39:1-39:15 - [c20]Radoslav Fulek
The Z_2-Genus of Kuratowski Minors. SoCG 2018: 40:1-40:14 - [i18]Radoslav Fulek, Jan Kyncl:
The ℤ2-genus of Kuratowski minors. CoRR abs/1803.05085 (2018) - 2017
- [j29]Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi:
Unified Hanani-Tutte Theorem. Electron. J. Comb. 24(3): 3 (2017) - [j28]Jan Kyncl, Zuzana Patáková:
On the Nonexistence of k-Reptile Simplices in ℝ3 and ℝ4. Electron. J. Comb. 24(3): 3 (2017) - [j27]Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz:
Induced Ramsey-Type Results and Binary Predicates for Point Sets. Electron. J. Comb. 24(4): 4 (2017) - [j26]Andreas F. Holmsen, Jan Kyncl
Near equipartitions of colored point sets. Comput. Geom. 65: 35-42 (2017) - [j25]Jan Kyncl, Bernard Lidický, Tomás Vyskocil:
Irreversible 2-conversion set in graphs of bounded degree. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j24]Martin Balko
Induced Ramsey-type results and binary predicates for point sets. Electron. Notes Discret. Math. 61: 77-83 (2017) - [j23]Sergio Cabello
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46(5): 1574-1602 (2017) - [c19]Oswin Aichholzer
A Superlinear Lower Bound on the Number of 5-Holes. SoCG 2017: 8:1-8:16 - [c18]Vít Jelínek
Hardness of Permutation Pattern Matching. SODA 2017: 378-396 - [c17]Josef Cibulka, Jan Kyncl
Better upper bounds on the Füredi-Hajnal limits of permutations. SODA 2017: 2280-2293 - [i17]Radoslav Fulek, Jan Kyncl:
Hanani-Tutte for approximating maps of graphs. CoRR abs/1705.05243 (2017) - [i16]Radoslav Fulek, Jan Kyncl:
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. CoRR abs/1709.00508 (2017) - 2016
- [i15]Josef Cibulka, Jan Kyncl:
Füredi-Hajnal limits are typically subexponential. CoRR abs/1607.07491 (2016) - [i14]Vít Jelínek, Jan Kyncl:
Hardness of Permutation Pattern Matching. CoRR abs/1608.00529 (2016) - [i13]Jan Kyncl:
Simple realizability of complete abstract topological graphs simplified. CoRR abs/1608.05867 (2016) - [i12]Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi:
Unified Hanani-Tutte theorem. CoRR abs/1612.00688 (2016) - 2015
- [j22]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Clustered Planarity Testing Revisited. Electron. J. Comb. 22(4): 4 (2015) - [j21]Jan Kyncl
Saturated simple and k-simple topological graphs. Comput. Geom. 48(4): 295-310 (2015) - [j20]Martin Balko
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. Discret. Comput. Geom. 53(1): 107-143 (2015) - [j19]Roman N. Karasev, Jan Kyncl
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. Discret. Comput. Geom. 54(3): 610-636 (2015) - [j18]Martin Balko
Ramsey numbers of ordered graphs. Electron. Notes Discret. Math. 49: 419-424 (2015) - [c16]Jan Kyncl
Simple Realizability of Complete Abstract Topological Graphs Simplified. GD 2015: 309-320 - 2014
- [c15]Sergio Cabello
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG 2014: 224 - [c14]Radoslav Fulek, Jan Kyncl
Clustered Planarity Testing Revisited. GD 2014: 428-439 - [i11]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling potatoes near-optimally in near-linear time. CoRR abs/1406.1368 (2014) - [i10]Jan Kyncl
Irreversible 2-conversion set in graphs of bounded degree. CoRR abs/1412.4188 (2014) - 2013
- [j17]Jan Kyncl
Improved Enumeration of Simple Topological Graphs. Discret. Comput. Geom. 50(3): 727-770 (2013) - [j16]Jakub Cerný, Jan Kyncl
Improvement on the Decay of Crossing Numbers. Graphs Comb. 29(3): 365-371 (2013) - [j15]Josef Cibulka, Jan Kyncl
Graph sharing games: Complexity and connectivity. Theor. Comput. Sci. 494: 49-62 (2013) - [c13]Josef Cibulka, Jan Kyncl
On planar point sets with the pentagon property. SoCG 2013: 81-90 - [c12]Jan Kyncl, Adithya Hariram, Martin Novotný
On measurement of synchronous phasors in electrical grids. ISCAS 2013: 2972-2975 - [i9]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Efficient c-planarity testing algebraically. CoRR abs/1305.4519 (2013) - [i8]Martin Balko, Radoslav Fulek, Jan Kyncl:
Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. CoRR abs/1312.3679 (2013) - 2012
- [j14]Jan Kyncl
Ramsey-type constructions for arrangements of segments. Eur. J. Comb. 33(3): 336-339 (2012) - [j13]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) - [c11]Josef Cibulka, Jan Kyncl:
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. SODA 2012: 1113-1122 - [i7]Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the decay of crossing numbers. CoRR abs/1201.5421 (2012) - [i6]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Graph sharing games: complexity and connectivity. CoRR abs/1202.0847 (2012) - [i5]Jan Kyncl:
Improved enumeration of simple topological graphs. CoRR abs/1212.2950 (2012) - 2011
- [j12]Jan Kyncl
Simple Realizability of Complete Abstract Topological Graphs in P. Discret. Comput. Geom. 45(3): 383-399 (2011) - [c10]Jan Kyncl, Martin Novotný
Education of Digital and Analog Circuits supported by computer algebra system. ISCAS 2011: 341-344 - [i4]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) - [i3]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
- [j11]Jan Kyncl
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. ACM Trans. Comput. Theory 1(3): 8:1-8:11 (2010) - [c9]Josef Cibulka, Jan Kyncl
On Three Parameters of Invisibility Graphs. COCOON 2010: 192-198 - [c8]Josef Cibulka, Jan Kyncl
Graph Sharing Games: Complexity and Connectivity. TAMC 2010: 340-349
2000 – 2009
- 2009
- [j10]Vít Jelínek
Monochromatic triangles in two-colored plane. Comb. 29(6): 699-718 (2009) - [j9]Jan Kyncl
On edges crossing few other edges in simple topological complete graphs. Discret. Math. 309(7): 1917-1923 (2009) - [j8]Jan Kyncl
Enumeration of simple complete topological graphs. Eur. J. Comb. 30(7): 1676-1685 (2009) - [j7]Ken-ichi Kawarabayashi, Daniel Král
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23(1): 372-383 (2009) - [c7]Josef Cibulka, Jan Kyncl
Solution of Peter Winkler's Pizza Problem. IWOCA 2009: 356-367 - [i2]Jan Kyncl, Tomás Vyskocil:
Logspace reduction of directed reachability for bounded genus graphs to the planar case. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j6]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) - [j5]Jan Kyncl
Long alternating paths in bicolored point sets. Discret. Math. 308(19): 4315-4321 (2008) - [j4]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31: 235-240 (2008) - [j3]Jan Kyncl
Ramsey-type constructions for arrangements of segments. Electron. Notes Discret. Math. 31: 265-269 (2008) - [c6]Josef Cibulka, Jan Kyncl
Hamiltonian Alternating Paths on Bicolored Double-Chains. GD 2008: 181-192 - [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) - 2007
- [j2]Jan Kyncl
Enumeration of simple complete topological graphs. Electron. Notes Discret. Math. 29: 295-299 (2007) - [j1]Zdenek Dvorák
Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms 30(1-2): 63-77 (2007) - [c5]Jakub Cerný, Jan Kyncl
Improvement on the Decay of Crossing Numbers. GD 2007: 25-30 - [c4]Jan Kyncl
The Complexity of Several Realizability Problems for Abstract Topological Graphs. GD 2007: 137-158 - 2005
- [c3]Jan Kyncl
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. GD 2005: 274-284 - [c2]Zdenek Dvorák
Three Optimal Algorithms for Balls of Three Colors. STACS 2005: 206-217 - 2004
- [c1]Jan Kyncl, János Pach, Géza Tóth:
Long Alternating Paths in Bicolored Point Sets. GD 2004: 340-348
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-04 03:44 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: