Eberhard Triesch

Discret. Appl. Math., July, 2023

2021

Transitive Avoidance Games on Boards of Odd Size.

[BibT_eX]

[DOI]

Matthias Gehnen

Electron. J. Comb., 2021

2019

On the Burning Number of p-Caterpillars.

[BibT_eX]

[DOI]

Michaela Hiller

Arie M. C. A. Koster

CoRR, 2019

2018

A ternary search problem on two disjoint sets.

[BibT_eX]

[DOI]

Shengjia Li

Xiaohui Wu

Discret. Appl. Math., 2018

2016

A note on the duality between matchings and vertex covers in balanced hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

2014

New estimates for the gap chromatic number.

[BibT_eX]

[DOI]

Discret. Math., 2014

2013

A Lower Bound for the Complexity of Monotone Graph Properties.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Two New Perspectives on Multi-Stage Group Testing.

[BibT_eX]

[DOI]

Peter Damaschke

Azam Sheikh Muhammad

Algorithmica, 2013

Reconstruction Problems for Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

New Estimations of the Gap-k-coloring Number.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Matchings in balanced hypergraphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Torsten Korneffel

Comb., 2010

A Better Bouncer's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2005

Improved Results for Competitive Group Testing.

[BibT_eX]

[DOI]

Jens Schlaghoff

Comb. Probab. Comput., 2005

2004

Optimization theory.

[BibT_eX]

Hubertus Th. Jongen

Klaus Meer

Kluwer, ISBN: 978-1-4020-8098-2, 2004

2003

Superdominance order and distance of trees with bounded maximum degree.

[BibT_eX]

[DOI]

F. Jelen

Discret. Appl. Math., 2003

2002

Reconstructing Infinite Sets of Integers.

[BibT_eX]

[DOI]

Dieter Rautenbach

J. Comb. Theory A, 2002

Reconstruction up to isometries.

[BibT_eX]

[DOI]

Dieter Rautenbach

Discret. Math., 2002

Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.

[BibT_eX]

[DOI]

Andreas Huck

Comb., 2002

1999

Using the generalized assignment problem in scheduling the ROSAT space telescope.

[BibT_eX]

[DOI]

Jörg Nowakovski

Werner Schwärzler

Eur. J. Oper. Res., 1999

1996

Degree sequences of graphs and dominance order.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

A Group Testing Problem for Hypergraphs of Bounded Rank.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

On the Recognition Complexity of Some Graph Properties.

[BibT_eX]

[DOI]

Comb., 1996

1995

Searching for acyclic orientations of graphs.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Math., 1995

1994

Some Results on Elusive Graph Properties.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Codings of graphs with binary edge labels.

[BibT_eX]

[DOI]

Graphs Comb., 1994

A probabilistic upper bound for the edge identification complexity of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Realizability and uniqueness in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

Book reviews.

[BibT_eX]

[DOI]

Horst W. Hamacher

ZOR Methods Model. Oper. Res., 1993

Edge search in graphs and hypergraphs of bounded rank.

[BibT_eX]

[DOI]

Ingo Althöfer

Discret. Math., 1993

Reconstructing a Graph from its Neighborhood Lists.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

1990

Irregular Assignments of Trees and Forests.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

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

[BibT_eX]

[DOI]

J. Complex., 1990

1988

Searching for an edge in a graph.

[BibT_eX]

[DOI]