Andreas Brandstädt

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 37

Top Venues

CoRR

Discret. Appl. Math.

Inf. Process. Lett.

Theor. Comput. Sci.

University of Jena, Germany (PHD)

Education History

University of Jena, Germany

PHD

Publications

Andreas Brandstädt, Raffaele Mosca
Finding dominating induced matchings in P10-free graphs in polynomial time. Theor. Comput. Sci. 990 (2024)
Andreas Brandstädt, Raffaele Mosca
Combining decomposition approaches for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 960 (2023)
Andreas Brandstädt, Raffaele Mosca
-free graphs in polynomial time. Discuss. Math. Graph Theory 42 (4) (2022)
Andreas Brandstädt, Raffaele Mosca
, triangle)-free graphs in polynomial time. Theor. Comput. Sci. (2021)
Andreas Brandstädt
-Free Chordal Bipartite Graphs in Polynomial Time. CoRR (2021)
Andreas Brandstädt, Raffaele Mosca
-Free Bipartite Graphs in Polynomial Time. CoRR (2021)
Andreas Brandstädt, Raffaele Mosca
-Free Bipartite Graphs in Polynomial Time. CoRR (2020)
Andreas Brandstädt, Raffaele Mosca
-Free Bipartite Graphs in Polynomial Time. CoRR (2020)
Andreas Brandstädt, Raffaele Mosca
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. 283 (2020)
Andreas Brandstädt, Raffaele Mosca
Dominating induced matchings in S1, 2, 4-free graphs. Discret. Appl. Math. 278 (2020)
Andreas Brandstädt, Raffaele Mosca
Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. Discret. Appl. Math. 284 (2020)
Andreas Brandstädt, Raffaele Mosca
On efficient domination for some classes of H-free chordal graphs. Discret. Appl. Math. 281 (2020)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs in Polynomial Time. CoRR (2019)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs in Polynomial Time. CoRR (2019)
Andreas Brandstädt, Raffaele Mosca
On efficient domination for some classes of H-free bipartite graphs. Discret. Appl. Math. 270 (2019)
Andreas Brandstädt, Martin Milanic
A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. 142 (2019)
Andreas Brandstädt, Raffaele Mosca
, Triangle)-Free Graphs in Polynomial Time. CoRR (2018)
Andreas Brandstädt
Efficient Domination and Efficient Edge Domination: A Brief Survey. CALDAM (2018)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discret. Appl. Math. 236 (2018)
Andreas Brandstädt, Raffaele Mosca
On Efficient Domination for Some Classes of H-Free Bipartite Graphs. CoRR (2018)
Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. Discret. Appl. Math. 250 (2018)
Andreas Brandstädt, Raffaele Mosca
Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discret. Appl. Math. 237 (2018)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs in Polynomial Time. Algorithmica 77 (4) (2017)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. CoRR (2017)
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
-Free Chordal Graphs. J. Graph Theory 86 (1) (2017)
Andreas Brandstädt, Raffaele Mosca
-Free Chordal Graphs. Electron. Notes Discret. Math. 62 (2017)
Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick
-free graphs. Discret. Appl. Math. 223 (2017)
Andreas Brandstädt, Raffaele Mosca
On Efficient Domination for Some Classes of H-Free Chordal Graphs. CoRR (2017)
Andreas Brandstädt, Raffaele Mosca
On Chordal-k-Generalized Split Graphs. CoRR (2017)
Andreas Brandstädt, Raffaele Mosca
Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. CoRR (2017)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time. CoRR (2016)
Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca
Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. CoRR (2016)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs. SIAM J. Discret. Math. 30 (4) (2016)
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti
Clique cycle-transversals in distance-hereditary graphs. Discret. Appl. Math. 210 (2016)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the clique-width of H-free split graphs. Discret. Appl. Math. 211 (2016)
Andreas Brandstädt, T. Karthick
-free graphs. Discret. Appl. Math. 201 (2016)
Andreas Brandstädt, Raffaele Mosca
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG (2016)
Andreas Brandstädt, Elaine M. Eschen, Erik Friese
-Free Graphs in Polynomial Time. CoRR (2015)
Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. 184 (2015)
Andreas Brandstädt, Vassilis Giakoumakis
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 115 (2) (2015)
Andreas Brandstädt, Raffaele Mosca
Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. CoRR (2015)
Andreas Brandstädt
-Free Graphs in Linear Time. CoRR (2015)
Andreas Brandstädt, Elaine M. Eschen, Erik Friese
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. WG (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) (2015)
Andreas Brandstädt, Raffaele Mosca
-free Graphs in Polynomial Time. CoRR (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of $H$-free Split Graphs. CoRR (2015)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. CoRR (2015)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. Graphs Comb. 31 (5) (2015)
Anne Berry, Andreas Brandstädt, Konrad Engel
The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs Comb. 31 (5) (2015)
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. 49 (2015)
Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115 (2) (2015)
Andreas Brandstädt, T. Karthick
-free Graphs. CoRR (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. CoRR (2015)
Andreas Brandstädt, Van Bang Le
-free graphs. Inf. Process. Lett. 114 (7) (2014)
Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs. CoRR (2014)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
Preface. Discret. Appl. Math. 163 (2014)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica 68 (4) (2014)
Andreas Brandstädt, Vassilis Giakoumakis
Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time. CoRR (2014)
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti
Clique cycle transversals in distance-hereditary graphs. Electron. Notes Discret. Math. 44 (2013)
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti
Clique cycle-transversals in distance-hereditary graphs CoRR (2013)
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
New Polynomial Cases of the Weighted Efficient Domination Problem CoRR (2013)
Anne Berry, Andreas Brandstädt, Konrad Engel
The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR (2013)
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS (2013)
Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. Theor. Comput. Sci. 487 (2013)
Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
Cycle transversals in perfect graphs and cographs. Theor. Comput. Sci. 469 (2013)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull CoRR (2012)
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC (2012)
Andreas Brandstädt, Vassilis Giakoumakis
Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 112 (3) (2012)
Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discret. Appl. Math. 160 (4-5) (2012)
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs CoRR (2012)
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
Path-Bicolorable Graphs. Graphs Comb. 27 (6) (2011)
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports 1 (5) (2011)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings for P7-Free Graphs in Linear Time CoRR (2011)
Andreas Brandstädt, Raffaele Mosca
On distance-3 matchings and induced matchings. Discret. Appl. Math. 159 (7) (2011)
Andreas Brandstädt, Vassilis Giakoumakis
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences CoRR (2011)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC (2011)
Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica 56 (4) (2010)
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
Exact leaf powers. Theor. Comput. Sci. 411 (31-33) (2010)
Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner
Rooted directed path graphs are leaf powers. Discret. Math. 310 (4) (2010)
Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. 24 (1) (2010)
Andreas Brandstädt, Peter Wagner
)-leaf powers. Discret. Appl. Math. 158 (2) (2010)
Andreas Brandstädt, Christian Hundt, Ragnar Nevries
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. LATIN (2010)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le
Preface. Discret. Appl. Math. 157 (9) (2009)
Andreas Brandstädt, Raffaele Mosca
On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought (2009)
Peter Wagner, Andreas Brandstädt
The complete inclusion structure of leaf power classes. Theor. Comput. Sci. 410 (52) (2009)
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought (2009)
Andreas Brandstädt, Van Bang Le
Simplicial powers of graphs. Theor. Comput. Sci. 410 (52) (2009)
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. 309 (12) (2009)
Andreas Brandstädt, Van Bang Le
Simplicial Powers of Graphs. COCOA (2008)
Andreas Brandstädt, Chính T. Hoàng
Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52 (4) (2008)
Andreas Brandstädt, Christian Hundt
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. LATIN (2008)
Andreas Brandstädt, Peter Wagner
On k-Versus (k+1)-Leaf Powers. COCOA (2008)
Andreas Brandstädt, Van Bang Le, R. Sritharan
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5 (1) (2008)
Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC (2008)
Andreas Brandstädt, Elaine M. Eschen, R. Sritharan
The induced matching and chain subgraph cover problems for convex bipartite graphs. Theor. Comput. Sci. 381 (1-3) (2007)
Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007)
Andreas Brandstädt, Van Bang Le, Suhail Mahfud
New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 370 (1-3) (2007)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47 (1) (2007)
Andreas Brandstädt, Peter Wagner
)-Leaf Powers. MFCS (2007)
Andreas Brandstädt, Chính T. Hoàng
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Theor. Comput. Sci. 389 (1-2) (2007)

Andreas Brandstädt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Brandstädt