|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Robert Scheidweiler, Eberhard Triesch |
Matchings in balanced hypergraphs.  |
CTW  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Torsten Korneffel, Eberhard Triesch |
An asymptotic bound for the complexity of monotone graph properties. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch |
A Better Bouncer's Algorithm. |
FUN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Schlaghoff, Eberhard Triesch |
Improved Results for Competitive Group Testing. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch |
Optimization theory. |
|
2004 |
RDF |
|
| 1 | F. Jelen, Eberhard Triesch |
Superdominance order and distance of trees with bounded maximum degree. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Eberhard Triesch |
Reconstructing Infinite Sets of Integers. |
J. Comb. Theory, Ser. A |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Eberhard Triesch |
Reconstruction up to isometries. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Huck, Eberhard Triesch |
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C65, 05C70 |
| 1 | Jörg Nowakovski, Werner Schwärzler, Eberhard Triesch |
Using the generalized assignment problem in scheduling the ROSAT space telescope. |
European Journal of Operational Research |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eberhard Triesch |
On the Recognition Complexity of Some Graph Properties. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Eberhard Triesch |
A Group Testing Problem for Hypergraphs of Bounded Rank. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aigner, Eberhard Triesch, Zsolt Tuza |
Searching for acyclic orientations of graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Eberhard Triesch |
A probabilistic upper bound for the edge identification complexity of graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aigner, Eberhard Triesch |
Realizability and uniqueness in graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aigner, Eberhard Triesch |
Codings of graphs with binary edge labels. |
Graphs and Combinatorics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Eberhard Triesch |
Some Results on Elusive Graph Properties. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Althöfer, Eberhard Triesch |
Edge search in graphs and hypergraphs of bounded rank. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aigner, Eberhard Triesch |
Reconstructing a Graph from its Neighborhood Lists. |
Combinatorics, Probability & Computing |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Eberhard Triesch |
A note on a theorem of Blum, Shub, and Smale. |
J. Complexity |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aigner, Eberhard Triesch |
Irregular Assignments of Trees and Forests. |
SIAM J. Discrete Math. |
1990 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")