Dömötör Pálvölgyi

CoRR, April, 2026

2025

Coloring Geometric Hypergraphs: A Survey.

[BibT_eX]

[DOI]

CoRR, December, 2025

Partitioned matching games for international kidney exchange.

[BibT_eX]

[DOI]

Math. Program., November, 2025

Projective and External Saturation Problem for Posets.

[BibT_eX]

[DOI]

Balázs Patkós

Order, April, 2025

The complexity of recognizing $ABAB$-free hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Orientation of good covers.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Query complexity of Boolean functions on the middle slice of the cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

k-Dimensional Transversals for Fat Convex Sets.

[BibT_eX]

[DOI]

Attila Jung

Proceedings of the 41st International Symposium on Computational Geometry, 2025

Erdős-Szekeres Maker-Breaker Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 2025

2024

Note on Polychromatic Coloring of Hereditary Hypergraph Families.

[BibT_eX]

[DOI]

Graphs Comb., December, 2024

Odd-sunflowers.

[BibT_eX]

[DOI]

Peter Frankl

J. Comb. Theory, Ser. A, 2024

On tangencies among planar curves with an application to coloring L-shapes.

[BibT_eX]

[DOI]

Eyal Ackerman

Eur. J. Comb., 2024

The double Hall property and cycle covers in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2024

On dual-ABAB-free and related hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Orientation of Convex Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., December, 2023

Colouring bottomless rectangles and arborescences.

[BibT_eX]

[DOI]

Comput. Geom., December, 2023

The Number of Tangencies Between Two Families of Curves.

[BibT_eX]

[DOI]

Comb., October, 2023

Turán problems for edge-ordered graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, May, 2023

k-dimensional transversals for balls.

[BibT_eX]

[DOI]

Attila Jung

CoRR, 2023

2022

Realizing an m-Uniform Four-Chromatic Hypergraph with Disks.

[BibT_eX]

[DOI]

Gábor Damásdi

Comb., December, 2022

Exchange Properties of Finite Set-Systems.

[BibT_eX]

[DOI]

Peter Frankl

SIAM J. Discret. Math., September, 2022

A Faster Algorithm for Finding Tarski Fixed Points.

[BibT_eX]

[DOI]

John Fearnley

Rahul Savani

ACM Trans. Algorithms, 2022

On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs.

[BibT_eX]

[DOI]

Chaya Keller

Electron. J. Comb., 2022

Three-Chromatic Geometric Hypergraphs.

[BibT_eX]

[DOI]

Gábor Damásdi

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

On Communication Complexity of Fixed Point Computation.

[BibT_eX]

[DOI]

Anat Ganor

Karthik C. S.

ACM Trans. Economics and Comput., 2021

Induced and non-induced poset saturation problems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Exponential Lower Bound for Berge-Ramsey Problems.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Adaptive majority problems for restricted query graphs and for weighted sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Grid drawings of graphs with constant edge-vertex resolution.

[BibT_eX]

[DOI]

Michael A. Bekos

Martin Gronemann

Fabrizio Montecchiani

Antonios Symvonis

Leonidas Theocharous

Comput. Geom., 2021

Coloring Delaunay-edges and their generalizations.

[BibT_eX]

[DOI]

Eyal Ackerman

Comput. Geom., 2021

At most 3.55n stable matchings.

[BibT_eX]

[DOI]

Cory Palmer

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs.

[BibT_eX]

[DOI]

Eyal Ackerman

SIAM J. Discret. Math., 2020

The range of non-linear natural polynomials cannot be context-free.

[BibT_eX]

[DOI]

Kybernetika, 2020

Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Distribution of colors in Gallai colorings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Unlabeled compression schemes exceeding the VC-dimension.

[BibT_eX]

[DOI]

Gábor Tardos

Discret. Appl. Math., 2020

At most 4.47n stable matchings.

[BibT_eX]

[DOI]

Cory Palmer

CoRR, 2020

An improved constant factor for the unit distance problem.

[BibT_eX]

[DOI]

Péter Ágoston

CoRR, 2020

Radon Numbers Grow Linearly.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Almost-Monochromatic Sets and the Chromatic Number of the Plane.

[BibT_eX]

[DOI]

Nóra Frankl

Tamás Hubai

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Realizing m-uniform four-chromatic hypergraphs with disks.

[BibT_eX]

Gábor Damásdi

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings.

[BibT_eX]

[DOI]

Benjamin Gunby

Eur. J. Comb., 2019

Generalized Matching Games for International Kidney Exchange.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

All or Nothing Caching Games with Bounded Queries.

[BibT_eX]

[DOI]

IGTR, 2018

Weak embeddings of posets to the Boolean lattice.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Plane drawings of the generalized Delaunay-graphs for pseudo-disks.

[BibT_eX]

[DOI]

CoRR, 2018

Acyclic orientations with degree constraints.

[BibT_eX]

[DOI]

Zoltán Király

CoRR, 2018

2017

Finding a non-minority ball with majority answers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems.

[BibT_eX]

[DOI]

Abhishek Methuku

Comb. Probab. Comput., 2017

Complexity of Domination in Triangulated Plane Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Unified Hanani-Tutte Theorem.

[BibT_eX]

[DOI]

Radoslav Fulek

Jan Kyncl

Electron. J. Comb., 2017

Regular families of forests, antichains and duality pairs of relational structures.

[BibT_eX]

[DOI]

Comb., 2017

Search for the end of a path in the d-dimensional grid and in other graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Proper Coloring of Geometric Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Topological orderings of weighted directed acyclic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

2015

More on decomposing coverings by octants.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Finding a majority ball with majority answers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Unsplittable Coverings in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the Tree Search Problem with Non-uniform Costs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Advantage in the discrete Voronoi game.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Domination in transitive colorings of tournaments.

[BibT_eX]

[DOI]

András Gyárfás

J. Comb. Theory B, 2014

Convex Polygons are Self-Coverable.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Octants are cover-decomposable into many coverings.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Clustered Planarity Testing Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Saturating Sperner Families.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Majority and plurality problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Efficient c-planarity testing algebraically

[BibT_eX]

[DOI]

CoRR, 2013

Indecomposable coverings with unit discs.

[BibT_eX]

[DOI]

CoRR, 2013

Online and Quasi-online Colorings of Wedges and Intervals.

[BibT_eX]

[DOI]

Nathan Lemons

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Density-Based Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Vectors in a box.

[BibT_eX]

[DOI]

Math. Program., 2012

On Families of Weakly Cross-intersecting Set-pairs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Search for the end of a path in the d-dimensional grid and in other graphs

[BibT_eX]

[DOI]

CoRR, 2012

On infinite-finite tree-duality pairs of relational structures

[BibT_eX]

[DOI]

CoRR, 2012

Lower Bounds on the Obstacle Number of Graphs.

[BibT_eX]

[DOI]

Padmini Mukkamala

Electron. J. Comb., 2012

Monochromatic even cycles.

[BibT_eX]

[DOI]

András Gyárfás

Contributions Discret. Math., 2012

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011

Octants are Cover Decomposable.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Digitalizing line segments.

[BibT_eX]

[DOI]

Tobias Christ

Milos Stojakovic

Electron. Notes Discret. Math., 2011

Lower bounds for finding the maximum and minimum elements with k lies

[BibT_eX]

[DOI]

CoRR, 2011

Bin Packing via Discrepancy of Permutations.

[BibT_eX]

[DOI]

Friedrich Eisenbrand

Thomas Rothvoß

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Drawing Cubic Graphs with the Four Basic Slopes.

[BibT_eX]

[DOI]

Padmini Mukkamala

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Permutations, hyperplanes and polynomials over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2010

Polychromatic colorings of arbitrary rectangular partitions.

[BibT_eX]

[DOI]

Discret. Math., 2010

Convex Polygons are Cover-Decomposable.

[BibT_eX]

[DOI]

Géza Tóth

Discret. Comput. Geom., 2010

Indecomposable Coverings with Concave Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Finding the maximum and minimum elements with one lie.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Decomposition of Geometric Set Systems and Graphs

[BibT_eX]

[DOI]

CoRR, 2010

Communication Complexity

[BibT_eX]

[DOI]

CoRR, 2010

Partitionability to two trees is NP-complete

[BibT_eX]

[DOI]

CoRR, 2010

Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous Directions.

[BibT_eX]

[DOI]

Padmini Mukkamala

Electron. J. Comb., 2010

Testing Additive Integrality Gaps.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Drawing Planar Graphs of Bounded Degree with Few Slopes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Consistent digital line segments.

[BibT_eX]

[DOI]

Tobias Christ

Milos Stojakovic

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Combinatorial Necklace Splitting.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2D-TUCKER Is PPAD-Complete.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008

Cubic Graphs Have Bounded Slope Parameter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2006

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.

[BibT_eX]

[DOI]