The following pages link to Andreas Brandstädt (Q170457):
Displaying 50 items.
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Corrigendum to ``Cycle transversals in perfect graphs and cographs'' (Q387014) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
- (Q808695) (redirect page) (← links)
- An upward measure separation theorem (Q808696) (← links)
- New graph classes of bounded clique-width (Q814931) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Distance approximating trees for chordal and dually chordal graphs (extended abstract) (Q826072) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Exact leaf powers (Q982668) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- The complete inclusion structure of leaf power classes (Q1040592) (← links)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- Classes of bipartite graphs related to chordal graphs (Q1179261) (← links)
- A relation between space, return and dual return complexities (Q1259165) (← links)
- The expected length of a shortest path (Q1261487) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- Recognizing the \(P_4\)-structure of bipartite graphs (Q1296570) (← links)
- Tree- and forest-perfect graphs (Q1302153) (← links)
- On the stability number of claw-free \(P_5\)-free and more general graphs (Q1302154) (← links)
