BibTeX records: Jan Kyncl

download as .bib file

@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},
  archivePrefix = {arXiv},
  eprint    = {1903.08637},
  timestamp = {Tue, 02 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1903-08637},
  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/bib/journals/comgeo/KanoK18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FulekK18,
  author    = {Radoslav Fulek and
               Jan Kyncl},
  title     = {Hanani-Tutte for Approximating Maps of Graphs},
  booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
               June 11-14, 2018, Budapest, Hungary},
  pages     = {39:1--39:15},
  year      = {2018},
  crossref  = {DBLP:conf/compgeom/2018},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2018.39},
  doi       = {10.4230/LIPIcs.SoCG.2018.39},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/FulekK18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FulekK18a,
  author    = {Radoslav Fulek and
               Jan Kyncl},
  title     = {The Z{\_}2-Genus of Kuratowski Minors},
  booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
               June 11-14, 2018, Budapest, Hungary},
  pages     = {40:1--40:14},
  year      = {2018},
  crossref  = {DBLP:conf/compgeom/2018},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2018.40},
  doi       = {10.4230/LIPIcs.SoCG.2018.40},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/FulekK18a},
  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},
  archivePrefix = {arXiv},
  eprint    = {1803.05085},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1803-05085},
  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 {\textdollar}k{\textdollar}-Reptile Simplices
               in {\textdollar}{\textbackslash}mathbb R{\^{}}3{\textdollar} and {\textdollar}{\textbackslash}mathbb
               R{\^{}}4{\textdollar}},
  journal   = {Electr. J. Comb.},
  volume    = {24},
  number    = {3},
  pages     = {P3.1},
  year      = {2017},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p1},
  timestamp = {Tue, 15 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/KynclP17},
  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   = {Electr. J. Comb.},
  volume    = {24},
  number    = {3},
  pages     = {P3.18},
  year      = {2017},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p18},
  timestamp = {Tue, 15 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/FulekKP17},
  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   = {Electr. J. Comb.},
  volume    = {24},
  number    = {4},
  pages     = {P4.24},
  year      = {2017},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p24},
  timestamp = {Fri, 24 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/BalkoKLP17},
  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/bib/journals/comgeo/HolmsenKV17},
  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   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {19},
  number    = {3},
  year      = {2017},
  url       = {http://dmtcs.episciences.org/3952},
  timestamp = {Wed, 18 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/KynclLV17},
  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   = {Electronic Notes in Discrete Mathematics},
  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 = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/BalkoKLP17},
  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 = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/CabelloCKSV17},
  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},
  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},
  pages     = {8:1--8:16},
  year      = {2017},
  crossref  = {DBLP:conf/compgeom/2017},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2017.8},
  doi       = {10.4230/LIPIcs.SoCG.2017.8},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/AichholzerBHKPS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JelinekK17,
  author    = {V{\'{\i}}t Jel{\'{\i}}nek and
               Jan Kyncl},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.24},
  doi       = {10.1137/1.9781611974782.24},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/JelinekK17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CibulkaK17,
  author    = {Josef Cibulka and
               Jan Kyncl},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.150},
  doi       = {10.1137/1.9781611974782.150},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CibulkaK17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1705.05243},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FulekK17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1709.00508},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1709-00508},
  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},
  archivePrefix = {arXiv},
  eprint    = {1607.07491},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/CibulkaK16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1608.00529},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/JelinekK16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1608.05867},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Kyncl16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1612.00688},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FulekKP16},
  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   = {Electr. J. Comb.},
  volume    = {22},
  number    = {4},
  pages     = {P4.24},
  year      = {2015},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p24},
  timestamp = {Tue, 08 Dec 2015 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/FulekKMP15},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/KynclPRT15},
  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   = {Discrete {\&} Computational Geometry},
  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 = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/BalkoFK15},
  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   = {Discrete {\&} Computational Geometry},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/KarasevKPPT15},
  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   = {Electronic Notes in Discrete Mathematics},
  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 = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/BalkoC0K15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kyncl15,
  author    = {Jan Kyncl},
  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},
  pages     = {309--320},
  year      = {2015},
  crossref  = {DBLP:conf/gd/2015},
  url       = {https://doi.org/10.1007/978-3-319-27261-0\_26},
  doi       = {10.1007/978-3-319-27261-0\_26},
  timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/Kyncl15},
  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},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/compgeom/2014},
  url       = {https://doi.org/10.1145/2582112.2582159},
  doi       = {10.1145/2582112.2582159},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/CabelloCKSV14},
  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},
  title     = {Clustered Planarity Testing Revisited},
  booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
               Germany, September 24-26, 2014, Revised Selected Papers},
  pages     = {428--439},
  year      = {2014},
  crossref  = {DBLP:conf/gd/2014},
  url       = {https://doi.org/10.1007/978-3-662-45803-7\_36},
  doi       = {10.1007/978-3-662-45803-7\_36},
  timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/gd/FulekKMP14},
  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},
  archivePrefix = {arXiv},
  eprint    = {1406.1368},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/CabelloCKSV14},
  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},
  archivePrefix = {arXiv},
  eprint    = {1412.4188},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/KynclLV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kyncl13,
  author    = {Jan Kyncl},
  title     = {Improved Enumeration of Simple Topological Graphs},
  journal   = {Discrete {\&} Computational Geometry},
  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 = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/Kyncl13},
  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 and Combinatorics},
  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 = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/CernyKT13},
  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 = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/CibulkaKMSV13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CibulkaKV13,
  author    = {Josef Cibulka and
               Jan Kyncl and
               Pavel Valtr},
  title     = {On planar point sets with the pentagon property},
  booktitle = {Symposuim on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
               Brazil, June 17-20, 2013},
  pages     = {81--90},
  year      = {2013},
  crossref  = {DBLP:conf/compgeom/2013},
  url       = {https://doi.org/10.1145/2462356.2462406},
  doi       = {10.1145/2462356.2462406},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/CibulkaKV13},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/iscas/2013},
  url       = {https://doi.org/10.1109/ISCAS.2013.6572503},
  doi       = {10.1109/ISCAS.2013.6572503},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iscas/KynclHN13},
  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},
  archivePrefix = {arXiv},
  eprint    = {1305.4519},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1305-4519},
  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},
  archivePrefix = {arXiv},
  eprint    = {1312.3679},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BalkoFK13},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/Kyncl12},
  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, Ser. {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 = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jct/CibulkaK12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CibulkaK12,
  author    = {Josef Cibulka and
               Jan Kyncl},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095203\&\#38;CFID=63838676\&\#38;CFTOKEN=79617016},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CibulkaK12},
  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},
  archivePrefix = {arXiv},
  eprint    = {1201.5421},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1201-5421},
  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},
  archivePrefix = {arXiv},
  eprint    = {1202.0847},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1202-0847},
  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},
  archivePrefix = {arXiv},
  eprint    = {1212.2950},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1212-2950},
  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   = {Discrete {\&} Computational Geometry},
  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 = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/Kyncl11},
  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},
  year      = {2011},
  crossref  = {DBLP:conf/iscas/2011},
  url       = {https://doi.org/10.1109/ISCAS.2011.5937572},
  doi       = {10.1109/ISCAS.2011.5937572},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iscas/KynclN11},
  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},
  archivePrefix = {arXiv},
  eprint    = {1102.0874},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1102-0874},
  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},
  archivePrefix = {arXiv},
  eprint    = {1104.5007},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1104-5007},
  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   = {{TOCT}},
  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 = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/toct/KynclV10},
  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},
  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},
  pages     = {192--198},
  year      = {2010},
  crossref  = {DBLP:conf/cocoon/2010},
  url       = {https://doi.org/10.1007/978-3-642-14031-0\_22},
  doi       = {10.1007/978-3-642-14031-0\_22},
  timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/CibulkaKMSV10},
  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},
  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},
  pages     = {340--349},
  year      = {2010},
  crossref  = {DBLP:conf/tamc/2010},
  url       = {https://doi.org/10.1007/978-3-642-13562-0\_31},
  doi       = {10.1007/978-3-642-13562-0\_31},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/CibulkaKMSV10},
  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   = {Combinatorica},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorica/JelinekKSV09},
  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   = {Discrete Mathematics},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/KynclV09},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/Kyncl09},
  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. Discrete Math.},
  volume    = {23},
  number    = {1},
  pages     = {372--383},
  year      = {2009},
  url       = {https://doi.org/10.1137/070706835},
  doi       = {10.1137/070706835},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/KawarabayashiKKL09},
  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},
  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},
  pages     = {356--367},
  year      = {2009},
  crossref  = {DBLP:conf/iwoca/2009},
  url       = {https://doi.org/10.1007/978-3-642-10217-2\_35},
  doi       = {10.1007/978-3-642-10217-2\_35},
  timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iwoca/CibulkaKMSV09},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {50},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/050},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/KynclV09},
  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   = {Electr. J. Comb.},
  volume    = {15},
  number    = {1},
  year      = {2008},
  url       = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r27.html},
  timestamp = {Wed, 11 Jan 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/KynclT08},
  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   = {Discrete Mathematics},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/KynclPT08},
  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   = {Electronic Notes in Discrete Mathematics},
  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 = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/endm/ChenettePSTYKKKL08},
  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   = {Electronic Notes in Discrete Mathematics},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/Kyncl08},
  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},
  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},
  pages     = {181--192},
  year      = {2008},
  crossref  = {DBLP:conf/gd/2008},
  url       = {https://doi.org/10.1007/978-3-642-00219-9\_18},
  doi       = {10.1007/978-3-642-00219-9\_18},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/CibulkaKMSV08},
  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},
  archivePrefix = {arXiv},
  eprint    = {0812.4322},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0812-4322},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Kyncl07,
  author    = {Jan Kyncl},
  title     = {Enumeration of simple complete topological graphs},
  journal   = {Electronic Notes in Discrete Mathematics},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/Kyncl07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DvorakJKKS07,
  author    = {Zdenek Dvorak 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 = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/rsa/DvorakJKKS07},
  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},
  title     = {Improvement on the Decay of Crossing Numbers},
  booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
               September 24-26, 2007. Revised Papers},
  pages     = {25--30},
  year      = {2007},
  crossref  = {DBLP:conf/gd/2007},
  url       = {https://doi.org/10.1007/978-3-540-77537-9\_5},
  doi       = {10.1007/978-3-540-77537-9\_5},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/CernyKT07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kyncl07,
  author    = {Jan Kyncl},
  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},
  pages     = {137--158},
  year      = {2007},
  crossref  = {DBLP:conf/gd/2007},
  url       = {https://doi.org/10.1007/978-3-540-77537-9\_16},
  doi       = {10.1007/978-3-540-77537-9\_16},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/Kyncl07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KynclV05,
  author    = {Jan Kyncl and
               Pavel Valtr},
  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},
  pages     = {274--284},
  year      = {2005},
  crossref  = {DBLP:conf/gd/2005},
  url       = {https://doi.org/10.1007/11618058\_25},
  doi       = {10.1007/11618058\_25},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/KynclV05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DvorakJKKS05,
  author    = {Zdenek Dvorak and
               V{\'{\i}}t Jel{\'{\i}}nek and
               Daniel Kr{\'{a}}l and
               Jan Kyncl and
               Michael E. Saks},
  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},
  pages     = {206--217},
  year      = {2005},
  crossref  = {DBLP:conf/stacs/2005},
  url       = {https://doi.org/10.1007/978-3-540-31856-9\_17},
  doi       = {10.1007/978-3-540-31856-9\_17},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/DvorakJKKS05},
  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},
  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},
  pages     = {340--348},
  year      = {2004},
  crossref  = {DBLP:conf/gd/2004},
  url       = {https://doi.org/10.1007/978-3-540-31843-9\_34},
  doi       = {10.1007/978-3-540-31843-9\_34},
  timestamp = {Wed, 14 Nov 2018 10:57:16 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/gd/KynclPT04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2018,
  editor    = {Bettina Speckmann and
               Csaba D. T{\'{o}}th},
  title     = {34th International Symposium on Computational Geometry, SoCG 2018,
               June 11-14, 2018, Budapest, Hungary},
  series    = {LIPIcs},
  volume    = {99},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-066-8},
  isbn      = {978-3-95977-066-8},
  timestamp = {Fri, 08 Jun 2018 10:08:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2017,
  editor    = {Boris Aronov and
               Matthew J. Katz},
  title     = {33rd International Symposium on Computational Geometry, SoCG 2017,
               July 4-7, 2017, Brisbane, Australia},
  series    = {LIPIcs},
  volume    = {77},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-038-5},
  isbn      = {978-3-95977-038-5},
  timestamp = {Mon, 26 Jun 2017 09:41:17 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2017,
  editor    = {Philip N. Klein},
  title     = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782},
  doi       = {10.1137/1.9781611974782},
  isbn      = {978-1-61197-478-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2015,
  editor    = {Emilio Di Giacomo and
               Anna Lubiw},
  title     = {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},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-27261-0},
  doi       = {10.1007/978-3-319-27261-0},
  isbn      = {978-3-319-27260-3},
  timestamp = {Fri, 26 May 2017 00:49:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2014,
  editor    = {Siu{-}Wing Cheng and
               Olivier Devillers},
  title     = {30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan,
               June 08 - 11, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {https://doi.org/10.1145/2582112},
  doi       = {10.1145/2582112},
  isbn      = {978-1-4503-2594-3},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2014,
  editor    = {Christian A. Duncan and
               Antonios Symvonis},
  title     = {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},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-45803-7},
  doi       = {10.1007/978-3-662-45803-7},
  isbn      = {978-3-662-45802-0},
  timestamp = {Fri, 26 May 2017 00:49:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2013,
  editor    = {Guilherme Dias da Fonseca and
               Thomas Lewiner and
               Luis Mariano Pe{\~{n}}aranda and
               Timothy M. Chan and
               Rolf Klein},
  title     = {Symposuim on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
               Brazil, June 17-20, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {https://doi.org/10.1145/2462356},
  doi       = {10.1145/2462356},
  isbn      = {978-1-4503-2031-3},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iscas/2013,
  title     = {2013 {IEEE} International Symposium on Circuits and Systems (ISCAS2013),
               Beijing, China, May 19-23, 2013},
  publisher = {{IEEE}},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6560459},
  isbn      = {978-1-4673-5760-9},
  timestamp = {Mon, 26 Aug 2013 07:33:58 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iscas/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2012,
  editor    = {Yuval Rabani},
  title     = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  publisher = {{SIAM}},
  year      = {2012},
  url       = {https://doi.org/10.1137/1.9781611973099},
  doi       = {10.1137/1.9781611973099},
  isbn      = {978-1-61197-210-8},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iscas/2011,
  title     = {International Symposium on Circuits and Systems {(ISCAS} 2011), May
               15-19 2011, Rio de Janeiro, Brazil},
  publisher = {{IEEE}},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5910713},
  isbn      = {978-1-4244-9473-6},
  timestamp = {Fri, 20 May 2016 09:36:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iscas/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2010,
  editor    = {My T. Thai and
               Sartaj Sahni},
  title     = {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},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14031-0},
  doi       = {10.1007/978-3-642-14031-0},
  isbn      = {978-3-642-14030-3},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2010,
  editor    = {Jan Kratochv{\'{\i}}l and
               Angsheng Li and
               Jir{\'{\i}} Fiala and
               Petr Kolman},
  title     = {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},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-13562-0},
  doi       = {10.1007/978-3-642-13562-0},
  isbn      = {978-3-642-13561-3},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2009,
  editor    = {Jir{\'{\i}} Fiala and
               Jan Kratochv{\'{\i}}l and
               Mirka Miller},
  title     = {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},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-10217-2},
  doi       = {10.1007/978-3-642-10217-2},
  isbn      = {978-3-642-10216-5},
  timestamp = {Wed, 17 May 2017 10:54:37 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iwoca/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2008,
  editor    = {Ioannis G. Tollis and
               Maurizio Patrignani},
  title     = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
               Crete, Greece, September 21-24, 2008. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {5417},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-00219-9},
  doi       = {10.1007/978-3-642-00219-9},
  isbn      = {978-3-642-00218-2},
  timestamp = {Fri, 26 May 2017 00:49:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2007,
  editor    = {Seok{-}Hee Hong and
               Takao Nishizeki and
               Wu Quan},
  title     = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
               September 24-26, 2007. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4875},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-77537-9},
  doi       = {10.1007/978-3-540-77537-9},
  isbn      = {978-3-540-77536-2},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2005,
  editor    = {Patrick Healy and
               Nikola S. Nikolov},
  title     = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick,
               Ireland, September 12-14, 2005, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {3843},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11618058},
  doi       = {10.1007/11618058},
  isbn      = {3-540-31425-3},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/gd/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2005,
  editor    = {Volker Diekert and
               Bruno Durand},
  title     = {{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},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/b106485},
  doi       = {10.1007/b106485},
  isbn      = {3-540-24998-2},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2004,
  editor    = {J{\'{a}}nos Pach},
  title     = {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},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b105810},
  doi       = {10.1007/b105810},
  isbn      = {3-540-24528-6},
  timestamp = {Wed, 14 Nov 2018 10:57:16 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/gd/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier