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
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
58*2012
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
572013
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
532013
On linear forbidden submatrices
B Keszegh
Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009
452009
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
442013
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47, 598-609, 2012
292012
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
272021
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
262008
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
23*2019
Coloring half-planes and bottomless rectangles
B Keszegh
Computational geometry 45 (9), 495-507, 2012
232012
More on decomposing coverings by octants
B Keszegh, D Pálvölgyi
Journal of Computational Geometry 6 (1), 300-315., 2015
192015
Coloring intersection hypergraphs of pseudo-disks
B Keszegh
Discrete & Computational Geometry 64 (3), 942-964, 2020
182020
Coloring points with respect to squares
E Ackerman, B Keszegh, M Vizer
Discrete & Computational Geometry 58, 757-784, 2017
182017
Convex polygons are self-coverable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 51 (4), 885-895, 2014
182014
Improved upper bounds on the reflexivity of point sets
E Ackerman, O Aichholzer, B Keszegh
Computational Geometry 42 (3), 241-249, 2009
182009
Octants are cover-decomposable into many coverings
B Keszegh, D Pálvölgyi
Computational Geometry 47 (5), 585-588, 2014
172014
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
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
162013
On the tree search problem with non-uniform costs
F Cicalese, B Keszegh, B Lidický, D Pálvölgyi, T Valla
Theoretical Computer Science 647, 22-32, 2016
152016
The system can't perform the operation now. Try again later.
Articles 1–20