BibTeX records: László Kozma 0002

download as .bib file

@inproceedings{DBLP:conf/iwpec/Berendsohn0M19,
  author    = {Benjamin Aram Berendsohn and
               L{\'{a}}szl{\'{o}} Kozma and
               D{\'{a}}niel Marx},
  editor    = {Bart M. P. Jansen and
               Jan Arne Telle},
  title     = {Finding and Counting Permutations via CSPs},
  booktitle = {14th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2019, September 11-13, 2019, Munich, Germany},
  series    = {LIPIcs},
  volume    = {148},
  pages     = {1:1--1:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2019.1},
  doi       = {10.4230/LIPIcs.IPEC.2019.1},
  timestamp = {Thu, 05 Dec 2019 15:19:13 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/Berendsohn0M19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kaplan0ZZ19,
  author    = {Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Or Zamir and
               Uri Zwick},
  editor    = {Jeremy T. Fineman and
               Michael Mitzenmacher},
  title     = {Selection from Heaps, Row-Sorted Matrices, and {X+Y} Using Soft Heaps},
  booktitle = {2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January
               8-9, 2019 - San Diego, CA, {USA}},
  series    = {{OASICS}},
  volume    = {69},
  pages     = {5:1--5:21},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/OASIcs.SOSA.2019.5},
  doi       = {10.4230/OASIcs.SOSA.2019.5},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Kaplan0ZZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Berger0MV19,
  author    = {Andr{\'{e}} Berger and
               L{\'{a}}szl{\'{o}} Kozma and
               Matthias Mnich and
               Roland Vincze},
  editor    = {Timothy M. Chan},
  title     = {A time- and space-optimal algorithm for the many-visits {TSP}},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {1770--1782},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482.106},
  doi       = {10.1137/1.9781611975482.106},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Berger0MV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Jansen0N19,
  author    = {Bart M. P. Jansen and
               L{\'{a}}szl{\'{o}} Kozma and
               Jesper Nederlof},
  editor    = {Ignasi Sau and
               Dimitrios M. Thilikos},
  title     = {Hamiltonicity Below Dirac's Condition},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
               Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
               2019, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {11789},
  pages     = {27--39},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-30786-8\_3},
  doi       = {10.1007/978-3-030-30786-8\_3},
  timestamp = {Tue, 17 Sep 2019 12:59:56 +0200},
  biburl    = {https://dblp.org/rec/conf/wg/Jansen0N19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-01745,
  author    = {Bart M. P. Jansen and
               L{\'{a}}szl{\'{o}} Kozma and
               Jesper Nederlof},
  title     = {Hamiltonicity below Dirac's condition},
  journal   = {CoRR},
  volume    = {abs/1902.01745},
  year      = {2019},
  url       = {http://arxiv.org/abs/1902.01745},
  archivePrefix = {arXiv},
  eprint    = {1902.01745},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1902-01745.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08809,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  title     = {Faster and simpler algorithms for finding large patterns in permutations},
  journal   = {CoRR},
  volume    = {abs/1902.08809},
  year      = {2019},
  url       = {http://arxiv.org/abs/1902.08809},
  archivePrefix = {arXiv},
  eprint    = {1902.08809},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1902-08809.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-04673,
  author    = {Benjamin Aram Berendsohn and
               L{\'{a}}szl{\'{o}} Kozma and
               D{\'{a}}niel Marx},
  title     = {Finding and counting permutations via CSPs},
  journal   = {CoRR},
  volume    = {abs/1908.04673},
  year      = {2019},
  url       = {http://arxiv.org/abs/1908.04673},
  archivePrefix = {arXiv},
  eprint    = {1908.04673},
  timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1908-04673.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-13117,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  title     = {Exact exponential algorithms for two poset problems},
  journal   = {CoRR},
  volume    = {abs/1912.13117},
  year      = {2019},
  url       = {http://arxiv.org/abs/1912.13117},
  archivePrefix = {arXiv},
  eprint    = {1912.13117},
  timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1912-13117.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Kozma18,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  title     = {Review of Compact Data Structures - a practical approach by Gonzalo
               Navarro},
  journal   = {{SIGACT} News},
  volume    = {49},
  number    = {3},
  pages     = {9--13},
  year      = {2018},
  url       = {https://doi.org/10.1145/3289137.3289140},
  doi       = {10.1145/3289137.3289140},
  timestamp = {Fri, 16 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/sigact/Kozma18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DorfmanK0PZ18,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Seth Pettie and
               Uri Zwick},
  editor    = {Yossi Azar and
               Hannah Bast and
               Grzegorz Herman},
  title     = {Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary
               Search Trees},
  booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
               2018, Helsinki, Finland},
  series    = {LIPIcs},
  volume    = {112},
  pages     = {24:1--24:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2018.24},
  doi       = {10.4230/LIPIcs.ESA.2018.24},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/esa/DorfmanK0PZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChalermsookG0MS18,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  editor    = {Wen{-}Lian Hsu and
               Der{-}Tsai Lee and
               Chung{-}Shou Liao},
  title     = {Multi-Finger Binary Search Trees},
  booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
               2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
  series    = {LIPIcs},
  volume    = {123},
  pages     = {55:1--55:26},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.55},
  doi       = {10.4230/LIPIcs.ISAAC.2018.55},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/isaac/ChalermsookG0MS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DorfmanK0Z18,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Uri Zwick},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Pairing heaps: the forward variant},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {13:1--13:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.13},
  doi       = {10.4230/LIPIcs.MFCS.2018.13},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DorfmanK0Z18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002S18,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Thatchaphol Saranurak},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Smooth heaps and a dual view of self-adjusting data structures},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {801--814},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188864},
  doi       = {10.1145/3188745.3188864},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/0002S18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05471,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Thatchaphol Saranurak},
  title     = {Smooth heaps and a dual view of self-adjusting data structures},
  journal   = {CoRR},
  volume    = {abs/1802.05471},
  year      = {2018},
  url       = {http://arxiv.org/abs/1802.05471},
  archivePrefix = {arXiv},
  eprint    = {1802.05471},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1802-05471.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07041,
  author    = {Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Or Zamir and
               Uri Zwick},
  title     = {Selection from heaps, row-sorted matrices and {X+Y} using soft heaps},
  journal   = {CoRR},
  volume    = {abs/1802.07041},
  year      = {2018},
  url       = {http://arxiv.org/abs/1802.07041},
  archivePrefix = {arXiv},
  eprint    = {1802.07041},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1802-07041.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-06361,
  author    = {Andr{\'{e}} Berger and
               L{\'{a}}szl{\'{o}} Kozma and
               Matthias Mnich and
               Roland Vincze},
  title     = {Time- and space-optimal algorithms for the many-visits {TSP}},
  journal   = {CoRR},
  volume    = {abs/1804.06361},
  year      = {2018},
  url       = {http://arxiv.org/abs/1804.06361},
  archivePrefix = {arXiv},
  eprint    = {1804.06361},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1804-06361.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-08692,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Seth Pettie and
               Uri Zwick},
  title     = {Improved bounds for multipass pairing heaps and path-balanced binary
               search trees},
  journal   = {CoRR},
  volume    = {abs/1806.08692},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.08692},
  archivePrefix = {arXiv},
  eprint    = {1806.08692},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1806-08692.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-01759,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  title     = {Multi-finger binary search trees},
  journal   = {CoRR},
  volume    = {abs/1809.01759},
  year      = {2018},
  url       = {http://arxiv.org/abs/1809.01759},
  archivePrefix = {arXiv},
  eprint    = {1809.01759},
  timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1809-01759.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/0002M17,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Tobias M{\"{o}}mke},
  editor    = {Philip N. Klein},
  title     = {Maximum Scatter {TSP} in Doubling Metrics},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  pages     = {143--153},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782.10},
  doi       = {10.1137/1.9781611974782.10},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/0002M17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-01152,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Uri Zwick},
  title     = {Pairing heaps: the forward variant},
  journal   = {CoRR},
  volume    = {abs/1709.01152},
  year      = {2017},
  url       = {http://arxiv.org/abs/1709.01152},
  archivePrefix = {arXiv},
  eprint    = {1709.01152},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1709-01152.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Kozma16,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  title     = {Binary search trees, rectangles and patterns},
  school    = {Saarland University, Saarbr{\"{u}}cken, Germany},
  year      = {2016},
  url       = {http://scidok.sulb.uni-saarland.de/volltexte/2016/6646/},
  timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/phd/dnb/Kozma16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Bringmann0MN16,
  author    = {Karl Bringmann and
               L{\'{a}}szl{\'{o}} Kozma and
               Shay Moran and
               N. S. Narayanaswamy},
  editor    = {Piotr Sankowski and
               Christos D. Zaroliagis},
  title     = {Hitting Set for Hypergraphs of Low VC-dimension},
  booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
               2016, Aarhus, Denmark},
  series    = {LIPIcs},
  volume    = {57},
  pages     = {23:1--23:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2016.23},
  doi       = {10.4230/LIPIcs.ESA.2016.23},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/esa/Bringmann0MN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChalermsookG0MS16,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  title     = {The landscape of bounds for binary search trees},
  journal   = {CoRR},
  volume    = {abs/1603.04892},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.04892},
  archivePrefix = {arXiv},
  eprint    = {1603.04892},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ChalermsookG0MS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0002S16a,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Thatchaphol Saranurak},
  title     = {Binary search trees and rectangulations},
  journal   = {CoRR},
  volume    = {abs/1603.08151},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.08151},
  archivePrefix = {arXiv},
  eprint    = {1603.08151},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/0002S16a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChalermsookG0MS15,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  editor    = {Nikhil Bansal and
               Irene Finocchi},
  title     = {Self-Adjusting Binary Search Trees: What Makes Them Tick?},
  booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
               Greece, September 14-16, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9294},
  pages     = {300--312},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-48350-3\_26},
  doi       = {10.1007/978-3-662-48350-3\_26},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/ChalermsookG0MS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookG0MS15,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  editor    = {Venkatesan Guruswami},
  title     = {Pattern-Avoiding Access in Binary Search Trees},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {410--423},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {https://doi.org/10.1109/FOCS.2015.32},
  doi       = {10.1109/FOCS.2015.32},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/ChalermsookG0MS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChalermsookG0MS15,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  editor    = {Frank Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Ulrike Stege},
  title     = {Greedy Is an Almost Optimal Deque},
  booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
               2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9214},
  pages     = {152--165},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-21840-3\_13},
  doi       = {10.1007/978-3-319-21840-3\_13},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/wads/ChalermsookG0MS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChalermsookG0MS15,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  title     = {A Global Geometric View of Splaying},
  journal   = {CoRR},
  volume    = {abs/1503.03105},
  year      = {2015},
  url       = {http://arxiv.org/abs/1503.03105},
  archivePrefix = {arXiv},
  eprint    = {1503.03105},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChalermsookG0MS15a,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  title     = {Greedy Is an Almost Optimal Deque},
  journal   = {CoRR},
  volume    = {abs/1506.08319},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.08319},
  archivePrefix = {arXiv},
  eprint    = {1506.08319},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChalermsookG0MS15b,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  title     = {Pattern-avoiding access in binary search trees},
  journal   = {CoRR},
  volume    = {abs/1507.06953},
  year      = {2015},
  url       = {http://arxiv.org/abs/1507.06953},
  archivePrefix = {arXiv},
  eprint    = {1507.06953},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15b.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bringmann0MN15,
  author    = {Karl Bringmann and
               L{\'{a}}szl{\'{o}} Kozma and
               Shay Moran and
               N. S. Narayanaswamy},
  title     = {Hitting Set in hypergraphs of low VC-dimension},
  journal   = {CoRR},
  volume    = {abs/1512.00481},
  year      = {2015},
  url       = {http://arxiv.org/abs/1512.00481},
  archivePrefix = {arXiv},
  eprint    = {1512.00481},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Bringmann0MN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KozmaM15,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Tobias M{\"{o}}mke},
  title     = {A {PTAS} for Euclidean Maximum Scatter {TSP}},
  journal   = {CoRR},
  volume    = {abs/1512.02963},
  year      = {2015},
  url       = {http://arxiv.org/abs/1512.02963},
  archivePrefix = {arXiv},
  eprint    = {1512.02963},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KozmaM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Kozma14,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  title     = {Review of the tower of Hanoi: myths and maths by Andreas M. Hinz,
               Sandi Klav{\v{z}}ar, Uro{\v{z}} Milutinovi{\'{c}} and Ciril Petr},
  journal   = {{SIGACT} News},
  volume    = {45},
  number    = {3},
  pages     = {34--36},
  year      = {2014},
  url       = {https://doi.org/10.1145/2670418.2670430},
  doi       = {10.1145/2670418.2670430},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/sigact/Kozma14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KonradK14,
  author    = {Christian Konrad and
               L{\'{a}}szl{\'{o}} Kozma},
  title     = {Streaming Algorithms for Partitioning Integer Sequences},
  journal   = {CoRR},
  volume    = {abs/1404.1732},
  year      = {2014},
  url       = {http://arxiv.org/abs/1404.1732},
  archivePrefix = {arXiv},
  eprint    = {1404.1732},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KonradK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KozmaM13,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Shay Moran},
  title     = {Shattering, Graph Orientations, and Connectivity},
  journal   = {Electr. J. Comb.},
  volume    = {20},
  number    = {3},
  pages     = {P44},
  year      = {2013},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p44},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorics/KozmaM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AlvarezCK13,
  author    = {Victor Alvarez and
               Erin W. Chambers and
               L{\'{a}}szl{\'{o}} Kozma},
  title     = {Privacy by Fake Data: {A} Geometric Approach},
  booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
               {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
  publisher = {Carleton University, Ottawa, Canada},
  year      = {2013},
  url       = {http://cccg.ca/proceedings/2013/papers/paper\_12.pdf},
  timestamp = {Fri, 23 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/cccg/AlvarezCK13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Kozma12,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  editor    = {Leah Epstein and
               Paolo Ferragina},
  title     = {Minimum Average Distance Triangulations},
  booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
               Slovenia, September 10-12, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7501},
  pages     = {695--706},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-33090-2\_60},
  doi       = {10.1007/978-3-642-33090-2\_60},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/Kozma12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1319,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Shay Moran},
  title     = {Shattering, Graph Orientations, and Connectivity},
  journal   = {CoRR},
  volume    = {abs/1211.1319},
  year      = {2012},
  url       = {http://arxiv.org/abs/1211.1319},
  archivePrefix = {arXiv},
  eprint    = {1211.1319},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1211-1319.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-1828,
  author    = {L{\'{a}}szl{\'{o}} Kozma},
  title     = {Minimum Average Distance Triangulations},
  journal   = {CoRR},
  volume    = {abs/1112.1828},
  year      = {2011},
  url       = {http://arxiv.org/abs/1112.1828},
  archivePrefix = {arXiv},
  eprint    = {1112.1828},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1112-1828.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icmi/KozmaKK09,
  author    = {L{\'{a}}szl{\'{o}} Kozma and
               Arto Klami and
               Samuel Kaski},
  editor    = {James L. Crowley and
               Yuri A. Ivanov and
               Christopher Richard Wren and
               Daniel Gatica{-}Perez and
               Michael Johnston and
               Rainer Stiefelhagen},
  title     = {GaZIR: gaze-based zooming interface for image retrieval},
  booktitle = {Proceedings of the 11th International Conference on Multimodal Interfaces,
               {ICMI} 2009, Cambridge, Massachusetts, USA, November 2-4, 2009},
  pages     = {305--312},
  publisher = {{ACM}},
  year      = {2009},
  url       = {https://doi.org/10.1145/1647314.1647379},
  doi       = {10.1145/1647314.1647379},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/icmi/KozmaKK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics