Andreas Brandstädt

196 papers A 2B 34C 2Journal 146Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Weighted efficient domination for P8-free bipartite graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2025	J	`jnl`	Independent sets of maximum weight beyond claw-free graphs and related problems. Theor. Comput. Sci. Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
2024	J	`jnl`	Finding dominating induced matchings in P10-free graphs in polynomial time. Theor. Comput. Sci. Andreas Brandstädt, Raffaele Mosca
2023	J	`jnl`	Combining decomposition approaches for the Maximum Weight Stable Set problem. Theor. Comput. Sci. Andreas Brandstädt, Raffaele Mosca
2022	J	`jnl`	Finding dominating induced matchings in P Discuss. Math. Graph Theory Andreas Brandstädt, Raffaele Mosca
2021	J	`jnl`	Finding Efficient Domination for (P CoRR Andreas Brandstädt
2021	J	`jnl`	Finding Efficient Domination for P CoRR Andreas Brandstädt, Raffaele Mosca
2021	J	`jnl`	Maximum weight independent sets for ( Theor. Comput. Sci. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Dominating induced matchings in S1, 2, 4-free graphs. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding Efficient Domination for S CoRR Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding Efficient Domination for S CoRR Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	On efficient domination for some classes of H-free chordal graphs. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2019	J	`jnl`	A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. Andreas Brandstädt, Martin Milanic
2019	J	`jnl`	Finding Dominating Induced Matchings in P CoRR Andreas Brandstädt, Raffaele Mosca
2019	J	`jnl`	Finding Dominating Induced Matchings in S CoRR Andreas Brandstädt, Raffaele Mosca
2019	J	`jnl`	On efficient domination for some classes of H-free bipartite graphs. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2018	—	`conf`	Efficient Domination and Efficient Edge Domination: A Brief Survey. CALDAM Andreas Brandstädt
2018	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings WG Andreas Brandstädt, Ekkehard Köhler, Klaus Meer
2018	J	`jnl`	Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	Maximum Weight Independent Sets for (S CoRR Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	On Efficient Domination for Some Classes of H-Free Bipartite Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. Discret. Appl. Math. Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic
2017	J	`jnl`	Bounding the Clique-Width of J. Graph Theory Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2017	J	`jnl`	Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	Efficient domination for classes of P Discret. Appl. Math. Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick
2017	J	`jnl`	Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	Finding Dominating Induced Matchings in P Algorithmica Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	On Chordal-k-Generalized Split Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	On Efficient Domination for Some Classes of Electron. Notes Discret. Math. Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	On Efficient Domination for Some Classes of H-Free Chordal Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2016	J	`jnl`	Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. CoRR Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca
2016	J	`jnl`	Bounding the clique-width of H-free split graphs. Discret. Appl. Math. Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2016	J	`jnl`	Clique cycle-transversals in distance-hereditary graphs. Discret. Appl. Math. Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti
2016	—	`ch.`	Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. Encyclopedia of Algorithms Andreas Brandstädt, Ragnar Nevries
2016	J	`jnl`	Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2016	J	`jnl`	Weighted Efficient Domination for P SIAM J. Discret. Math. Andreas Brandstädt, Raffaele Mosca
2016	B	`conf`	Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG Andreas Brandstädt, Raffaele Mosca
2016	J	`jnl`	Weighted efficient domination in two subclasses of P Discret. Appl. Math. Andreas Brandstädt, T. Karthick
2015	J	`jnl`	Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. Andreas Brandstädt, Vassilis Giakoumakis
2015	J	`jnl`	Bounding the Clique-Width of $H$-free Split Graphs. CoRR Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015	—	`conf`	Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015	J	`jnl`	Bounding the Clique-Width of H-free Chordal Graphs. CoRR Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015	J	`jnl`	Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2015	J	`jnl`	Dominating Induced Matchings for P CoRR Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Efficient Domination for Some Subclasses of P CoRR Andreas Brandstädt, Elaine M. Eschen, Erik Friese
2015	B	`conf`	Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. WG Andreas Brandstädt, Elaine M. Eschen, Erik Friese
2015	J	`jnl`	Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
2015	J	`jnl`	Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. Graphs Comb. Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
2015	J	`jnl`	The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs Comb. Anne Berry, Andreas Brandstädt, Konrad Engel
2015	J	`jnl`	Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Weighted Efficient Domination for P CoRR Andreas Brandstädt
2015	J	`jnl`	Weighted Efficient Domination in Classes of P CoRR Andreas Brandstädt, T. Karthick
2014	J	`jnl`	A note on efficient domination in a superclass of P Inf. Process. Lett. Andreas Brandstädt, Van Bang Le
2014	J	`jnl`	Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica Andreas Brandstädt, Raffaele Mosca
2014	J	`jnl`	Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs. CoRR Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
2014	J	`jnl`	Preface. Discret. Appl. Math. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
2014	J	`jnl`	Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Vassilis Giakoumakis
2013	J	`jnl`	Clique cycle transversals in distance-hereditary graphs. Electron. Notes Discret. Math. Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti
2013	J	`jnl`	Clique cycle-transversals in distance-hereditary graphs CoRR Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti
2013	J	`jnl`	Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. Theor. Comput. Sci. Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2013	J	`jnl`	Cycle transversals in perfect graphs and cographs. Theor. Comput. Sci. Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2013	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers WG Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk
2013	J	`jnl`	New Polynomial Cases of the Weighted Efficient Domination Problem CoRR Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2013	B	`conf`	New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2013	J	`jnl`	The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR Anne Berry, Andreas Brandstädt, Konrad Engel
2012	J	`jnl`	Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discret. Appl. Math. Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
2012	J	`jnl`	Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs CoRR Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
2012	B	`conf`	Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
2012	J	`jnl`	Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull CoRR Andreas Brandstädt, Raffaele Mosca
2012	J	`jnl`	Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. Andreas Brandstädt, Vassilis Giakoumakis
2011	J	`jnl`	Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences CoRR Andreas Brandstädt, Vassilis Giakoumakis
2011	B	`conf`	Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC Andreas Brandstädt, Raffaele Mosca
2011	J	`jnl`	Dominating Induced Matchings for P7-Free Graphs in Linear Time CoRR Andreas Brandstädt, Raffaele Mosca
2011	J	`jnl`	Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
2011	J	`jnl`	On distance-3 matchings and induced matchings. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2011	J	`jnl`	Path-Bicolorable Graphs. Graphs Comb. Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
2010	J	`jnl`	Characterising (k, Discret. Appl. Math. Andreas Brandstädt, Peter Wagner
2010	B	`conf`	Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. LATIN Andreas Brandstädt, Christian Hundt, Ragnar Nevries
2010	J	`jnl`	Exact leaf powers. Theor. Comput. Sci. Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
2010	J	`jnl`	Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
2010	J	`jnl`	On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
2010	J	`jnl`	Rooted directed path graphs are leaf powers. Discret. Math. Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner
2009	J	`jnl`	A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
2009	—	`conf`	On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought Andreas Brandstädt, Raffaele Mosca
2009	—	`conf`	Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
2009	J	`jnl`	Preface. Discret. Appl. Math. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le
2009	J	`jnl`	Simplicial powers of graphs. Theor. Comput. Sci. Andreas Brandstädt, Van Bang Le
2009	J	`jnl`	The complete inclusion structure of leaf power classes. Theor. Comput. Sci. Peter Wagner, Andreas Brandstädt
2008	B	`conf`	Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
2008	J	`jnl`	Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica Andreas Brandstädt, Chính T. Hoàng
2008	C	`conf`	On k-Versus (k+1)-Leaf Powers. COCOA Andreas Brandstädt, Peter Wagner
2008	B	`conf`	Ptolemaic Graphs and Interval Graphs Are Leaf Powers. LATIN Andreas Brandstädt, Christian Hundt
2008	C	`conf`	Simplicial Powers of Graphs. COCOA Andreas Brandstädt, Van Bang Le
2008	J	`jnl`	Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms Andreas Brandstädt, Van Bang Le, R. Sritharan
2007	—	`conf`	07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
2007	—	`ed.`	Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
2007	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers WG Andreas Brandstädt, Dieter Kratsch, Haiko Müller
2007	J	`jnl`	New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. Andreas Brandstädt, Van Bang Le, Suhail Mahfud
2007	B	`conf`	On ( MFCS Andreas Brandstädt, Peter Wagner
2007	J	`jnl`	On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Theor. Comput. Sci. Andreas Brandstädt, Chính T. Hoàng
2007	J	`jnl`	The induced matching and chain subgraph cover problems for convex bipartite graphs. Theor. Comput. Sci. Andreas Brandstädt, Elaine M. Eschen, R. Sritharan
2007	J	`jnl`	Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2006	J	`jnl`	Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2006	J	`jnl`	Distance-Hereditary 5-Leaf Powers. Electron. Notes Discret. Math. Dieter Rautenbach, Andreas Brandstädt, Van Bang Le
2006	—	`conf`	Generalized Powers of Graphs and Their Algorithmic Use. SWAT Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
2006	J	`jnl`	Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. Andreas Brandstädt, Van Bang Le
2005	J	`jnl`	Bisplit graphs. Discret. Math. Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin
2005	J	`jnl`	Chordal co-gem-free and ( Discret. Appl. Math. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
2005	B	`conf`	Clique-Width for Four-Vertex Forbidden Subgraphs. FCT Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2005	B	`conf`	New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT Andreas Brandstädt, Van Bang Le, Suhail Mahfud
2005	J	`jnl`	New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2005	B	`conf`	On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. IPCO Andreas Brandstädt, Chính T. Hoàng
2005	J	`jnl`	On algorithms for ( Theor. Comput. Sci. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2005	J	`jnl`	On the structure of ( Discret. Appl. Math. Andreas Brandstädt, Dieter Kratsch
2004	J	`jnl`	(P Discret. Appl. Math. Andreas Brandstädt
2004	—	`conf`	04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. Robust and Approximative Algorithms an Particular Graph Classes Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad
2004	J	`jnl`	Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Inf. Process. Lett. Andreas Brandstädt, Van Bang Le, H. N. de Ridder
2004	J	`jnl`	Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Int. J. Found. Comput. Sci. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
2004	J	`jnl`	On minimal prime extensions of a four-vertex graph in a prime graph. Discret. Math. Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe
2004	J	`jnl`	Preface: ODSA. Discret. Appl. Math. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn
2004	—	`ed.`	Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004 Robust and Approximative Algorithms an Particular Graph Classes Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad
2004	J	`jnl`	Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discret. Math. Andreas Brandstädt, Van Bang Le
2004	J	`jnl`	Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2003	B	`conf`	Linear Time Algorithms for Some NP-Complete Problems on (P FCT Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2003	J	`jnl`	On linear and circular structure of (claw, net)-free graphs. Discret. Appl. Math. Andreas Brandstädt, Feodor F. Dragan
2003	J	`jnl`	On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. Andreas Brandstädt, Vadim V. Lozin
2003	J	`jnl`	On the structure and stability number of P Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2003	J	`jnl`	On variations of P Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2003	J	`jnl`	Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
2003	J	`jnl`	Structure and stability number of chair-, co-P- and gem-free graphs revisited. Inf. Process. Lett. Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe
2003	B	`conf`	Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2002	J	`jnl`	Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Inf. Process. Lett. Andreas Brandstädt, Suhail Mahfud
2002	B	`conf`	New Graph Classes of Bounded Clique-Width. WG Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2002	J	`jnl`	On alpha-redundant vertices in P5-free graphs. Inf. Process. Lett. Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le
2002	J	`jnl`	Recognizing the P Discret. Math. Theor. Comput. Sci. Luitpold Babel, Andreas Brandstädt, Van Bang Le
2002	B	`conf`	Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2001	J	`jnl`	A note on alpha-redundant vertices in graphs. Discret. Appl. Math. Andreas Brandstädt, Vadim V. Lozin
2001	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings WG Andreas Brandstädt, Van Bang Le
2001	B	`conf`	On Robust Algorithms for the Maximum Weight Stable Set Problem. FCT Andreas Brandstädt
2000	J	`jnl`	Efficiently Recognizing the Graphs Comb. Andreas Brandstädt, Van Bang Le, Stephan Olariu
2000	J	`jnl`	Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. SIAM J. Comput. Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
2000	J	`jnl`	On stable cutsets in graphs. Discret. Appl. Math. Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak
2000	J	`jnl`	Recognizing the P Discret. Appl. Math. Andreas Brandstädt, Van Bang Le
2000	B	`conf`	Split-Perfect Graphs: Characterizations and Algorithmic Use. WG Andreas Brandstädt, Van Bang Le
1999	J	`jnl`	Convexity and HHD-Free Graphs. SIAM J. Discret. Math. Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
1999	J	`jnl`	Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1999	B	`conf`	Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
1999	J	`jnl`	On the Stability Number of Claw-free P Discret. Appl. Math. Andreas Brandstädt, Peter L. Hammer
1999	J	`jnl`	Recognizing the P Discret. Appl. Math. Luitpold Babel, Andreas Brandstädt, Van Bang Le
1999	J	`jnl`	Tree- and Forest-perfect Graphs. Discret. Appl. Math. Andreas Brandstädt, Van Bang Le
1998	J	`jnl`	A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks Andreas Brandstädt, Feodor F. Dragan
1998	J	`jnl`	Corrigendum. Discret. Math. Andreas Brandstädt
1998	J	`jnl`	Dually Chordal Graphs. SIAM J. Discret. Math. Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
1998	J	`jnl`	Powers of hhd-free graphs. Int. J. Comput. Math. Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
1998	J	`jnl`	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discret. Appl. Math. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1998	J	`jnl`	The Complexity of some Problems Related to Graph 3-colorability. Discret. Appl. Math. Andreas Brandstädt, Van Bang Le, Thomas Szymczak
1997	J	`jnl`	Clique SIAM J. Discret. Math. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1997	A	`conf`	Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1997	J	`jnl`	Duchet-type theorems for powers of HHD-free graphs. Discret. Math. Andreas Brandstädt, Van Bang Le, Thomas Szymczak
1997	J	`jnl`	Homogeneously Orderable Graphs. Theor. Comput. Sci. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
1997	J	`jnl`	LexBFS-orderings and powers of chordal graphs. Discret. Math. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
1996	B	`conf`	LexBFS-Orderings and Power of Graphs. WG Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
1996	J	`jnl`	Partitions of graphs into one or two independent sets and cliques. Discret. Math. Andreas Brandstädt
1996	J	`jnl`	Perfect elimination orderings of chordal powers of graphs. Discret. Math. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1996	J	`jnl`	Short Disjoint Cycles in Graphs with Degree Constraints. Discret. Appl. Math. Andreas Brandstädt, Heinz-Jürgen Voss
1996	J	`jnl`	r-Dominating cliques in graphs with hypertree structure. Discret. Math. Feodor F. Dragan, Andreas Brandstädt
1995	B	`conf`	Homogeneously Orderable Graphs and the Steiner Tree Problem. WG Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
1994	A	`conf`	Dominating Cliques in Graphs with Hypertree Structures. STACS Feodor F. Dragan, Andreas Brandstädt
1994	—	`book`	Graphen und Algorithmen. Andreas Brandstädt
1994	B	`conf`	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1993	B	`conf`	Dually Chordal Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
1993	B	`conf`	Short Disjoint Cycles in Graphs with Degree Constraints. WG Andreas Brandstädt, Heinz-Jürgen Voss
1992	B	`conf`	On Improved Time Bounds for Permutation Graph Problems. WG Andreas Brandstädt
1991	J	`jnl`	Classes of bipartite graphs related to chordal graphs. Discret. Appl. Math. Andreas Brandstädt
1991	B	`conf`	Short Disjoint Cycles in Cubic Bridgeless Graphs. WG Andreas Brandstädt
1989	B	`conf`	The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. FCT Andreas Brandstädt
1987	J	`jnl`	Bipartite permutation graphs. Discret. Appl. Math. Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart
1987	J	`jnl`	On Domination Problems for Permutation and Other Graphs. Theor. Comput. Sci. Andreas Brandstädt, Dieter Kratsch
1987	J	`jnl`	The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit, Dominating Set, Steiner Tree, and Bandwidth on Special Perfect Graphs. J. Inf. Process. Cybern. Andreas Brandstädt
1987	J	`jnl`	The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. Theor. Comput. Sci. Haiko Müller, Andreas Brandstädt
1987	J	`jnl`	Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. Math. Syst. Theory Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner
1986	J	`jnl`	On Partitions of Permutations into Increasing and Decreasing Subsequences. J. Inf. Process. Cybern. Andreas Brandstädt, Dieter Kratsch
1985	B	`conf`	On the restriction of some NP-complete graph problems to permutation graphs. FCT Andreas Brandstädt, Dieter Kratsch
1983	B	`conf`	Reversal-Bounded and Visit-Bounded Realtime Computations. FCT Andreas Brandstädt, Klaus W. Wagner
1983	J	`jnl`	Space Classes, Intersection of Languages and Bounded Erasing Homomorphisms. RAIRO Theor. Informatics Appl. Andreas Brandstädt
1983	—	`—`	Zu Raum- und Zeitkompliziertheitsklassen auf nichtdeterministischen Turingakzeptoren. Andreas Brandstädt
1981	J	`jnl`	Closure Properties of Certain Families of Formal Languages with Respect to a Generalization of Cyclic Closure. RAIRO Theor. Informatics Appl. Andreas Brandstädt
1981	B	`conf`	Pushdown Automata with Restricted Use of Storage Symbols. MFCS Andreas Brandstädt
1979	J	`jnl`	A Relation Between Space, Return and Dual Return Complexities. Theor. Comput. Sci. Gerd Wechsung, Andreas Brandstädt
1978	J	`jnl`	On a Family of Complexity Measures on Turing Machines, defined by Predicates. J. Inf. Process. Cybern. Andreas Brandstädt
1977	J	`jnl`	Eine Hierarchie beschränkter Rückkehrberechnungen auf on-line Turingmaschinen. J. Inf. Process. Cybern. Andreas Brandstädt, Dietrich Saalfeld