Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. - János Pach; Dömötör Pálvölgyi (Electron. J. Comb., 2006)

Drawing cubic graphs with at most five slopes. - Balázs Keszegh; János Pach; Dömötör Pálvölgyi; Géza Tóth 001 (Comput. Geom., 2008)

2D-TUCKER Is PPAD-Complete. - Dömötör Pálvölgyi (WINE, 2009)

Combinatorial Necklace Splitting. - Dömötör Pálvölgyi (Electron. J. Comb., 2009)

Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous Directions. - Padmini Mukkamala; Dömötör Pálvölgyi (Electron. J. Comb., 2010)

Partitionability to two trees is NP-complete - Dömötör Pálvölgyi (CoRR, 2010)

Communication Complexity - Dömötör Pálvölgyi (CoRR, 2010)

Decomposition of Geometric Set Systems and Graphs - Dömötör Pálvölgyi (CoRR, 2010)

Finding the maximum and minimum elements with one lie. - Dániel Gerbner; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Discret. Appl. Math., 2010)

Indecomposable Coverings with Concave Polygons. - Dömötör Pálvölgyi (Discret. Comput. Geom., 2010)

Convex Polygons are Cover-Decomposable. - Dömötör Pálvölgyi; Géza Tóth 001 (Discret. Comput. Geom., 2010)

Polychromatic colorings of arbitrary rectangular partitions. - Dániel Gerbner; Balázs Keszegh; Nathan Lemons; Cory Palmer; Dömötör Pálvölgyi; Balázs Patkós (Discret. Math., 2010)

Permutations, hyperplanes and polynomials over finite fields. - András Gács; Tamás Héger; Zoltán Lóránt Nagy; Dömötör Pálvölgyi (Finite Fields Their Appl., 2010)

Cubic graphs have bounded slope parameter. - Balázs Keszegh; János Pach; Dömötör Pálvölgyi; Géza Tóth 001 (J. Graph Algorithms Appl., 2010)

Drawing Cubic Graphs with the Four Basic Slopes. - Padmini Mukkamala; Dömötör Pálvölgyi (GD, 2011)

Lower bounds for finding the maximum and minimum elements with k lies - Dömötör Pálvölgyi (CoRR, 2011)

Digitalizing line segments. - Tobias Christ; Dömötör Pálvölgyi; Milos Stojakovic (Electron. Notes Discret. Math., 2011)

Octants are Cover Decomposable. - Balázs Keszegh; Dömötör Pálvölgyi (Electron. Notes Discret. Math., 2011)

Monochromatic even cycles. - András Gyárfás; Dömötör Pálvölgyi (Contributions Discret. Math., 2012)

Lower Bounds on the Obstacle Number of Graphs. - Padmini Mukkamala; János Pach; Dömötör Pálvölgyi (Electron. J. Comb., 2012)

On infinite-finite tree-duality pairs of relational structures - Péter L. Erdös; Dömötör Pálvölgyi; Claude Tardif; Gábor Tardos (CoRR, 2012)

Search for the end of a path in the d-dimensional grid and in other graphs - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Gábor Wiener (CoRR, 2012)

Consistent Digital Line Segments. - Tobias Christ; Dömötör Pálvölgyi; Milos Stojakovic (Discret. Comput. Geom., 2012)

On Families of Weakly Cross-intersecting Set-pairs. - Zoltán Király; Zoltán Lóránt Nagy; Dömötör Pálvölgyi; Mirkó Visontai (Fundam. Informaticae, 2012)

Vectors in a box. - Kevin Buchin; Jirí Matousek 001; Robin A. Moser; Dömötör Pálvölgyi (Math. Program., 2012)

Density-Based Group Testing. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Gábor Wiener (Information Theory, Combinatorics, and Search Theory, 2013)

Indecomposable coverings with unit discs. - Dömötör Pálvölgyi (CoRR, 2013)

Efficient c-planarity testing algebraically - Radoslav Fulek; Jan Kyncl; Igor Malinovic; Dömötör Pálvölgyi (CoRR, 2013)

Majority and plurality problems. - Dániel Gerbner; Gyula O. H. Katona; Dömötör Pálvölgyi; Balázs Patkós (Discret. Appl. Math., 2013)

Saturating Sperner Families. - Dániel Gerbner; Balázs Keszegh; Nathan Lemons; Cory Palmer; Dömötör Pálvölgyi; Balázs Patkós (Graphs Comb., 2013)

Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. - Dániel Gerbner; Nathan Lemons; Cory Palmer; Dömötör Pálvölgyi; Balázs Patkós; Vajk Szécsi (Graphs Comb., 2013)

Testing additive integrality gaps. - Friedrich Eisenbrand; Nicolai Hähnle; Dömötör Pálvölgyi; Gennady Shmonin (Math. Program., 2013)

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. - Panagiotis Cheilaris; Balázs Keszegh; Dömötör Pálvölgyi (SIAM J. Discret. Math., 2013)

Drawing Planar Graphs of Bounded Degree with Few Slopes. - Balázs Keszegh; János Pach; Dömötör Pálvölgyi (SIAM J. Discret. Math., 2013)

Bin Packing via Discrepancy of Permutations. - Friedrich Eisenbrand; Dömötör Pálvölgyi; Thomas Rothvoß (ACM Trans. Algorithms, 2013)

Octants are cover-decomposable into many coverings. - Balázs Keszegh; Dömötör Pálvölgyi (Comput. Geom., 2014)

Convex Polygons are Self-Coverable. - Balázs Keszegh; Dömötör Pálvölgyi (Discret. Comput. Geom., 2014)

Domination in transitive colorings of tournaments. - Dömötör Pálvölgyi; András Gyárfás (J. Comb. Theory B, 2014)

Advantage in the discrete Voronoi game. - Dániel Gerbner; Viola Mészáros; Dömötör Pálvölgyi; Alexey Pokrovskiy; Günter Rote (J. Graph Algorithms Appl., 2014)

Unsplittable Coverings in the Plane. - János Pach; Dömötör Pálvölgyi (WG, 2015)

Clustered Planarity Testing Revisited. - Radoslav Fulek; Jan Kyncl; Igor Malinovic; Dömötör Pálvölgyi (Electron. J. Comb., 2015)

Finding a majority ball with majority answers. - Máté Vizer; Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Electron. Notes Discret. Math., 2015)

More on decomposing coverings by octants. - Balázs Keszegh; Dömötör Pálvölgyi (J. Comput. Geom., 2015)

Topological orderings of weighted directed acyclic graphs. - Dániel Gerbner; Balázs Keszegh; Cory Palmer; Dömötör Pálvölgyi (Inf. Process. Lett., 2016)

Online and Quasi-online Colorings of Wedges and Intervals. - Balázs Keszegh; Nathan Lemons; Dömötör Pálvölgyi (Order, 2016)

On the tree search problem with non-uniform costs. - Ferdinando Cicalese; Balázs Keszegh; Bernard Lidický; Dömötör Pálvölgyi; Tomás Valla (Theor. Comput. Sci., 2016)

Search for the end of a path in the d-dimensional grid and in other graphs. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Günter Rote; Gábor Wiener (Ars Math. Contemp., 2017)

Regular families of forests, antichains and duality pairs of relational structures. - Péter L. Erdös; Dömötör Pálvölgyi; Claude Tardif; Gábor Tardos (Comb., 2017)

Unified Hanani-Tutte Theorem. - Radoslav Fulek; Jan Kyncl; Dömötör Pálvölgyi (Electron. J. Comb., 2017)

Complexity of Domination in Triangulated Plane Graphs. - Dömötör Pálvölgyi (CoRR, 2017)

Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. - Abhishek Methuku; Dömötör Pálvölgyi (Comb. Probab. Comput., 2017)

Finding a non-minority ball with majority answers. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2017)

Acyclic orientations with degree constraints. - Zoltán Király; Dömötör Pálvölgyi (CoRR, 2018)

Plane drawings of the generalized Delaunay-graphs for pseudo-disks. - Balázs Keszegh; Dömötör Pálvölgyi (CoRR, 2018)

Weak embeddings of posets to the Boolean lattice. - Dömötör Pálvölgyi (Discret. Math. Theor. Comput. Sci., 2018)

All or Nothing Caching Games with Bounded Queries. - Dömötör Pálvölgyi (IGTR, 2018)

Generalized Matching Games for International Kidney Exchange. - Péter Biró 001; Walter Kern; Dömötör Pálvölgyi; Daniël Paulusma (AAMAS, 2019)

Proper Coloring of Geometric Hypergraphs. - Balázs Keszegh; Dömötör Pálvölgyi (Discret. Comput. Geom., 2019)

Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings. - Benjamin Gunby; Dömötör Pálvölgyi (Eur. J. Comb., 2019)

An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. - Balázs Keszegh; Dömötör Pálvölgyi (J. Comput. Geom., 2019)

Realizing m-uniform four-chromatic hypergraphs with disks. - Gábor Damásdi; Dömötör Pálvölgyi (CCCG, 2020)

An improved constant factor for the unit distance problem. - Péter Ágoston; Dömötör Pálvölgyi (CoRR, 2020)

At most 4.47n stable matchings. - Cory Palmer; Dömötör Pálvölgyi (CoRR, 2020)

Unlabeled compression schemes exceeding the VC-dimension. - Dömötör Pálvölgyi; Gábor Tardos (Discret. Appl. Math., 2020)

Distribution of colors in Gallai colorings. - András Gyárfás; Dömötör Pálvölgyi; Balázs Patkós; Matthew Wales (Eur. J. Comb., 2020)

Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. - Balázs Keszegh; Dömötör Pálvölgyi (J. Comput. Geom., 2020)

The range of non-linear natural polynomials cannot be context-free. - Dömötör Pálvölgyi (Kybernetika, 2020)

Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (SIAM J. Discret. Math., 2020)

