Dömötör Pálvölgyi
Título
Citado por
Citado por
Ano
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
422013
Bounded-degree graphs can have arbitrarily large slope numbers
J Pach, D Pálvölgyi
the electronic journal of combinatorics 13 (1), N1, 2006
412006
Indecomposable coverings with concave polygons
D Pálvölgyi
Discrete & Computational Geometry 44 (3), 577-588, 2010
392010
Convex polygons are cover-decomposable
D Pálvölgyi, G Tóth
Discrete & Computational Geometry 43 (3), 483-496, 2010
312010
Drawing cubic graphs with at most five slopes
B Keszegh, J Pach, D Pálvölgyi, G Tóth
Computational Geometry-Theory and Applications 40 (ARTICLE), 138-147, 2008
312008
Unique-maximum and conflict-free colorings for hypergraphs and tree graphs
P Cheilaris, B Keszegh, D Palvolgyi
Arxiv preprint arXiv:1002.4210, 2010
302010
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
292017
Bin packing via discrepancy of permutations
F Eisenbrand, D Pálvölgyi, T Rothvoß
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
292013
Survey on decomposition of multiple coverings
J Pach, D Pálvölgyi, G Tóth
Geometry—intuitive, discrete, and convex, 219-257, 2013
252013
Multiple equilibria in noisy rational expectations economies
D Pálvölgyi, G Venter
Available at SSRN 2524105, 2015
24*2015
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47 (3), 598-609, 2012
242012
Clustered planarity testing revisited
R Fulek, J Kynčl, I Malinović, D Pálvölgyi
arXiv preprint arXiv:1305.4519, 2013
22*2013
Drawing cubic graphs with the four basic slopes
P Mukkamala, D Pálvölgyi
International Symposium on Graph Drawing, 254-265, 2011
202011
Consistent digital line segments
T Christ, D Pálvölgyi, M Stojaković
Discrete & Computational Geometry 47 (4), 691-710, 2012
182012
Octants are cover-decomposable into many coverings
B Keszegh, D Pálvölgyi
Computational Geometry 47 (5), 585-588, 2014
172014
Decomposition of geometric set systems and graphs
D Pálvölgyi
arXiv preprint arXiv:1009.4641, 2010
162010
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
152013
Unsplittable coverings in the plane
J Pach, D Pálvölgyi
Advances in Mathematics 302, 433-457, 2016
142016
Convex polygons are self-coverable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 51 (4), 885-895, 2014
142014
Permutations, hyperplanes and polynomials over finite fields
A Gács, T Héger, ZL Nagy, D Palvolgyi
Finite Fields and Their Applications 16 (5), 301-314, 2010
142010
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20