World's Best Scientists 2026 revealed!
Andreas Brandstädt

Andreas Brandstädt

D-Index & Metrics

Computer Science

D-Index
37
Citations
6990
World Ranking
10614
National Ranking
532

Mathematics

D-Index
37
Citations
6976
World Ranking
2463
National Ranking
152

Overview

Andreas Brandstädt is affiliated with the University of Rostock in Germany and specializes in computer science with a focus on computational theory and mathematics. Their work spans several subfields, including computer networks and communications, discrete mathematics and combinatorics, geometry and topology, and electrical and electronic engineering.

The primary areas of research addressed by Brandstädt include advanced graph theory research, complexity and algorithms in graphs, graph labeling and dimension problems, cooperative communication and network coding, limits and structures in graph theory, interconnection networks and systems, and optimization and search problems.

Recent papers by Brandstädt are as follows:

  • Finding dominating induced matchings in S2,2,3-free graphs in polynomial time, 2020, published in Discrete Applied Mathematics
  • Finding dominating induced matchings in S1,1,5-free graphs in polynomial time, 2020, published in Discrete Applied Mathematics
  • Maximum weight independent sets for (S1,2,4,triangle)-free graphs in polynomial time, 2021, published in Theoretical Computer Science
  • Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time, 2021, published in arXiv (Cornell University)
  • Finding Efficient Domination for S1,3,3-Free Bipartite Graphs in Polynomial Time, 2020, published in arXiv (Cornell University)

Frequent co-authors working with Brandstädt include:

  • Raffaele Mosca
  • Vadim Lozin
  • Christian Rosenke
  • Van Bang Lê
  • Martin Charles Golumbic

Brandstädt's research has appeared predominantly in the following publication venues:

  • SSRN Electronic Journal
  • Theoretical Computer Science
  • Discrete Applied Mathematics
  • arXiv (Cornell University)

Their focus on computational theory and mathematical foundations of computer science contributes to an understanding of graph-theoretic problems and related algorithmic challenges. The topics of advanced graph theory, algorithmic complexity, and graph dimension form the core of their scholarly output.

Best Publications

  • Graph Classes : A Survey

    Andreas Brandstädt;Van Bang Le;Jeremy P. Spinrad

  • Bipartite permutation graphs

    Jeremy Spinrad;Andreas Brandstädt;Lorna Stewart

  • Dually Chordal Graphs

    Andreas Brandstädt;Feodor Dragan;Victor Chepoi;Vitaly Voloshin

  • The NP-completeness of Steiner Tree and Dominating Set for chordal bipartite graphs

    Haiko Müller;Andreas Brandstädt

  • Partitions of graphs into one or two independent sets and cliques

    Andreas Brandstädt

  • On domination problems for permutation and other graphs

    Andreas Brandstädt;Dieter Kratsch

  • The algorithmic use of hypertree structure and maximum neighbourhood orderings

    Andreas Brandstädt;Victor D. Chepoi;Feodor F. Dragan

  • Distance Approximating Trees for Chordal and Dually Chordal Graphs

    Andreas Brandstädt;Victor Chepoi;Feodor Dragan

  • Convexity and HHD-Free Graphs

    Feodor F. Dragan;Falk Nicolai;Andreas Brandstädt

  • On the linear structure and clique-width of bipartite permutation graphs.

    Andreas Brandstädt;Vadim V. Lozin

  • On the structure of (P5,gem)-free graphs

    Andreas Brandstädt;Dieter Kratsch

  • The complexity of some problems related to Graph 3-COLORABILITY

    Andreas Brandstädt;Van Bang Le;Thomas Szymczak

  • New Graph Classes of Bounded Clique-Width

    Andreas Brandstädt;Feodor F. Dragan;Hoàng-Oanh Le;Raffaele Mosca

  • On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem

    Andreas Brandstädt;Chính T. Hoàng

  • Graphen und Algorithmen

    Andreas Brandstädt

  • Clique-Width for 4-Vertex Forbidden Subgraphs

    Andreas Brandstadt;Joost Engelfriet;Hoang-Oanh Le;Vadim V. Lozin

  • On the restriction of some NP-complete graph problems to permutation graphs

    Andreas Brandstädt;Dieter Kratsch

  • Structure and linear time recognition of 3-leaf powers

    Andreas Brandstädt;Van Bang Le

  • On the structure and stability number of P 5 - and co-chair-free graphs

    Andreas Brandstädt;Raffaele Mosca

  • GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH

    Andreas Brandstädt;Hoàng-Oanh Le;Raffaele Mosca

Frequent Co-Authors

Feodor F. Dragan
Feodor F. Dragan Kent State University
Dieter Kratsch
Dieter Kratsch University of Lorraine
Vadim V. Lozin
Vadim V. Lozin University of Warwick
Victor Chepoi
Victor Chepoi Aix-Marseille University
Daniël Paulusma
Daniël Paulusma Durham University
Klaus Jansen
Klaus Jansen Kiel University
Martin Charles Golumbic
Martin Charles Golumbic University of Haifa
Joost Engelfriet
Joost Engelfriet Leiden University
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Peter L. Hammer
Peter L. Hammer Rutgers, The State University of New Jersey

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics in the USA, exploring related online degrees can open diverse career opportunities. Many professionals combine mathematical skills with business knowledge by pursuing an easiest mba program that balances accessibility with quality education. These programs provide a strong foundation in management while enhancing analytical skills.

Additionally, the easiest online mba degrees are ideal for working professionals seeking flexibility without compromising academic rigor. These online formats accommodate busy schedules, making it easier to upskill alongside a full-time career.

For those aiming at advanced leadership roles, online doctorate options, such as dba programs online, focus on business administration with a research perspective. These programs are designed to deepen expertise in strategic decision-making and organizational management.

Moreover, pursuing an online masters in finance complements a Mathematics background, opening doors in finance-driven sectors such as investment banking, financial analysis, and risk management. Together, these degrees offer versatile pathways that integrate quantitative skills with business acumen.

Best Scientists Citing Andreas Brandstädt

Trending Scientists