default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Andreae
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j37]Thomas Andreae:
Classes of locally finite ubiquitous graphs. J. Comb. Theory B 103(2): 274-290 (2013)- 2008
- [j36]Thomas Andreae:
On self-immersions of infinite graphs. J. Graph Theory 58(4): 275-285 (2008) - 2005
- [j35]Thomas Andreae:
Reconstructing the number of blocks of an infinite graph. Discret. Math. 297(1-3): 144-151 (2005) - 2003
- [j34]Thomas Andreae:
On immersions of uncountable graphs. J. Comb. Theory B 87(1): 130-137 (2003) - 2002
- [j33]Thomas Andreae:
On disjoint configurations in infinite graphs. J. Graph Theory 39(4): 222-229 (2002) - 2001
- [j32]Thomas Andreae:
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38(2): 59-67 (2001) - 1999
- [j31]Thomas Andreae, Felix Hartenstein, Andrea Wolter:
A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men. Theor. Comput. Sci. 215(1-2): 305-323 (1999) - 1998
- [j30]Thomas Andreae:
On the clique-transversal number of chordal graphs. Discret. Math. 191(1-3): 3-11 (1998) - [j29]Thomas Andreae, Martin Hintz:
On Hypercubes in de Bruijn Graphs. Parallel Process. Lett. 8(2): 259-268 (1998) - 1997
- [j28]Thomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng:
Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three. Discret. Appl. Math. 79(1-3): 3-34 (1997) - [j27]Thomas Andreae, Michael Nölle, Gerald Schreiber:
Embedding Cartesian Products of Graphs into de Bruijn Graphs. J. Parallel Distributed Comput. 46(2): 194-200 (1997) - 1996
- [j26]Thomas Andreae:
On independent cycles and edges in graphs. Discret. Math. 149(1-3): 291-297 (1996) - [j25]Thomas Andreae, Carsten Flotow:
On covering all cliques of a chordal graph. Discret. Math. 149(1-3): 299-302 (1996) - 1995
- [j24]Thomas Andreae, Hans-Jürgen Bandelt:
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities. SIAM J. Discret. Math. 8(1): 1-16 (1995) - 1994
- [j23]Thomas Andreae:
On Reconstructing Rooted Trees. J. Comb. Theory B 62(2): 183-198 (1994) - 1993
- [j22]Thomas Andreae, Ulf Hennig, Andreas Parra:
On a Problem Concerning Tolerance Graphs. Discret. Appl. Math. 46(1): 73-78 (1993) - 1992
- [j21]Thomas Andreae:
Some Results on Visibility Graphs. Discret. Appl. Math. 40(1): 5-17 (1992) - 1991
- [j20]Thomas Andreae, Martin Schughart, Zsolt Tuza:
Clique-transversal sets of line graphs and complements of line graphs. Discret. Math. 88(1): 11-20 (1991) - [j19]Thomas Andreae:
A search problem on graphs which generalizes some group testing problems with two defectives. Discret. Math. 88(2-3): 121-127 (1991) - 1989
- [j18]Thomas Andreae:
A ternary search problem on graphs. Discret. Appl. Math. 23(1): 1-10 (1989) - [j17]Thomas Andreae, Martin Aigner:
The total interval number of a graph. J. Comb. Theory B 46(1): 7-21 (1989) - 1988
- [j16]Thomas Andreae:
On the unit interval number of a graph. Discret. Appl. Math. 22(1): 1-7 (1988) - [j15]Thomas Andreae:
A Remark on Perfect Gaussian Elimination of Symmetric Matrices. Eur. J. Comb. 9(6): 547-549 (1988) - 1987
- [j14]Thomas Andreae:
On the Interval Number of a Triangulated Graph. J. Graph Theory 11(3): 273-280 (1987) - 1986
- [j13]Thomas Andreae:
On well-quasi-ordering finite graphs by immersion. Comb. 6(4): 287-298 (1986) - [j12]Thomas Andreae:
On an extremal problem concerning the interval number of a graph. Discret. Appl. Math. 14(1): 1-9 (1986) - [j11]Thomas Andreae:
On a pursuit game played on graphs for which a minor is excluded. J. Comb. Theory B 41(1): 37-47 (1986) - 1985
- [j10]Thomas Andreae:
On superperfect noncomparability graphs. J. Graph Theory 9(4): 523-532 (1985) - 1984
- [j9]Thomas Andreae:
Note on a pursuit game played on graphs. Discret. Appl. Math. 9(2): 111-115 (1984) - [j8]Thomas Andreae, Rüdiger Schmidt:
On the reconstruction of rayless infinite forests. J. Graph Theory 8(3): 405-422 (1984) - 1982
- [j7]Thomas Andreae:
Reconstructing the degree sequence and the number of components of an infinite graph. Discret. Math. 39(1): 1-7 (1982) - [j6]Thomas Andreae:
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs. J. Comb. Theory B 32(3): 258-263 (1982) - [j5]Thomas Andreae:
Note on the reconstruction of infinite graphs with a fixed finite number of components. J. Graph Theory 6(1): 81-83 (1982) - 1981
- [j4]Thomas Andreae:
On the reconstruction of locally finite trees. J. Graph Theory 5(2): 123-135 (1981) - 1980
- [j3]Thomas Andreae:
On a problem of R. Halin concerning infinite graphs II. Discret. Math. 29(3): 219-227 (1980) - 1979
- [j2]Thomas Andreae:
Über eine eigenschaft lokalfiniter, unendlicher bäume. J. Comb. Theory B 27(2): 202-215 (1979) - 1978
- [j1]Thomas Andreae:
Matroidal families of finite connected nonhomeomorphic graphs exist. J. Graph Theory 2(2): 149-153 (1978)
Conference and Workshop Papers
- 1995
- [c2]Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber:
On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One. Combinatorics and Computer Science 1995: 316-327 - 1994
- [c1]Thomas Andreae, Michael Nölle, Gerald Schreiber:
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). WG 1994: 140-150
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 21:28 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:
