Balázs Keszegh

Cited by

	All	Since 2020
Citations	997	520
h-index	18	13
i10-index	37	18

140

105

2008200920102011201220132014201520162017201820192020202120222023202420256 16 23 24 38 45 54 47 57 44 52 46 69 91 85 121 111 40

Public access

View all

56 articles

1 article

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
Csaba D. TothCalifornia State University NorthridgeVerified email at csun.edu
Gábor WienerAssociate professor, Budapest University of Technology and EconomicsVerified email at cs.bme.hu
Nathan LemonsLos Alamos National LaboratoryVerified email at lanl.gov
Radoslav FulekNYUVerified email at nyu.edu
Gábor DamásdiAlfréd Rényi Institute of Mathematics and ELTE Eötvös Loránd UniversityVerified email at caesar.elte.hu
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
Dániel T. NagyEötvös Loránd UniversityVerified email at inf.elte.hu
Abhishek MethukuUniversity of Illinois Urbana-ChampaignVerified email at illinois.edu
Panagiotis CheilarisPostdoctoral researcher at Università della Svizzera italianaVerified email at usi.ch
Micha SharirTel Aviv UniversityVerified email at tauex.tau.ac.il
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
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	64	2013
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	64*	2012
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	59	2013
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	48	2013
On linear forbidden submatrices B Keszegh Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009	47	2009
Octants are cover-decomposable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 47, 598-609, 2012	34	2012
Weak Conflict-Free Colorings of Point Sets and Simple Regions B Keszegh CCCG, 97-100, 2007	33	2007
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	31	2021
Coloring half-planes and bottomless rectangles B Keszegh Computational geometry 45 (9), 495-507, 2012	28	2012
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	28	2008
Coloring intersection hypergraphs of pseudo-disks B Keszegh Discrete & Computational Geometry 64 (3), 942-964, 2020	27	2020
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	27*	2019
More on decomposing coverings by octants B Keszegh, D Pálvölgyi Journal of Computational Geometry 6 (1), 300-315., 2015	24	2015
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs E Ackerman, B Keszegh, D Pálvölgyi SIAM Journal on Discrete Mathematics 34 (4), 2250-2269, 2020	23	2020
Convex polygons are self-coverable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 51 (4), 885-895, 2014	23	2014
Octants are cover-decomposable into many coverings B Keszegh, D Pálvölgyi Computational Geometry 47 (5), 585-588, 2014	22	2014
Coloring points with respect to squares E Ackerman, B Keszegh, M Vizer Discrete & Computational Geometry 58, 757-784, 2017	21	2017
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	20	2016
Improved upper bounds on the reflexivity of point sets E Ackerman, O Aichholzer, B Keszegh Computational Geometry 42 (3), 241-249, 2009	18	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	17	2018

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