Follow
Balázs Keszegh
Balázs Keszegh
Researcher, Alfréd Rényi Institute of Mathematics, Budapest
Verified email at renyi.hu - Homepage
Title
Cited by
Cited by
Year
Drawing planar graphs of bounded degree with few slopes
B Keszegh, J Pach, D Palvolgyi
SIAM Journal on Discrete Mathematics 27 (2), 1171-1183, 2013
512013
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
P Cheilaris, B Keszegh, D Pálvölgyi
SIAM Journal on Discrete Mathematics 27 (4), 1775-1787, 2013
422013
Graphs that admit right angle crossing drawings
K Arikushi, R Fulek, B Keszegh, F Morić, CD Tóth
Computational Geometry 45 (4), 169-177, 2012
39*2012
On linear forbidden submatrices
B Keszegh
Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009
382009
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47 (3), 598-609, 2012
302012
Saturating sperner families
D Gerbner, B Keszegh, N Lemons, C Palmer, D Pálvölgyi, B Patkós
Graphs and Combinatorics 29 (5), 1355-1364, 2013
282013
Weak Conflict-Free Colorings of Point Sets and Simple Regions
B Keszegh
CCCG, 97-100, 2007
272007
Drawing cubic graphs with at most five slopes
B Keszegh, J Pach, D Pálvölgyi, G Tóth
Computational Geometry 40 (2), 138-147, 2008
252008
Coloring half-planes and bottomless rectangles
B Keszegh
Computational geometry 45 (9), 495-507, 2012
212012
Convex polygons are self-coverable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 51 (4), 885-895, 2014
182014
Octants are cover-decomposable into many coverings
B Keszegh, D Pálvölgyi
Computational Geometry 47 (5), 585-588, 2014
172014
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
B Keszegh, D Pálvölgyi
Journal of Computational Geometry 10 (1), 1–26., 2019
16*2019
On the size of planarly connected crossing graphs
E Ackerman, B Keszegh, M Vizer
Journal of Graph Algorithms and Applications 22 (1), 11-22., 2018
162018
More on decomposing coverings by octants
B Keszegh, D Pálvölgyi
Journal of Computational Geometry 6 (1), 300-315., 2015
162015
Improved upper bounds on the reflexivity of point sets
E Ackerman, O Aichholzer, B Keszegh
Computational Geometry 42 (3), 241-249, 2009
162009
Coloring intersection hypergraphs of pseudo-disks
B Keszegh
Discrete & Computational Geometry 64 (3), 942-964, 2020
152020
Coloring points with respect to squares
E Ackerman, B Keszegh, M Vizer
Discrete & Computational Geometry 58 (4), 757-784, 2017
152017
On the complexity of the partial least-squares matching Voronoi diagram
M Henze, R Jaume, B Keszegh
Proc. 29th European Workshop on Computational Geometry, 193-196, 2013
142013
Density-based group testing
D Gerbner, B Keszegh, D Pálvölgyi, G Wiener
Information theory, combinatorics, and search theory, 543-556, 2013
13*2013
Induced and non-induced poset saturation problems
B Keszegh, N Lemons, RR Martin, D Pálvölgyi, B Patkós
Journal of Combinatorial Theory, Series A 184, 105497, 2021
122021
The system can't perform the operation now. Try again later.
Articles 1–20