Balázs Keszegh

Dikutip oleh

	Semua	Sejak 2020
Kutipan	978	501
indeks-h	18	13
indeks-i10	37	18

120

2008200920102011201220132014201520162017201820192020202120222023202420256 16 23 24 37 46 54 47 57 44 52 46 69 91 77 119 111 31

Akses publik

Lihat semua

56 artikel

1 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

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

Ikuti

Balázs Keszegh

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

Email yang diverifikasi di renyi.hu - Beranda

combinatorial geometry computational geometry combinatorics extremal combinatorics graph theory


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
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
On linear forbidden submatrices B Keszegh Journal of Combinatorial Theory, Series A 116 (1), 232-241, 2009	47	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	46	2013
Octants are cover-decomposable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 47, 598-609, 2012	33	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	29	2021
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 half-planes and bottomless rectangles B Keszegh Computational geometry 45 (9), 495-507, 2012	27	2012
Coloring intersection hypergraphs of pseudo-disks B Keszegh Discrete & Computational Geometry 64 (3), 942-964, 2020	26	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	26*	2019
More on decomposing coverings by octants B Keszegh, D Pálvölgyi Journal of Computational Geometry 6 (1), 300-315., 2015	22	2015
Octants are cover-decomposable into many coverings B Keszegh, D Pálvölgyi Computational Geometry 47 (5), 585-588, 2014	22	2014
Convex polygons are self-coverable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 51 (4), 885-895, 2014	22	2014
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	21	2020
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
Coloring points with respect to squares E Ackerman, B Keszegh, M Vizer Discrete & Computational Geometry 58, 757-784, 2017	19	2017
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

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama