Unpublished papers:
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, and Balázs Patkós. Saturating sperner families. 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. [ bib | arxiv | .pdf ]
Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, and Vajk Szécsi. Almost cross-intersecting and almost cross-sperner pairs of families of sets. [ bib | .pdf ]
András Gyárfás and Dömötör Pálvölgyi. Monochromatic even cycles. [ bib | .pdf ]
Padmini Mukkamala, János Pach, and Dömötör Pálvölgyi. Lower bounds on the obstacle number of graphs. [ bib | arxiv | .pdf ]
Panagiotis Cheilaris, Balázs Keszegh, and Dömötör Pálvölgyi. Unique-maximum and conflict-free colorings for hypergraphs and tree graphs. 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. [ bib | arxiv | .pdf ]
Zoltán Király, Zoltán Lóránt Nagy, Dömötör Pálvölgyi, and Mirkó Visontai. On weakly intersecting pairs of sets. 7th International Conference on Lattice Path Combinatorics and Applications. [ bib | .pdf ]
Published papers:
Dömötör Pálvölgyi. Lower bounds for finding the maximum and minimum elements with k lies. Acta Univ. Sapientiae Informatica., 3(2):224-229, 2011. [ bib | arxiv | journal | .pdf ]
Padmini Mukkamala and Dömötör Pálvölgyi. Drawing cubic graphs with the four basic slopes. Graph Drawing 2011, volume 7034 LNCS, pp 254-265, 2010. [ bib | arxiv | .pdf ]
Balázs Keszegh and Dömötör Pálvölgyi. Octants are cover decomposable. Discrete and Computational Geometry, pages 1-12, in press. (Conference version in Electronic Notes in Discrete Mathematics 38, pp. 499-504, 2011.) [ bib | arxiv | .pdf ]
Kevin Buchin, Jiří Matoušek, Robin Moser, and Dömötör Pálvölgyi. Vectors in a box. Mathematical Programming, pages 1-13, in press. [ bib | arxiv | .pdf ]
Dömötör Pálvölgyi. Partitionability to two trees is NP-complete. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae - Sectio mathematica, 52(1):131-135, 2009. [ bib | arxiv | .pdf ]
Balázs Keszegh, János Pach, and Dömötör Pálvölgyi. Drawing Planar Graphs of Bounded Degree with Few Slopes, volume 6502 LNCS, 2010. [ bib | arxiv | .pdf ]
Friedrich Eisenbrand, Dömötör Pálvölgyi, and Thomas Rothvoß. Bin packing via discrepancy of permutations. In SODA, pages 476-481, 2011. [ bib | arxiv | .pdf ]
Padmini Mukkamala and Dömötör Pálvölgyi. Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions. Electronic Journal of Combinatorics, 17(1), 2010. [ bib | arxiv | journal | .pdf ]
Tobias Christ, Dömötör Pálvölgyi, and Miloš Stojaković. Consistent digital line segments. In Symposium on Computational Geometry, pages 11-18, 2010. (See also Electronic Notes in Discrete Mathematics 38, pp. 273-278, 2011.) [ bib | arxiv | .pdf ]
A. Gács, T. Héger, Z. L. Nagy, and Dömötör Pálvölgyi. Permutations, hyperplanes and polynomials over finite fields. Finite Fields and their Applications, 16(5):301-314, 2010. [ bib | journal | .pdf ]
Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, and Gábor Wiener. Finding the maximum and minimum elements with one lie. Discrete Applied Mathematics, 158(9):988-995, 2010. [ bib | journal | .pdf ]
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, and Gennady Shmonin. Testing additive integrality gaps. In SODA, pages 1227-1234, 2010. [ bib | journal | .pdf ]
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, and Balázs Patkós. Polychromatic colorings of arbitrary rectangular partitions. Discrete Mathematics, 310(1):21-30, 2010. [ bib | journal | .pdf ]
Dömötör Pálvölgyi. 2D-TUCKER is PPAD-complete. In WINE, volume 5929 LNCS, pages 569-574, 2009. [ bib | journal | .pdf ]
Dömötör Pálvölgyi. Indecomposable coverings with concave polygons. Discrete and Computational Geometry, 44(3):577-588, 2010. [ bib | journal | .pdf ]
Dömötör Pálvölgyi and Géza Tóth. Convex polygons are cover-decomposable. Discrete and Computational Geometry, 43(3):483-496, 2010. [ bib | journal | .pdf ]
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, and Géza Tóth. Cubic graphs have bounded slope parameter. Journal of Graph Algorithms and Applications, 14(1):5-17, 2010. (Conference version in volume 5417 LNCS. 2009.) [ bib | journal | .pdf ]
Dömötör Pálvölgyi. Combinatorial necklace splitting. Electronic Journal of Combinatorics, 16(1), 2009. [ bib | journal | .pdf ]
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, and Géza Tóth. Drawing cubic graphs with at most five slopes. Computational Geometry: Theory and Applications, 40(2):138-147, 2008. (Conference version in volume 4372 LNCS. 2007.) [ bib | journal | .pdf ]
János Pach and Dömötör Pálvölgyi. Bounded-degree graphs can have arbitrarily large slope numbers. Electronic Journal of Combinatorics, 13(1 N):1-4, 2006. [ bib | journal | .pdf ]
Dömötör Pálvölgyi. Deciding soccer scores and partial orientations of graphs. Acta Univ. Sapientiae Math., 1(1):35-42, 2009. [ bib | journal | .pdf ]
Dömötör Pálvölgyi. Revisiting sequential search using question-sets with bounded intersections. J. Stat. Theory Pract., 1(2):199-204, 2007. [ bib | .pdf | short note to it.pdf ]
Dömötör Pálvölgyi. Baljó S Árnyak (english: Left compressed shadows - a simple proof of the Kruskal-Katona theorem). Matematikai Lapok, 10(2):13-16, 2005. [ bib | .pdf | in english.pdf ]
Theses and other:
Dömötör Pálvölgyi. Decomposition of Geometric Set Systems and Graphs. PhD thesis, Ecole Polytechnique Fédérale de Lausanne, 2010. [ bib | arxiv | .html | .pdf ]
Dömötör Pálvölgyi. Communication complexity. Master's thesis, Eötvös University Budapest, 2005. [ bib | arxiv | elte.pdf | .pdf ]
3rd Emléktábla workshop proceedings, 2011. [ bib | .html ]
2nd Emléktábla workshop proceedings, 2011. [ bib | .html | .pdf ]
1st Emléktábla workshop proceedings, 2010. [ bib | .html | .pdf ]
This file was generated by bibtex2html 1.95.