According to our database
1,
Balázs Keszegh
authored at least 70 papers
between 2007 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
On graphs that contain exactly <i>k</i> copies of a subgraph, and a related problem in search theory.
Discret. Appl. Math., December, 2023
The Number of Tangencies Between Two Families of Curves.
Comb., October, 2023
Coloring directed hypergraphs.
Discret. Math., September, 2023
Saturation of Ordered Graphs.
SIAM J. Discret. Math., June, 2023
Query complexity of Boolean functions on the middle slice of the cube.
CoRR, 2023
The maximum size of adjacency-crossing graphs.
CoRR, 2023
On the number of tangencies among 1-intersecting curves.
CoRR, 2023
2022
Discrete Helly-type theorems for pseudohalfplanes.
Eur. J. Comb., 2022
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
Discret. Comput. Geom., 2022
A new discrete theory of pseudoconvexity.
CoRR, 2022
On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs.
Electron. J. Comb., 2022
2021
Saturation Problems about Forbidden 0-1 Submatrices.
SIAM J. Discret. Math., 2021
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
SIAM J. Discret. Math., 2021
Induced and non-induced poset saturation problems.
J. Comb. Theory, Ser. A, 2021
Saturation problems in the Ramsey theory of graphs, posets and point sets.
Eur. J. Comb., 2021
Adaptive majority problems for restricted query graphs and for weighted sets.
,
,
,
,
,
,
,
,
,
,
Discret. Appl. Math., 2021
Coloring Delaunay-edges and their generalizations.
Comput. Geom., 2021
2020
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs.
SIAM J. Discret. Math., 2020
Generalized Forbidden Subposet Problems.
Order, 2020
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks.
J. Comput. Geom., 2020
Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once.
Graphs Comb., 2020
Set systems related to a house allocation problem.
Discret. Math., 2020
Coloring Intersection Hypergraphs of Pseudo-Disks.
Discret. Comput. Geom., 2020
A note about online nonrepetitive coloring k-trees.
Discret. Appl. Math., 2020
2019
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes.
J. Comput. Geom., 2019
An improvement on the maximum number of k?dominating independent sets.
J. Graph Theory, 2019
Proper Coloring of Geometric Hypergraphs.
Discret. Comput. Geom., 2019
2018
On the Number of Cycles in a Graph with Restricted Cycle Lengths.
SIAM J. Discret. Math., 2018
Line Percolation in Finite Projective Planes.
SIAM J. Discret. Math., 2018
On the size of planarly connected crossing graphs.
J. Graph Algorithms Appl., 2018
Plane drawings of the generalized Delaunay-graphs for pseudo-disks.
CoRR, 2018
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms.
Algorithmica, 2018
2017
On the number of edge-disjoint triangles in K<sub>4</sub>-free graphs.
Electron. Notes Discret. Math., 2017
Coloring Points with Respect to Squares.
Discret. Comput. Geom., 2017
Choosability and paintability of the lexicographic product of graphs.
Discret. Appl. Math., 2017
Finding a non-minority ball with majority answers.
Discret. Appl. Math., 2017
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.
Comb., 2017
Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp., 2017
2016
On the tree search problem with non-uniform costs.
Theor. Comput. Sci., 2016
Online and Quasi-online Colorings of Wedges and Intervals.
Order, 2016
Topological orderings of weighted directed acyclic graphs.
Inf. Process. Lett., 2016
Counting houses of Pareto optimal matchings in the house allocation problem.
Discret. Math., 2016
2015
More on decomposing coverings by octants.
J. Comput. Geom., 2015
Finding a majority ball with majority answers.
Electron. Notes Discret. Math., 2015
2014
Nonrepetitive colorings of lexicographic product of graphs.
Discret. Math. Theor. Comput. Sci., 2014
Convex Polygons are Self-Coverable.
Discret. Comput. Geom., 2014
Covering Paths for Planar Point Sets.
Discret. Comput. Geom., 2014
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms.
CoRR, 2014
Counting One-sided Exchange Stable Matchings.
CoRR, 2014
Octants are cover-decomposable into many coverings.
Comput. Geom., 2014
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms.
Proceedings of the Algorithms - ESA 2014, 2014
2013
Drawing Planar Graphs of Bounded Degree with Few Slopes.
SIAM J. Discret. Math., 2013
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.
SIAM J. Discret. Math., 2013
Saturating Sperner Families.
Graphs Comb., 2013
On Polygons Excluding Point Sets.
Graphs Comb., 2013
Density-Based Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013
2012
Generalizations of the tree packing conjecture.
Discuss. Math. Graph Theory, 2012
Search for the end of a path in the d-dimensional grid and in other graphs
CoRR, 2012
Coloring half-planes and bottomless rectangles.
Comput. Geom., 2012
Graphs that admit right angle crossing drawings.
Comput. Geom., 2012
2011
Octants are Cover Decomposable.
Electron. Notes Discret. Math., 2011
Path-search in the pyramid and in other graphs
CoRR, 2011
2010
Cubic graphs have bounded slope parameter.
J. Graph Algorithms Appl., 2010
Polychromatic colorings of arbitrary rectangular partitions.
Discret. Math., 2010
2009
On linear forbidden submatrices.
J. Comb. Theory, Ser. A, 2009
Improved upper bounds on the reflexivity of point sets.
Comput. Geom., 2009
2008
Drawing cubic graphs with at most five slopes.
Comput. Geom., 2008
Polychromatic Colorings of n-Dimensional Guillotine-Partitions.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
2007
Weak Conflict-Free Colorings of Point Sets and Simple Regions.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
