Dömötör Pálvölgyi 个人学术档案

引用次数

	总计	2019 年至今
引用	1287	693
h 指数	21	14
i10 指数	46	28

180

135

200820092010201120122013201420152016201720182019202020212022202320248 15 25 23 48 59 85 78 95 65 69 76 92 124 126 174 95

开放获取的出版物数量

查看全部

61 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Balázs KeszeghResearcher, Alfréd Rényi Institute of Mathematics, Budapest在 renyi.hu 的电子邮件经过验证
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute Budapest在 renyi.hu 的电子邮件经过验证
Dániel GerbnerRényi Institute在 renyi.hu 的电子邮件经过验证
Balázs PatkósRényi Institute在 renyi.hu 的电子邮件经过验证
Abhishek MethukuETH Zürich在 math.ethz.ch 的电子邮件经过验证
Nathan LemonsLos Alamos National Laboratory在 lanl.gov 的电子邮件经过验证
Gábor WienerAssociate professor, Budapest University of Technology and Economics在 cs.bme.hu 的电子邮件经过验证
Cory PalmerUniversity of Montana在 umontana.edu 的电子邮件经过验证
Géza TóthRenyi Institute and Technical University, Budapest在 renyi.mta.hu 的电子邮件经过验证
Gábor DamásdiAlfréd Rényi Institute of Mathematics and ELTE Eötvös Loránd University在 caesar.elte.hu 的电子邮件经过验证
Dániel T. NagyRényi Institute在 renyi.hu 的电子邮件经过验证
Jan KynčlCharles University, Prague在 kam.mff.cuni.cz 的电子邮件经过验证
Zoltán Lóránt NagyEötvös University, ELTE Linear hypergraphs research group在 cs.elte.hu 的电子邮件经过验证
Gyuri VenterWarwick Business School在 wbs.ac.uk 的电子邮件经过验证
Eyal AckermanUniversity of Haifa at Oranim在 sci.haifa.ac.il 的电子邮件经过验证
Friedrich EisenbrandEPFL在 epfl.ch 的电子邮件经过验证
Andras GyarfasAlfred renyi institute of Mathematics, Hungarian Academy of Sciences在 renyi.mta.hu 的电子邮件经过验证
Radoslav FulekNYU在 nyu.edu 的电子邮件经过验证
Zoltán KirályELTE Eötvös Loránd University在 cs.elte.hu 的电子邮件经过验证
Miloš StojakovićUniversity of Novi Sad在 dmi.uns.ac.rs 的电子邮件经过验证

关注

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

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

在 cs.elte.hu 的电子邮件经过验证 - 首页

combinatorics combinatorial geometry theoretical computer science


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	58	2013
Indecomposable coverings with concave polygons D Pálvölgyi Discrete & Computational Geometry 44, 577-588, 2010	54	2010
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	53	2013
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	44	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	39	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	26	2021
Unsplittable coverings in the plane J Pach, D Pálvölgyi Advances in Mathematics 302, 433-457, 2016	26	2016
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
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	24	2015
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
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	21	2019

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用