Andreas Brandstädt | Academic Influence

Andreas Brandstädt's AcademicInfluence.com Rankings

Andreas Brandstädt

Computer Science

#2755

World Rank

#2883

Historical Rank

Theoretical Computer Science

#61

World Rank

#61

Historical Rank

computer-science Degrees

Andreas Brandstädt

Mathematics

#3801

World Rank

#5525

Historical Rank

Graph Theory

#72

World Rank

#80

Historical Rank

Measure Theory

#2750

World Rank

#3283

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Andreas Brandstädt's Degrees

PhD Computer Science Paderborn University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2024

Why Is Andreas Brandstädt Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Andreas Brandstädt is a German mathematician and computer scientist. Life and work He graduated from the Friedrich Schiller University of Jena, Germany, with a Ph.D. in stochastics in 1976 and a habilitation in complexity theory in 1983. Since 1974 he worked there in the group of his academic teacher Gerd Wechsung.

(See a Problem?)

Andreas Brandstädt's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Graph Classes: A Survey (1987) (1819)
Bipartite permutation graphs (1987) (225)
Dually Chordal Graphs (1993) (149)
The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs (1987) (120)
Partitions of graphs into one or two independent sets and cliques (1996) (93)
On Domination Problems for Permutation and Other Graphs (1987) (79)
Distance Approximating Trees for Chordal and Dually Chordal Graphs (1999) (79)
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (2005) (76)
On the linear structure and clique-width of bipartite permutation graphs (2003) (73)
New Graph Classes of Bounded Clique-Width (2002) (71)
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs (2015) (70)
Convexity and HHD-Free Graphs (1999) (64)
Handbook of graph theory, combinatorial optimization, and algorithms (2016) (63)
P6- and triangle-free graphs revisited: structure and bounded clique-width (2006) (62)
Clique-Width for 4-Vertex Forbidden Subgraphs (2006) (62)
The Complexity of some Problems Related to Graph 3-colorability (1998) (60)
LexBFS-orderings and powers of chordal graphs (1997) (53)
Structure and linear time recognition of 3-leaf powers (2006) (52)
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings (1994) (49)
Tree spanners on chordal graphs: complexity and algorithms (2004) (48)
Structure and linear-time recognition of 4-leaf powers (2008) (48)
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs (1998) (47)
On the structure and stability number of P5- and co-chair-free graphs (2003) (46)
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width (2005) (45)
Independent Sets of Maximum Weight in Apple-Free Graphs (2008) (45)
On the structure of (P5, gem)-free graphs (2005) (43)
On the restriction of some NP-complete graph problems to permutation graphs (1985) (42)
(P5, diamond)-free graphs revisited: structure and linear time optimization (2004) (40)
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (2012) (39)
LexBFS-Orderings and Power of Graphs (1996) (38)
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width (2004) (38)
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (2010) (37)
On stable cutsets in graphs (2000) (37)
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time (2002) (36)
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs (1997) (36)
Dominating Induced Matchings for P7-Free Graphs in Linear Time (2011) (35)
Bisplit graphs (2005) (35)
An in vitro study of the reliability of DIAGNOdent measurements. (2004) (33)
Tree Spanners for Bipartite Graphs and Probe Interval Graphs (2003) (31)
Maximum Induced Matchings for Chordal Graphs in Linear Time (2008) (29)
On Partitions of Permutations into Increasing and Decreasing Subsequences (1986) (29)
On the Stability Number of Claw-free P5-free and More General Graphs (1999) (29)
A note on alpha-redundant vertices in graphs (2001) (28)
On algorithms for (P5, gem)-free graphs (2005) (28)
Classes of bipartite graphs related to chordal graphs (1991) (28)
New Polynomial Cases of the Weighted Efficient Domination Problem (2013) (27)
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs (1999) (27)
Ptolemaic Graphs and Interval Graphs Are Leaf Powers (2008) (27)
Rooted directed path graphs are leaf powers (2010) (26)
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (2011) (26)
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (2014) (25)
On distance-3 matchings and induced matchings (2009) (25)
On linear and circular structure of (claw, net)-free graphs (2003) (25)
Stability number of bull- and chair-free graphs revisited (2003) (23)
On Independent Vertex Sets in Subclasses of Apple-Free Graphs (2010) (23)
Maximum weight independent set for ℓclaw-free graphs in polynomial time (2016) (22)
On Improved Time Bounds for Permutation Graph Problems (1992) (22)
Bounding the Clique‐Width of H‐Free Chordal Graphs (2015) (22)
New applications of clique separator decomposition for the Maximum Weight Stable Set problem (2005) (22)
Bounding the clique-width of H-free split graphs (2015) (21)
r-Dominating cliques in graphs with hypertree structure (1996) (20)
On variations of P4-sparse graphs (2003) (20)
The induced matching and chain subgraph cover problems for convex bipartite graphs (2007) (19)
The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions (1989) (18)
Structure and stability number of chair-, co-P- and gem-free graphs revisited (2003) (18)
Perfect elimination orderings of chordal powers of graphs (1996) (18)
Exact leaf powers (2010) (16)
Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time (2014) (16)
Maximum Weight Independent Sets in hole- and co-chair-free graphs (2012) (16)
Homogeneously Orderable Graphs (1997) (14)
Dominating Induced Matchings for P7-Free Graphs in Linear Time (2011) (13)
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull (2012) (13)
Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time (2015) (13)
A Relation Between Space, Return and Dual Return Complexities (1979) (13)
Weighted Efficient Domination for P5-Free and P6-Free Graphs (2016) (12)
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time (2015) (12)
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (2015) (12)
Cycle transversals in perfect graphs and cographs (2013) (11)
Clique-Width for Four-Vertex Forbidden Subgraphs (2005) (11)
On minimal prime extensions of a four-vertex graph in a prime graph (2004) (11)
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time (2015) (11)
Dominating Cliques in Graphs with Hypertree Structures (1994) (11)
On ( k , l)-Leaf Powers (2007) (11)
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (2009) (11)
Distance-Hereditary 5-Leaf Powers (2006) (11)
Simplicial powers of graphs (2008) (10)
On k-Versus (k+1)-Leaf Powers (2008) (10)
Weighted efficient domination in two subclasses of P6-free graphs (2016) (10)
Split-Perfect Graphs: Characterizations and Algorithmic Use (2000) (10)
Generalized Powers of Graphs and Their Algorithmic Use (2006) (9)
Recognizing the P4-structure of Block Graphs (2000) (9)
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes (2004) (8)
Finding Dominating Induced Matchings in $$P_8$$P8-Free Graphs in Polynomial Time (2015) (8)
Efficiently Recognizing the P4-Structure of Trees and of Bipartite Graphs Without Short Cycles (2000) (8)
Characterising (k, l)-leaf powers (2010) (8)
A note on efficient domination in a superclass of P5-free graphs (2014) (7)
Recognizing the P4-structure of Bipartite Graphs (1999) (7)
The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit, Dominating Set, Steiner Tree, and Bandwidth on Special Perfect Graphs (1987) (7)
Weighted Efficient Domination for P5-Free Graphs in Linear Time (2015) (6)
Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs (2017) (6)
Efficient domination for classes of P6-free graphs (2017) (5)
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs (2018) (5)
Duchet-type theorems for powers of HHD-free graphs (1997) (5)
Tree- and Forest-perfect Graphs (1999) (5)
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems (2002) (5)
Closure Properties of Certain Families of Formal Languages with Respect to a Generalization of Cyclic Closure (1981) (4)
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time (2019) (4)
On Efficient Domination for Some Classes of H-Free Bipartite Graphs (2018) (4)
Weighted Efficient Domination in Classes of P6-free Graphs (2015) (4)
Efficient Domination and Efficient Edge Domination: A Brief Survey (2018) (4)
Leaf powers (2021) (4)
On Robust Algorithms for the Maximum Weight Stable Set Problem (2001) (4)
Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time (2018) (4)
Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time (2017) (4)
On Efficient Domination for Some Classes of H-Free Chordal Graphs (2017) (3)
Clique cycle transversals in distance-hereditary graphs (2013) (3)
Powers of hhd-free graphs (1998) (3)
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs (2016) (3)
Corrigendum (1998) (3)
The Dilworth Number of Auto-Chordal Bipartite Graphs (2013) (3)
Efficiently recognizing , decomposing and triangulating hole-and diamond-free graphs (2012) (3)
The complete inclusion structure of leaf power classes (2009) (3)
On alpha-redundant vertices in P5-free graphs (2002) (3)
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs (2003) (2)
Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time (2021) (2)
Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (2001) (2)
Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs (2016) (2)
Homogeneously Orderable Graphs and the Steiner Tree Problem (1995) (2)
Reversal-Bounded and Visit-Bounded Realtime Computations (1983) (2)
Clique cycle-transversals in distance-hereditary graphs (2013) (1)
Short Disjoint Cycles in Cubic Bridgeless Graphs (1991) (1)
Graph-theoretic concepts in computer science : 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings (2001) (1)
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract) (1997) (1)
On the Domination Problem for Bipartite Graphs (1990) (1)
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes (2004) (1)
1 4 M ay 2 01 9 Finding Dominating Induced Matchings in S 1 , 1 , 5-Free Graphs in Polynomial Time (2019) (1)
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull (2014) (1)
Graph-theoretic concepts in computer science : 39th international workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, revised papers (2013) (1)
Finding Efficient Domination for S1, 3, 3-Free Bipartite Graphs in Polynomial Time (2020) (1)
Dominating Induced Matchings for P8-free Graphs in Polynomial Time (2015) (1)
On Chordal-k-Generalized Split Graphs (2017) (0)
Finding Dominating Induced Matchings in P8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_8$$\end{document}-Free Gra (2016) (0)
Edge Addition Planarity Testing Algorithm (2015) (0)
Finding Efficient Domination for (P9, S1, 1, 6, S1, 2, 5-Free Chordal Bipartite Graphs in Polynomial Time (2021) (0)
A dichotomy for weighted efficient dominating sets with bounded degree vertices (2019) (0)
Dually and strongly chordal graphs (2021) (0)
14. The Strong Perfect Graph Conjecture (1999) (0)
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs (Extended Abstract) (1999) (0)
On a Property of Homogeneous Gaussian L-Fields (1980) (0)
Recognizing the P4-structure of claw-free graphs and a larger graph class (2002) (0)
11. Algebraic Compositions and Recursive Definitions (1999) (0)
Chordality properties of trapezoid graphs (1991) (0)
4. Models and Interactions (1999) (0)
Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 99231) (2021) (0)
Pushdown Automata with Restricted Use of Storage Symbols (1981) (0)
Path-Bicolorable Graphs (2009) (0)
Preface: ODSA (2004) (0)
Short Disjoint Cycles in Graphs with Degree Constraints (1993) (0)
On a Family of Complexity Measures on Turing Machines, defined by Predicates (1978) (0)
7. Forbidden Subgraphs (1999) (0)
Uniform simulations of nondeterministic real time multitape turing machines (1986) (0)
8. Hypergraphs and Graphs (1999) (0)
12. Decompositions and Cutsets (1999) (0)
Space Classes, Intersection of Languages and Bounded Erasing Homomorphisms (1983) (0)
The Yin and Yang atomic structure of diamond-free hole-free graphs (2011) (0)
Planarity Testing Based on PC-Trees (2015) (0)
Finding Dominating Induced Matchings in $(S_{2,2,3},S_{1,4,4})$-Free Graphs in Polynomial Time (2017) (0)
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23] (2013) (0)
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182) (2011) (0)
Preface (2014) (0)
Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251) (2021) (0)
9. Matrices and Polyhedra (1999) (0)
Preface (2009) (0)
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007) (0)
Deposited in DRO : 21 August 2015 Version of attached le : Accepted Version Peer-review status of attached (2016) (0)
10. Distance Properties (1999) (0)
5. Vertex and Edge Orderings (1999) (0)
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 (2007) (0)
13. Threshold Graphs and Related Concepts (1999) (0)
The Dilworth Number of Auto-Chordal Bipartite Graphs (2014) (0)
2. Perfection, Generalized Perfection, and Related Concepts (1999) (0)
3. Cycles, Chords, and Bridges (1999) (0)
Graph-theoretic concepts in computer science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers (2007) (0)
Linear time algorithms for some NP-complete problems on (P5, Gem)-Free graphs (extended abstract) (2003) (0)

This paper list is powered by the following services:

Other Resources About Andreas Brandstädt

en.wikipedia.org

What Schools Are Affiliated With Andreas Brandstädt?

Andreas Brandstädt is affiliated with the following schools: