Weak Conflict-Free Colorings of Point Sets and Simple Regions. - Balázs Keszegh (CCCG, 2007)

Polychromatic Colorings of n-Dimensional Guillotine-Partitions. - Balázs Keszegh (COCOON, 2008)

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)

Improved upper bounds on the reflexivity of point sets. - Eyal Ackerman; Oswin Aichholzer; Balázs Keszegh (Comput. Geom., 2009)

On linear forbidden submatrices. - Balázs Keszegh (J. Comb. Theory A, 2009)

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)

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)

Path-search in the pyramid and in other graphs - Dániel Gerbner; Balázs Keszegh (CoRR, 2011)

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

Graphs that admit right angle crossing drawings. - Karin Arikushi; Radoslav Fulek; Balázs Keszegh; Filip Moric; Csaba D. Tóth (Comput. Geom., 2012)

Coloring half-planes and bottomless rectangles. - Balázs Keszegh (Comput. Geom., 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)

Generalizations of the tree packing conjecture. - Dániel Gerbner; Balázs Keszegh; Cory Palmer (Discuss. Math. Graph Theory, 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)

On Polygons Excluding Point Sets. - Radoslav Fulek; Balázs Keszegh; Filip Moric; Igor Uljarevic (Graphs Comb., 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)

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)

Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. - Rinat Ben Avraham; Matthias Henze; Rafel Jaume; Balázs Keszegh; Orit E. Raz; Micha Sharir; Igor Tubis (ESA, 2014)

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

Counting One-sided Exchange Stable Matchings. - Andrei Asinowski; Balázs Keszegh; Tillmann Miltzow (CoRR, 2014)

Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. - Rinat Ben Avraham; Matthias Henze; Rafel Jaume; Balázs Keszegh; Orit E. Raz; Micha Sharir; Igor Tubis (CoRR, 2014)

Covering Paths for Planar Point Sets. - Adrian Dumitrescu; Dániel Gerbner; Balázs Keszegh; Csaba D. Tóth (Discret. Comput. Geom., 2014)

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

Nonrepetitive colorings of lexicographic product of graphs. - Balázs Keszegh; Balázs Patkós; Xuding Zhu (Discret. Math. Theor. Comput. Sci., 2014)

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)

Counting houses of Pareto optimal matchings in the house allocation problem. - Andrei Asinowski; Balázs Keszegh; Tillmann Miltzow (Discret. Math., 2016)

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)

On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. - Ervin Györi; Balázs Keszegh (Comb., 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)

Choosability and paintability of the lexicographic product of graphs. - Balázs Keszegh; Xuding Zhu (Discret. Appl. Math., 2017)

Coloring Points with Respect to Squares. - Eyal Ackerman; Balázs Keszegh; Máté Vizer (Discret. Comput. Geom., 2017)

On the number of edge-disjoint triangles in K4-free graphs. - Ervin Györi; Balázs Keszegh (Electron. Notes Discret. Math., 2017)

Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. - Rinat Ben Avraham; Matthias Henze; Rafel Jaume; Balázs Keszegh; Orit E. Raz; Micha Sharir; Igor Tubis (Algorithmica, 2018)

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

On the size of planarly connected crossing graphs. - Eyal Ackerman; Balázs Keszegh; Máté Vizer (J. Graph Algorithms Appl., 2018)

Line Percolation in Finite Projective Planes. - Dániel Gerbner; Balázs Keszegh; Gábor Mészáros; Balázs Patkós; Máté Vizer (SIAM J. Discret. Math., 2018)

On the Number of Cycles in a Graph with Restricted Cycle Lengths. - Dániel Gerbner; Balázs Keszegh; Cory Palmer; Balázs Patkós (SIAM J. Discret. Math., 2018)

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

An improvement on the maximum number of k?dominating independent sets. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Balázs Patkós; Máté Vizer (J. Graph Theory, 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)

A note about online nonrepetitive coloring k-trees. - Balázs Keszegh; Xuding Zhu (Discret. Appl. Math., 2020)

Coloring Intersection Hypergraphs of Pseudo-Disks. - Balázs Keszegh (Discret. Comput. Geom., 2020)

Set systems related to a house allocation problem. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Casey Tompkins; Chuanqi Xiao (Discret. Math., 2020)

Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once. - Balázs Keszegh (Graphs 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)

Generalized Forbidden Subposet Problems. - Dániel Gerbner; Balázs Keszegh; Balázs Patkós (Order, 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)

Coloring Delaunay-edges and their generalizations. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (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)

Saturation problems in the Ramsey theory of graphs, posets and point sets. - Gábor Damásdi; Balázs Keszegh; David Malec; Casey Tompkins; Zhiyu Wang; Oscar Zamora 001 (Eur. J. 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 Covering Numbers, Young Diagrams, and the Local Dimension of Posets. - Gábor Damásdi; Stefan Felsner; António Girão; Balázs Keszegh; David Lewis; Dániel T. Nagy; Torsten Ueckerdt (SIAM J. Discret. Math., 2021)

Saturation Problems about Forbidden 0-1 Submatrices. - Radoslav Fulek; Balázs Keszegh (SIAM J. Discret. Math., 2021)

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)

An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. - Eyal Ackerman; Balázs Keszegh; Günter Rote (Discret. Comput. Geom., 2022)

Discrete Helly-type theorems for pseudohalfplanes. - Balázs Keszegh (Eur. J. Comb., 2022)

On the number of tangencies among 1-intersecting curves. - Eyal Ackerman; Balázs Keszegh (CoRR, 2023)

Convex Hull Thrackles. - Balázs Keszegh; Dániel Simon (CoRR, 2023)

The maximum size of adjacency-crossing graphs. - Eyal Ackerman; Balázs Keszegh (CoRR, 2023)

A new discrete theory of pseudoconvexity. - Balázs Keszegh (Discret. Math. Theor. Comput. Sci., 2023)

Saturation of Ordered Graphs. - Vladimir Boskovic; Balázs Keszegh (SIAM J. Discret. Math., 2023)

Coloring directed hypergraphs. - Balázs Keszegh (Discret. Math., 2023)

The Number of Tangencies Between Two Families of Curves. - Balázs Keszegh; Dömötör Pálvölgyi (Comb., 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 maximum number of digons formed by pairwise crossing pseudocircles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (CoRR, 2024)

On the number of tangencies among 1-intersecting x-monotone curves. - Eyal Ackerman; Balázs Keszegh (Eur. J. Comb., 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)

The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (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)

The Zarankiewicz Problem for Polygon Visibility Graphs. - Eyal Ackerman; Balázs Keszegh (CoRR, 2025)

Cooperation in combinatorial search. - Dániel Gerbner; Balázs Keszegh; Kartal Nagy; Balázs Patkós; Gábor Wiener (Optim. Lett., 2025)

On the Number of Digons in Arrangements of Pairwise Intersecting Circles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (Comb., 2025)