 | 2006 |
|---|
| 6 |       | André Große,
Jörg Rothe,
Gerd Wechsung:
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P.
Inf. Process. Lett. 99(6): 215-221 (2006) |
| 2003 |
|---|
| 5 | | André Große,
Harald Hempel:
On Functions and Relations.
DMTCS 2003: 181-192 |
| 2002 |
|---|
| 4 | | André Große,
Jörg Rothe,
Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones.
Theory Comput. Syst. 35(1): 81-93 (2002) |
| 2001 |
|---|
| 3 | | André Große,
Jörg Rothe,
Gerd Wechsung:
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions.
ICTCS 2001: 339-356 |
| 2 | | André Große,
Jörg Rothe,
Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
CoRR cs.CC/0106041: (2001) |
| 1 | | André Große,
Jörg Rothe,
Gerd Wechsung:
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
CoRR cs.CC/0106045: (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page