Eberhard Triesch

Affiliations:
  • RWTH Aachen University


According to our database1, Eberhard Triesch authored at least 34 papers between 1988 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Upper and lower bounds for competitive group testing.
Discret. Appl. Math., July, 2023

2021
Transitive Avoidance Games on Boards of Odd Size.
Electron. J. Comb., 2021

2019
On the Burning Number of p-Caterpillars.
CoRR, 2019

2018
A ternary search problem on two disjoint sets.
Discret. Appl. Math., 2018

2016
A note on the duality between matchings and vertex covers in balanced hypergraphs.
J. Comb. Optim., 2016

2014
New estimates for the gap chromatic number.
Discret. Math., 2014

2013
A Lower Bound for the Complexity of Monotone Graph Properties.
SIAM J. Discret. Math., 2013

Two New Perspectives on Multi-Stage Group Testing.
Algorithmica, 2013

Reconstruction Problems for Digraphs.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
New Estimations of the Gap-k-coloring Number.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Matchings in balanced hypergraphs.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
An asymptotic bound for the complexity of monotone graph properties.
Comb., 2010

A Better Bouncer's Algorithm.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2005
Improved Results for Competitive Group Testing.
Comb. Probab. Comput., 2005

2004
Optimization theory.
Kluwer, ISBN: 978-1-4020-8098-2, 2004

2003
Superdominance order and distance of trees with bounded maximum degree.
Discret. Appl. Math., 2003

2002
Reconstructing Infinite Sets of Integers.
J. Comb. Theory A, 2002

Reconstruction up to isometries.
Discret. Math., 2002

Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.
Comb., 2002

1999
Using the generalized assignment problem in scheduling the ROSAT space telescope.
Eur. J. Oper. Res., 1999

1996
Degree sequences of graphs and dominance order.
J. Graph Theory, 1996

A Group Testing Problem for Hypergraphs of Bounded Rank.
Discret. Appl. Math., 1996

On the Recognition Complexity of Some Graph Properties.
Comb., 1996

1995
Searching for acyclic orientations of graphs.
Discret. Math., 1995

1994
Some Results on Elusive Graph Properties.
SIAM J. Comput., 1994

Codings of graphs with binary edge labels.
Graphs Comb., 1994

A probabilistic upper bound for the edge identification complexity of graphs.
Discret. Math., 1994

Realizability and uniqueness in graphs.
Discret. Math., 1994

1993
Book reviews.
ZOR Methods Model. Oper. Res., 1993

Edge search in graphs and hypergraphs of bounded rank.
Discret. Math., 1993

Reconstructing a Graph from its Neighborhood Lists.
Comb. Probab. Comput., 1993

1990
Irregular Assignments of Trees and Forests.
SIAM J. Discret. Math., 1990

A note on a theorem of Blum, Shub, and Smale.
J. Complex., 1990

1988
Searching for an edge in a graph.
J. Graph Theory, 1988


  Loading...