Balázs Keszegh
Balázs Keszegh
Researcher, Alfréd Rényi Institute of Mathematics, Budapest
Dirección de correo verificada de renyi.hu - Página principal
Título
Citado por
Citado por
Ańo
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
422013
On linear forbidden submatrices
B Keszegh
Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009
342009
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
302013
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
29*2012
Weak Conflict-Free Colorings of Point Sets and Simple Regions.
B Keszegh
CCCG, 97-100, 2007
252007
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47 (3), 598-609, 2012
232012
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
232008
Octants are cover-decomposable into many coverings
B Keszegh, D Pálvölgyi
Computational Geometry 47 (5), 585-588, 2014
172014
Coloring half-planes and bottomless rectangles
B Keszegh
Arxiv preprint arXiv:1105.0169, 2011
152011
Convex polygons are self-coverable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 51 (4), 885-895, 2014
142014
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
142013
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
Improved upper bounds on the reflexivity of point sets
E Ackerman, O Aichholzer, B Keszegh
Computational Geometry 42 (3), 241-249, 2009
122009
More on decomposing coverings by octants
B Keszegh, D Pálvölgyi
arXiv preprint arXiv:1503.01669, 2015
112015
Minimum partial-matching and Hausdorff RMS-distance under translation: Combinatorics and algorithms
R Ben-Avraham, M Henze, R Jaume, B Keszegh, OE Raz, M Sharir, ...
European Symposium on Algorithms, 100-111, 2014
102014
On polygons excluding point sets
R Fulek, B Keszegh, F Morić, I Uljarević
Graphs and Combinatorics 29 (6), 1741-1753, 2013
102013
Density-based group testing
D Gerbner, B Keszegh, D Pálvölgyi, G Wiener
Information Theory, Combinatorics, and Search Theory, 543-556, 2013
10*2013
Drawing cubic graphs with at most five slopes
B Keszegh, J Pach, D Pálvölgyi, G Toth
International Symposium on Graph Drawing, 114-125, 2006
102006
Coloring intersection hypergraphs of pseudo-disks
B Keszegh
Discrete & Computational Geometry, 1-23, 2019
82019
Counting houses of Pareto optimal matchings in the house allocation problem
A Asinowski, B Keszegh, T Miltzow
Discrete Mathematics 339 (12), 2919-2932, 2016
82016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20