The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |