Eberhard Triesch - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2023

Upper and lower bounds for competitive group testingRobert Scheidweiler, Eberhard Triesch. DAM, 333:136-150, July 2023. [doi]

2021

Transitive Avoidance Games on Boards of Odd SizeMatthias Gehnen, Eberhard Triesch. combinatorics, 28(4), 2021. [doi]

2018

A ternary search problem on two disjoint setsShengjia Li, Xiaohui Wu, Eberhard Triesch. DAM, 251:221-235, 2018. [doi]

2016

A note on the duality between matchings and vertex covers in balanced hypergraphsRobert Scheidweiler, Eberhard Triesch. jco, 32(2):639-644, 2016. [doi]

2014

New estimates for the gap chromatic numberRobert Scheidweiler, Eberhard Triesch. DM, 328:42-53, 2014. [doi]

2013

Reconstruction Problems for DigraphsMartin Aigner 0001, Eberhard Triesch. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 5-13, Springer, 2013. [doi]

Two New Perspectives on Multi-Stage Group TestingPeter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch. algorithmica, 67(3):324-354, 2013. [doi]

A Lower Bound for the Complexity of Monotone Graph PropertiesRobert Scheidweiler, Eberhard Triesch. siamdm, 27(1):257-265, 2013. [doi]

2012

New Estimations of the Gap-k-coloring NumberRobert Scheidweiler, Eberhard Triesch. colognetwente 2012: 240-244

2011

Matchings in balanced hypergraphsRobert Scheidweiler, Eberhard Triesch. colognetwente 2011: 244-247 [doi]

2010

A Better Bouncer s AlgorithmFerdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch. fun 2010: 113-120 [doi]

An asymptotic bound for the complexity of monotone graph propertiesTorsten Korneffel, Eberhard Triesch. combinatorica, 30(6):735-743, 2010. [doi]

2005

Improved Results for Competitive Group TestingJens Schlaghoff, Eberhard Triesch. cpc, 14(1-2):191-202, 2005. [doi]

2004

Optimization theoryHubertus Th. Jongen, Klaus Meer, Eberhard Triesch. Kluwer, 2004.

2003

Superdominance order and distance of trees with bounded maximum degreeF. Jelen, Eberhard Triesch. DAM, 125(2-3):225-233, 2003.

2002

Perfect Matchings in Balanced Hypergraphs - A Combinatorial ApproachAndreas Huck, Eberhard Triesch. combinatorica, 22(3):409-416, 2002. [doi]

Reconstruction up to isometriesDieter Rautenbach, Eberhard Triesch. DM, 259(1-3):331-336, 2002. [doi]

Reconstructing Infinite Sets of IntegersDieter Rautenbach, Eberhard Triesch. JCT, 99(2):297-306, 2002. [doi]

1999

Using the generalized assignment problem in scheduling the ROSAT space telescopeJörg Nowakovski, Werner Schwärzler, Eberhard Triesch. eor, 112(3):531-541, 1999. [doi]

1996

A Group Testing Problem for Hypergraphs of Bounded RankEberhard Triesch. DAM, 66(2):185-188, 1996. [doi]

On the Recognition Complexity of Some Graph PropertiesEberhard Triesch. combinatorica, 16(2):259-268, 1996.

Degree sequences of graphs and dominance orderEberhard Triesch. jgt, 22(1):89-93, 1996. [doi]

1995

Searching for acyclic orientations of graphsMartin Aigner, Eberhard Triesch, Zsolt Tuza. DM, 144(1-3):3-10, 1995. [doi]

1994

Realizability and uniqueness in graphsMartin Aigner, Eberhard Triesch. DM, 136(1-3):3-20, 1994. [doi]

Codings of graphs with binary edge labelsMartin Aigner, Eberhard Triesch. gc, 10(1):1-10, 1994. [doi]

A probabilistic upper bound for the edge identification complexity of graphsEberhard Triesch. DM, 125(1-3):371-376, 1994. [doi]

Some Results on Elusive Graph PropertiesEberhard Triesch. SICOMP, 23(2):247-254, 1994.

1993

Reconstructing a Graph from its Neighborhood ListsMartin Aigner, Eberhard Triesch. cpc, 2:103-113, 1993.

Edge search in graphs and hypergraphs of bounded rankIngo Althöfer, Eberhard Triesch. DM, 115(1-3):1-9, 1993. [doi]

Book reviewsHorst W. Hamacher, Eberhard Triesch. mmor, 38(2):230-233, 1993. [doi]

1990

Irregular Assignments of Trees and ForestsMartin Aigner, Eberhard Triesch. siamdm, 3(4):439-449, 1990.

A note on a theorem of Blum, Shub, and SmaleEberhard Triesch. jc, 6(2):166-169, 1990. [doi]

1988

Searching for an edge in a graphMartin Aigner, Eberhard Triesch. jgt, 12(1):45-57, 1988. [doi]

Sign in or sign up to see more results.

runs on WebDSL