Követés
Dömötör Pálvölgyi
Dömötör Pálvölgyi
E-mail megerősítve itt: cs.elte.hu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
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
502013
Indecomposable coverings with concave polygons
D Pálvölgyi
Discrete & Computational Geometry 44 (3), 577-588, 2010
482010
Bounded-degree graphs can have arbitrarily large slope numbers
J Pach, D Pálvölgyi
the electronic journal of combinatorics 13 (1), N1, 2006
482006
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
402013
Multiple equilibria in noisy rational expectations economies
D Pálvölgyi, G Venter
Available at SSRN 2524105, 2015
39*2015
Convex polygons are cover-decomposable
D Pálvölgyi, G Tóth
Discrete & Computational Geometry 43 (3), 483-496, 2010
372010
Bin packing via discrepancy of permutations
F Eisenbrand, D Pálvölgyi, T Rothvoß
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
352013
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
342017
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
332008
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47 (3), 598-609, 2012
302012
Survey on decomposition of multiple coverings
J Pach, D Pálvölgyi, G Tóth
Geometry—intuitive, discrete, and convex, 219-257, 2013
292013
Clustered planarity testing revisited
R Fulek, J Kynčl, I Malinović, D Pálvölgyi
Electronic Journal of Combinatorics 22 (4), 1-29, 2015
26*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
262013
Drawing cubic graphs with the four basic slopes
P Mukkamala, D Pálvölgyi
International Symposium on Graph Drawing, 254-265, 2011
242011
Unsplittable coverings in the plane
J Pach, D Pálvölgyi
Advances in Mathematics 302, 433-457, 2016
232016
Consistent digital line segments
T Christ, D Pálvölgyi, M Stojaković
Discrete & Computational Geometry 47 (4), 691-710, 2012
212012
Convex polygons are self-coverable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 51 (4), 885-895, 2014
182014
Octants are cover-decomposable into many coverings
B Keszegh, D Pálvölgyi
Computational Geometry 47 (5), 585-588, 2014
172014
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
172012
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
16*2019
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20