Balázs Keszegh

127 papers A* 7A 5B 5Misc 2Journal 104Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Convex hull thrackles.
Discret. Math.
Balázs Keszegh, Dániel Simon
2026 J jnl
On Triangles in Colored Pseudoline Arrangements.
CoRR
Yan Alves Radtke, Balázs Keszegh, Robert Lauff
2026 J jnl
On the maximum number of tangencies among 1-intersecting curves.
CoRR
Eyal Ackerman, Balázs Keszegh
2025 J jnl
Coloring Geometric Hypergraphs: A Survey.
CoRR
Gábor Damásdi, Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2025 J jnl
Cooperation in combinatorial search.
Optim. Lett.
Dániel Gerbner, Balázs Keszegh, Kartal Nagy, Balázs Patkós, Gábor Wiener
2025 J jnl
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
Comb.
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2025 J jnl
Orientation of good covers.
Discret. Math. Theor. Comput. Sci.
Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi
2025 J jnl
Query complexity of Boolean functions on the middle slice of the cube.
Discret. Appl. Math.
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
2025 A* conf
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.
SODA
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
2025 A* conf
The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles.
SoCG
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2025 J jnl
The Zarankiewicz Problem for Polygon Visibility Graphs.
CoRR
Eyal Ackerman, Balázs Keszegh
2025 J jnl
The complexity of recognizing $ABAB$-free hypergraphs.
Discret. Math. Theor. Comput. Sci.
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi, Karamjeet Singh
2025 J jnl
Unavoidable patterns and plane paths in dense topological graphs.
CoRR
Balázs Keszegh, Andrew Suk, Gábor Tardos, Ji Zeng
2024 J jnl
On dual-ABAB-free and related hypergraphs.
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2024 J jnl
On tangencies among planar curves with an application to coloring L-shapes.
Eur. J. Comb.
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
2024 A* conf
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
SoCG
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
On the number of digons in arrangements of pairwise intersecting circles.
CoRR
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
On the number of tangencies among 1-intersecting x-monotone curves.
Eur. J. Comb.
Eyal Ackerman, Balázs Keszegh
2024 J jnl
Orientation of Convex Sets.
Electron. J. Comb.
Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi
2024 J jnl
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.
CoRR
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
2024 J jnl
The maximum number of digons formed by pairwise crossing pseudocircles.
CoRR
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2023 J jnl
A new discrete theory of pseudoconvexity.
Discret. Math. Theor. Comput. Sci.
Balázs Keszegh
2023 J jnl
Coloring directed hypergraphs.
Discret. Math.
Balázs Keszegh
2023 J jnl
Convex Hull Thrackles.
CoRR
Balázs Keszegh, Dániel Simon
2023 J jnl
On graphs that contain exactly
Discret. Appl. Math.
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
2023 J jnl
On the number of tangencies among 1-intersecting curves.
CoRR
Eyal Ackerman, Balázs Keszegh
2023 J jnl
Query complexity of Boolean functions on the middle slice of the cube.
CoRR
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
2023 J jnl
Saturation of Ordered Graphs.
SIAM J. Discret. Math.
Vladimir Boskovic, Balázs Keszegh
2023 J jnl
The Number of Tangencies Between Two Families of Curves.
Comb.
Balázs Keszegh, Dömötör Pálvölgyi
2023 J jnl
The maximum size of adjacency-crossing graphs.
CoRR
Eyal Ackerman, Balázs Keszegh
2022 J jnl
A new discrete theory of pseudoconvexity.
CoRR
Balázs Keszegh
2022 J jnl
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
Discret. Comput. Geom.
Eyal Ackerman, Balázs Keszegh, Günter Rote
2022 J jnl
Discrete Helly-type theorems for pseudohalfplanes.
Eur. J. Comb.
Balázs Keszegh
2022 J jnl
On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs.
Electron. J. Comb.
Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi
2021 J jnl
Adaptive majority problems for restricted query graphs and for weighted sets.
Discret. Appl. Math.
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
2021 J jnl
Coloring Delaunay-edges and their generalizations.
Comput. Geom.
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
2021 J jnl
Discrete Helly-type theorems for pseudohalfplanes.
CoRR
Balázs Keszegh
2021 J jnl
Induced and non-induced poset saturation problems.
J. Comb. Theory A
Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós
2021 J jnl
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
SIAM J. Discret. Math.
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2021 J jnl
Saturation Problems about Forbidden 0-1 Submatrices.
SIAM J. Discret. Math.
Radoslav Fulek, Balázs Keszegh
2021 J jnl
Saturation problems in the Ramsey theory of graphs, posets and point sets.
Eur. J. Comb.
Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora
2021 J jnl
The number of tangencies between two families of curves.
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2020 J jnl
A note about online nonrepetitive coloring k-trees.
Discret. Appl. Math.
Balázs Keszegh, Xuding Zhu
2020 J jnl
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks.
J. Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2020 A* conf
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
SoCG
Eyal Ackerman, Balázs Keszegh, Günter Rote
2020 J jnl
An almost optimal bound on the number of intersections of two simple polygons.
CoRR
Eyal Ackerman, Balázs Keszegh, Günter Rote
2020 J jnl
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs.
SIAM J. Discret. Math.
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
2020 J jnl
Coloring Intersection Hypergraphs of Pseudo-Disks.
Discret. Comput. Geom.
Balázs Keszegh
2020 J jnl
Generalized Forbidden Subposet Problems.
Order
Dániel Gerbner, Balázs Keszegh, Balázs Patkós
2020 J jnl
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
CoRR
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2020 J jnl
Set systems related to a house allocation problem.
Discret. Math.
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao
2020 J jnl
Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once.
Graphs Comb.
Balázs Keszegh
2019 J jnl
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.
CoRR
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
2019 J jnl
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes.
J. Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2019 J jnl
An improvement on the maximum number of k?dominating independent sets.
J. Graph Theory
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer
2019 J jnl
Proper Coloring of Geometric Hypergraphs.
Discret. Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2018 J jnl
Coloring Delaunay-Edges and their Generalizations.
CoRR
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
2018 A* conf
Coloring Intersection Hypergraphs of Pseudo-Disks.
SoCG
Balázs Keszegh
2018 J jnl
Line Percolation in Finite Projective Planes.
SIAM J. Discret. Math.
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer
2018 J jnl
On the Number of Cycles in a Graph with Restricted Cycle Lengths.
SIAM J. Discret. Math.
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós
2018 J jnl
On the size of planarly connected crossing graphs.
J. Graph Algorithms Appl.
Eyal Ackerman, Balázs Keszegh, Máté Vizer
2018 J jnl
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms.
Algorithmica
Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
2018 J jnl
Plane drawings of the generalized Delaunay-graphs for pseudo-disks.
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2017 J jnl
Choosability and paintability of the lexicographic product of graphs.
Discret. Appl. Math.
Balázs Keszegh, Xuding Zhu
2017 J jnl
Coloring Points with Respect to Squares.
Discret. Comput. Geom.
Eyal Ackerman, Balázs Keszegh, Máté Vizer
2017 J jnl
Coloring intersection hypergraphs of pseudo-disks.
CoRR
Balázs Keszegh
2017 J jnl
Finding a non-minority ball with majority answers.
Discret. Appl. Math.
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2017 J jnl
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.
Comb.
Ervin Györi, Balázs Keszegh
2017 J jnl
On the number of edge-disjoint triangles in K
Electron. Notes Discret. Math.
Ervin Györi, Balázs Keszegh
2017 A* conf
Proper Coloring of Geometric Hypergraphs.
SoCG
Balázs Keszegh, Dömötör Pálvölgyi
2017 J jnl
Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp.
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener
2016 A* conf
Coloring Points with Respect to Squares.
SoCG
Eyal Ackerman, Balázs Keszegh, Máté Vizer
2016 J jnl
Counting houses of Pareto optimal matchings in the house allocation problem.
Discret. Math.
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
2016 A conf
On the Size of Planarly Connected Crossing Graphs.
GD
Eyal Ackerman, Balázs Keszegh, Máté Vizer
2016 J jnl
On the tree search problem with non-uniform costs.
Theor. Comput. Sci.
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
2016 J jnl
Online and Quasi-online Colorings of Wedges and Intervals.
Order
Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
2016 J jnl
Proper Coloring of Geometric Hypergraphs.
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2016 J jnl
Topological orderings of weighted directed acyclic graphs.
Inf. Process. Lett.
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi
2015 B conf
An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes.
WG
Balázs Keszegh, Dömötör Pálvölgyi
2015 J jnl
Finding a majority ball with majority answers.
Electron. Notes Discret. Math.
Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
2015 J jnl
More on Decomposing Coverings by Octants.
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2015 J jnl
More on decomposing coverings by octants.
J. Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2015 B conf
On the Tree Search Problem with Non-uniform Costs.
WG
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
2015 J jnl
On the size of planarly connected crossing graphs.
CoRR
Eyal Ackerman, Balázs Keszegh, Máté Vizer
2014 J jnl
Convex Polygons are Self-Coverable.
Discret. Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2014 Misc conf
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem.
FUN
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
2014 J jnl
Counting One-sided Exchange Stable Matchings.
CoRR
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
2014 J jnl
Covering Paths for Planar Point Sets.
Discret. Comput. Geom.
Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth
2014 A conf
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms.
ESA
Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
2014 J jnl
Nonrepetitive colorings of lexicographic product of graphs.
Discret. Math. Theor. Comput. Sci.
Balázs Keszegh, Balázs Patkós, Xuding Zhu
2014 J jnl
Octants are cover-decomposable into many coverings.
Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2014 J jnl
On the Tree Search Problem with Non-uniform Costs.
CoRR
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
2014 J jnl
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms.
CoRR
Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
2013 J jnl
Convex Polygons are Self-Coverable.
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2013 J jnl
Covering Paths for Planar Point Sets
CoRR
Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth
2013 — conf
Density-Based Group Testing.
Information Theory, Combinatorics, and Search Theory
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
2013 J jnl
Drawing Planar Graphs of Bounded Degree with Few Slopes.
SIAM J. Discret. Math.
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
2013 J jnl
On Polygons Excluding Point Sets.
Graphs Comb.
Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic
2013 B conf
Online and Quasi-online Colorings of Wedges and Intervals.
SOFSEM
Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
2013 J jnl
Saturating Sperner Families.
Graphs Comb.
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
2013 J jnl
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.
SIAM J. Discret. Math.
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
2012 J jnl
Coloring half-planes and bottomless rectangles.
Comput. Geom.
Balázs Keszegh
2012 J jnl
Density-based group testing
CoRR
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
2012 J jnl
Generalizations of the tree packing conjecture.
Discuss. Math. Graph Theory
Dániel Gerbner, Balázs Keszegh, Cory Palmer
2012 J jnl
Graphs that admit right angle crossing drawings.
Comput. Geom.
Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth
2012 J jnl
Octants Are Cover-Decomposable.
Discret. Comput. Geom.
Balázs Keszegh, Dömötör Pálvölgyi
2012 J jnl
Octants are Cover-Decomposable into Many Coverings
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2012 J jnl
Online and quasi-online colorings of wedges and intervals
CoRR
Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
2012 J jnl
Search for the end of a path in the d-dimensional grid and in other graphs
CoRR
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
2012 B conf
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.
SOFSEM
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
2011 J jnl
Octants are Cover Decomposable
CoRR
Balázs Keszegh, Dömötör Pálvölgyi
2011 J jnl
Octants are Cover Decomposable.
Electron. Notes Discret. Math.
Balázs Keszegh, Dömötör Pálvölgyi
2011 J jnl
Path-search in the pyramid and in other graphs
CoRR
Dániel Gerbner, Balázs Keszegh
2010 J jnl
Cubic graphs have bounded slope parameter.
J. Graph Algorithms Appl.
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2010 A conf
Drawing Planar Graphs of Bounded Degree with Few Slopes.
GD
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
2010 J jnl
Drawing planar graphs of bounded degree with few slopes
CoRR
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
2010 B conf
Graphs that Admit Right Angle Crossing Drawings.
WG
Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth
2010 — conf
On polygons excluding point sets.
CCCG
Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic
2010 J jnl
Polychromatic colorings of arbitrary rectangular partitions.
Discret. Math.
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
2009 J jnl
Improved upper bounds on the reflexivity of point sets.
Comput. Geom.
Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh
2009 J jnl
On linear forbidden submatrices.
J. Comb. Theory A
Balázs Keszegh
2008 A conf
Cubic Graphs Have Bounded Slope Parameter.
GD
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2008 J jnl
Drawing cubic graphs with at most five slopes.
Comput. Geom.
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2008 Misc conf
Polychromatic Colorings of n-Dimensional Guillotine-Partitions.
COCOON
Balázs Keszegh
2007 — conf
Improved Upper Bounds on the Reflexivity of Point Sets.
CCCG
Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh
2007 — conf
Weak Conflict-Free Colorings of Point Sets and Simple Regions.
CCCG
Balázs Keszegh
2006 A conf
Drawing Cubic Graphs with at Most Five Slopes.
GD
Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth