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

Cited by

	All	Since 2019
Citations	1315	721
h-index	21	15
i10-index	48	30

180

135

200820092010201120122013201420152016201720182019202020212022202320248 15 25 23 48 59 85 78 95 65 69 77 93 124 123 171 126

Public access

View all

61 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
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestVerified email at renyi.hu
Dániel GerbnerRényi InstituteVerified email at renyi.hu
Balázs PatkósRényi InstituteVerified email at renyi.hu
Abhishek MethukuUniversity of Illinois Urbana-ChampaignVerified email at illinois.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
Cory PalmerUniversity of MontanaVerified email at umontana.edu
Gábor DamásdiAlfréd Rényi Institute of Mathematics and ELTE Eötvös Loránd UniversityVerified email at caesar.elte.hu
Géza TóthRenyi Institute and Technical University, BudapestVerified email at renyi.mta.hu
Dániel T. NagyEötvös Loránd UniversityVerified email at inf.elte.hu
Zoltán Lóránt NagyEötvös University, ELTE Linear hypergraphs research groupVerified email at cs.elte.hu
Jan KynčlCharles University, PragueVerified email at kam.mff.cuni.cz
Gyuri VenterAarhus University, School of Business and Social SciencesVerified email at econ.au.dk
Eyal AckermanUniversity of Haifa at OranimVerified email at sci.haifa.ac.il
Andras GyarfasAlfred renyi institute of Mathematics, Hungarian Academy of SciencesVerified email at renyi.mta.hu
Friedrich EisenbrandEPFLVerified email at epfl.ch
Zoltán KirályELTE Eötvös Loránd UniversityVerified email at cs.elte.hu
Radoslav FulekNYUVerified email at nyu.edu
Kern, WalterUniversiteit TwenteVerified email at utwente.nl

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	59	2013
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	56	2013
Indecomposable coverings with concave polygons D Pálvölgyi Discrete & Computational Geometry 44, 577-588, 2010	54	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	51	2006
Multiple equilibria in noisy rational expectations economies D Pálvölgyi, G Venter Available at SSRN 2524105, 2015	47	2015
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	45	2013
Convex polygons are cover-decomposable D Pálvölgyi, G Tóth Discrete & Computational Geometry 43 (3), 483-496, 2010	42	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	40	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	39	2013
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	35	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	35	2008
Drawing cubic graphs with the four basic slopes P Mukkamala, D Pálvölgyi Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012	34	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	32*	2015
Octants are cover-decomposable B Keszegh, D Pálvölgyi Discrete & Computational Geometry 47, 598-609, 2012	31	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	28	2021
Unsplittable coverings in the plane J Pach, D Pálvölgyi Advances in Mathematics 302, 433-457, 2016	26	2016
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes B Keszegh, D Pálvölgyi International Workshop on Graph-Theoretic Concepts in Computer Science, 266-280, 2015	25	2015
Consistent digital line segments T Christ, D Pálvölgyi, M Stojaković Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010	25	2010
Generalized matching games for international kidney exchange W Kern, P Biró, D Pálvölgyi, D Paulusma 18th International Conference on Autonomous Agents and Multiagent Systems …, 2019	22	2019
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	22	2012

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