default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEberhard Triesch
Person information
- affiliation: RWTH Aachen University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Robert Scheidweiler, Eberhard Triesch:
Upper and lower bounds for competitive group testing. Discret. Appl. Math. 333: 136-150 (2023)- 2021
- [j27]Matthias Gehnen
, Eberhard Triesch:
Transitive Avoidance Games on Boards of Odd Size. Electron. J. Comb. 28(4) (2021)
2010 – 2019
- 2019
- [i1]Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster:
On the Burning Number of p-Caterpillars. CoRR abs/1912.10897 (2019) - 2018
- [j26]Shengjia Li, Xiaohui Wu, Eberhard Triesch:
A ternary search problem on two disjoint sets. Discret. Appl. Math. 251: 221-235 (2018) - 2016
- [j25]Robert Scheidweiler, Eberhard Triesch:
A note on the duality between matchings and vertex covers in balanced hypergraphs. J. Comb. Optim. 32(2): 639-644 (2016) - 2014
- [j24]Robert Scheidweiler, Eberhard Triesch:
New estimates for the gap chromatic number. Discret. Math. 328: 42-53 (2014) - 2013
- [j23]Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch:
Two New Perspectives on Multi-Stage Group Testing. Algorithmica 67(3): 324-354 (2013) - [j22]Robert Scheidweiler, Eberhard Triesch:
A Lower Bound for the Complexity of Monotone Graph Properties. SIAM J. Discret. Math. 27(1): 257-265 (2013) - [p1]Martin Aigner, Eberhard Triesch:
Reconstruction Problems for Digraphs. The Mathematics of Paul Erdős II 2013: 5-13 - 2012
- [c3]Robert Scheidweiler, Eberhard Triesch:
New Estimations of the Gap-k-coloring Number. CTW 2012: 240-244 - 2011
- [c2]Robert Scheidweiler, Eberhard Triesch:
Matchings in balanced hypergraphs. CTW 2011: 244-247 - 2010
- [j21]Torsten Korneffel, Eberhard Triesch:
An asymptotic bound for the complexity of monotone graph properties. Comb. 30(6): 735-743 (2010) - [c1]Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch:
A Better Bouncer's Algorithm. FUN 2010: 113-120
2000 – 2009
- 2005
- [j20]Jens Schlaghoff, Eberhard Triesch:
Improved Results for Competitive Group Testing. Comb. Probab. Comput. 14(1-2): 191-202 (2005) - 2004
- [b1]Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch:
Optimization theory. Kluwer 2004, ISBN 978-1-4020-8098-2, pp. I-XI, 1-443 - 2003
- [j19]F. Jelen, Eberhard Triesch:
Superdominance order and distance of trees with bounded maximum degree. Discret. Appl. Math. 125(2-3): 225-233 (2003) - 2002
- [j18]Andreas Huck, Eberhard Triesch:
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. Comb. 22(3): 409-416 (2002) - [j17]Dieter Rautenbach, Eberhard Triesch:
Reconstruction up to isometries. Discret. Math. 259(1-3): 331-336 (2002) - [j16]Dieter Rautenbach, Eberhard Triesch:
Reconstructing Infinite Sets of Integers. J. Comb. Theory A 99(2): 297-306 (2002)
1990 – 1999
- 1999
- [j15]Jörg Nowakovski, Werner Schwärzler, Eberhard Triesch:
Using the generalized assignment problem in scheduling the ROSAT space telescope. Eur. J. Oper. Res. 112(3): 531-541 (1999) - 1996
- [j14]Eberhard Triesch:
On the Recognition Complexity of Some Graph Properties. Comb. 16(2): 259-268 (1996) - [j13]Eberhard Triesch:
A Group Testing Problem for Hypergraphs of Bounded Rank. Discret. Appl. Math. 66(2): 185-188 (1996) - [j12]Eberhard Triesch:
Degree sequences of graphs and dominance order. J. Graph Theory 22(1): 89-93 (1996) - 1995
- [j11]Martin Aigner, Eberhard Triesch, Zsolt Tuza:
Searching for acyclic orientations of graphs. Discret. Math. 144(1-3): 3-10 (1995) - 1994
- [j10]Eberhard Triesch:
A probabilistic upper bound for the edge identification complexity of graphs. Discret. Math. 125(1-3): 371-376 (1994) - [j9]Martin Aigner, Eberhard Triesch:
Realizability and uniqueness in graphs. Discret. Math. 136(1-3): 3-20 (1994) - [j8]Martin Aigner, Eberhard Triesch:
Codings of graphs with binary edge labels. Graphs Comb. 10(1): 1-10 (1994) - [j7]Eberhard Triesch:
Some Results on Elusive Graph Properties. SIAM J. Comput. 23(2): 247-254 (1994) - 1993
- [j6]Martin Aigner, Eberhard Triesch:
Reconstructing a Graph from its Neighborhood Lists. Comb. Probab. Comput. 2: 103-113 (1993) - [j5]Ingo Althöfer, Eberhard Triesch:
Edge search in graphs and hypergraphs of bounded rank. Discret. Math. 115(1-3): 1-9 (1993) - [j4]Horst W. Hamacher, Eberhard Triesch:
Book reviews. ZOR Methods Model. Oper. Res. 38(2): 230-233 (1993) - 1990
- [j3]Eberhard Triesch:
A note on a theorem of Blum, Shub, and Smale. J. Complex. 6(2): 166-169 (1990) - [j2]Martin Aigner, Eberhard Triesch:
Irregular Assignments of Trees and Forests. SIAM J. Discret. Math. 3(4): 439-449 (1990)
1980 – 1989
- 1988
- [j1]Martin Aigner, Eberhard Triesch:
Searching for an edge in a graph. J. Graph Theory 12(1): 45-57 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
