Jan Kyncl - RankMe

91 papers A* 10A 9B 1C 5Misc 1Journal 65

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