Brandstädt, Andreas, 1949-
Brandstädt, Andreas
Andreas Brandstädt deutscher Mathematiker und Informatiker
VIAF ID: 56710036 ( Personal )
Permalink: http://viaf.org/viaf/56710036
Preferred Forms
- 100 0 _ ‡a Andreas Brandstädt ‡c deutscher Mathematiker und Informatiker
- 200 _ | ‡a Brandstädt ‡b Andreas
-
- 100 1 0 ‡a Brandstädt, Andreas
-
-
- 100 1 _ ‡a Brandstädt, Andreas ‡d 1949-
- 100 1 _ ‡a Brandstädt, Andreas, ‡d 1949-....
-
- 100 1 _ ‡a Brandstädt, Andreas
-
-
-
- 100 1 _ ‡a Brandstädt, Andreas ‡d 1949-
-
4xx's: Alternate Name Forms (9)
5xx's: Related Names (1)
- 551 _ _ ‡a Jena, Duisburg, Rostock ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
Works
Title | Sources |
---|---|
algorithmic use of hypertree structure and maximum neighbourhood orderings | |
Chordality properties of trapezoid graphs | |
Distance hereditary 5-leaf powers | |
Efficient domination and polarity | |
Finding dominating induced matchings in P₉-free graphs in polynomial time | |
Graph classes, 1999: | |
Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings | |
Graphen und algorithmen | |
Handbook of graph theory, combinatorial optimization, and algorithms | |
Homogeneously orderable graphs | |
Lehr- und Übungsbuch Informatik | |
linear time algorithm for connected r-domination and Steiner tree on distance hereditary graphs | |
On improved bounds for permutation graph problems | |
On (P5, gem) free graphs and related graph classes structure and algorithmic applications | |
On prime (P5, claw)-free, (P5, bull)-free, and (bull, claw)-free graphs and the maximum stable set problem | |
On the clique width of graph classes defined by three forbidden P4-extensions | |
On variations of P4-sparse graphs | |
(P5, diamond) - free graphs revisited structure, bounded clique width and linear time optimization | |
Partitions of graphs into one or two independent sets and cliques (revised version) | |
Perfect elimination orderings of chordal powers of graphs | |
Powers of HHD-free graphs | |
Proceedings of the Conference on Optimal Discrete Structures and Algorithms, ODSA '97, 8-10 September 1997, Rostock, Germany | |
R-dominating cliques in helly graphs and chordal graphs | |
Robust and approximative algorithms on particular graph classes 04221 abstracts collection ; Dagstuhl seminar | |
Short disjoint cycles in cubic bridgeless graphs | |
Split perfect graphs characterizations and algorithmic use | |
Structure and linear time recognition of 4 leaf powers | |
Structure and stability number of (chair, Co-P, gem)-free graphs revisited | |
Tree spanners for bipartite graphs and probe interval graphs | |
Über einige Klassen nichthierarchischer stochastischer Prozesse | |
Uniform simulations of nondeterministic real time multitape turing machines | |
WG 2001 | |
Zu Raum- und Zeitkompliziertheitsklassen auf nichtdeterministischen Turingakzeptoren |