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

	2012
35		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
34		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)
33		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)
32		Balázs Keszegh, Dömötör Pálvölgyi: Octants Are Cover-Decomposable. Discrete & Computational Geometry 47(3): 598-609 (2012)
31		Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic: Consistent Digital Line Segments. Discrete & Computational Geometry 47(4): 691-710 (2012)
	2011
30		Padmini Mukkamala, Dömötör Pálvölgyi: Drawing Cubic Graphs with the Four Basic Slopes. Graph Drawing 2011: 254-265
29		Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß: Bin Packing via Discrepancy of Permutations. SODA 2011: 476-481
28		Balázs Keszegh, Dömötör Pálvölgyi: Octants are Cover Decomposable CoRR abs/1101.3773: (2011)
27		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)
26		Padmini Mukkamala, Dömötör Pálvölgyi: Drawing cubic graphs with the four basic slopes CoRR abs/1106.1973: (2011)
25		Dömötör Pálvölgyi: Lower bounds for finding the maximum and minimum elements with k lies CoRR abs/1111.3288: (2011)
24		Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic: Digitalizing line segments. Electronic Notes in Discrete Mathematics 38: 273-278 (2011)
23		Balázs Keszegh, Dömötör Pálvölgyi: Octants are Cover Decomposable. Electronic Notes in Discrete Mathematics 38: 499-504 (2011)
	2010
22		Balázs Keszegh, János Pach, Dömötör Pálvölgyi: Drawing Planar Graphs of Bounded Degree with Few Slopes. Graph Drawing 2010: 293-304
21		Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin: Testing Additive Integrality Gaps. SODA 2010: 1227-1234
20		Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic: Consistent digital line segments. Symposium on Computational Geometry 2010: 11-18
19		Dömötör Pálvölgyi: Partitionability to two trees is NP-complete CoRR abs/1002.3937: (2010)
18		Dömötör Pálvölgyi: Communication Complexity CoRR abs/1007.1841: (2010)
17		Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß: Bin Packing via Discrepancy of Permutations CoRR abs/1007.2170: (2010)
16		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)
15		Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic: Consistent digital line segments CoRR abs/1009.2142: (2010)
14		Dömötör Pálvölgyi: Decomposition of Geometric Set Systems and Graphs CoRR abs/1009.4641: (2010)
13		Dömötör Pálvölgyi, Géza Tóth: Convex Polygons are Cover-Decomposable. Discrete & Computational Geometry 43(3): 483-496 (2010)
12		Dömötör Pálvölgyi: Indecomposable Coverings with Concave Polygons. Discrete & Computational Geometry 44(3): 577-588 (2010)
11		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. Discrete Applied Mathematics 158(9): 988-995 (2010)
10		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. Discrete Mathematics 310(1): 21-30 (2010)
9		Padmini Mukkamala, Dömötör Pálvölgyi: Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous Directions. Electr. J. Comb. 17(1): (2010)
8		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 and Their Applications 16(5): 301-314 (2010)
7		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)
	2009
6		Dömötör Pálvölgyi: 2D-TUCKER Is PPAD-Complete. WINE 2009: 569-574
5		Dömötör Pálvölgyi: Combinatorial Necklace Splitting. Electr. J. Comb. 16(1): (2009)
	2008
4		Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth: Cubic Graphs Have Bounded Slope Parameter. Graph Drawing 2008: 50-60
3		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)
	2006
2		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. Graph Drawing 2006: 114-125
1		János Pach, Dömötör Pálvölgyi: Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. Electr. J. Comb. 13(1): (2006)

Coauthor Index

1	Panagiotis Cheilaris	[35]
2	Tobias Christ	[15] [20] [24] [31]
3	Friedrich Eisenbrand	[17] [21] [29]
4	András Gács	[8]
5	Dániel Gerbner	[10] [11] [33] [34]
6	Nicolai Hähnle	[21]
7	Tamás Héger	[8]
8	Gyula O. H. Katona	[34]
9	Balázs Keszegh	[2] [3] [4] [7] [10] [16] [22] [23] [28] [32] [33] [35]
10	Nathan Lemons	[10]
11	Padmini Mukkamala	[9] [26] [27] [30]
12	Zoltán Lóránt Nagy	[8]
13	János Pach	[1] [2] [3] [4] [7] [16] [22] [27]
14	Cory Palmer	[10]
15	Balázs Patkós	[10] [11] [34]
16	Thomas Rothvoß	[17] [29]
17	Gennady Shmonin	[21]
18	Milos Stojakovic	[15] [20] [24] [31]
19	Géza Tóth	[2] [3] [4] [7] [13]
20	Gábor Wiener	[11] [33]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page