Balázs Keszegh

Cited by

	All	Since 2018
Citations	793	454
h-index	16	12
i10-index	33	17

120

20082009201020112012201320142015201620172018201920202021202220236 16 20 23 34 42 52 43 48 40 54 50 77 94 67 105

Public access

View all

51 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Dömötör PálvölgyiEötvös Loránd University (ELTE)Verified email at cs.elte.hu
Dániel GerbnerRényi InstituteVerified email at renyi.hu
Balázs PatkósRényi InstituteVerified email at renyi.hu
Eyal AckermanUniversity of Haifa at OranimVerified email at sci.haifa.ac.il
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestVerified email at renyi.hu
Cory PalmerUniversity of MontanaVerified email at umontana.edu
Radoslav FulekNYUVerified email at nyu.edu
Nathan LemonsLos Alamos National LaboratoryVerified email at lanl.gov
Gábor WienerAssociate professor, Budapest University of Technology and EconomicsVerified email at cs.bme.hu
Csaba D. TothCalifornia State University NorthridgeVerified email at csun.edu
Rafel Jaume DeyàVerified email at mi.fu-berlin.de
Géza TóthRenyi Institute and Technical University, BudapestVerified email at renyi.mta.hu
Xuding ZhuZhejiang Normal UniversityVerified email at zjnu.edu.cn
Gábor DamásdiDoctoral Student, Eötvös Loránd UniversityVerified email at caesar.elte.hu
Dániel T. NagyRényi InstituteVerified email at renyi.hu
Abhishek MethukuETH ZürichVerified email at math.ethz.ch
Micha SharirTel Aviv UniversityVerified email at tauex.tau.ac.il
Panagiotis CheilarisPostdoctoral researcher at Università della Svizzera italianaVerified email at usi.ch
Oswin AichholzerProf. Informatik, TU Graz, Graz, AustriaVerified email at ist.tugraz.at
Andrei AsinowskiUniversity of Klagenfurt, AustriaVerified email at aau.at

Balázs Keszegh

Researcher, Alfréd Rényi Institute of Mathematics, Budapest

Verified email at renyi.hu - Homepage

combinatorial geometry computational geometry combinatorics extremal combinatorics graph theory


Title Sort by citations Sort by year Sort by 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	59*	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	54	2013
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs P Cheilaris, B Keszegh, D Pálvölgyi SIAM Journal on Discrete Mathematics 27 (4), 1775-1787, 2013	48	2013
On linear forbidden submatrices B Keszegh Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009	42	2009
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	38	2013
Octants are cover-decomposable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 47, 598-609, 2012	29	2012
Weak Conflict-Free Colorings of Point Sets and Simple Regions B Keszegh CCCG, 97-100, 2007	27	2007
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	26	2008
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	22*	2019
Coloring half-planes and bottomless rectangles B Keszegh Computational geometry 45 (9), 495-507, 2012	22	2012
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	19	2021
Coloring intersection hypergraphs of pseudo-disks B Keszegh Discrete & Computational Geometry 64 (3), 942-964, 2020	18	2020
More on decomposing coverings by octants B Keszegh, D Pálvölgyi Journal of Computational Geometry 6 (1), 300-315., 2015	18	2015
Convex polygons are self-coverable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 51 (4), 885-895, 2014	18	2014
Octants are cover-decomposable into many coverings B Keszegh, D Pálvölgyi Computational Geometry 47 (5), 585-588, 2014	17	2014
Improved upper bounds on the reflexivity of point sets E Ackerman, O Aichholzer, B Keszegh Computational Geometry 42 (3), 241-249, 2009	17	2009
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	16	2018
Coloring points with respect to squares E Ackerman, B Keszegh, M Vizer Discrete & Computational Geometry 58, 757-784, 2017	16	2017
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	16	2013
Proper coloring of geometric hypergraphs B Keszegh, D Pálvölgyi Discrete & Computational Geometry 62 (3), 674-689, 2019	13	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors