Balázs Keszegh

Citata da

	Tutte	Dal 2018
Citazioni	745	409
Indice H	16	12
i10-index	31	17

100

20082009201020112012201320142015201620172018201920202021202220235 17 18 24 33 43 53 31 55 42 54 51 78 94 73 53

Accesso pubblico

Visualizza tutto

51 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Dömötör PálvölgyiEötvös Loránd University (ELTE)Email verificata su cs.elte.hu
Dániel GerbnerRényi InstituteEmail verificata su renyi.hu
Balázs PatkósRényi InstituteEmail verificata su renyi.hu
Eyal AckermanUniversity of Haifa at OranimEmail verificata su sci.haifa.ac.il
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestEmail verificata su renyi.hu
Cory PalmerUniversity of MontanaEmail verificata su umontana.edu
Radoslav FulekUC San DiegoEmail verificata su ucsd.edu
Nathan LemonsLos Alamos National LaboratoryEmail verificata su lanl.gov
Gábor WienerAssociate professor, Budapest University of Technology and EconomicsEmail verificata su cs.bme.hu
Csaba D. TothCalifornia State University NorthridgeEmail verificata su csun.edu
Rafel Jaume DeyàEmail verificata su mi.fu-berlin.de
Xuding ZhuZhejiang Normal UniversityEmail verificata su zjnu.edu.cn
Géza TóthRenyi Institute and Technical University, BudapestEmail verificata su renyi.mta.hu
Gábor DamásdiDoctoral Student, Eötvös Loránd UniversityEmail verificata su caesar.elte.hu
Dániel T. NagyRényi InstituteEmail verificata su renyi.hu
Abhishek MethukuETH ZürichEmail verificata su math.ethz.ch
Micha SharirTel Aviv UniversityEmail verificata su tauex.tau.ac.il
Panagiotis CheilarisPostdoctoral researcher at Università della Svizzera italianaEmail verificata su usi.ch
Oswin AichholzerProf. Informatik, TU Graz, Graz, AustriaEmail verificata su ist.tugraz.at
Andrei AsinowskiUniversity of Klagenfurt, AustriaEmail verificata su aau.at

Segui

Balázs Keszegh

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

Email verificata su renyi.hu - Home page

combinatorial geometry computational geometry combinatorics extremal combinatorics graph theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	53	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	53*	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	45	2013
On linear forbidden submatrices B Keszegh Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009	38	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	34	2013
Octants are cover-decomposable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 47, 598-609, 2012	28	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	25	2008
Coloring half-planes and bottomless rectangles B Keszegh Computational geometry 45 (9), 495-507, 2012	21	2012
Convex polygons are self-coverable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 51 (4), 885-895, 2014	18	2014
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	17	2021
Coloring intersection hypergraphs of pseudo-disks B Keszegh Discrete & Computational Geometry 64 (3), 942-964, 2020	17	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	17	2019
Octants are cover-decomposable into many coverings B Keszegh, D Pálvölgyi Computational Geometry 47 (5), 585-588, 2014	17	2014
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
More on decomposing coverings by octants B Keszegh, D Pálvölgyi Journal of Computational Geometry 6 (1), 300-315., 2015	16	2015
Improved upper bounds on the reflexivity of point sets E Ackerman, O Aichholzer, B Keszegh Computational Geometry 42 (3), 241-249, 2009	16	2009
Coloring points with respect to squares E Ackerman, B Keszegh, M Vizer Discrete & Computational Geometry 58, 757-784, 2017	15	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	14	2013
Nonrepetitive colorings of lexicographic product of graphs B Keszegh, B Patkós, X Zhu Discrete Mathematics and Theoretical Computer Science 16 (2), 97--110, 2014	13	2014

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori