| 2005 |
|---|
| 15 | EE | Jens Schlaghoff,
Eberhard Triesch:
Improved Results for Competitive Group Testing.
Combinatorics, Probability & Computing 14(1-2): 191-202 (2005) |
| 2003 |
|---|
| 14 | | F. Jelen,
Eberhard Triesch:
Superdominance order and distance of trees with bounded maximum degree.
Discrete Applied Mathematics 125(2-3): 225-233 (2003) |
| 2002 |
|---|
| 13 | EE | Andreas Huck,
Eberhard Triesch:
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.
Combinatorica 22(3): 409-416 (2002) |
| 12 | EE | Dieter Rautenbach,
Eberhard Triesch:
Reconstruction up to isometries.
Discrete Mathematics 259(1-3): 331-336 (2002) |
| 11 | EE | Dieter Rautenbach,
Eberhard Triesch:
Reconstructing Infinite Sets of Integers.
J. Comb. Theory, Ser. A 99(2): 297-306 (2002) |
| 1996 |
|---|
| 10 | | Eberhard Triesch:
On the Recognition Complexity of Some Graph Properties.
Combinatorica 16(2): 259-268 (1996) |
| 9 | EE | Eberhard Triesch:
A Group Testing Problem for Hypergraphs of Bounded Rank.
Discrete Applied Mathematics 66(2): 185-188 (1996) |
| 1995 |
|---|
| 8 | EE | Martin Aigner,
Eberhard Triesch,
Zsolt Tuza:
Searching for acyclic orientations of graphs.
Discrete Mathematics 144(1-3): 3-10 (1995) |
| 1994 |
|---|
| 7 | EE | Eberhard Triesch:
A probabilistic upper bound for the edge identification complexity of graphs.
Discrete Mathematics 125(1-3): 371-376 (1994) |
| 6 | EE | Martin Aigner,
Eberhard Triesch:
Realizability and uniqueness in graphs.
Discrete Mathematics 136(1-3): 3-20 (1994) |
| 5 | | Eberhard Triesch:
Some Results on Elusive Graph Properties.
SIAM J. Comput. 23(2): 247-254 (1994) |
| 1993 |
|---|
| 4 | | Martin Aigner,
Eberhard Triesch:
Reconstructing a Graph from its Neighborhood Lists.
Combinatorics, Probability & Computing 2: 103-113 (1993) |
| 3 | EE | Ingo Althöfer,
Eberhard Triesch:
Edge search in graphs and hypergraphs of bounded rank.
Discrete Mathematics 115(1-3): 1-9 (1993) |
| 1990 |
|---|
| 2 | EE | Eberhard Triesch:
A note on a theorem of Blum, Shub, and Smale.
J. Complexity 6(2): 166-169 (1990) |
| 1 | | Martin Aigner,
Eberhard Triesch:
Irregular Assignments of Trees and Forests.
SIAM J. Discrete Math. 3(4): 439-449 (1990) |
