default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDömötör Pálvölgyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]János Barát, Andrzej Grzesik, Attila Jung
, Zoltán Lóránt Nagy, Dömötör Pálvölgyi:
The double Hall property and cycle covers in bipartite graphs. Discret. Math. 347(9): 114079 (2024)- [j68]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
On tangencies among planar curves with an application to coloring L-shapes. Eur. J. Comb. 121: 103837 (2024) - [j67]Peter Frankl, János Pach, Dömötör Pálvölgyi:
Odd-sunflowers. J. Comb. Theory, Ser. A 206: 105889 (2024) - [i47]Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR abs/2404.05045 (2024) - [i46]Balázs Keszegh, Dömötör Pálvölgyi:
On dual-ABAB-free and related hypergraphs. CoRR abs/2406.13321 (2024) - 2023
- [j66]Balázs Keszegh, Dömötör Pálvölgyi:
The Number of Tangencies Between Two Families of Curves. Comb. 43(5): 939-952 (2023) - [j65]Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan:
Colouring bottomless rectangles and arborescences. Comput. Geom. 115: 102020 (2023) - [j64]Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [j63]Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi:
Almost-Monochromatic Sets and the Chromatic Number of the Plane. Discret. Comput. Geom. 70(3): 753-772 (2023) - [j62]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer:
Turán problems for edge-ordered graphs. J. Comb. Theory B 160: 66-113 (2023) - [i45]Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Partitioned Matching Games for International Kidney Exchange. CoRR abs/2301.13181 (2023) - [i44]Dömötör Pálvölgyi:
Note on polychromatic coloring of hereditary hypergraph families. CoRR abs/2309.04603 (2023) - [i43]Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Query complexity of Boolean functions on the middle slice of the cube. CoRR abs/2309.13678 (2023) - [i42]Attila Jung, Dömötör Pálvölgyi:
k-dimensional transversals for balls. CoRR abs/2311.15646 (2023) - 2022
- [j61]Gábor Damásdi, Dömötör Pálvölgyi:
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks. Comb. 42(6): 1027-1048 (2022) - [j60]Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi:
On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. Electron. J. Comb. 29(3) (2022) - [j59]Dömötör Pálvölgyi:
Radon Numbers Grow Linearly. Discret. Comput. Geom. 68(1): 165-171 (2022) - [j58]Peter Frankl, János Pach, Dömötör Pálvölgyi:
Exchange Properties of Finite Set-Systems. SIAM J. Discret. Math. 36(3): 2073-2081 (2022) - [j57]John Fearnley, Dömötör Pálvölgyi, Rahul Savani:
A Faster Algorithm for Finding Tarski Fixed Points. ACM Trans. Algorithms 18(3): 23:1-23:23 (2022) - [c22]Gábor Damásdi, Dömötör Pálvölgyi:
Three-Chromatic Geometric Hypergraphs. SoCG 2022: 32:1-32:13 - 2021
- [j56]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Delaunay-edges and their generalizations. Comput. Geom. 96: 101745 (2021) - [j55]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous:
Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98: 101789 (2021) - [j54]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - [j53]Dömötör Pálvölgyi:
Exponential Lower Bound for Berge-Ramsey Problems. Graphs Comb. 37(4): 1433-1435 (2021) - [j52]Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós:
Induced and non-induced poset saturation problems. J. Comb. Theory A 184: 105497 (2021) - [j51]Anat Ganor, Karthik C. S., Dömötör Pálvölgyi:
On Communication Complexity of Fixed Point Computation. ACM Trans. Economics and Comput. 9(4): 25:1-25:27 (2021) - [c21]Cory Palmer, Dömötör Pálvölgyi:
At most 3.55n stable matchings. FOCS 2021: 217-227 - [i41]Balázs Keszegh, Dömötör Pálvölgyi:
The number of tangencies between two families of curves. CoRR abs/2111.08787 (2021) - [i40]Gábor Damásdi, Dömötör Pálvölgyi:
Three-chromatic geometric hypergraphs. CoRR abs/2112.01820 (2021) - 2020
- [j50]Dömötör Pálvölgyi, Gábor Tardos:
Unlabeled compression schemes exceeding the VC-dimension. Discret. Appl. Math. 276: 102-107 (2020) - [j49]András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales:
Distribution of colors in Gallai colorings. Eur. J. Comb. 86: 103087 (2020) - [j48]Balázs Keszegh, Dömötör Pálvölgyi:
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. J. Comput. Geom. 11(1): 354-370 (2020) - [j47]Dömötör Pálvölgyi:
The range of non-linear natural polynomials cannot be context-free. Kybernetika 56(4): 722-726 (2020) - [j46]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. SIAM J. Discret. Math. 34(4): 2250-2269 (2020) - [c20]Gábor Damásdi, Dömötör Pálvölgyi:
Realizing m-uniform four-chromatic hypergraphs with disks. CCCG 2020: 258-265 - [c19]Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi:
Almost-Monochromatic Sets and the Chromatic Number of the Plane. SoCG 2020: 47:1-47:15 - [c18]Dömötör Pálvölgyi:
Radon Numbers Grow Linearly. SoCG 2020: 60:1-60:5 - [i39]Péter Ágoston, Dömötör Pálvölgyi:
An improved constant factor for the unit distance problem. CoRR abs/2006.06285 (2020) - [i38]Cory Palmer, Dömötör Pálvölgyi:
At most 4.47n stable matchings. CoRR abs/2011.00915 (2020) - [i37]Gábor Damásdi, Dömötör Pálvölgyi:
Realizing an m-uniform four-chromatic hypergraph with disks. CoRR abs/2011.12187 (2020)
2010 – 2019
- 2019
- [j45]Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. Discret. Comput. Geom. 62(3): 674-689 (2019) - [j44]Benjamin Gunby, Dömötör Pálvölgyi:
Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings. Eur. J. Comb. 82 (2019) - [j43]Balázs Keszegh, Dömötör Pálvölgyi:
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. J. Comput. Geom. 10(1): 1-26 (2019) - [c17]Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Generalized Matching Games for International Kidney Exchange. AAMAS 2019: 413-421 - [i36]Dömötör Pálvölgyi:
The range of non-linear natural polynomials cannot be context-free. CoRR abs/1901.03913 (2019) - [i35]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019) - [i34]Anat Ganor, Karthik C. S., Dömötör Pálvölgyi:
On Communication Complexity of Fixed Point Computation. CoRR abs/1909.10958 (2019) - [i33]Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi:
Almost-monochromatic sets and the chromatic number of the plane. CoRR abs/1912.02604 (2019) - 2018
- [j42]Dömötör Pálvölgyi:
Weak embeddings of posets to the Boolean lattice. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j41]Dömötör Pálvölgyi:
All or Nothing Caching Games with Bounded Queries. IGTR 20(1): 1750023:1-1750023:9 (2018) - [i32]Zoltán Király, Dömötör Pálvölgyi:
Acyclic orientations with degree constraints. CoRR abs/1806.03426 (2018) - [i31]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Delaunay-Edges and their Generalizations. CoRR abs/1806.03931 (2018) - [i30]Balázs Keszegh, Dömötör Pálvölgyi:
Plane drawings of the generalized Delaunay-graphs for pseudo-disks. CoRR abs/1806.04217 (2018) - [i29]Dömötör Pálvölgyi, Gábor Tardos:
Unlabeled Compression Schemes Exceeding the VC-dimension. CoRR abs/1811.12471 (2018) - 2017
- [j40]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12(2): 301-314 (2017) - [j39]Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos:
Regular families of forests, antichains and duality pairs of relational structures. Comb. 37(4): 651-672 (2017) - [j38]Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi:
Unified Hanani-Tutte Theorem. Electron. J. Comb. 24(3): 3 (2017) - [j37]Abhishek Methuku, Dömötör Pálvölgyi:
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. Comb. Probab. Comput. 26(4): 593-602 (2017) - [j36]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219: 18-31 (2017) - [c16]Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. SoCG 2017: 47:1-47:15 - [i28]Dömötör Pálvölgyi:
All or Nothing Caching Games with Bounded Queries. CoRR abs/1702.00635 (2017) - [i27]Dömötör Pálvölgyi:
Complexity of Domination in Triangulated Plane Graphs. CoRR abs/1709.00596 (2017) - 2016
- [j35]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi:
Topological orderings of weighted directed acyclic graphs. Inf. Process. Lett. 116(9): 564-568 (2016) - [j34]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and Quasi-online Colorings of Wedges and Intervals. Order 33(3): 389-409 (2016) - [j33]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the tree search problem with non-uniform costs. Theor. Comput. Sci. 647: 22-32 (2016) - [i26]Dömötör Pálvölgyi:
Weak embeddings of posets to the Boolean lattice. CoRR abs/1606.08226 (2016) - [i25]Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi:
Unified Hanani-Tutte theorem. CoRR abs/1612.00688 (2016) - [i24]Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. CoRR abs/1612.02158 (2016) - 2015
- [j32]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Clustered Planarity Testing Revisited. Electron. J. Comb. 22(4): 4 (2015) - [j31]Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49: 345-351 (2015) - [j30]Balázs Keszegh, Dömötör Pálvölgyi:
More on decomposing coverings by octants. J. Comput. Geom. 6(1): 300-315 (2015) - [c15]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. WG 2015: 90-102 - [c14]Balázs Keszegh, Dömötör Pálvölgyi:
An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. WG 2015: 266-280 - [c13]János Pach, Dömötör Pálvölgyi:
Unsplittable Coverings in the Plane. WG 2015: 281-296 - [i23]Balázs Keszegh, Dömötör Pálvölgyi:
More on Decomposing Coverings by Octants. CoRR abs/1503.01669 (2015) - 2014
- [j29]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are cover-decomposable into many coverings. Comput. Geom. 47(5): 585-588 (2014) - [j28]Balázs Keszegh, Dömötör Pálvölgyi:
Convex Polygons are Self-Coverable. Discret. Comput. Geom. 51(4): 885-895 (2014) - [j27]Dömötör Pálvölgyi, András Gyárfás:
Domination in transitive colorings of tournaments. J. Comb. Theory B 107: 1-11 (2014) - [j26]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. J. Graph Algorithms Appl. 18(3): 439-457 (2014) - [c12]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Clustered Planarity Testing Revisited. GD 2014: 428-439 - [i22]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. CoRR abs/1404.4504 (2014) - 2013
- [j25]Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
Majority and plurality problems. Discret. Appl. Math. 161(6): 813-818 (2013) - [j24]Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi:
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. Graphs Comb. 29(3): 489-498 (2013) - [j23]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Saturating Sperner Families. Graphs Comb. 29(5): 1355-1364 (2013) - [j22]Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin:
Testing additive integrality gaps. Math. Program. 141(1-2): 257-271 (2013) - [j21]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. SIAM J. Discret. Math. 27(2): 1171-1183 (2013) - [j20]Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SIAM J. Discret. Math. 27(4): 1775-1787 (2013) - [j19]Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß:
Bin Packing via Discrepancy of Permutations. ACM Trans. Algorithms 9(3): 24:1-24:15 (2013) - [c11]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 543-556 - [c10]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and Quasi-online Colorings of Wedges and Intervals. SOFSEM 2013: 292-306 - [i21]Dömötör Pálvölgyi, András Gyárfás:
Domination in transitive colorings of tournaments. CoRR abs/1302.4677 (2013) - [i20]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. CoRR abs/1303.0523 (2013) - [i19]Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi:
Efficient c-planarity testing algebraically. CoRR abs/1305.4519 (2013) - [i18]Balázs Keszegh, Dömötör Pálvölgyi:
Convex Polygons are Self-Coverable. CoRR abs/1307.2411 (2013) - [i17]Dömötör Pálvölgyi:
Indecomposable coverings with unit discs. CoRR abs/1310.6900 (2013) - 2012
- [j18]András Gyárfás, Dömötör Pálvölgyi:
Monochromatic even cycles. Contributions Discret. Math. 7(1) (2012) - [j17]Padmini Mukkamala, János Pach, Dömötör Pálvölgyi:
Lower Bounds on the Obstacle Number of Graphs. Electron. J. Comb. 19(2): 32 (2012) - [j16]Balázs Keszegh, Dömötör Pálvölgyi:
Octants Are Cover-Decomposable. Discret. Comput. Geom. 47(3): 598-609 (2012) - [j15]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent Digital Line Segments. Discret. Comput. Geom. 47(4): 691-710 (2012) - [j14]Zoltán Király, Zoltán Lóránt Nagy, Dömötör Pálvölgyi, Mirkó Visontai:
On Families of Weakly Cross-intersecting Set-pairs. Fundam. Informaticae 117(1-4): 189-198 (2012) - [j13]Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi:
Vectors in a box. Math. Program. 135(1-2): 323-335 (2012) - [c9]Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SOFSEM 2012: 190-201 - [i16]Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
Majority and Plurality Problems. CoRR abs/1203.1398 (2012) - [i15]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-based group testing. CoRR abs/1204.1464 (2012) - [i14]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are Cover-Decomposable into Many Coverings. CoRR abs/1207.0672 (2012) - [i13]Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos:
On infinite-finite tree-duality pairs of relational structures. CoRR abs/1207.4402 (2012) - [i12]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and quasi-online colorings of wedges and intervals. CoRR abs/1207.4415 (2012) - [i11]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. CoRR abs/1211.3000 (2012) - 2011
- [j12]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Digitalizing line segments. Electron. Notes Discret. Math. 38: 273-278 (2011) - [j11]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are Cover Decomposable. Electron. Notes Discret. Math. 38: 499-504 (2011) - [c8]Padmini Mukkamala, Dömötör Pálvölgyi:
Drawing Cubic Graphs with the Four Basic Slopes. GD 2011: 254-265 - [c7]Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß:
Bin Packing via Discrepancy of Permutations. SODA 2011: 476-481 - [i10]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are Cover Decomposable. CoRR abs/1101.3773 (2011) - [i9]Padmini Mukkamala, János Pach, Dömötör Pálvölgyi:
Lower bounds on the obstacle number of graphs. CoRR abs/1103.2724 (2011) - [i8]Padmini Mukkamala, Dömötör Pálvölgyi:
Drawing cubic graphs with the four basic slopes. CoRR abs/1106.1973 (2011) - [i7]Dömötör Pálvölgyi:
Lower bounds for finding the maximum and minimum elements with k lies. CoRR abs/1111.3288 (2011) - 2010
- [j10]Padmini Mukkamala, Dömötör Pálvölgyi:
Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous Directions. Electron. J. Comb. 17(1) (2010) - [j9]Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding the maximum and minimum elements with one lie. Discret. Appl. Math. 158(9): 988-995 (2010) - [j8]Dömötör Pálvölgyi, Géza Tóth:
Convex Polygons are Cover-Decomposable. Discret. Comput. Geom. 43(3): 483-496 (2010) - [j7]Dömötör Pálvölgyi:
Indecomposable Coverings with Concave Polygons. Discret. Comput. Geom. 44(3): 577-588 (2010) - [j6]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Polychromatic colorings of arbitrary rectangular partitions. Discret. Math. 310(1): 21-30 (2010) - [j5]András Gács, Tamás Héger, Zoltán Lóránt Nagy, Dömötör Pálvölgyi:
Permutations, hyperplanes and polynomials over finite fields. Finite Fields Their Appl. 16(5): 301-314 (2010) - [j4]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. 14(1): 5-17 (2010) - [c6]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent digital line segments. SCG 2010: 11-18 - [c5]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. GD 2010: 293-304 - [c4]Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin:
Testing Additive Integrality Gaps. SODA 2010: 1227-1234 - [i6]Dömötör Pálvölgyi:
Partitionability to two trees is NP-complete. CoRR abs/1002.3937 (2010) - [i5]Dömötör Pálvölgyi:
Communication Complexity. CoRR abs/1007.1841 (2010) - [i4]Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß:
Bin Packing via Discrepancy of Permutations. CoRR abs/1007.2170 (2010) - [i3]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing planar graphs of bounded degree with few slopes. CoRR abs/1009.1315 (2010) - [i2]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent digital line segments. CoRR abs/1009.2142 (2010) - [i1]Dömötör Pálvölgyi:
Decomposition of Geometric Set Systems and Graphs. CoRR abs/1009.4641 (2010)
2000 – 2009
- 2009
- [j3]Dömötör Pálvölgyi:
Combinatorial Necklace Splitting. Electron. J. Comb. 16(1) (2009) - [c3]Dömötör Pálvölgyi:
2D-TUCKER Is PPAD-Complete. WINE 2009: 569-574 - 2008
- [j2]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Drawing cubic graphs with at most five slopes. Comput. Geom. 40(2): 138-147 (2008) - [c2]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter. GD 2008: 50-60 - 2006
- [j1]János Pach, Dömötör Pálvölgyi:
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. Electron. J. Comb. 13(1) (2006) - [c1]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Drawing Cubic Graphs with at Most Five Slopes. GD 2006: 114-125
Coauthor Index
[j68] [i47] [i46] [j66] [j64] [i43] [j60] [j56] [j54] [j52] [i41] [j48] [j46] [j45] [j43] [i35] [i31] [i30] [j40] [j36] [c16] [j35] [j34] [j33] [i24] [j31] [j30] [c15] [c14] [i23] [j29] [j28] [i22] [j23] [j21] [j20] [c11] [c10] [i18] [j16] [c9] [i15] [i14] [i12] [i11] [j11] [i10] [j6] [j4] [c5] [i3] [j2] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
