Følg
Dömötör Pálvölgyi
Dömötör Pálvölgyi
Eötvös Loránd University (ELTE)
Verifisert e-postadresse på cs.elte.hu - Startside
Tittel
Sitert av
Sitert av
År
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
642013
Indecomposable coverings with concave polygons
D Pálvölgyi
Discrete & Computational Geometry 44, 577-588, 2010
602010
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
592013
Bounded-degree graphs can have arbitrarily large slope numbers
J Pach, D Pálvölgyi
the electronic journal of combinatorics 13 (1), N1, 2006
552006
Multiple equilibria in noisy rational expectations economies
D Pálvölgyi, G Venter
Available at SSRN 2524105, 2015
472015
Convex polygons are cover-decomposable
D Pálvölgyi, G Tóth
Discrete & Computational Geometry 43 (3), 483-496, 2010
472010
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
462013
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
412017
Bin packing via discrepancy of permutations
F Eisenbrand, D Pálvölgyi, T Rothvoß
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
392013
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
382013
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
372008
Drawing cubic graphs with the four basic slopes
P Mukkamala, D Pálvölgyi
Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012
362012
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47, 598-609, 2012
342012
Clustered planarity testing revisited
R Fulek, J Kynčl, I Malinović, D Pálvölgyi
Electronic Journal of Combinatorics 22 (4), 1-29, 2015
33*2015
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
292021
Unsplittable coverings in the plane
J Pach, D Pálvölgyi
Advances in Mathematics 302, 433-457, 2016
272016
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
262015
Consistent digital line segments
T Christ, D Pálvölgyi, M Stojaković
Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010
252010
A faster algorithm for finding Tarski fixed points
J Fearnley, D Pálvölgyi, R Savani
ACM Transactions on Algorithms (TALG) 18 (3), 1-23, 2022
242022
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
242019
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20