×

zbMATH — the first resource for mathematics

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

Compute Distance To:
Author ID: palvolgyi.domotor Recent zbMATH articles by "Pálvölgyi, Dömötör"
Published as: Pálvölgyi, Dömötör; Palvolgyi, Dömötör; Pålvölgyi, Dömötör; Pálvőlgyi, Dőmőtőr
Homepage: http://www.cs.elte.hu/~dom
External Links: MGP · ORCID · ResearchGate · MathOverflow · dblp
Documents Indexed: 78 Publications since 2006

Publications by Year

Citations contained in zbMATH Open

53 Publications have been cited 233 times in 139 Documents Cited by Year
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. Zbl 1292.05107
Cheilaris, Panagiotis; Keszegh, Balázs; Pálvölgyi, Dömötör
14
2013
Indecomposable coverings with concave polygons. Zbl 1211.52017
Pálvölgyi, Dömötör
14
2010
Bounded-degree graphs can have arbitrarily large slope numbers. Zbl 1080.05064
Pach, János; Pálvölgyi, Dömötör
12
2006
Octants are cover-decomposable. Zbl 1237.52013
Keszegh, Balázs; Pálvölgyi, Dömötör
12
2012
Forbidden hypermatrices imply general bounds on induced forbidden subposet problems. Zbl 1371.05301
Methuku, Abhishek; Pálvölgyi, Dömötör
11
2017
Convex polygons are cover-decomposable. Zbl 1194.52017
Pálvölgyi, Dömötör; Tóth, Géza
11
2010
Drawing planar graphs of bounded degree with few slopes. Zbl 1272.05133
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör
9
2013
Bin packing via discrepancy of permutations. Zbl 1301.68196
Eisenbrand, Friedrich; Pálvölgyi, Dömötör; Rothvoß, Thomas
9
2013
Clustered planarity testing revisited. Zbl 1327.05076
Fulek, Radoslav; Kynčl, Jan; Malinović, Igor; Pálvölgyi, Dömötör
8
2015
Saturating Sperner families. Zbl 1272.05212
Gerbner, Dániel; Keszegh, Balázs; Lemons, Nathan; Palmer, Cory; Pálvölgyi, Dömötör; Patkós, Balázs
8
2013
Octants are cover-decomposable into many coverings. Zbl 1285.05061
Keszegh, Balázs; Pálvölgyi, Dömötör
7
2014
Convex polygons are self-coverable. Zbl 1302.52002
Keszegh, Balázs; Pálvölgyi, Dömötör
7
2014
Survey on decomposition of multiple coverings. Zbl 1319.52024
Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
7
2013
Majority and plurality problems. Zbl 1263.68047
Gerbner, Dániel; Katona, Gyula O. H.; Pálvölgyi, Dömötör; Patkós, Balázs
6
2013
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. Zbl 1417.05069
Keszegh, Balázs; Pálvölgyi, Dömötör
5
2016
Drawing cubic graphs with the four basic slopes. Zbl 1311.68121
Mukkamala, Padmini; Pálvölgyi, Dömötör
5
2012
More on decomposing coverings by octants. Zbl 1405.52018
Keszegh, Balázs; Pálvölgyi, Dömötör
5
2015
Permutations, hyperplanes and polynomials over finite fields. Zbl 1245.11116
Gács, András; Héger, Tamás; Nagy, Zoltán Lóránt; Pálvölgyi, Dömötör
5
2010
Drawing cubic graphs with at most five slopes. Zbl 1154.05020
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
5
2008
Density-based group testing. Zbl 1309.68081
Gerbner, Dániel; Keszegh, Balázs; Pálvőlgyi, Dőmőtőr; Wiener, Gábor
5
2013
Unsplittable coverings in the plane. Zbl 1350.52007
Pach, János; Pálvölgyi, Dömötör
4
2016
Finding a non-minority ball with majority answers. Zbl 1356.68158
Gerbner, Dániel; Keszegh, Balázs; Pálvölgyi, Dömötör; Patkós, Balázs; Vizer, Máté; Wiener, Gábor
4
2017
Domination in transitive colorings of tournaments. Zbl 1298.05132
Pálvölgyi, Dömötör; Gyárfás, András
4
2014
Combinatorial necklace splitting. Zbl 1186.05017
Pálvölgyi, Dömötör
4
2009
Unified Hanani-Tutte theorem. Zbl 1369.05045
Fulek, Radoslav; Kynčl, Jan; Pálvölgyi, Dömötör
3
2017
Consistent digital line segments. Zbl 1259.65039
Christ, Tobias; Pálvölgyi, Dömötör; Stojaković, Miloš
3
2012
Online and quasi-online colorings of wedges and intervals. Zbl 1303.68161
Keszegh, Balázs; Lemons, Nathan; Pálvölgyi, Dömötör
3
2013
Lower bounds on the obstacle number of graphs. Zbl 1243.05176
Mukkamala, Padmini; Pach, János; Pálvölgyi, Dömötör
3
2012
On families of weakly cross-intersecting set-pairs. Zbl 1244.05222
Király, Zoltán; Nagy, Zoltán L.; Pálvölgyi, Dömötör; Visontai, Mirkó
3
2012
Polychromatic colorings of arbitrary rectangular partitions. Zbl 1198.05047
Gerbner, Dániel; Keszegh, Balázs; Lemons, Nathan; Palmer, Cory; Pálvölgyi, Dömötör; Patkós, Balázs
3
2010
Testing additive integrality gaps. Zbl 1280.90086
Eisenbrand, Friedrich; Hähnle, Nicolai; Pálvölgyi, Dömötör; Shmonin, Gennady
3
2013
Proper coloring of geometric hypergraphs. Zbl 1430.68377
Keszegh, Balázs; Pálvölgyi, Dömötör
2
2017
Clustered planarity testing revisited. Zbl 1427.05061
Fulek, Radoslav; Kynčl, Jan; Malinović, Igor; Pálvölgyi, Dömötör
2
2014
Partitioning to three matchings of given size is NP-complete for bipartite graphs. Zbl 1306.05194
Pálvölgyi, Dömötör
2
2014
Topological orderings of weighted directed acyclic graphs. Zbl 1358.05132
Gerbner, Dániel; Keszegh, Balázs; Palmer, Cory; Pálvölgyi, Dömötör
2
2016
Advantage in the discrete Voronoi game. Zbl 1302.05118
Gerbner, Dániel; Mészáros, Viola; Pálvölgyi, Dömötör; Pokrovskiy, Alexey; Rote, Günter
2
2014
Drawing cubic graphs with at most five slopes. Zbl 1185.68486
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
2
2007
Drawing planar graphs of bounded degree with few slopes. Zbl 1314.68234
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör
2
2011
Cubic graphs have bounded slope parameter. Zbl 1283.05189
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
2
2010
Bin packing via discrepancy of permutations. Zbl 1376.90048
Eisenbrand, Friedrich; Pálvölgyi, Dömötör; Rothvoß, Thomas
2
2011
Proper coloring of geometric hypergraphs. Zbl 1430.68378
Keszegh, Balázs; Pálvölgyi, Dömötör
1
2019
Finding a majority ball with majority answers. Zbl 1386.68113
Vizer, Máté; Gerbner, Dániel; Keszegh, Balázs; Pálvölgyi, Dömötör; Patkós, Balázs; Wiener, Gábor
1
2015
Unsplittable coverings in the plane. Zbl 1417.52024
Pach, János; Pálvölgyi, Dömötör
1
2016
Distribution of colors in Gallai colorings. Zbl 1437.05072
Gyárfás, András; Pálvölgyi, Dömötör; Patkós, Balázs; Wales, Matthew
1
2020
Online and quasi-online colorings of wedges and intervals. Zbl 1361.05050
Keszegh, Balázs; Lemons, Nathan; Pálvölgyi, Dömötör
1
2016
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. Zbl 1417.05070
Keszegh, Balázs; Pálvölgyi, Dömötör
1
2019
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. Zbl 07245483
Keszegh, Balázs; Pálvölgyi, Dömötör
1
2020
Partitionability to two trees in NP-complete. Zbl 1240.05243
Pálvölgyi, Dömötör
1
2009
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. Zbl 1298.05108
Cheilaris, Panagiotis; Keszegh, Balázs; Pálvölgyi, Dömötör
1
2012
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions. Zbl 1202.91044
Mukkamala, Padmini; Pálvölgyi, Dömötör
1
2010
Regular families of forests, antichains and duality pairs of relational structures. Zbl 1399.68066
Erdős, Péter; Pálvölgyi, Dömötör; Tardif, Vlaude; Tardos, Gábor
1
2017
Exponential lower bound for Berge-Ramsey problems. Zbl 07375719
Pálvölgyi, Dömötör
1
2021
Induced and non-induced poset saturation problems. Zbl 07385225
Keszegh, Balázs; Lemons, Nathan; Martin, Ryan R.; Pálvölgyi, Dömötör; Patkós, Balázs
1
2021
Exponential lower bound for Berge-Ramsey problems. Zbl 07375719
Pálvölgyi, Dömötör
1
2021
Induced and non-induced poset saturation problems. Zbl 07385225
Keszegh, Balázs; Lemons, Nathan; Martin, Ryan R.; Pálvölgyi, Dömötör; Patkós, Balázs
1
2021
Distribution of colors in Gallai colorings. Zbl 1437.05072
Gyárfás, András; Pálvölgyi, Dömötör; Patkós, Balázs; Wales, Matthew
1
2020
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. Zbl 07245483
Keszegh, Balázs; Pálvölgyi, Dömötör
1
2020
Proper coloring of geometric hypergraphs. Zbl 1430.68378
Keszegh, Balázs; Pálvölgyi, Dömötör
1
2019
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. Zbl 1417.05070
Keszegh, Balázs; Pálvölgyi, Dömötör
1
2019
Forbidden hypermatrices imply general bounds on induced forbidden subposet problems. Zbl 1371.05301
Methuku, Abhishek; Pálvölgyi, Dömötör
11
2017
Finding a non-minority ball with majority answers. Zbl 1356.68158
Gerbner, Dániel; Keszegh, Balázs; Pálvölgyi, Dömötör; Patkós, Balázs; Vizer, Máté; Wiener, Gábor
4
2017
Unified Hanani-Tutte theorem. Zbl 1369.05045
Fulek, Radoslav; Kynčl, Jan; Pálvölgyi, Dömötör
3
2017
Proper coloring of geometric hypergraphs. Zbl 1430.68377
Keszegh, Balázs; Pálvölgyi, Dömötör
2
2017
Regular families of forests, antichains and duality pairs of relational structures. Zbl 1399.68066
Erdős, Péter; Pálvölgyi, Dömötör; Tardif, Vlaude; Tardos, Gábor
1
2017
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. Zbl 1417.05069
Keszegh, Balázs; Pálvölgyi, Dömötör
5
2016
Unsplittable coverings in the plane. Zbl 1350.52007
Pach, János; Pálvölgyi, Dömötör
4
2016
Topological orderings of weighted directed acyclic graphs. Zbl 1358.05132
Gerbner, Dániel; Keszegh, Balázs; Palmer, Cory; Pálvölgyi, Dömötör
2
2016
Unsplittable coverings in the plane. Zbl 1417.52024
Pach, János; Pálvölgyi, Dömötör
1
2016
Online and quasi-online colorings of wedges and intervals. Zbl 1361.05050
Keszegh, Balázs; Lemons, Nathan; Pálvölgyi, Dömötör
1
2016
Clustered planarity testing revisited. Zbl 1327.05076
Fulek, Radoslav; Kynčl, Jan; Malinović, Igor; Pálvölgyi, Dömötör
8
2015
More on decomposing coverings by octants. Zbl 1405.52018
Keszegh, Balázs; Pálvölgyi, Dömötör
5
2015
Finding a majority ball with majority answers. Zbl 1386.68113
Vizer, Máté; Gerbner, Dániel; Keszegh, Balázs; Pálvölgyi, Dömötör; Patkós, Balázs; Wiener, Gábor
1
2015
Octants are cover-decomposable into many coverings. Zbl 1285.05061
Keszegh, Balázs; Pálvölgyi, Dömötör
7
2014
Convex polygons are self-coverable. Zbl 1302.52002
Keszegh, Balázs; Pálvölgyi, Dömötör
7
2014
Domination in transitive colorings of tournaments. Zbl 1298.05132
Pálvölgyi, Dömötör; Gyárfás, András
4
2014
Clustered planarity testing revisited. Zbl 1427.05061
Fulek, Radoslav; Kynčl, Jan; Malinović, Igor; Pálvölgyi, Dömötör
2
2014
Partitioning to three matchings of given size is NP-complete for bipartite graphs. Zbl 1306.05194
Pálvölgyi, Dömötör
2
2014
Advantage in the discrete Voronoi game. Zbl 1302.05118
Gerbner, Dániel; Mészáros, Viola; Pálvölgyi, Dömötör; Pokrovskiy, Alexey; Rote, Günter
2
2014
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. Zbl 1292.05107
Cheilaris, Panagiotis; Keszegh, Balázs; Pálvölgyi, Dömötör
14
2013
Drawing planar graphs of bounded degree with few slopes. Zbl 1272.05133
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör
9
2013
Bin packing via discrepancy of permutations. Zbl 1301.68196
Eisenbrand, Friedrich; Pálvölgyi, Dömötör; Rothvoß, Thomas
9
2013
Saturating Sperner families. Zbl 1272.05212
Gerbner, Dániel; Keszegh, Balázs; Lemons, Nathan; Palmer, Cory; Pálvölgyi, Dömötör; Patkós, Balázs
8
2013
Survey on decomposition of multiple coverings. Zbl 1319.52024
Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
7
2013
Majority and plurality problems. Zbl 1263.68047
Gerbner, Dániel; Katona, Gyula O. H.; Pálvölgyi, Dömötör; Patkós, Balázs
6
2013
Density-based group testing. Zbl 1309.68081
Gerbner, Dániel; Keszegh, Balázs; Pálvőlgyi, Dőmőtőr; Wiener, Gábor
5
2013
Online and quasi-online colorings of wedges and intervals. Zbl 1303.68161
Keszegh, Balázs; Lemons, Nathan; Pálvölgyi, Dömötör
3
2013
Testing additive integrality gaps. Zbl 1280.90086
Eisenbrand, Friedrich; Hähnle, Nicolai; Pálvölgyi, Dömötör; Shmonin, Gennady
3
2013
Octants are cover-decomposable. Zbl 1237.52013
Keszegh, Balázs; Pálvölgyi, Dömötör
12
2012
Drawing cubic graphs with the four basic slopes. Zbl 1311.68121
Mukkamala, Padmini; Pálvölgyi, Dömötör
5
2012
Consistent digital line segments. Zbl 1259.65039
Christ, Tobias; Pálvölgyi, Dömötör; Stojaković, Miloš
3
2012
Lower bounds on the obstacle number of graphs. Zbl 1243.05176
Mukkamala, Padmini; Pach, János; Pálvölgyi, Dömötör
3
2012
On families of weakly cross-intersecting set-pairs. Zbl 1244.05222
Király, Zoltán; Nagy, Zoltán L.; Pálvölgyi, Dömötör; Visontai, Mirkó
3
2012
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. Zbl 1298.05108
Cheilaris, Panagiotis; Keszegh, Balázs; Pálvölgyi, Dömötör
1
2012
Drawing planar graphs of bounded degree with few slopes. Zbl 1314.68234
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör
2
2011
Bin packing via discrepancy of permutations. Zbl 1376.90048
Eisenbrand, Friedrich; Pálvölgyi, Dömötör; Rothvoß, Thomas
2
2011
Indecomposable coverings with concave polygons. Zbl 1211.52017
Pálvölgyi, Dömötör
14
2010
Convex polygons are cover-decomposable. Zbl 1194.52017
Pálvölgyi, Dömötör; Tóth, Géza
11
2010
Permutations, hyperplanes and polynomials over finite fields. Zbl 1245.11116
Gács, András; Héger, Tamás; Nagy, Zoltán Lóránt; Pálvölgyi, Dömötör
5
2010
Polychromatic colorings of arbitrary rectangular partitions. Zbl 1198.05047
Gerbner, Dániel; Keszegh, Balázs; Lemons, Nathan; Palmer, Cory; Pálvölgyi, Dömötör; Patkós, Balázs
3
2010
Cubic graphs have bounded slope parameter. Zbl 1283.05189
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
2
2010
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions. Zbl 1202.91044
Mukkamala, Padmini; Pálvölgyi, Dömötör
1
2010
Combinatorial necklace splitting. Zbl 1186.05017
Pálvölgyi, Dömötör
4
2009
Partitionability to two trees in NP-complete. Zbl 1240.05243
Pálvölgyi, Dömötör
1
2009
Drawing cubic graphs with at most five slopes. Zbl 1154.05020
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
5
2008
Drawing cubic graphs with at most five slopes. Zbl 1185.68486
Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
2
2007
Bounded-degree graphs can have arbitrarily large slope numbers. Zbl 1080.05064
Pach, János; Pálvölgyi, Dömötör
12
2006
all top 5

