Eberhard Triesch

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