| 2006 |
|---|
| 25 | EE | Erich Prisner:
Generalizing the Wolf-Goat-Cabbage Problem.
Electronic Notes in Discrete Mathematics 27: 83 (2006) |
| 2004 |
|---|
| 24 | EE | Roger Labahn,
Arthur L. Liestman,
Erich Prisner:
Preface.
Discrete Applied Mathematics 137(2): 125-126 (2004) |
| 23 | EE | Fedor V. Fomin,
Martín Matamala,
Erich Prisner,
Ivan Rapaport:
AT-free graphs: linear bounds for the oriented diameter.
Discrete Applied Mathematics 141(1-3): 135-148 (2004) |
| 22 | EE | Erich Prisner:
k-Pseudosnakes in n-dimensional Hypercubes.
Electronic Notes in Discrete Mathematics 17: 237-240 (2004) |
| 2003 |
|---|
| 21 | EE | Erich Prisner:
The recognition problem for line bigraphs.
Discrete Mathematics 268(1-3): 243-256 (2003) |
| 2002 |
|---|
| 20 | EE | Martín Matamala,
Erich Prisner,
Ivan Rapaport:
k-pseudosnakes in Large Grids.
LATIN 2002: 224-235 |
| 2001 |
|---|
| 19 | EE | Erich Prisner:
Eulerian iterated line graphs and digraphs.
Discrete Mathematics 236(1-3): 315-323 (2001) |
| 18 | EE | Fedor V. Fomin,
Martín Matamala,
Erich Prisner,
Ivan Rapaport:
Bilateral Orientations and Domination.
Electronic Notes in Discrete Mathematics 7: 26-29 (2001) |
| 2000 |
|---|
| 17 | | Erich Prisner:
A Note of k-Rotation Graphs.
Ars Comb. 55: (2000) |
| 16 | EE | Erich Prisner:
Bicliques in Graphs I: Bounds on Their Number.
Combinatorica 20(1): 109-117 (2000) |
| 15 | EE | Erich Prisner:
Recognizing k-path Graphs.
Discrete Applied Mathematics 99(1-3): 169-181 (2000) |
| 14 | EE | Erich Prisner:
Eccentricity-approximating trees in chordal graphs.
Discrete Mathematics 220(1-3): 263-269 (2000) |
| 13 | EE | Erich Prisner:
Recognizing random intersection graphs.
Discrete Mathematics 223(1-3): 263-274 (2000) |
| 12 | EE | Eric Goles Ch.,
Erich Prisner:
Source reversal and chip firing on graphs.
Theor. Comput. Sci. 233(1-2): 287-295 (2000) |
| 1999 |
|---|
| 11 | EE | Erich Prisner,
Jayme Luiz Szwarcfiter:
Recognizing Clique Graphs of Directed and Rooted Path Graphs.
Discrete Applied Mathematics 94(1-3): 321-328 (1999) |
| 10 | EE | Erich Prisner:
Generalized octahedra and cliques in intersection graphs of uniform hypergraphs.
Discrete Mathematics 206(1-3): 187-195 (1999) |
| 1997 |
|---|
| 9 | | Erich Prisner:
Distance Approximating Spanning Trees.
STACS 1997: 499-510 |
| 8 | | Erich Prisner:
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.
WG 1997: 273-287 |
| 7 | EE | Erich Prisner:
Radius versus diameter in cocomparability and intersection graphs.
Discrete Mathematics 163(1-3): 109-117 (1997) |
| 1995 |
|---|
| 6 | EE | Erich Prisner:
Clique Covering and Clique Partition in Generalizations of Line Graphs.
Discrete Applied Mathematics 56(1): 93-98 (1995) |
| 1994 |
|---|
| 5 | EE | Erich Prisner:
Algorithms for Interval Catch Digraphs.
Discrete Applied Mathematics 51(1-2): 147-157 (1994) |
| 1993 |
|---|
| 4 | EE | Jørgen Bang-Jensen,
Jing Huang,
Erich Prisner:
In-Tournament Digraphs.
J. Comb. Theory, Ser. B 59(2): 267-287 (1993) |
| 1992 |
|---|
| 3 | EE | Erich Prisner:
Convergence of iterated clique graphs.
Discrete Mathematics 103(2): 199-207 (1992) |
| 1991 |
|---|
| 2 | EE | Hans-Jürgen Bandelt,
Erich Prisner:
Clique graphs and Helly graphs.
J. Comb. Theory, Ser. B 51(1): 34-45 (1991) |
| 1989 |
|---|
| 1 | EE | Erich Prisner:
A characterization of interval catch digraphs.
Discrete Mathematics 73(3): 285-289 (1989) |