Cited by 237 Authors

19 Keszegh, Balázs
17 Pálvölgyi, Dömötör
8 Patkós, Balázs
7 Gerbner, Dániel
7 Vizer, Máté
6 Fulek, Radoslav
5 Jendrol’, Stanislav
5 Liotta, Giuseppe
5 Montecchiani, Fabrizio
4 Di Giacomo, Emilio
4 Martin, Ryan R.
4 Methuku, Abhishek
4 Nagy, Dániel T.
4 Pach, János
3 Ackerman, Eyal
3 Bekos, Michael A.
3 Dujmović, Vida
3 Eppstein, David Arthur
3 Katona, Gyula O. H.
3 Li, Xueliang
3 Tuza, Zsolt
3 Wiener, Gábor
2 Aliev, Iskander M.
2 Angelini, Patrizio
2 Bérczi, Kristóf
2 Chang, Hong
2 Chang, Huilan
2 Czap, Július
2 Da Lozzo, Giordano
2 Damásdi, Gábor
2 Doan, Trung Duy
2 Frank, András
2 Gibson, Matthew R.
2 Huang, Zhong
2 Iori, Manuel
2 Kurz, Sascha
2 Lemons, Nathan
2 Li, Jiyou
2 Lidický, Bernard
2 Lu, Linyuan
2 Meunier, Frédéric
2 Micek, Piotr
2 Mukkamala, Padmini
2 Rothvoß, Thomas
2 Scheithauer, Guntram
2 Schiermeyer, Ingo
2 Smith, Heather C.
2 Smorodinsky, Shakhar
2 Suderman, Matthew
2 Thomassé, Stéphan
2 Tomon, István
2 Tompkins, Casey
2 Vrbjarová, Michaela
2 Walker, Shanise
2 Wood, David Ronald
1 Ahlswede, Rudolf
1 Alam, Jawaherul Md.
1 Andova, Vesna
1 Axenovich, Maria A.
1 Badakhshian, Leila
1 Balko, Martin
1 Balogh, József
1 Banik, Aritra
1 Bansal, Michael Martin Nikhil
1 Bansal, Nikhil
1 Beaudou, Laurent
1 Bera, Sahadev
1 Bernáth, Attila
1 Bhattacharya, Bhargab Bikram
1 Bhattacharya, Bhaswar B.
1 Bhowmick, Partha
1 Bishnu, Arijit
1 Biswas, Sudip
1 Bokov, Grigoriy V.
1 Bonnet, Edouard
1 Borzyszkowski, Andrzej M.
1 Bousquet, Nicolas
1 Bujtás, Csilla
1 Cabello, Sergio
1 Caprara, Alberto
1 Chaplick, Steven
1 Chiu, Man-Kwun
1 Choi, Jeong-Ok
1 Chowdhury, Iffat
1 Christensen, Henrik I.
1 Chu, Han-Min
1 Chudnovsky, Maria
1 Cibulka, Josef
1 Colin de Verdière, Éric
1 Daneshpajouh, Hamid Reza
1 Das, Sandip
1 Dell’Amico, Mauro
1 Delorme, Maxence
1 Deppe, Christian
1 Devroye, Luc P. J. A.
1 Díaz, José Carlos Díaz
1 Didimo, Walter
1 Dimitrov, Darko
1 Eades, Peter
1 Eisenbrand, Friedrich
...and 137 more Authors

Citations by Year