sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000116486234 | 1 hits
Person
ISNI: 
0000 0001 1648 6234
Name: 
Andreas Brandstädt (German mathematician and computer scientist)
Brandstädt, A.
Brandstädt, Andreas
Dates: 
1949-
Creation class: 
article
Computer file
Language material
Text
Creation role: 
author
contributor
editor
Related names: 
Chepoi, Victor D.
Dragan, Feodor F.
Jena, Univ
Kratsch, Dieter
Le, Van Bang
Le, Van Bang (1959-)
Mosca, Raffaele
Müller, Haiko
Nicolai, Falk
Spinrad, Jeremy P.
Thulasiraman, K.
Universität Rostock Fachbereich Informatik
Vanherpe, Jean-Marie
Titles: 
algorithmic use of hypertree structure and maximum neighbourhood orderings
Chordality properties of trapezoid graphs
Distance hereditary 5-leaf powers
Graph classes : a survey
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 clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
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
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 graphs with degree constraints
Special graph classes
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
Twenty-seventh International Workshop on Graph Theoretic Concepts in Computer Science
Über einige Klassen nichthierarchischer stochastischer Prozesse
Uniform simulations of nondeterministic real time multitape turing machines
WG 2001
Zu Raum- und Zeitkompliziertheitsklassen auf nichtdeterministischen Turingakzeptoren
Contributed to or performed: 
LECTURE NOTES IN COMPUTER SCIENCE
THEORETICAL COMPUTER SCIENCE -AMSTERDAM-
Notes: 
Jena, Univ., Diss. B, 1983 (Nicht f.d. Austausch)
Sources: 
VIAF DNB LC NUKAT SUDOC WKD
BOWKER
NTA
ZETO