 | 2010 |
|---|
| 7 |       | Robert Berke,
Dieter Mitsche:
Colorings at minimum cost.
Discrete Mathematics 310(3): 561-569 (2010) |
| 2009 |
|---|
| 6 | | Robert Berke,
Mikael Onsjö:
Propagation Connectivity of Random Hypergraphs.
SAGA 2009: 117-126 |
| 5 | | Robert Berke,
Tibor Szabó:
Deciding Relaxed Two-Colourability: A Hardness Jump.
Combinatorics, Probability & Computing 18(1-2): 53-81 (2009) |
| 4 | | Noga Alon,
Robert Berke,
Kevin Buchin,
Maike Buchin,
Péter Csorba,
Saswata Shannigrahi,
Bettina Speckmann,
Philipp Zumstein:
Polychromatic Colorings of Plane Graphs.
Discrete & Computational Geometry 42(3): 421-442 (2009) |
| 2008 |
|---|
| 3 | | Noga Alon,
Robert Berke,
Kevin Buchin,
Maike Buchin,
Péter Csorba,
Saswata Shannigrahi,
Bettina Speckmann,
Philipp Zumstein:
Polychromatic colorings of plane graphs.
Symposium on Computational Geometry 2008: 338-345 |
| 2007 |
|---|
| 2 | | Robert Berke,
Tibor Szabó:
Relaxed two-coloring of cubic graphs.
J. Comb. Theory, Ser. B 97(4): 652-668 (2007) |
| 2006 |
|---|
| 1 | | Robert Berke,
Tibor Szabó:
Deciding Relaxed Two-Colorability - A Hardness Jump.
ESA 2006: 124-135 |
Data released under the ODC-BY 1.0 license — See also our legal information page