At most 3.55n stable matchings. - Cory Palmer; Dömötör Pálvölgyi (FOCS, 2021)

Coloring Delaunay-edges and their generalizations. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (Comput. Geom., 2021)

Grid drawings of graphs with constant edge-vertex resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Dömötör Pálvölgyi; Antonios Symvonis; Leonidas Theocharous (Comput. Geom., 2021)

Adaptive majority problems for restricted query graphs and for weighted sets. - Gábor Damásdi; Dániel Gerbner; Gyula O. H. Katona; Balázs Keszegh; Dániel Lenger; Abhishek Methuku; Dániel T. Nagy; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2021)

Exponential Lower Bound for Berge-Ramsey Problems. - Dömötör Pálvölgyi (Graphs Comb., 2021)

Induced and non-induced poset saturation problems. - Balázs Keszegh; Nathan Lemons; Ryan R. Martin; Dömötör Pálvölgyi; Balázs Patkós (J. Comb. Theory A, 2021)

On Communication Complexity of Fixed Point Computation. - Anat Ganor; Karthik C. S. 001; Dömötör Pálvölgyi (ACM Trans. Economics and Comput., 2021)

Three-Chromatic Geometric Hypergraphs. - Gábor Damásdi; Dömötör Pálvölgyi (SoCG, 2022)

On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. - Chaya Keller; Balázs Keszegh; Dömötör Pálvölgyi (Electron. J. Comb., 2022)

Radon Numbers Grow Linearly. - Dömötör Pálvölgyi (Discret. Comput. Geom., 2022)

A Faster Algorithm for Finding Tarski Fixed Points. - John Fearnley; Dömötör Pálvölgyi; Rahul Savani (ACM Trans. Algorithms, 2022)

Exchange Properties of Finite Set-Systems. - Peter Frankl; János Pach; Dömötör Pálvölgyi (SIAM J. Discret. Math., 2022)

Realizing an m-Uniform Four-Chromatic Hypergraph with Disks. - Gábor Damásdi; Dömötör Pálvölgyi (Comb., 2022)

Partitioned Matching Games for International Kidney Exchange. - Márton Benedek; Péter Biró 001; Walter Kern; Dömötör Pálvölgyi; Daniël Paulusma (CoRR, 2023)

k-dimensional transversals for balls. - Attila Jung; Dömötör Pálvölgyi (CoRR, 2023)

Turán problems for edge-ordered graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Dömötör Pálvölgyi; Gábor Tardos; Máté Vizer (J. Comb. Theory B, 2023)

The Number of Tangencies Between Two Families of Curves. - Balázs Keszegh; Dömötör Pálvölgyi (Comb., 2023)

Almost-Monochromatic Sets and the Chromatic Number of the Plane. - Nóra Frankl; Tamás Hubai; Dömötör Pálvölgyi (Discret. Comput. Geom., 2023)

Colouring bottomless rectangles and arborescences. - Jean Cardinal; Kolja Knauer; Piotr Micek; Dömötör Pálvölgyi; Torsten Ueckerdt; Narmada Varadarajan (Comput. Geom., 2023)

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. - Dániel Gerbner; Balázs Keszegh; Dániel Lenger; Dániel T. Nagy; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2023)

Orientation of Convex Sets. - Péter Ágoston; Gábor Damásdi; Balázs Keszegh; Dömötör Pálvölgyi (Electron. J. Comb., 2024)

On dual-ABAB-free and related hypergraphs. - Balázs Keszegh; Dömötör Pálvölgyi (CoRR, 2024)

The double Hall property and cycle covers in bipartite graphs. - János Barát; Andrzej Grzesik; Attila Jung; Zoltán Lóránt Nagy; Dömötör Pálvölgyi (Discret. Math., 2024)

On tangencies among planar curves with an application to coloring L-shapes. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (Eur. J. Comb., 2024)

Odd-sunflowers. - Peter Frankl; János Pach; Dömötör Pálvölgyi (J. Comb. Theory, Ser. A, 2024)

Note on Polychromatic Coloring of Hereditary Hypergraph Families. - Dömötör Pálvölgyi (Graphs Comb., 2024)

Erdős-Szekeres Maker-Breaker Games. - Aleksa Dzuklevski; Dömötör Pálvölgyi; Alexey Pokrovskiy; Csaba D. Tóth; Tomás Valla; Lander Verlinde (COCOON (1), 2025)

k-Dimensional Transversals for Fat Convex Sets. - Attila Jung; Dömötör Pálvölgyi (SoCG, 2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. - Sujoy Bhore; Balázs Keszegh; Andrey Kupavskii; Hung Le 001; Alexandre Louvet; Dömötör Pálvölgyi; Csaba D. Tóth (SODA, 2025)

Query complexity of Boolean functions on the middle slice of the cube. - Dániel Gerbner; Balázs Keszegh; Dániel T. Nagy; Kartal Nagy; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Discret. Appl. Math., 2025)

Projective and External Saturation Problem for Posets. - Dömötör Pálvölgyi; Balázs Patkós (Order, 2025)