default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jan Kyncl
@article{DBLP:journals/dcg/KynclSSS24,
author = {Jan Kyncl and
Marcus Schaefer and
Eric Sedgwick and
Daniel Stefankovic},
title = {Spiraling and Folding: The Topological View},
journal = {Discret. Comput. Geom.},
volume = {72},
number = {1},
pages = {246--268},
year = {2024},
url = {https://doi.org/10.1007/s00454-023-00603-z},
doi = {10.1007/S00454-023-00603-Z},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/KynclSSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AichholzerCH0KM23,
author = {Oswin Aichholzer and
Man{-}Kwun Chiu and
Hung P. Hoang and
Michael Hoffmann and
Jan Kyncl and
Yannic Maus and
Birgit Vogtenhuber and
Alexandra Weinberger},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {Drawings of Complete Multipartite Graphs up to Triangle Flips},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {6:1--6:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.6},
doi = {10.4230/LIPICS.SOCG.2023.6},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AichholzerCH0KM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-07401,
author = {Oswin Aichholzer and
Man{-}Kwun Chiu and
Hung P. Hoang and
Michael Hoffmann and
Jan Kyncl and
Yannic Maus and
Birgit Vogtenhuber and
Alexandra Weinberger},
title = {Drawings of Complete Multipartite Graphs Up to Triangle Flips},
journal = {CoRR},
volume = {abs/2303.07401},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.07401},
doi = {10.48550/ARXIV.2303.07401},
eprinttype = {arXiv},
eprint = {2303.07401},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-07401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-17675,
author = {Jan Kyncl and
Jan Soukup},
title = {Extending simple monotone drawings},
journal = {CoRR},
volume = {abs/2312.17675},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.17675},
doi = {10.48550/ARXIV.2312.17675},
eprinttype = {arXiv},
eprint = {2312.17675},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-17675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AichholzerKSVV22,
author = {Oswin Aichholzer and
Jan Kyncl and
Manfred Scheucher and
Birgit Vogtenhuber and
Pavel Valtr},
title = {On crossing-families in planar point sets},
journal = {Comput. Geom.},
volume = {107},
pages = {101899},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2022.101899},
doi = {10.1016/J.COMGEO.2022.101899},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/AichholzerKSVV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FulekK22,
author = {Radoslav Fulek and
Jan Kyncl},
title = {The {\textdollar}{\textbackslash}mathbb \{Z\}{\_}2{\textdollar}-Genus
of Kuratowski Minors},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {2},
pages = {425--447},
year = {2022},
url = {https://doi.org/10.1007/s00454-022-00412-w},
doi = {10.1007/S00454-022-00412-W},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/FulekK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FelsnerHKKP22,
author = {Stefan Felsner and
Michael Hoffmann and
Kristin Knorr and
Jan Kyncl and
Irene Parada},
title = {On the Maximum Number of Crossings in Star-Simple Drawings of K\({}_{\mbox{n}}\)
with No Empty Lens},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {381--399},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00600},
doi = {10.7155/JGAA.00600},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FelsnerHKKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-07849,
author = {Jan Kyncl and
Marcus Schaefer and
Eric Sedgwick and
Daniel Stefankovic},
title = {Spiraling and Folding: The Topological View},
journal = {CoRR},
volume = {abs/2206.07849},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.07849},
doi = {10.48550/ARXIV.2206.07849},
eprinttype = {arXiv},
eprint = {2206.07849},
timestamp = {Mon, 20 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-07849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-10705,
author = {Oswin Aichholzer and
Jan Kyncl and
Manfred Scheucher and
Birgit Vogtenhuber and
Pavel Valtr},
title = {On Crossing-Families in Planar Point Sets},
journal = {CoRR},
volume = {abs/2109.10705},
year = {2021},
url = {https://arxiv.org/abs/2109.10705},
eprinttype = {arXiv},
eprint = {2109.10705},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-10705.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BalkoC0K20,
author = {Martin Balko and
Josef Cibulka and
Karel Kr{\'{a}}l and
Jan Kyncl},
title = {Ramsey Numbers of Ordered Graphs},
journal = {Electron. J. Comb.},
volume = {27},
number = {1},
pages = {1},
year = {2020},
url = {https://doi.org/10.37236/7816},
doi = {10.37236/7816},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BalkoC0K20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kyncl20,
author = {Jan Kyncl},
title = {Simple Realizability of Complete Abstract Topological Graphs Simplified},
journal = {Discret. Comput. Geom.},
volume = {64},
number = {1},
pages = {1--27},
year = {2020},
url = {https://doi.org/10.1007/s00454-020-00204-0},
doi = {10.1007/S00454-020-00204-0},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/Kyncl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JelinekKKT20,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Ida Kantor and
Jan Kyncl and
Martin Tancer},
title = {On the growth of the M{\"{o}}bius function of permutations},
journal = {J. Comb. Theory {A}},
volume = {169},
year = {2020},
url = {https://doi.org/10.1016/j.jcta.2019.105121},
doi = {10.1016/J.JCTA.2019.105121},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/JelinekKKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/AichholzerBHKPS20,
author = {Oswin Aichholzer and
Martin Balko and
Thomas Hackl and
Jan Kyncl and
Irene Parada and
Manfred Scheucher and
Pavel Valtr and
Birgit Vogtenhuber},
title = {A superlinear lower bound on the number of 5-holes},
journal = {J. Comb. Theory {A}},
volume = {173},
pages = {105236},
year = {2020},
url = {https://doi.org/10.1016/j.jcta.2020.105236},
doi = {10.1016/J.JCTA.2020.105236},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/AichholzerBHKPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerBHKMP20,
author = {Oswin Aichholzer and
Martin Balko and
Michael Hoffmann and
Jan Kyncl and
Wolfgang Mulzer and
Irene Parada and
Alexander Pilz and
Manfred Scheucher and
Pavel Valtr and
Birgit Vogtenhuber and
Emo Welzl},
title = {Minimal Representations of Order Types by Geometric Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {551--572},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00545},
doi = {10.7155/JGAA.00545},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerBHKMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FulekK19,
author = {Radoslav Fulek and
Jan Kyncl},
title = {Counterexample to an Extension of the Hanani-Tutte Theorem on the
Surface of Genus 4},
journal = {Comb.},
volume = {39},
number = {6},
pages = {1267--1279},
year = {2019},
url = {https://doi.org/10.1007/s00493-019-3905-7},
doi = {10.1007/S00493-019-3905-7},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FulekK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FulekK19,
author = {Radoslav Fulek and
Jan Kyncl},
editor = {Gill Barequet and
Yusu Wang},
title = {Z{\_}2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {39:1--39:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.39},
doi = {10.4230/LIPICS.SOCG.2019.39},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FulekK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AichholzerB0KMP19,
author = {Oswin Aichholzer and
Martin Balko and
Michael Hoffmann and
Jan Kyncl and
Wolfgang Mulzer and
Irene Parada and
Alexander Pilz and
Manfred Scheucher and
Pavel Valtr and
Birgit Vogtenhuber and
Emo Welzl},
editor = {Daniel Archambault and
Csaba D. T{\'{o}}th},
title = {Minimal Representations of Order Types by Geometric Graphs},
booktitle = {Graph Drawing and Network Visualization - 27th International Symposium,
{GD} 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11904},
pages = {101--113},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-35802-0\_8},
doi = {10.1007/978-3-030-35802-0\_8},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AichholzerB0KMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08637,
author = {Radoslav Fulek and
Jan Kyncl},
title = {Z{\_}2-genus of graphs and minimum rank of partial symmetric matrices},
journal = {CoRR},
volume = {abs/1903.08637},
year = {2019},
url = {http://arxiv.org/abs/1903.08637},
eprinttype = {arXiv},
eprint = {1903.08637},
timestamp = {Tue, 02 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-08637.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-05124,
author = {Oswin Aichholzer and
Martin Balko and
Michael Hoffmann and
Jan Kyncl and
Wolfgang Mulzer and
Irene Parada and
Alexander Pilz and
Manfred Scheucher and
Pavel Valtr and
Birgit Vogtenhuber and
Emo Welzl},
title = {Minimal Representations of Order Types by Geometric Graphs},
journal = {CoRR},
volume = {abs/1908.05124},
year = {2019},
url = {http://arxiv.org/abs/1908.05124},
eprinttype = {arXiv},
eprint = {1908.05124},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-05124.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KanoK18,
author = {Mikio Kano and
Jan Kyncl},
title = {The hamburger theorem},
journal = {Comput. Geom.},
volume = {68},
pages = {167--173},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2017.06.012},
doi = {10.1016/J.COMGEO.2017.06.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/KanoK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FulekK18,
author = {Radoslav Fulek and
Jan Kyncl},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Hanani-Tutte for Approximating Maps of Graphs},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.39},
doi = {10.4230/LIPICS.SOCG.2018.39},
timestamp = {Wed, 16 Jun 2021 12:03:35 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FulekK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FulekK18a,
author = {Radoslav Fulek and
Jan Kyncl},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {The Z{\_}2-Genus of Kuratowski Minors},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {40:1--40:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.40},
doi = {10.4230/LIPICS.SOCG.2018.40},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FulekK18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-05085,
author = {Radoslav Fulek and
Jan Kyncl},
title = {The {\(\mathbb{Z}\)}\({}_{\mbox{2}}\)-genus of Kuratowski minors},
journal = {CoRR},
volume = {abs/1803.05085},
year = {2018},
url = {http://arxiv.org/abs/1803.05085},
eprinttype = {arXiv},
eprint = {1803.05085},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-05085.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FulekKP17,
author = {Radoslav Fulek and
Jan Kyncl and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Unified Hanani-Tutte Theorem},
journal = {Electron. J. Comb.},
volume = {24},
number = {3},
pages = {3},
year = {2017},
url = {https://doi.org/10.37236/6663},
doi = {10.37236/6663},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FulekKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KynclP17,
author = {Jan Kyncl and
Zuzana Pat{\'{a}}kov{\'{a}}},
title = {On the Nonexistence of \emph{k}-Reptile Simplices in {\(\mathbb{R}\)}\({}^{\mbox{3}}\)
and {\(\mathbb{R}\)}\({}^{\mbox{4}}\)},
journal = {Electron. J. Comb.},
volume = {24},
number = {3},
pages = {3},
year = {2017},
url = {https://doi.org/10.37236/6113},
doi = {10.37236/6113},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KynclP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BalkoKLP17,
author = {Martin Balko and
Jan Kyncl and
Stefan Langerman and
Alexander Pilz},
title = {Induced Ramsey-Type Results and Binary Predicates for Point Sets},
journal = {Electron. J. Comb.},
volume = {24},
number = {4},
pages = {4},
year = {2017},
url = {https://doi.org/10.37236/7039},
doi = {10.37236/7039},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BalkoKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/HolmsenKV17,
author = {Andreas F. Holmsen and
Jan Kyncl and
Claudiu Valculescu},
title = {Near equipartitions of colored point sets},
journal = {Comput. Geom.},
volume = {65},
pages = {35--42},
year = {2017},
url = {https://doi.org/10.1016/j.comgeo.2017.05.001},
doi = {10.1016/J.COMGEO.2017.05.001},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/HolmsenKV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/KynclLV17,
author = {Jan Kyncl and
Bernard Lidick{\'{y}} and
Tom{\'{a}}s Vyskocil},
title = {Irreversible 2-conversion set in graphs of bounded degree},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {3},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-3-5},
doi = {10.23638/DMTCS-19-3-5},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/KynclLV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BalkoKLP17,
author = {Martin Balko and
Jan Kyncl and
Stefan Langerman and
Alexander Pilz},
title = {Induced Ramsey-type results and binary predicates for point sets},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {77--83},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.023},
doi = {10.1016/J.ENDM.2017.06.023},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BalkoKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloCKSV17,
author = {Sergio Cabello and
Josef Cibulka and
Jan Kyncl and
Maria Saumell and
Pavel Valtr},
title = {Peeling Potatoes Near-Optimally in Near-Linear Time},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {5},
pages = {1574--1602},
year = {2017},
url = {https://doi.org/10.1137/16M1079695},
doi = {10.1137/16M1079695},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CabelloCKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AichholzerBHKPS17,
author = {Oswin Aichholzer and
Martin Balko and
Thomas Hackl and
Jan Kyncl and
Irene Parada and
Manfred Scheucher and
Pavel Valtr and
Birgit Vogtenhuber},
editor = {Boris Aronov and
Matthew J. Katz},
title = {A Superlinear Lower Bound on the Number of 5-Holes},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {8:1--8:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.8},
doi = {10.4230/LIPICS.SOCG.2017.8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AichholzerBHKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JelinekK17,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kyncl},
editor = {Philip N. Klein},
title = {Hardness of Permutation Pattern Matching},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {378--396},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.24},
doi = {10.1137/1.9781611974782.24},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/JelinekK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CibulkaK17,
author = {Josef Cibulka and
Jan Kyncl},
editor = {Philip N. Klein},
title = {Better upper bounds on the F{\"{u}}redi-Hajnal limits of permutations},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2280--2293},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.150},
doi = {10.1137/1.9781611974782.150},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CibulkaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FulekK17,
author = {Radoslav Fulek and
Jan Kyncl},
title = {Hanani-Tutte for approximating maps of graphs},
journal = {CoRR},
volume = {abs/1705.05243},
year = {2017},
url = {http://arxiv.org/abs/1705.05243},
eprinttype = {arXiv},
eprint = {1705.05243},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FulekK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-00508,
author = {Radoslav Fulek and
Jan Kyncl},
title = {Counterexample to an extension of the Hanani-Tutte theorem on the
surface of genus 4},
journal = {CoRR},
volume = {abs/1709.00508},
year = {2017},
url = {http://arxiv.org/abs/1709.00508},
eprinttype = {arXiv},
eprint = {1709.00508},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-00508.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CibulkaK16,
author = {Josef Cibulka and
Jan Kyncl},
title = {F{\"{u}}redi-Hajnal limits are typically subexponential},
journal = {CoRR},
volume = {abs/1607.07491},
year = {2016},
url = {http://arxiv.org/abs/1607.07491},
eprinttype = {arXiv},
eprint = {1607.07491},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CibulkaK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JelinekK16,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kyncl},
title = {Hardness of Permutation Pattern Matching},
journal = {CoRR},
volume = {abs/1608.00529},
year = {2016},
url = {http://arxiv.org/abs/1608.00529},
eprinttype = {arXiv},
eprint = {1608.00529},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JelinekK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Kyncl16,
author = {Jan Kyncl},
title = {Simple realizability of complete abstract topological graphs simplified},
journal = {CoRR},
volume = {abs/1608.05867},
year = {2016},
url = {http://arxiv.org/abs/1608.05867},
eprinttype = {arXiv},
eprint = {1608.05867},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Kyncl16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FulekKP16,
author = {Radoslav Fulek and
Jan Kyncl and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Unified Hanani-Tutte theorem},
journal = {CoRR},
volume = {abs/1612.00688},
year = {2016},
url = {http://arxiv.org/abs/1612.00688},
eprinttype = {arXiv},
eprint = {1612.00688},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FulekKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FulekKMP15,
author = {Radoslav Fulek and
Jan Kyncl and
Igor Malinovic and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Clustered Planarity Testing Revisited},
journal = {Electron. J. Comb.},
volume = {22},
number = {4},
pages = {4},
year = {2015},
url = {https://doi.org/10.37236/5002},
doi = {10.37236/5002},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FulekKMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KynclPRT15,
author = {Jan Kyncl and
J{\'{a}}nos Pach and
Rados Radoicic and
G{\'{e}}za T{\'{o}}th},
title = {Saturated simple and k-simple topological graphs},
journal = {Comput. Geom.},
volume = {48},
number = {4},
pages = {295--310},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2014.10.008},
doi = {10.1016/J.COMGEO.2014.10.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/KynclPRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BalkoFK15,
author = {Martin Balko and
Radoslav Fulek and
Jan Kyncl},
title = {Crossing Numbers and Combinatorial Characterization of Monotone Drawings
of {\textdollar}{\textdollar}K{\_}n{\textdollar}{\textdollar} {K}
n},
journal = {Discret. Comput. Geom.},
volume = {53},
number = {1},
pages = {107--143},
year = {2015},
url = {https://doi.org/10.1007/s00454-014-9644-z},
doi = {10.1007/S00454-014-9644-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BalkoFK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KarasevKPPT15,
author = {Roman N. Karasev and
Jan Kyncl and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer},
title = {Bounds for Pach's Selection Theorem and for the Minimum Solid Angle
in a Simplex},
journal = {Discret. Comput. Geom.},
volume = {54},
number = {3},
pages = {610--636},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9720-z},
doi = {10.1007/S00454-015-9720-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KarasevKPPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BalkoC0K15,
author = {Martin Balko and
Josef Cibulka and
Karel Kr{\'{a}}l and
Jan Kyncl},
title = {Ramsey numbers of ordered graphs},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {419--424},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.059},
doi = {10.1016/J.ENDM.2015.06.059},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BalkoC0K15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kyncl15,
author = {Jan Kyncl},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {Simple Realizability of Complete Abstract Topological Graphs Simplified},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {309--320},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_26},
doi = {10.1007/978-3-319-27261-0\_26},
timestamp = {Sun, 13 Nov 2022 09:57:26 +0100},
biburl = {https://dblp.org/rec/conf/gd/Kyncl15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloCKSV14,
author = {Sergio Cabello and
Josef Cibulka and
Jan Kyncl and
Maria Saumell and
Pavel Valtr},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {Peeling Potatoes Near-Optimally in Near-Linear Time},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {224},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582159},
doi = {10.1145/2582112.2582159},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloCKSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FulekKMP14,
author = {Radoslav Fulek and
Jan Kyncl and
Igor Malinovic and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Clustered Planarity Testing Revisited},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {428--439},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_36},
doi = {10.1007/978-3-662-45803-7\_36},
timestamp = {Sun, 13 Nov 2022 09:57:27 +0100},
biburl = {https://dblp.org/rec/conf/gd/FulekKMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloCKSV14,
author = {Sergio Cabello and
Josef Cibulka and
Jan Kyncl and
Maria Saumell and
Pavel Valtr},
title = {Peeling potatoes near-optimally in near-linear time},
journal = {CoRR},
volume = {abs/1406.1368},
year = {2014},
url = {http://arxiv.org/abs/1406.1368},
eprinttype = {arXiv},
eprint = {1406.1368},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/CabelloCKSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KynclLV14,
author = {Jan Kyncl and
Bernard Lidick{\'{y}} and
Tom{\'{a}}s Vyskocil},
title = {Irreversible 2-conversion set in graphs of bounded degree},
journal = {CoRR},
volume = {abs/1412.4188},
year = {2014},
url = {http://arxiv.org/abs/1412.4188},
eprinttype = {arXiv},
eprint = {1412.4188},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KynclLV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kyncl13,
author = {Jan Kyncl},
title = {Improved Enumeration of Simple Topological Graphs},
journal = {Discret. Comput. Geom.},
volume = {50},
number = {3},
pages = {727--770},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9535-8},
doi = {10.1007/S00454-013-9535-8},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Kyncl13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CernyKT13,
author = {Jakub Cern{\'{y}} and
Jan Kyncl and
G{\'{e}}za T{\'{o}}th},
title = {Improvement on the Decay of Crossing Numbers},
journal = {Graphs Comb.},
volume = {29},
number = {3},
pages = {365--371},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1137-3},
doi = {10.1007/S00373-012-1137-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CernyKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CibulkaKMSV13,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
title = {Graph sharing games: Complexity and connectivity},
journal = {Theor. Comput. Sci.},
volume = {494},
pages = {49--62},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.029},
doi = {10.1016/J.TCS.2012.12.029},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CibulkaKMSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CibulkaKV13,
author = {Josef Cibulka and
Jan Kyncl and
Pavel Valtr},
editor = {Guilherme Dias da Fonseca and
Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and
Timothy M. Chan and
Rolf Klein},
title = {On planar point sets with the pentagon property},
booktitle = {Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
Brazil, June 17-20, 2013},
pages = {81--90},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2462356.2462406},
doi = {10.1145/2462356.2462406},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/CibulkaKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/KynclHN13,
author = {Jan Kyncl and
Adithya Hariram and
Martin Novotn{\'{y}}},
title = {On measurement of synchronous phasors in electrical grids},
booktitle = {2013 {IEEE} International Symposium on Circuits and Systems (ISCAS2013),
Beijing, China, May 19-23, 2013},
pages = {2972--2975},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ISCAS.2013.6572503},
doi = {10.1109/ISCAS.2013.6572503},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscas/KynclHN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4519,
author = {Radoslav Fulek and
Jan Kyncl and
Igor Malinovic and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Efficient c-planarity testing algebraically},
journal = {CoRR},
volume = {abs/1305.4519},
year = {2013},
url = {http://arxiv.org/abs/1305.4519},
eprinttype = {arXiv},
eprint = {1305.4519},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4519.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalkoFK13,
author = {Martin Balko and
Radoslav Fulek and
Jan Kyncl},
title = {Crossing numbers and combinatorial characterization of monotone drawings
of {\textdollar}K{\_}n{\textdollar}},
journal = {CoRR},
volume = {abs/1312.3679},
year = {2013},
url = {http://arxiv.org/abs/1312.3679},
eprinttype = {arXiv},
eprint = {1312.3679},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalkoFK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Kyncl12,
author = {Jan Kyncl},
title = {Ramsey-type constructions for arrangements of segments},
journal = {Eur. J. Comb.},
volume = {33},
number = {3},
pages = {336--339},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.09.006},
doi = {10.1016/J.EJC.2011.09.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Kyncl12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CibulkaK12,
author = {Josef Cibulka and
Jan Kyncl},
title = {Tight bounds on the maximum size of a set of permutations with bounded
VC-dimension},
journal = {J. Comb. Theory {A}},
volume = {119},
number = {7},
pages = {1461--1478},
year = {2012},
url = {https://doi.org/10.1016/j.jcta.2012.04.004},
doi = {10.1016/J.JCTA.2012.04.004},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/CibulkaK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CibulkaK12,
author = {Josef Cibulka and
Jan Kyncl},
editor = {Yuval Rabani},
title = {Tight bounds on the maximum size of a set of permutations with bounded
VC-dimension},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1113--1122},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.87},
doi = {10.1137/1.9781611973099.87},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/CibulkaK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-5421,
author = {Jakub Cern{\'{y}} and
Jan Kyncl and
G{\'{e}}za T{\'{o}}th},
title = {Improvement on the decay of crossing numbers},
journal = {CoRR},
volume = {abs/1201.5421},
year = {2012},
url = {http://arxiv.org/abs/1201.5421},
eprinttype = {arXiv},
eprint = {1201.5421},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-5421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-0847,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
title = {Graph sharing games: complexity and connectivity},
journal = {CoRR},
volume = {abs/1202.0847},
year = {2012},
url = {http://arxiv.org/abs/1202.0847},
eprinttype = {arXiv},
eprint = {1202.0847},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-0847.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-2950,
author = {Jan Kyncl},
title = {Improved enumeration of simple topological graphs},
journal = {CoRR},
volume = {abs/1212.2950},
year = {2012},
url = {http://arxiv.org/abs/1212.2950},
eprinttype = {arXiv},
eprint = {1212.2950},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-2950.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kyncl11,
author = {Jan Kyncl},
title = {Simple Realizability of Complete Abstract Topological Graphs in {P}},
journal = {Discret. Comput. Geom.},
volume = {45},
number = {3},
pages = {383--399},
year = {2011},
url = {https://doi.org/10.1007/s00454-010-9320-x},
doi = {10.1007/S00454-010-9320-X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Kyncl11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/KynclN11,
author = {Jan Kyncl and
Martin Novotn{\'{y}}},
title = {Education of Digital and Analog Circuits supported by computer algebra
system},
booktitle = {International Symposium on Circuits and Systems {(ISCAS} 2011), May
15-19 2011, Rio de Janeiro, Brazil},
pages = {341--344},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/ISCAS.2011.5937572},
doi = {10.1109/ISCAS.2011.5937572},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscas/KynclN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0874,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
title = {Universal Sets for Straight-Line Embeddings of Bicolored Graphs},
journal = {CoRR},
volume = {abs/1102.0874},
year = {2011},
url = {http://arxiv.org/abs/1102.0874},
eprinttype = {arXiv},
eprint = {1102.0874},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-0874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-5007,
author = {Josef Cibulka and
Jan Kyncl},
title = {Tight bounds on the maximum size of a set of permutations with bounded
VC-dimension},
journal = {CoRR},
volume = {abs/1104.5007},
year = {2011},
url = {http://arxiv.org/abs/1104.5007},
eprinttype = {arXiv},
eprint = {1104.5007},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-5007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KynclV10,
author = {Jan Kyncl and
Tom{\'{a}}s Vyskocil},
title = {Logspace Reduction of Directed Reachability for Bounded Genus Graphs
to the Planar Case},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {3},
pages = {8:1--8:11},
year = {2010},
url = {https://doi.org/10.1145/1714450.1714451},
doi = {10.1145/1714450.1714451},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KynclV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CibulkaKMSV10,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
editor = {My T. Thai and
Sartaj Sahni},
title = {On Three Parameters of Invisibility Graphs},
booktitle = {Computing and Combinatorics, 16th Annual International Conference,
{COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6196},
pages = {192--198},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14031-0\_22},
doi = {10.1007/978-3-642-14031-0\_22},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/CibulkaKMSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/CibulkaKMSV10,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Graph Sharing Games: Complexity and Connectivity},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {340--349},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_31},
doi = {10.1007/978-3-642-13562-0\_31},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/CibulkaKMSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JelinekKSV09,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kyncl and
Rudolf Stolar and
Tom{\'{a}}s Valla},
title = {Monochromatic triangles in two-colored plane},
journal = {Comb.},
volume = {29},
number = {6},
pages = {699--718},
year = {2009},
url = {https://doi.org/10.1007/s00493-009-2291-y},
doi = {10.1007/S00493-009-2291-Y},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JelinekKSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KynclV09,
author = {Jan Kyncl and
Pavel Valtr},
title = {On edges crossing few other edges in simple topological complete graphs},
journal = {Discret. Math.},
volume = {309},
number = {7},
pages = {1917--1923},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.03.005},
doi = {10.1016/J.DISC.2008.03.005},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KynclV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Kyncl09,
author = {Jan Kyncl},
title = {Enumeration of simple complete topological graphs},
journal = {Eur. J. Comb.},
volume = {30},
number = {7},
pages = {1676--1685},
year = {2009},
url = {https://doi.org/10.1016/j.ejc.2009.03.005},
doi = {10.1016/J.EJC.2009.03.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Kyncl09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KawarabayashiKKL09,
author = {Ken{-}ichi Kawarabayashi and
Daniel Kr{\'{a}}l and
Jan Kyncl and
Bernard Lidick{\'{y}}},
title = {6-Critical Graphs on the Klein Bottle},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {372--383},
year = {2009},
url = {https://doi.org/10.1137/070706835},
doi = {10.1137/070706835},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KawarabayashiKKL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CibulkaKMSV09,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Solution of Peter Winkler's Pizza Problem},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {356--367},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_35},
doi = {10.1007/978-3-642-10217-2\_35},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/CibulkaKMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KynclV09,
author = {Jan Kyncl and
Tom{\'{a}}s Vyskocil},
title = {Logspace reduction of directed reachability for bounded genus graphs
to the planar case},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-050}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/050},
eprinttype = {ECCC},
eprint = {TR09-050},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KynclV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KynclT08,
author = {Jan Kyncl and
Martin Tancer},
title = {The Maximum Piercing Number for some Classes of Convex Sets with the
(4, 3)-property},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r27.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KynclT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KynclPT08,
author = {Jan Kyncl and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th},
title = {Long alternating paths in bicolored point sets},
journal = {Discret. Math.},
volume = {308},
number = {19},
pages = {4315--4321},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.08.013},
doi = {10.1016/J.DISC.2007.08.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KynclPT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChenettePSTYKKKL08,
author = {Nathan Chenette and
Luke Postle and
Noah Streib and
Robin Thomas and
Carl Yerger and
Ken{-}ichi Kawarabayashi and
Daniel Kr{\'{a}}l and
Jan Kyncl and
Bernard Lidick{\'{y}}},
title = {Six-Critical Graphs on the Klein Bottle},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {235--240},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.047},
doi = {10.1016/J.ENDM.2008.06.047},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChenettePSTYKKKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Kyncl08,
author = {Jan Kyncl},
title = {Ramsey-type constructions for arrangements of segments},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {265--269},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.054},
doi = {10.1016/J.ENDM.2008.06.054},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Kyncl08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CibulkaKMSV08,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Hamiltonian Alternating Paths on Bicolored Double-Chains},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {181--192},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_18},
doi = {10.1007/978-3-642-00219-9\_18},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gd/CibulkaKMSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-4322,
author = {Josef Cibulka and
Jan Kyncl and
Viola M{\'{e}}sz{\'{a}}ros and
Rudolf Stolar and
Pavel Valtr},
title = {Solution of Peter Winkler's Pizza Problem},
journal = {CoRR},
volume = {abs/0812.4322},
year = {2008},
url = {http://arxiv.org/abs/0812.4322},
eprinttype = {arXiv},
eprint = {0812.4322},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-4322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Kyncl07,
author = {Jan Kyncl},
title = {Enumeration of simple complete topological graphs},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {295--299},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.051},
doi = {10.1016/J.ENDM.2007.07.051},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Kyncl07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DvorakJKKS07,
author = {Zdenek Dvor{\'{a}}k and
V{\'{\i}}t Jel{\'{\i}}nek and
Daniel Kr{\'{a}}l and
Jan Kyncl and
Michael E. Saks},
title = {Probabilistic strategies for the partition and plurality problems},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {63--77},
year = {2007},
url = {https://doi.org/10.1002/rsa.20148},
doi = {10.1002/RSA.20148},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DvorakJKKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CernyKT07,
author = {Jakub Cern{\'{y}} and
Jan Kyncl and
G{\'{e}}za T{\'{o}}th},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {Improvement on the Decay of Crossing Numbers},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {25--30},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_5},
doi = {10.1007/978-3-540-77537-9\_5},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/gd/CernyKT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kyncl07,
author = {Jan Kyncl},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {The Complexity of Several Realizability Problems for Abstract Topological
Graphs},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {137--158},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_16},
doi = {10.1007/978-3-540-77537-9\_16},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Kyncl07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KynclV05,
author = {Jan Kyncl and
Pavel Valtr},
editor = {Patrick Healy and
Nikola S. Nikolov},
title = {On Edges Crossing Few Other Edges in Simple Topological Complete Graphs},
booktitle = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick,
Ireland, September 12-14, 2005, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3843},
pages = {274--284},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11618058\_25},
doi = {10.1007/11618058\_25},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gd/KynclV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DvorakJKKS05,
author = {Zdenek Dvor{\'{a}}k and
V{\'{\i}}t Jel{\'{\i}}nek and
Daniel Kr{\'{a}}l and
Jan Kyncl and
Michael E. Saks},
editor = {Volker Diekert and
Bruno Durand},
title = {Three Optimal Algorithms for Balls of Three Colors},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {206--217},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_17},
doi = {10.1007/978-3-540-31856-9\_17},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DvorakJKKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KynclPT04,
author = {Jan Kyncl and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th},
editor = {J{\'{a}}nos Pach},
title = {Long Alternating Paths in Bicolored Point Sets},
booktitle = {Graph Drawing, 12th International Symposium, {GD} 2004, New York,
NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3383},
pages = {340--348},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31843-9\_34},
doi = {10.1007/978-3-540-31843-9\_34},
timestamp = {Sun, 13 Nov 2022 09:57:33 +0100},
biburl = {https://dblp.org/rec/conf/gd/KynclPT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-05 21:24 CEST 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:
