|
|
Personal data sheet |
Print preview personal data approved: 2024. I. 05. Publications |
2017
from data base, 2024. I. 05. |
Methuku A, Pálvölgyi D: Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems, COMBINATORICS PROBABILITY & COMPUTING 26: (4) pp. 593-602. type of document: Journal paper/Article number of independent citations: 18 language: English URL |
2016
from data base, 2024. I. 05. |
Pach J, Palvolgyi D: Unsplittable coverings in the plane, ADVANCES IN MATHEMATICS 302: pp. 433-457. type of document: Journal paper/Article number of independent citations: 11 language: English URL |
2014
from data base, 2024. I. 05. |
B Keszegh, D Pálvölgyi: Convex Polygons are Self-Coverable, DISCRETE AND COMPUTATIONAL GEOMETRY 51: (4) pp. 885-895. type of document: Journal paper/Article number of independent citations: 2 language: English URL |
2013
from data base, 2024. I. 05. |
Eisenbrand F, Pálvölgyi D, Rothvoß T: Bin packing via discrepancy of permutations, ACM TRANSACTIONS ON ALGORITHMS 9: (3) 24 type of document: Journal paper/Article number of independent citations: 17 language: English URL |
2013
from data base, 2024. I. 05. |
Keszegh Balázs, Pach János, Pálvölgyi Dömötör: Drawing Planar Graphs of Bounded Degree with Few Slopes, SIAM JOURNAL ON DISCRETE MATHEMATICS 27: (2) pp. 1171-1183. type of document: Journal paper/Article number of independent citations: 39 language: English URL |
2013
from data base, 2024. I. 05. |
János Pach, Dömötör Pálvölgyi, Géza Tóth: Survey on Decomposition of Multiple Coverings, In: Imre, Bárány; Károly, J Böröczky; Gábor, Fejes Tóth; János, Pach (szerk.) Geometry - Intuitive, Discrete, and Convex, Springer-Verlag (2013) pp. 219-257. type of document: Part of book/Szaktanulmány (to be translated) number of independent citations: 10 language: English URL |
2012
from data base, 2024. I. 05. |
Keszegh B, Pálvölgyi D: Octants are Cover Decomposable, DISCRETE AND COMPUTATIONAL GEOMETRY 47: (3) pp. 598-609. type of document: Journal paper/Article number of independent citations: 7 language: English URL |
2010
from data base, 2024. I. 05. |
D Pálvölgyi, G Tóth: Convex polygons are cover-decoposable, DISCRETE AND COMPUTATIONAL GEOMETRY 43: (3) pp. 483-496. type of document: Journal paper/Article number of independent citations: 22 language: English URL |
2010
from data base, 2024. I. 05. |
Palvolgyi D: Indecomposable Coverings with Concave Polygons, DISCRETE AND COMPUTATIONAL GEOMETRY 44: (3) pp. 577-588. type of document: Journal paper/Article number of independent citations: 22 language: English URL |
2006
from data base, 2024. I. 05. |
J Pach, D Pálvölgyi: Bounded-degree graphs can have arbitrarily large slope numbers, ELECTRONIC JOURNAL OF COMBINATORICS 13: (1) N1 type of document: Journal paper/Article number of independent citations: 35 language: English URL |
| Number of independent citations to these publications: | 183 |
|
|
|
|
|