Dömötör Pálvölgyi

Cited by

	All	Since 2018
Citations	1085	573
h-index	18	13
i10-index	37	20

140

105

200720082009201020112012201320142015201620172018201920202021202220233 6 17 25 24 46 63 87 61 97 64 68 81 96 126 120 77

Public access

View all

56 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Balázs KeszeghResearcher, Alfréd Rényi Institute of Mathematics, BudapestVerified email at renyi.hu
Dániel GerbnerRényi InstituteVerified email at renyi.hu
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestVerified email at renyi.hu
Balázs PatkósRényi InstituteVerified email at renyi.hu
Nathan LemonsLos Alamos National LaboratoryVerified email at lanl.gov
Gábor WienerAssociate professor, Budapest University of Technology and EconomicsVerified email at cs.bme.hu
Abhishek MethukuETH ZürichVerified email at math.ethz.ch
Cory PalmerUniversity of MontanaVerified email at umontana.edu
Géza TóthRenyi Institute and Technical University, BudapestVerified email at renyi.mta.hu
Jan KynčlCharles University, PragueVerified email at kam.mff.cuni.cz
Zoltán Lóránt NagyEötvös University, ELTE Linear hypergraphs research groupVerified email at cs.elte.hu
Gyuri VenterWarwick Business SchoolVerified email at wbs.ac.uk
Dániel T. NagyRényi InstituteVerified email at renyi.hu
Gábor DamásdiDoctoral Student, Eötvös Loránd UniversityVerified email at caesar.elte.hu
Andras GyarfasAlfred renyi institute of Mathematics, Hungarian Academy of SciencesVerified email at renyi.mta.hu
Friedrich EisenbrandEPFLVerified email at epfl.ch
Eyal AckermanUniversity of Haifa at OranimVerified email at sci.haifa.ac.il
Radoslav FulekUC San DiegoVerified email at ucsd.edu
Zoltán KirályELTE Eötvös Loránd UniversityVerified email at cs.elte.hu
Gyula O.H. KatonaRenyi InstituteVerified email at renyi.hu

Dömötör Pálvölgyi

Eötvös Loránd University (ELTE)

Verified email at cs.elte.hu - Homepage

combinatorics combinatorial geometry theoretical computer science


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	53	2013
Indecomposable coverings with concave polygons D Pálvölgyi Discrete & Computational Geometry 44, 577-588, 2010	49	2010
Bounded-degree graphs can have arbitrarily large slope numbers J Pach, D Pálvölgyi the electronic journal of combinatorics 13 (1), N1, 2006	49	2006
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs P Cheilaris, B Keszegh, D Palvolgyi SIAM Journal on Discrete Mathematics 27 (4), 1775-1787, 2013	45	2013
Multiple equilibria in noisy rational expectations economies D Pálvölgyi, G Venter Available at SSRN 2524105, 2015	38	2015
Convex polygons are cover-decomposable D Pálvölgyi, G Tóth Discrete & Computational Geometry 43 (3), 483-496, 2010	38	2010
Forbidden hypermatrices imply general bounds on induced forbidden subposet problems A Methuku, D Pálvölgyi Combinatorics, Probability and Computing 26 (4), 593-602, 2017	37	2017
Bin packing via discrepancy of permutations F Eisenbrand, D Pálvölgyi, T Rothvoß ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013	37	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	34	2013
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	33	2008
Survey on decomposition of multiple coverings J Pach, D Pálvölgyi, G Tóth Geometry—Intuitive, Discrete, and Convex: A Tribute to László Fejes Tóth …, 2013	30	2013
Drawing cubic graphs with the four basic slopes P Mukkamala, D Pálvölgyi Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012	29	2012
Clustered planarity testing revisited R Fulek, J Kynčl, I Malinović, D Pálvölgyi Electronic Journal of Combinatorics 22 (4), 1-29, 2015	28*	2015
Octants are cover-decomposable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 47, 598-609, 2012	28	2012
Unsplittable coverings in the plane J Pach, D Pálvölgyi Advances in Mathematics 302, 433-457, 2016	23	2016
Consistent digital line segments T Christ, D Pálvölgyi, M Stojaković Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010	21	2010
Lower bounds on the obstacle number of graphs P Mukkamala, J Pach, D Pálvölgyi Electronic Journal of Combinatorics 19 (2), 1-8, 2012	20	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
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-1–26, 2019	17	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