BibTeX records: Dömötör Pálvölgyi

download as .bib file

@article{DBLP:journals/combinatorica/KeszeghP23,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {The Number of Tangencies Between Two Families of Curves},
  journal      = {Comb.},
  volume       = {43},
  number       = {5},
  pages        = {939--952},
  year         = {2023},
  url          = {https://doi.org/10.1007/s00493-023-00041-8},
  doi          = {10.1007/S00493-023-00041-8},
  timestamp    = {Wed, 01 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KeszeghP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CardinalKMPUV23,
  author       = {Jean Cardinal and
                  Kolja Knauer and
                  Piotr Micek and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Torsten Ueckerdt and
                  Narmada Varadarajan},
  title        = {Colouring bottomless rectangles and arborescences},
  journal      = {Comput. Geom.},
  volume       = {115},
  pages        = {102020},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.comgeo.2023.102020},
  doi          = {10.1016/J.COMGEO.2023.102020},
  timestamp    = {Fri, 21 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/comgeo/CardinalKMPUV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GerbnerKLNPPVW23,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\'{a}}niel Lenger and
                  D{\'{a}}niel T. Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  M{\'{a}}t{\'{e}} Vizer and
                  G{\'{a}}bor Wiener},
  title        = {On graphs that contain exactly \emph{k} copies of a subgraph, and
                  a related problem in search theory},
  journal      = {Discret. Appl. Math.},
  volume       = {341},
  pages        = {196--203},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.dam.2023.08.012},
  doi          = {10.1016/J.DAM.2023.08.012},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GerbnerKLNPPVW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FranklHP23,
  author       = {N{\'{o}}ra Frankl and
                  Tam{\'{a}}s Hubai and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Almost-Monochromatic Sets and the Chromatic Number of the Plane},
  journal      = {Discret. Comput. Geom.},
  volume       = {70},
  number       = {3},
  pages        = {753--772},
  year         = {2023},
  url          = {https://doi.org/10.1007/s00454-023-00526-9},
  doi          = {10.1007/S00454-023-00526-9},
  timestamp    = {Wed, 01 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/FranklHP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GerbnerMNPTV23,
  author       = {D{\'{a}}niel Gerbner and
                  Abhishek Methuku and
                  D{\'{a}}niel T. Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{a}}bor Tardos and
                  M{\'{a}}t{\'{e}} Vizer},
  title        = {Tur{\'{a}}n problems for edge-ordered graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {160},
  pages        = {66--113},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.jctb.2022.12.006},
  doi          = {10.1016/J.JCTB.2022.12.006},
  timestamp    = {Tue, 28 Mar 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jctb/GerbnerMNPTV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-13181,
  author       = {M{\'{a}}rton Benedek and
                  P{\'{e}}ter Bir{\'{o}} and
                  Walter Kern and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Dani{\"{e}}l Paulusma},
  title        = {Partitioned Matching Games for International Kidney Exchange},
  journal      = {CoRR},
  volume       = {abs/2301.13181},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2301.13181},
  doi          = {10.48550/ARXIV.2301.13181},
  eprinttype    = {arXiv},
  eprint       = {2301.13181},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2301-13181.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-04603,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Note on polychromatic coloring of hereditary hypergraph families},
  journal      = {CoRR},
  volume       = {abs/2309.04603},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.04603},
  doi          = {10.48550/ARXIV.2309.04603},
  eprinttype    = {arXiv},
  eprint       = {2309.04603},
  timestamp    = {Wed, 20 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-04603.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-13678,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\'{a}}niel T. Nagy and
                  Kartal Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  G{\'{a}}bor Wiener},
  title        = {Query complexity of Boolean functions on the middle slice of the cube},
  journal      = {CoRR},
  volume       = {abs/2309.13678},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.13678},
  doi          = {10.48550/ARXIV.2309.13678},
  eprinttype    = {arXiv},
  eprint       = {2309.13678},
  timestamp    = {Mon, 16 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-13678.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-15646,
  author       = {Attila Jung and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {k-dimensional transversals for balls},
  journal      = {CoRR},
  volume       = {abs/2311.15646},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2311.15646},
  doi          = {10.48550/ARXIV.2311.15646},
  eprinttype    = {arXiv},
  eprint       = {2311.15646},
  timestamp    = {Wed, 29 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-15646.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DamasdiP22,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Realizing an m-Uniform Four-Chromatic Hypergraph with Disks},
  journal      = {Comb.},
  volume       = {42},
  number       = {6},
  pages        = {1027--1048},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00493-021-4846-5},
  doi          = {10.1007/S00493-021-4846-5},
  timestamp    = {Tue, 07 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/combinatorica/DamasdiP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KellerKP22,
  author       = {Chaya Keller and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs},
  journal      = {Electron. J. Comb.},
  volume       = {29},
  number       = {3},
  year         = {2022},
  url          = {https://doi.org/10.37236/10424},
  doi          = {10.37236/10424},
  timestamp    = {Tue, 02 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/KellerKP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Palvolgyi22,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Radon Numbers Grow Linearly},
  journal      = {Discret. Comput. Geom.},
  volume       = {68},
  number       = {1},
  pages        = {165--171},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00454-021-00331-2},
  doi          = {10.1007/S00454-021-00331-2},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcg/Palvolgyi22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FranklPP22,
  author       = {Peter Frankl and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Exchange Properties of Finite Set-Systems},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {36},
  number       = {3},
  pages        = {2073--2081},
  year         = {2022},
  url          = {https://doi.org/10.1137/21m145149x},
  doi          = {10.1137/21M145149X},
  timestamp    = {Sat, 11 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/FranklPP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FearnleyPS22,
  author       = {John Fearnley and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Rahul Savani},
  title        = {A Faster Algorithm for Finding Tarski Fixed Points},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {18},
  number       = {3},
  pages        = {23:1--23:23},
  year         = {2022},
  url          = {https://doi.org/10.1145/3524044},
  doi          = {10.1145/3524044},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/FearnleyPS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DamasdiP22,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {Three-Chromatic Geometric Hypergraphs},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {32:1--32:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.32},
  doi          = {10.4230/LIPICS.SOCG.2022.32},
  timestamp    = {Wed, 01 Jun 2022 16:45:26 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/DamasdiP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AckermanKP21,
  author       = {Eyal Ackerman and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Coloring Delaunay-edges and their generalizations},
  journal      = {Comput. Geom.},
  volume       = {96},
  pages        = {101745},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.comgeo.2021.101745},
  doi          = {10.1016/J.COMGEO.2021.101745},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/comgeo/AckermanKP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BekosGMPST21,
  author       = {Michael A. Bekos and
                  Martin Gronemann and
                  Fabrizio Montecchiani and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Antonios Symvonis and
                  Leonidas Theocharous},
  title        = {Grid drawings of graphs with constant edge-vertex resolution},
  journal      = {Comput. Geom.},
  volume       = {98},
  pages        = {101789},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.comgeo.2021.101789},
  doi          = {10.1016/J.COMGEO.2021.101789},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/comgeo/BekosGMPST21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DamasdiGKKLMNPP21,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\'{a}}niel Gerbner and
                  Gyula O. H. Katona and
                  Bal{\'{a}}zs Keszegh and
                  D{\'{a}}niel Lenger and
                  Abhishek Methuku and
                  D{\'{a}}niel T. Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  M{\'{a}}t{\'{e}} Vizer and
                  G{\'{a}}bor Wiener},
  title        = {Adaptive majority problems for restricted query graphs and for weighted
                  sets},
  journal      = {Discret. Appl. Math.},
  volume       = {288},
  pages        = {235--245},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2020.09.003},
  doi          = {10.1016/J.DAM.2020.09.003},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/DamasdiGKKLMNPP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Palvolgyi21,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Exponential Lower Bound for Berge-Ramsey Problems},
  journal      = {Graphs Comb.},
  volume       = {37},
  number       = {4},
  pages        = {1433--1435},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00373-021-02328-3},
  doi          = {10.1007/S00373-021-02328-3},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/Palvolgyi21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/KeszeghLMPP21,
  author       = {Bal{\'{a}}zs Keszegh and
                  Nathan Lemons and
                  Ryan R. Martin and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s},
  title        = {Induced and non-induced poset saturation problems},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {184},
  pages        = {105497},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.jcta.2021.105497},
  doi          = {10.1016/J.JCTA.2021.105497},
  timestamp    = {Sat, 11 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcta/KeszeghLMPP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/GanorSP21,
  author       = {Anat Ganor and
                  {Karthik {C. S.}} and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {On Communication Complexity of Fixed Point Computation},
  journal      = {{ACM} Trans. Economics and Comput.},
  volume       = {9},
  number       = {4},
  pages        = {25:1--25:27},
  year         = {2021},
  url          = {https://doi.org/10.1145/3485004},
  doi          = {10.1145/3485004},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/teco/GanorSP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PalmerP21,
  author       = {Cory Palmer and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {At most 3.55\({}^{\mbox{n}}\) stable matchings},
  booktitle    = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2021, Denver, CO, USA, February 7-10, 2022},
  pages        = {217--227},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/FOCS52979.2021.00029},
  doi          = {10.1109/FOCS52979.2021.00029},
  timestamp    = {Wed, 09 Mar 2022 12:12:23 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PalmerP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-08787,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {The number of tangencies between two families of curves},
  journal      = {CoRR},
  volume       = {abs/2111.08787},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.08787},
  eprinttype    = {arXiv},
  eprint       = {2111.08787},
  timestamp    = {Mon, 22 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-08787.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-01820,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Three-chromatic geometric hypergraphs},
  journal      = {CoRR},
  volume       = {abs/2112.01820},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.01820},
  eprinttype    = {arXiv},
  eprint       = {2112.01820},
  timestamp    = {Wed, 08 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-01820.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PalvolgyiT20,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{a}}bor Tardos},
  title        = {Unlabeled compression schemes exceeding the VC-dimension},
  journal      = {Discret. Appl. Math.},
  volume       = {276},
  pages        = {102--107},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.dam.2019.09.022},
  doi          = {10.1016/J.DAM.2019.09.022},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/PalvolgyiT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GyarfasPPW20,
  author       = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  Matthew Wales},
  title        = {Distribution of colors in Gallai colorings},
  journal      = {Eur. J. Comb.},
  volume       = {86},
  pages        = {103087},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.ejc.2020.103087},
  doi          = {10.1016/J.EJC.2020.103087},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/GyarfasPPW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KeszeghP20,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks},
  journal      = {J. Comput. Geom.},
  volume       = {11},
  number       = {1},
  pages        = {354--370},
  year         = {2020},
  url          = {https://doi.org/10.20382/jocg.v11i1a13},
  doi          = {10.20382/JOCG.V11I1A13},
  timestamp    = {Mon, 09 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jocg/KeszeghP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kybernetika/Palvolgyi20,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {The range of non-linear natural polynomials cannot be context-free},
  journal      = {Kybernetika},
  volume       = {56},
  number       = {4},
  pages        = {722--726},
  year         = {2020},
  url          = {https://doi.org/10.14736/kyb-2020-4-0722},
  doi          = {10.14736/KYB-2020-4-0722},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/kybernetika/Palvolgyi20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AckermanKP20,
  author       = {Eyal Ackerman and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free
                  Hypergraphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {34},
  number       = {4},
  pages        = {2250--2269},
  year         = {2020},
  url          = {https://doi.org/10.1137/19M1290231},
  doi          = {10.1137/19M1290231},
  timestamp    = {Sat, 09 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/AckermanKP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DamasdiP20,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {J. Mark Keil and
                  Debajyoti Mondal},
  title        = {Realizing m-uniform four-chromatic hypergraphs with disks},
  booktitle    = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
                  {CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
                  Saskatchewan, Canada},
  pages        = {258--265},
  year         = {2020},
  timestamp    = {Mon, 03 May 2021 21:50:39 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/DamasdiP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FranklHP20,
  author       = {N{\'{o}}ra Frankl and
                  Tam{\'{a}}s Hubai and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Sergio Cabello and
                  Danny Z. Chen},
  title        = {Almost-Monochromatic Sets and the Chromatic Number of the Plane},
  booktitle    = {36th International Symposium on Computational Geometry, SoCG 2020,
                  June 23-26, 2020, Z{\"{u}}rich, Switzerland},
  series       = {LIPIcs},
  volume       = {164},
  pages        = {47:1--47:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2020.47},
  doi          = {10.4230/LIPICS.SOCG.2020.47},
  timestamp    = {Wed, 16 Jun 2021 12:02:54 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/FranklHP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Palvolgyi20,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Sergio Cabello and
                  Danny Z. Chen},
  title        = {Radon Numbers Grow Linearly},
  booktitle    = {36th International Symposium on Computational Geometry, SoCG 2020,
                  June 23-26, 2020, Z{\"{u}}rich, Switzerland},
  series       = {LIPIcs},
  volume       = {164},
  pages        = {60:1--60:5},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2020.60},
  doi          = {10.4230/LIPICS.SOCG.2020.60},
  timestamp    = {Wed, 16 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/Palvolgyi20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-06285,
  author       = {P{\'{e}}ter {\'{A}}goston and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {An improved constant factor for the unit distance problem},
  journal      = {CoRR},
  volume       = {abs/2006.06285},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.06285},
  eprinttype    = {arXiv},
  eprint       = {2006.06285},
  timestamp    = {Fri, 12 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-06285.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-00915,
  author       = {Cory Palmer and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {At most 4.47\({}^{\mbox{n}}\) stable matchings},
  journal      = {CoRR},
  volume       = {abs/2011.00915},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.00915},
  eprinttype    = {arXiv},
  eprint       = {2011.00915},
  timestamp    = {Mon, 09 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-00915.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-12187,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Realizing an m-uniform four-chromatic hypergraph with disks},
  journal      = {CoRR},
  volume       = {abs/2011.12187},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.12187},
  eprinttype    = {arXiv},
  eprint       = {2011.12187},
  timestamp    = {Thu, 26 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-12187.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KeszeghP19,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Proper Coloring of Geometric Hypergraphs},
  journal      = {Discret. Comput. Geom.},
  volume       = {62},
  number       = {3},
  pages        = {674--689},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00454-019-00096-9},
  doi          = {10.1007/S00454-019-00096-9},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/KeszeghP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GunbyP19,
  author       = {Benjamin Gunby and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple
                  settings},
  journal      = {Eur. J. Comb.},
  volume       = {82},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ejc.2019.07.003},
  doi          = {10.1016/J.EJC.2019.07.003},
  timestamp    = {Tue, 26 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/GunbyP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KeszeghP19,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {An abstract approach to polychromatic coloring: shallow hitting sets
                  in ABA-free hypergraphs and pseudohalfplanes},
  journal      = {J. Comput. Geom.},
  volume       = {10},
  number       = {1},
  pages        = {1--26},
  year         = {2019},
  url          = {https://doi.org/10.20382/jocg.v10i1a1},
  doi          = {10.20382/JOCG.V10I1A1},
  timestamp    = {Thu, 10 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jocg/KeszeghP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BiroKPP19,
  author       = {P{\'{e}}ter Bir{\'{o}} and
                  Walter Kern and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Dani{\"{e}}l Paulusma},
  editor       = {Edith Elkind and
                  Manuela Veloso and
                  Noa Agmon and
                  Matthew E. Taylor},
  title        = {Generalized Matching Games for International Kidney Exchange},
  booktitle    = {Proceedings of the 18th International Conference on Autonomous Agents
                  and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
                  2019},
  pages        = {413--421},
  publisher    = {International Foundation for Autonomous Agents and Multiagent Systems},
  year         = {2019},
  url          = {http://dl.acm.org/citation.cfm?id=3331721},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/atal/BiroKPP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03913,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {The range of non-linear natural polynomials cannot be context-free},
  journal      = {CoRR},
  volume       = {abs/1901.03913},
  year         = {2019},
  url          = {http://arxiv.org/abs/1901.03913},
  eprinttype    = {arXiv},
  eprint       = {1901.03913},
  timestamp    = {Fri, 01 Feb 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1901-03913.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08383,
  author       = {G{\'{a}}bor Dam{\'{a}}sdi and
                  D{\'{a}}niel Gerbner and
                  Gyula O. H. Katona and
                  Bal{\'{a}}zs Keszegh and
                  D{\'{a}}niel Lenger and
                  Abhishek Methuku and
                  D{\'{a}}niel T. Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  M{\'{a}}t{\'{e}} Vizer and
                  G{\'{a}}bor Wiener},
  title        = {Adaptive Majority Problems for Restricted Query Graphs and for Weighted
                  Sets},
  journal      = {CoRR},
  volume       = {abs/1903.08383},
  year         = {2019},
  url          = {http://arxiv.org/abs/1903.08383},
  eprinttype    = {arXiv},
  eprint       = {1903.08383},
  timestamp    = {Tue, 02 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-08383.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-10958,
  author       = {Anat Ganor and
                  {Karthik {C. S.}} and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {On Communication Complexity of Fixed Point Computation},
  journal      = {CoRR},
  volume       = {abs/1909.10958},
  year         = {2019},
  url          = {http://arxiv.org/abs/1909.10958},
  eprinttype    = {arXiv},
  eprint       = {1909.10958},
  timestamp    = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1909-10958.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-02604,
  author       = {N{\'{o}}ra Frankl and
                  Tam{\'{a}}s Hubai and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Almost-monochromatic sets and the chromatic number of the plane},
  journal      = {CoRR},
  volume       = {abs/1912.02604},
  year         = {2019},
  url          = {http://arxiv.org/abs/1912.02604},
  eprinttype    = {arXiv},
  eprint       = {1912.02604},
  timestamp    = {Tue, 07 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1912-02604.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/Palvolgyi18,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Weak embeddings of posets to the Boolean lattice},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {20},
  number       = {1},
  year         = {2018},
  url          = {https://doi.org/10.23638/DMTCS-20-1-7},
  doi          = {10.23638/DMTCS-20-1-7},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/Palvolgyi18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igtr/Palvolgyi18,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {All or Nothing Caching Games with Bounded Queries},
  journal      = {{IGTR}},
  volume       = {20},
  number       = {1},
  pages        = {1750023:1--1750023:9},
  year         = {2018},
  url          = {https://doi.org/10.1142/S0219198917500232},
  doi          = {10.1142/S0219198917500232},
  timestamp    = {Wed, 24 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/igtr/Palvolgyi18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03426,
  author       = {Zolt{\'{a}}n Kir{\'{a}}ly and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Acyclic orientations with degree constraints},
  journal      = {CoRR},
  volume       = {abs/1806.03426},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.03426},
  eprinttype    = {arXiv},
  eprint       = {1806.03426},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-03426.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03931,
  author       = {Eyal Ackerman and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Coloring Delaunay-Edges and their Generalizations},
  journal      = {CoRR},
  volume       = {abs/1806.03931},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.03931},
  eprinttype    = {arXiv},
  eprint       = {1806.03931},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-03931.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04217,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Plane drawings of the generalized Delaunay-graphs for pseudo-disks},
  journal      = {CoRR},
  volume       = {abs/1806.04217},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.04217},
  eprinttype    = {arXiv},
  eprint       = {1806.04217},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-04217.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12471,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{a}}bor Tardos},
  title        = {Unlabeled Compression Schemes Exceeding the VC-dimension},
  journal      = {CoRR},
  volume       = {abs/1811.12471},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.12471},
  eprinttype    = {arXiv},
  eprint       = {1811.12471},
  timestamp    = {Mon, 03 Dec 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-12471.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/GerbnerKPRW17,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\"{u}}nter Rote and
                  G{\'{a}}bor Wiener},
  title        = {Search for the end of a path in the d-dimensional grid and in other
                  graphs},
  journal      = {Ars Math. Contemp.},
  volume       = {12},
  number       = {2},
  pages        = {301--314},
  year         = {2017},
  url          = {https://doi.org/10.26493/1855-3974.788.89a},
  doi          = {10.26493/1855-3974.788.89A},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arsmc/GerbnerKPRW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosPTT17,
  author       = {P{\'{e}}ter L. Erd{\"{o}}s and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Claude Tardif and
                  G{\'{a}}bor Tardos},
  title        = {Regular families of forests, antichains and duality pairs of relational
                  structures},
  journal      = {Comb.},
  volume       = {37},
  number       = {4},
  pages        = {651--672},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00493-015-3003-4},
  doi          = {10.1007/S00493-015-3003-4},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/ErdosPTT17.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/cpc/MethukuP17,
  author       = {Abhishek Methuku and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Forbidden Hypermatrices Imply General Bounds on Induced Forbidden
                  Subposet Problems},
  journal      = {Comb. Probab. Comput.},
  volume       = {26},
  number       = {4},
  pages        = {593--602},
  year         = {2017},
  url          = {https://doi.org/10.1017/S0963548317000013},
  doi          = {10.1017/S0963548317000013},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/MethukuP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GerbnerKPPVW17,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  M{\'{a}}t{\'{e}} Vizer and
                  G{\'{a}}bor Wiener},
  title        = {Finding a non-minority ball with majority answers},
  journal      = {Discret. Appl. Math.},
  volume       = {219},
  pages        = {18--31},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.11.012},
  doi          = {10.1016/J.DAM.2016.11.012},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GerbnerKPPVW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KeszeghP17,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Boris Aronov and
                  Matthew J. Katz},
  title        = {Proper Coloring of Geometric Hypergraphs},
  booktitle    = {33rd International Symposium on Computational Geometry, SoCG 2017,
                  July 4-7, 2017, Brisbane, Australia},
  series       = {LIPIcs},
  volume       = {77},
  pages        = {47:1--47:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2017.47},
  doi          = {10.4230/LIPICS.SOCG.2017.47},
  timestamp    = {Wed, 16 Jun 2021 12:03:17 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/KeszeghP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Palvolgyi17,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {All or Nothing Caching Games with Bounded Queries},
  journal      = {CoRR},
  volume       = {abs/1702.00635},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.00635},
  eprinttype    = {arXiv},
  eprint       = {1702.00635},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Palvolgyi17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-00596,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Complexity of Domination in Triangulated Plane Graphs},
  journal      = {CoRR},
  volume       = {abs/1709.00596},
  year         = {2017},
  url          = {http://arxiv.org/abs/1709.00596},
  eprinttype    = {arXiv},
  eprint       = {1709.00596},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1709-00596.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerbnerKPP16,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  Cory Palmer and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Topological orderings of weighted directed acyclic graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {116},
  number       = {9},
  pages        = {564--568},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.ipl.2016.04.007},
  doi          = {10.1016/J.IPL.2016.04.007},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GerbnerKPP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/KeszeghLP16,
  author       = {Bal{\'{a}}zs Keszegh and
                  Nathan Lemons and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Online and Quasi-online Colorings of Wedges and Intervals},
  journal      = {Order},
  volume       = {33},
  number       = {3},
  pages        = {389--409},
  year         = {2016},
  url          = {https://doi.org/10.1007/s11083-015-9374-8},
  doi          = {10.1007/S11083-015-9374-8},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/order/KeszeghLP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseKLPV16,
  author       = {Ferdinando Cicalese and
                  Bal{\'{a}}zs Keszegh and
                  Bernard Lidick{\'{y}} and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Tom{\'{a}}s Valla},
  title        = {On the tree search problem with non-uniform costs},
  journal      = {Theor. Comput. Sci.},
  volume       = {647},
  pages        = {22--32},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.07.019},
  doi          = {10.1016/J.TCS.2016.07.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CicaleseKLPV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Palvolgyi16,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Weak embeddings of posets to the Boolean lattice},
  journal      = {CoRR},
  volume       = {abs/1606.08226},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.08226},
  eprinttype    = {arXiv},
  eprint       = {1606.08226},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Palvolgyi16.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/corr/KeszeghP16,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Proper Coloring of Geometric Hypergraphs},
  journal      = {CoRR},
  volume       = {abs/1612.02158},
  year         = {2016},
  url          = {http://arxiv.org/abs/1612.02158},
  eprinttype    = {arXiv},
  eprint       = {1612.02158},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KeszeghP16.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/endm/VizerGKPPW15,
  author       = {M{\'{a}}t{\'{e}} Vizer and
                  D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  G{\'{a}}bor Wiener},
  title        = {Finding a majority ball with majority answers},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {49},
  pages        = {345--351},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.endm.2015.06.047},
  doi          = {10.1016/J.ENDM.2015.06.047},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/VizerGKPPW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KeszeghP15,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {More on decomposing coverings by octants},
  journal      = {J. Comput. Geom.},
  volume       = {6},
  number       = {1},
  pages        = {300--315},
  year         = {2015},
  url          = {https://doi.org/10.20382/jocg.v6i1a13},
  doi          = {10.20382/JOCG.V6I1A13},
  timestamp    = {Thu, 10 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jocg/KeszeghP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CicaleseKLPV15,
  author       = {Ferdinando Cicalese and
                  Bal{\'{a}}zs Keszegh and
                  Bernard Lidick{\'{y}} and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Tom{\'{a}}s Valla},
  editor       = {Ernst W. Mayr},
  title        = {On the Tree Search Problem with Non-uniform Costs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {90--102},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_7},
  doi          = {10.1007/978-3-662-53174-7\_7},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/CicaleseKLPV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KeszeghP15,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Ernst W. Mayr},
  title        = {An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets
                  in ABA-free Hypergraphs and Pseudohalfplanes},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {266--280},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_19},
  doi          = {10.1007/978-3-662-53174-7\_19},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/KeszeghP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PachP15,
  author       = {J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Ernst W. Mayr},
  title        = {Unsplittable Coverings in the Plane},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {281--296},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_20},
  doi          = {10.1007/978-3-662-53174-7\_20},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/PachP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KeszeghP15,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {More on Decomposing Coverings by Octants},
  journal      = {CoRR},
  volume       = {abs/1503.01669},
  year         = {2015},
  url          = {http://arxiv.org/abs/1503.01669},
  eprinttype    = {arXiv},
  eprint       = {1503.01669},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KeszeghP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KeszeghP14,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Octants are cover-decomposable into many coverings},
  journal      = {Comput. Geom.},
  volume       = {47},
  number       = {5},
  pages        = {585--588},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.comgeo.2013.12.001},
  doi          = {10.1016/J.COMGEO.2013.12.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/KeszeghP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KeszeghP14,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Convex Polygons are Self-Coverable},
  journal      = {Discret. Comput. Geom.},
  volume       = {51},
  number       = {4},
  pages        = {885--895},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00454-014-9582-9},
  doi          = {10.1007/S00454-014-9582-9},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/KeszeghP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PalvolgyiG14,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s},
  title        = {Domination in transitive colorings of tournaments},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {107},
  pages        = {1--11},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jctb.2014.02.001},
  doi          = {10.1016/J.JCTB.2014.02.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/PalvolgyiG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GerbnerMPPR14,
  author       = {D{\'{a}}niel Gerbner and
                  Viola M{\'{e}}sz{\'{a}}ros and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Alexey Pokrovskiy and
                  G{\"{u}}nter Rote},
  title        = {Advantage in the discrete Voronoi game},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {18},
  number       = {3},
  pages        = {439--457},
  year         = {2014},
  url          = {https://doi.org/10.7155/jgaa.00331},
  doi          = {10.7155/JGAA.00331},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/GerbnerMPPR14.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/CicaleseKLPV14,
  author       = {Ferdinando Cicalese and
                  Bal{\'{a}}zs Keszegh and
                  Bernard Lidick{\'{y}} and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Tom{\'{a}}s Valla},
  title        = {On the Tree Search Problem with Non-uniform Costs},
  journal      = {CoRR},
  volume       = {abs/1404.4504},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.4504},
  eprinttype    = {arXiv},
  eprint       = {1404.4504},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CicaleseKLPV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GerbnerKPP13,
  author       = {D{\'{a}}niel Gerbner and
                  Gyula O. H. Katona and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s},
  title        = {Majority and plurality problems},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {6},
  pages        = {813--818},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2012.10.023},
  doi          = {10.1016/J.DAM.2012.10.023},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GerbnerKPP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GerbnerLPPPS13,
  author       = {D{\'{a}}niel Gerbner and
                  Nathan Lemons and
                  Cory Palmer and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  Vajk Sz{\'{e}}csi},
  title        = {Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families
                  of Sets},
  journal      = {Graphs Comb.},
  volume       = {29},
  number       = {3},
  pages        = {489--498},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00373-012-1138-2},
  doi          = {10.1007/S00373-012-1138-2},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/GerbnerLPPPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GerbnerKLPPP13,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  Nathan Lemons and
                  Cory Palmer and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s},
  title        = {Saturating Sperner Families},
  journal      = {Graphs Comb.},
  volume       = {29},
  number       = {5},
  pages        = {1355--1364},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00373-012-1195-6},
  doi          = {10.1007/S00373-012-1195-6},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/GerbnerKLPPP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EisenbrandHPS13,
  author       = {Friedrich Eisenbrand and
                  Nicolai H{\"{a}}hnle and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Gennady Shmonin},
  title        = {Testing additive integrality gaps},
  journal      = {Math. Program.},
  volume       = {141},
  number       = {1-2},
  pages        = {257--271},
  year         = {2013},
  url          = {https://doi.org/10.1007/s10107-012-0518-y},
  doi          = {10.1007/S10107-012-0518-Y},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/EisenbrandHPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KeszeghPP13,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Drawing Planar Graphs of Bounded Degree with Few Slopes},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {27},
  number       = {2},
  pages        = {1171--1183},
  year         = {2013},
  url          = {https://doi.org/10.1137/100815001},
  doi          = {10.1137/100815001},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KeszeghPP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CheilarisKP13,
  author       = {Panagiotis Cheilaris and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree
                  Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {27},
  number       = {4},
  pages        = {1775--1787},
  year         = {2013},
  url          = {https://doi.org/10.1137/120880471},
  doi          = {10.1137/120880471},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CheilarisKP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EisenbrandPR13,
  author       = {Friedrich Eisenbrand and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Thomas Rothvo{\ss}},
  title        = {Bin Packing via Discrepancy of Permutations},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {9},
  number       = {3},
  pages        = {24:1--24:15},
  year         = {2013},
  url          = {https://doi.org/10.1145/2483699.2483704},
  doi          = {10.1145/2483699.2483704},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/EisenbrandPR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/GerbnerKPW13,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{a}}bor Wiener},
  editor       = {Harout K. Aydinian and
                  Ferdinando Cicalese and
                  Christian Deppe},
  title        = {Density-Based Group Testing},
  booktitle    = {Information Theory, Combinatorics, and Search Theory - In Memory of
                  Rudolf Ahlswede},
  series       = {Lecture Notes in Computer Science},
  volume       = {7777},
  pages        = {543--556},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-36899-8\_27},
  doi          = {10.1007/978-3-642-36899-8\_27},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/GerbnerKPW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KeszeghLP13,
  author       = {Bal{\'{a}}zs Keszegh and
                  Nathan Lemons and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Peter van Emde Boas and
                  Frans C. A. Groen and
                  Giuseppe F. Italiano and
                  Jerzy R. Nawrocki and
                  Harald Sack},
  title        = {Online and Quasi-online Colorings of Wedges and Intervals},
  booktitle    = {{SOFSEM} 2013: Theory and Practice of Computer Science, 39th International
                  Conference on Current Trends in Theory and Practice of Computer Science,
                  {\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 26-31,
                  2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7741},
  pages        = {292--306},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-35843-2\_26},
  doi          = {10.1007/978-3-642-35843-2\_26},
  timestamp    = {Mon, 28 Aug 2023 21:17:48 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/KeszeghLP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-4677,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s},
  title        = {Domination in transitive colorings of tournaments},
  journal      = {CoRR},
  volume       = {abs/1302.4677},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.4677},
  eprinttype    = {arXiv},
  eprint       = {1302.4677},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-4677.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-0523,
  author       = {D{\'{a}}niel Gerbner and
                  Viola M{\'{e}}sz{\'{a}}ros and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Alexey Pokrovskiy and
                  G{\"{u}}nter Rote},
  title        = {Advantage in the discrete Voronoi game},
  journal      = {CoRR},
  volume       = {abs/1303.0523},
  year         = {2013},
  url          = {http://arxiv.org/abs/1303.0523},
  eprinttype    = {arXiv},
  eprint       = {1303.0523},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1303-0523.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/KeszeghP13,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Convex Polygons are Self-Coverable},
  journal      = {CoRR},
  volume       = {abs/1307.2411},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.2411},
  eprinttype    = {arXiv},
  eprint       = {1307.2411},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KeszeghP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Palvolgyi13,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Indecomposable coverings with unit discs},
  journal      = {CoRR},
  volume       = {abs/1310.6900},
  year         = {2013},
  url          = {http://arxiv.org/abs/1310.6900},
  eprinttype    = {arXiv},
  eprint       = {1310.6900},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Palvolgyi13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/GyarfasP12,
  author       = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Monochromatic even cycles},
  journal      = {Contributions Discret. Math.},
  volume       = {7},
  number       = {1},
  year         = {2012},
  url          = {http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/305},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cdm/GyarfasP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/MukkamalaPP12,
  author       = {Padmini Mukkamala and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Lower Bounds on the Obstacle Number of Graphs},
  journal      = {Electron. J. Comb.},
  volume       = {19},
  number       = {2},
  pages        = {32},
  year         = {2012},
  url          = {https://doi.org/10.37236/2380},
  doi          = {10.37236/2380},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/MukkamalaPP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KeszeghP12,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Octants Are Cover-Decomposable},
  journal      = {Discret. Comput. Geom.},
  volume       = {47},
  number       = {3},
  pages        = {598--609},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00454-011-9377-1},
  doi          = {10.1007/S00454-011-9377-1},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/KeszeghP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ChristPS12,
  author       = {Tobias Christ and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Milos Stojakovic},
  title        = {Consistent Digital Line Segments},
  journal      = {Discret. Comput. Geom.},
  volume       = {47},
  number       = {4},
  pages        = {691--710},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00454-012-9411-y},
  doi          = {10.1007/S00454-012-9411-Y},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/ChristPS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/KiralyNPV12,
  author       = {Zolt{\'{a}}n Kir{\'{a}}ly and
                  Zolt{\'{a}}n L{\'{o}}r{\'{a}}nt Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Mirk{\'{o}} Visontai},
  title        = {On Families of Weakly Cross-intersecting Set-pairs},
  journal      = {Fundam. Informaticae},
  volume       = {117},
  number       = {1-4},
  pages        = {189--198},
  year         = {2012},
  url          = {https://doi.org/10.3233/FI-2012-695},
  doi          = {10.3233/FI-2012-695},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/KiralyNPV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BuchinMMP12,
  author       = {Kevin Buchin and
                  Jir{\'{\i}} Matousek and
                  Robin A. Moser and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Vectors in a box},
  journal      = {Math. Program.},
  volume       = {135},
  number       = {1-2},
  pages        = {323--335},
  year         = {2012},
  url          = {https://doi.org/10.1007/s10107-011-0474-y},
  doi          = {10.1007/S10107-011-0474-Y},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/BuchinMMP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/CheilarisKP12,
  author       = {Panagiotis Cheilaris and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {M{\'{a}}ria Bielikov{\'{a}} and
                  Gerhard Friedrich and
                  Georg Gottlob and
                  Stefan Katzenbeisser and
                  Gy{\"{o}}rgy Tur{\'{a}}n},
  title        = {Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree
                  Graphs},
  booktitle    = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
                  on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
                  Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7147},
  pages        = {190--201},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-27660-6\_16},
  doi          = {10.1007/978-3-642-27660-6\_16},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sofsem/CheilarisKP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-1398,
  author       = {D{\'{a}}niel Gerbner and
                  Gyula O. H. Katona and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s},
  title        = {Majority and Plurality Problems},
  journal      = {CoRR},
  volume       = {abs/1203.1398},
  year         = {2012},
  url          = {http://arxiv.org/abs/1203.1398},
  eprinttype    = {arXiv},
  eprint       = {1203.1398},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1203-1398.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-1464,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{a}}bor Wiener},
  title        = {Density-based group testing},
  journal      = {CoRR},
  volume       = {abs/1204.1464},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.1464},
  eprinttype    = {arXiv},
  eprint       = {1204.1464},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-1464.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0672,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Octants are Cover-Decomposable into Many Coverings},
  journal      = {CoRR},
  volume       = {abs/1207.0672},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.0672},
  eprinttype    = {arXiv},
  eprint       = {1207.0672},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-0672.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4402,
  author       = {P{\'{e}}ter L. Erd{\"{o}}s and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Claude Tardif and
                  G{\'{a}}bor Tardos},
  title        = {On infinite-finite tree-duality pairs of relational structures},
  journal      = {CoRR},
  volume       = {abs/1207.4402},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.4402},
  eprinttype    = {arXiv},
  eprint       = {1207.4402},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-4402.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4415,
  author       = {Bal{\'{a}}zs Keszegh and
                  Nathan Lemons and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Online and quasi-online colorings of wedges and intervals},
  journal      = {CoRR},
  volume       = {abs/1207.4415},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.4415},
  eprinttype    = {arXiv},
  eprint       = {1207.4415},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-4415.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-3000,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{a}}bor Wiener},
  title        = {Search for the end of a path in the d-dimensional grid and in other
                  graphs},
  journal      = {CoRR},
  volume       = {abs/1211.3000},
  year         = {2012},
  url          = {http://arxiv.org/abs/1211.3000},
  eprinttype    = {arXiv},
  eprint       = {1211.3000},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1211-3000.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChristPS11,
  author       = {Tobias Christ and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Milos Stojakovic},
  title        = {Digitalizing line segments},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {38},
  pages        = {273--278},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.endm.2011.09.045},
  doi          = {10.1016/J.ENDM.2011.09.045},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/ChristPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KeszeghP11,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Octants are Cover Decomposable},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {38},
  pages        = {499--504},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.endm.2011.09.081},
  doi          = {10.1016/J.ENDM.2011.09.081},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/KeszeghP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/MukkamalaP11,
  author       = {Padmini Mukkamala and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Marc J. van Kreveld and
                  Bettina Speckmann},
  title        = {Drawing Cubic Graphs with the Four Basic Slopes},
  booktitle    = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
                  The Netherlands, September 21-23, 2011, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7034},
  pages        = {254--265},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25878-7\_25},
  doi          = {10.1007/978-3-642-25878-7\_25},
  timestamp    = {Sun, 13 Nov 2022 09:57:29 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/MukkamalaP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandPR11,
  author       = {Friedrich Eisenbrand and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Thomas Rothvo{\ss}},
  editor       = {Dana Randall},
  title        = {Bin Packing via Discrepancy of Permutations},
  booktitle    = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
                  2011},
  pages        = {476--481},
  publisher    = {{SIAM}},
  year         = {2011},
  url          = {https://doi.org/10.1137/1.9781611973082.38},
  doi          = {10.1137/1.9781611973082.38},
  timestamp    = {Tue, 02 Feb 2021 17:07:23 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EisenbrandPR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-3773,
  author       = {Bal{\'{a}}zs Keszegh and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Octants are Cover Decomposable},
  journal      = {CoRR},
  volume       = {abs/1101.3773},
  year         = {2011},
  url          = {http://arxiv.org/abs/1101.3773},
  eprinttype    = {arXiv},
  eprint       = {1101.3773},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1101-3773.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2724,
  author       = {Padmini Mukkamala and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Lower bounds on the obstacle number of graphs},
  journal      = {CoRR},
  volume       = {abs/1103.2724},
  year         = {2011},
  url          = {http://arxiv.org/abs/1103.2724},
  eprinttype    = {arXiv},
  eprint       = {1103.2724},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-2724.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-1973,
  author       = {Padmini Mukkamala and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Drawing cubic graphs with the four basic slopes},
  journal      = {CoRR},
  volume       = {abs/1106.1973},
  year         = {2011},
  url          = {http://arxiv.org/abs/1106.1973},
  eprinttype    = {arXiv},
  eprint       = {1106.1973},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1106-1973.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-3288,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Lower bounds for finding the maximum and minimum elements with k lies},
  journal      = {CoRR},
  volume       = {abs/1111.3288},
  year         = {2011},
  url          = {http://arxiv.org/abs/1111.3288},
  eprinttype    = {arXiv},
  eprint       = {1111.3288},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1111-3288.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/MukkamalaP10,
  author       = {Padmini Mukkamala and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous
                  Directions},
  journal      = {Electron. J. Comb.},
  volume       = {17},
  number       = {1},
  year         = {2010},
  url          = {https://doi.org/10.37236/482},
  doi          = {10.37236/482},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/MukkamalaP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GerbnerPPW10,
  author       = {D{\'{a}}niel Gerbner and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  G{\'{a}}bor Wiener},
  title        = {Finding the maximum and minimum elements with one lie},
  journal      = {Discret. Appl. Math.},
  volume       = {158},
  number       = {9},
  pages        = {988--995},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.dam.2010.01.010},
  doi          = {10.1016/J.DAM.2010.01.010},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GerbnerPPW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/PalvolgyiT10,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{e}}za T{\'{o}}th},
  title        = {Convex Polygons are Cover-Decomposable},
  journal      = {Discret. Comput. Geom.},
  volume       = {43},
  number       = {3},
  pages        = {483--496},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00454-009-9133-y},
  doi          = {10.1007/S00454-009-9133-Y},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/PalvolgyiT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Palvolgyi10,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Indecomposable Coverings with Concave Polygons},
  journal      = {Discret. Comput. Geom.},
  volume       = {44},
  number       = {3},
  pages        = {577--588},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00454-009-9194-y},
  doi          = {10.1007/S00454-009-9194-Y},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/Palvolgyi10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GerbnerKLPPP10,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  Nathan Lemons and
                  Cory Palmer and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Bal{\'{a}}zs Patk{\'{o}}s},
  title        = {Polychromatic colorings of arbitrary rectangular partitions},
  journal      = {Discret. Math.},
  volume       = {310},
  number       = {1},
  pages        = {21--30},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disc.2009.07.019},
  doi          = {10.1016/J.DISC.2009.07.019},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/GerbnerKLPPP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ffa/GacsHNP10,
  author       = {Andr{\'{a}}s G{\'{a}}cs and
                  Tam{\'{a}}s H{\'{e}}ger and
                  Zolt{\'{a}}n L{\'{o}}r{\'{a}}nt Nagy and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Permutations, hyperplanes and polynomials over finite fields},
  journal      = {Finite Fields Their Appl.},
  volume       = {16},
  number       = {5},
  pages        = {301--314},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ffa.2010.05.003},
  doi          = {10.1016/J.FFA.2010.05.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ffa/GacsHNP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KeszeghPPT10,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{e}}za T{\'{o}}th},
  title        = {Cubic graphs have bounded slope parameter},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {14},
  number       = {1},
  pages        = {5--17},
  year         = {2010},
  url          = {https://doi.org/10.7155/jgaa.00196},
  doi          = {10.7155/JGAA.00196},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/KeszeghPPT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChristPS10,
  author       = {Tobias Christ and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Milos Stojakovic},
  editor       = {David G. Kirkpatrick and
                  Joseph S. B. Mitchell},
  title        = {Consistent digital line segments},
  booktitle    = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
                  Snowbird, Utah, USA, June 13-16, 2010},
  pages        = {11--18},
  publisher    = {{ACM}},
  year         = {2010},
  url          = {https://doi.org/10.1145/1810959.1810962},
  doi          = {10.1145/1810959.1810962},
  timestamp    = {Mon, 14 Jun 2021 16:25:04 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/ChristPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KeszeghPP10,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Ulrik Brandes and
                  Sabine Cornelsen},
  title        = {Drawing Planar Graphs of Bounded Degree with Few Slopes},
  booktitle    = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
                  Germany, September 21-24, 2010. Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {6502},
  pages        = {293--304},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-18469-7\_27},
  doi          = {10.1007/978-3-642-18469-7\_27},
  timestamp    = {Sun, 13 Nov 2022 09:57:29 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/KeszeghPP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandHPS10,
  author       = {Friedrich Eisenbrand and
                  Nicolai H{\"{a}}hnle and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Gennady Shmonin},
  editor       = {Moses Charikar},
  title        = {Testing Additive Integrality Gaps},
  booktitle    = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages        = {1227--1234},
  publisher    = {{SIAM}},
  year         = {2010},
  url          = {https://doi.org/10.1137/1.9781611973075.98},
  doi          = {10.1137/1.9781611973075.98},
  timestamp    = {Tue, 02 Feb 2021 17:07:39 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EisenbrandHPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-3937,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Partitionability to two trees is NP-complete},
  journal      = {CoRR},
  volume       = {abs/1002.3937},
  year         = {2010},
  url          = {http://arxiv.org/abs/1002.3937},
  eprinttype    = {arXiv},
  eprint       = {1002.3937},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1002-3937.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1841,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Communication Complexity},
  journal      = {CoRR},
  volume       = {abs/1007.1841},
  year         = {2010},
  url          = {http://arxiv.org/abs/1007.1841},
  eprinttype    = {arXiv},
  eprint       = {1007.1841},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1007-1841.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2170,
  author       = {Friedrich Eisenbrand and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Thomas Rothvo{\ss}},
  title        = {Bin Packing via Discrepancy of Permutations},
  journal      = {CoRR},
  volume       = {abs/1007.2170},
  year         = {2010},
  url          = {http://arxiv.org/abs/1007.2170},
  eprinttype    = {arXiv},
  eprint       = {1007.2170},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1007-2170.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-1315,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Drawing planar graphs of bounded degree with few slopes},
  journal      = {CoRR},
  volume       = {abs/1009.1315},
  year         = {2010},
  url          = {http://arxiv.org/abs/1009.1315},
  eprinttype    = {arXiv},
  eprint       = {1009.1315},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1009-1315.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-2142,
  author       = {Tobias Christ and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  Milos Stojakovic},
  title        = {Consistent digital line segments},
  journal      = {CoRR},
  volume       = {abs/1009.2142},
  year         = {2010},
  url          = {http://arxiv.org/abs/1009.2142},
  eprinttype    = {arXiv},
  eprint       = {1009.2142},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1009-2142.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-4641,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Decomposition of Geometric Set Systems and Graphs},
  journal      = {CoRR},
  volume       = {abs/1009.4641},
  year         = {2010},
  url          = {http://arxiv.org/abs/1009.4641},
  eprinttype    = {arXiv},
  eprint       = {1009.4641},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1009-4641.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Palvolgyi09,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Combinatorial Necklace Splitting},
  journal      = {Electron. J. Comb.},
  volume       = {16},
  number       = {1},
  year         = {2009},
  url          = {https://doi.org/10.37236/168},
  doi          = {10.37236/168},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/Palvolgyi09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/Palvolgyi09,
  author       = {D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  editor       = {Stefano Leonardi},
  title        = {2D-TUCKER Is PPAD-Complete},
  booktitle    = {Internet and Network Economics, 5th International Workshop, {WINE}
                  2009, Rome, Italy, December 14-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5929},
  pages        = {569--574},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10841-9\_57},
  doi          = {10.1007/978-3-642-10841-9\_57},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/Palvolgyi09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KeszeghPPT08,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{e}}za T{\'{o}}th},
  title        = {Drawing cubic graphs with at most five slopes},
  journal      = {Comput. Geom.},
  volume       = {40},
  number       = {2},
  pages        = {138--147},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.comgeo.2007.05.003},
  doi          = {10.1016/J.COMGEO.2007.05.003},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/KeszeghPPT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KeszeghPPT08,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{e}}za T{\'{o}}th},
  editor       = {Ioannis G. Tollis and
                  Maurizio Patrignani},
  title        = {Cubic Graphs Have Bounded Slope Parameter},
  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        = {50--60},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-642-00219-9\_6},
  doi          = {10.1007/978-3-642-00219-9\_6},
  timestamp    = {Sun, 13 Nov 2022 09:57:30 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/KeszeghPPT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/PachP06,
  author       = {J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
  title        = {Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers},
  journal      = {Electron. J. Comb.},
  volume       = {13},
  number       = {1},
  year         = {2006},
  url          = {https://doi.org/10.37236/1139},
  doi          = {10.37236/1139},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/PachP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KeszeghPPT06,
  author       = {Bal{\'{a}}zs Keszegh and
                  J{\'{a}}nos Pach and
                  D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
                  G{\'{e}}za T{\'{o}}th},
  editor       = {Michael Kaufmann and
                  Dorothea Wagner},
  title        = {Drawing Cubic Graphs with at Most Five Slopes},
  booktitle    = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
                  Germany, September 18-20, 2006. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4372},
  pages        = {114--125},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/978-3-540-70904-6\_13},
  doi          = {10.1007/978-3-540-70904-6\_13},
  timestamp    = {Sun, 13 Nov 2022 09:57:32 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/KeszeghPPT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics