The following pages link to Andreas Brandstädt (Q170457):
Displaying 38 items.
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045) (← links)
- (Q4635985) (← links)
- Split-Perfect Graphs: Characterizations and Algorithmic Use (Q4652596) (← links)
- (Q4694738) (← links)
- (Q4724636) (← links)
- (Q4782740) (← links)
- (Q4840182) (← links)
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (Q4909544) (← links)
- (Q4942657) (← links)
- (Q4944993) (← links)
- Structure and linear-time recognition of 4-leaf powers (Q4962769) (← links)
- Dually and strongly chordal graphs (Q5058671) (← links)
- Leaf powers (Q5058672) (← links)
- Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs (Q5360875) (← links)
- (Q5387674) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- (Q5463359) (← links)
- Fundamentals of Computation Theory (Q5492927) (← links)
- Fundamentals of Computation Theory (Q5492956) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
- On k- Versus (k + 1)-Leaf Powers (Q5505655) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
- Generalized Powers of Graphs and Their Algorithmic Use (Q5757881) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- Robust matchings and matroid intersections (Q5891380) (← links)
- Independent Sets of Maximum Weight in Apple-Free Graphs (Q5894185) (← links)
- Fundamentals of Computation Theory (Q5900786) (← links)
- Independent Sets of Maximum Weight in Apple-Free Graphs (Q5901364) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902514) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
- A note on \(\alpha\)-redundant vertices in graphs (Q5929313) (← links)
- Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles (Q5935599) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)
- LexBFS-orderings and powers of graphs (Q6550543) (← links)
