Eberhard Triesch

From MaRDI portal
Revision as of 06:37, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Eberhard Triesch to Eberhard Triesch: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:213186

Available identifiers

zbMath Open triesch.eberhardMaRDI QIDQ213186

List of research outcomes





PublicationDate of PublicationType
Upper and lower bounds for competitive group testing2023-04-27Paper
On the burning number of \(p\)-caterpillars2021-12-08Paper
Transitive avoidance games on boards of odd size2021-11-22Paper
Upper and Lower Bounds for Competitive Group Testing2020-12-04Paper
A ternary search problem on two disjoint sets2018-12-03Paper
A note on the duality between matchings and vertex covers in balanced hypergraphs2016-08-31Paper
https://portal.mardi4nfdi.de/entity/Q27919732016-03-16Paper
New estimates for the gap chromatic number2014-05-06Paper
Two new perspectives on multi-stage group testing2013-11-11Paper
A Lower Bound for the Complexity of Monotone Graph Properties2013-06-27Paper
An asymptotic bound for the complexity of monotone graph properties2011-12-19Paper
Matchings in balanced hypergraphs2009-10-22Paper
Improved Results for Competitive Group Testing2005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q48289042004-11-29Paper
A note on the reconstruction of sets of finite measure2003-12-14Paper
Perfect matchings in balanced hypergraphs---a combinatorial approach2003-05-18Paper
Reconstruction up to isometries2003-03-16Paper
Superdominance order and distance of trees with bounded maximum degree2003-03-09Paper
Reconstructing infinite sets of integers2002-09-12Paper
Searching for an edge in a graph2001-11-06Paper
Using the generalized assignment problem in scheduling the ROSAT space telescope1999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q43478761997-08-11Paper
On the recognition complexity of some graph properties1997-08-03Paper
https://portal.mardi4nfdi.de/entity/Q56889971997-03-11Paper
A group testing problem for hypergraphs of bounded rank1996-07-07Paper
Degree sequences of graphs and dominance order1996-05-22Paper
Searching for acyclic orientations of graphs1996-02-12Paper
Realizability and uniqueness in graphs1995-07-11Paper
Some Results on Elusive Graph Properties1994-11-14Paper
Codings of graphs with binary edge labels1994-09-04Paper
Reconstructing a Graph from its Neighborhood Lists1994-07-12Paper
Characterisation of Archimedean \(t\)-norms and a law of large numbers1994-06-01Paper
A probabilistic upper bound for the edge identification complexity of graphs1994-05-05Paper
Edge search in graphs and hypergraphs of bounded rank1993-06-20Paper
https://portal.mardi4nfdi.de/entity/Q40284141993-03-28Paper
On the convergence of product-sum series of \(L-R\) fuzzy numbers1993-01-01Paper
Extremals of the cone of norms and the cohomology of \(c^ 3\)- stratifications1992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39930411992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39930831992-09-17Paper
A short proof that matching matroids are transversal1992-06-28Paper
Irregular Assignments of Trees and Forests1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39719951992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39774721992-06-25Paper
A note on a theorem of Blum, Shub, and Smale1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552501990-01-01Paper
Searching for an edge in a graph1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282471984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808771982-01-01Paper

Research outcomes over time

This page was built for person: Eberhard Triesch