 | 2012 |
|---|
| 8 |       | Johannes Köbler,
Sebastian Kuhnert,
Oleg Verbitsky:
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space
CoRR abs/1202.4406: (2012) |
| 7 | | Sebastian Kuhnert,
Johannes Köbler,
Osamu Watanabe:
Interval graph representation with given interval and intersection lengths.
Electronic Colloquium on Computational Complexity (ECCC) 19: 32 (2012) |
| 2011 |
|---|
| 6 | | Johannes Köbler,
Sebastian Kuhnert,
Bastian Laubner,
Oleg Verbitsky:
Interval Graphs: Canonical Representations in Logspace.
SIAM J. Comput. 40(5): 1292-1315 (2011) |
| 2010 |
|---|
| 5 | | Johannes Köbler,
Sebastian Kuhnert,
Bastian Laubner,
Oleg Verbitsky:
Interval Graphs: Canonical Representation in Logspace.
ICALP (1) 2010: 384-395 |
| 4 | | Johannes Köbler,
Sebastian Kuhnert,
Bastian Laubner,
Oleg Verbitsky:
Interval Graphs: Canonical Representation in Logspace.
Electronic Colloquium on Computational Complexity (ECCC) 17: 43 (2010) |
| 2009 |
|---|
| 3 | | Johannes Köbler,
Sebastian Kuhnert:
The Isomorphism Problem for k-Trees Is Complete for Logspace.
MFCS 2009: 537-548 |
| 2 | | Johannes Köbler,
Sebastian Kuhnert:
The Isomorphism Problem for k-Trees is Complete for Logspace.
Electronic Colloquium on Computational Complexity (ECCC) 16: 53 (2009) |
| 2007 |
|---|
| 1 | | Sebastian Kuhnert:
Efficient Edge-Finding on Unary Resources with Optional Activities.
INAP/WLP 2007: 38-53 |
Data released under the ODC-BY 1.0 license — See also our legal information page