Eberhard Triesch

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 5

Top Topics

Graph Properties

Maximum Cardinality

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Electron. J. Comb.

Publications

Robert Scheidweiler, Eberhard Triesch
Upper and lower bounds for competitive group testing. Discret. Appl. Math. 333 (2023)
Matthias Gehnen, Eberhard Triesch
Transitive Avoidance Games on Boards of Odd Size. Electron. J. Comb. 28 (4) (2021)
Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster
On the Burning Number of p-Caterpillars. CoRR (2019)
Shengjia Li, Xiaohui Wu, Eberhard Triesch
A ternary search problem on two disjoint sets. Discret. Appl. Math. 251 (2018)
Robert Scheidweiler, Eberhard Triesch
A note on the duality between matchings and vertex covers in balanced hypergraphs. J. Comb. Optim. 32 (2) (2016)
Robert Scheidweiler, Eberhard Triesch
New estimates for the gap chromatic number. Discret. Math. 328 (2014)
Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch
Two New Perspectives on Multi-Stage Group Testing. Algorithmica 67 (3) (2013)
Robert Scheidweiler, Eberhard Triesch
A Lower Bound for the Complexity of Monotone Graph Properties. SIAM J. Discret. Math. 27 (1) (2013)
Robert Scheidweiler, Eberhard Triesch
New Estimations of the Gap-k-coloring Number. CTW (2012)
Robert Scheidweiler, Eberhard Triesch
Matchings in balanced hypergraphs. CTW (2011)
Torsten Korneffel, Eberhard Triesch
An asymptotic bound for the complexity of monotone graph properties. Comb. 30 (6) (2010)
Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch
A Better Bouncer's Algorithm. FUN (2010)
Jens Schlaghoff, Eberhard Triesch
Improved Results for Competitive Group Testing. Comb. Probab. Comput. 14 (1-2) (2005)
F. Jelen, Eberhard Triesch
Superdominance order and distance of trees with bounded maximum degree. Discret. Appl. Math. 125 (2-3) (2003)
Andreas Huck, Eberhard Triesch
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. Comb. 22 (3) (2002)
Dieter Rautenbach, Eberhard Triesch
Reconstructing Infinite Sets of Integers. J. Comb. Theory, Ser. A 99 (2) (2002)
Dieter Rautenbach, Eberhard Triesch
Reconstruction up to isometries. Discret. Math. 259 (1-3) (2002)
Jörg Nowakovski, Werner Schwärzler, Eberhard Triesch
Using the generalized assignment problem in scheduling the ROSAT space telescope. Eur. J. Oper. Res. 112 (3) (1999)
Eberhard Triesch
Degree sequences of graphs and dominance order. J. Graph Theory 22 (1) (1996)
Eberhard Triesch
On the Recognition Complexity of Some Graph Properties. Comb. 16 (2) (1996)
Eberhard Triesch
A Group Testing Problem for Hypergraphs of Bounded Rank. Discret. Appl. Math. 66 (2) (1996)
Martin Aigner, Eberhard Triesch, Zsolt Tuza
Searching for acyclic orientations of graphs. Discret. Math. 144 (1-3) (1995)
Martin Aigner, Eberhard Triesch
Codings of graphs with binary edge labels. Graphs Comb. 10 (1) (1994)
Eberhard Triesch
Some Results on Elusive Graph Properties. SIAM J. Comput. 23 (2) (1994)
Martin Aigner, Eberhard Triesch
Realizability and uniqueness in graphs. Discret. Math. 136 (1-3) (1994)
Eberhard Triesch
A probabilistic upper bound for the edge identification complexity of graphs. Discret. Math. 125 (1-3) (1994)
Martin Aigner, Eberhard Triesch
Reconstructing a Graph from its Neighborhood Lists. Comb. Probab. Comput. 2 (1993)
Horst W. Hamacher, Eberhard Triesch
Book reviews. ZOR Methods Model. Oper. Res. 38 (2) (1993)
Ingo Althöfer, Eberhard Triesch
Edge search in graphs and hypergraphs of bounded rank. Discret. Math. 115 (1-3) (1993)
Martin Aigner, Eberhard Triesch
Irregular Assignments of Trees and Forests. SIAM J. Discret. Math. 3 (4) (1990)
Eberhard Triesch
A note on a theorem of Blum, Shub, and Smale. J. Complex. 6 (2) (1990)
Martin Aigner, Eberhard Triesch
Searching for an edge in a graph. J. Graph Theory 12 (1) (1988)