34 results on '"Brandstädt, Andreas"'
Search Results
2. Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time
3. Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs
4. Bounding the Clique-Width of H-free Chordal Graphs
5. New Polynomial Cases of the Weighted Efficient Domination Problem
6. Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
7. Dominating Induced Matchings for P 7-free Graphs in Linear Time
8. Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
9. On Distance-3 Matchings and Induced Matchings
10. Path-Bicolorable Graphs
11. Independent Sets of Maximum Weight in Apple-Free Graphs
12. On (k,ℓ)-Leaf Powers
13. Generalized Powers of Graphs and Their Algorithmic Use
14. New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem
15. Clique-Width for Four-Vertex Forbidden Subgraphs
16. On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
17. Tree Spanners for Bipartite Graphs and Probe Interval Graphs
18. Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs
19. New Graph Classes of Bounded Clique-Width
20. On Robust Algorithms for the Maximum Weight Stable Set Problem
21. Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)—Free Graphs
22. Distance approximating trees for chordal and dually chordal graphs
23. LexBFS-orderings and powers of graphs
24. The algorithmic use of hypertree structure and maximum neighbourhood orderings
25. Homogeneously orderable graphs and the Steiner tree problem
26. Dually chordal graphs
27. Short disjoint cycles in graphs with degree constraints
28. On improved time bounds for permutation graph problems
29. Short disjoint cycles in cubic bridgeless graphs
30. The jump number problem for biconvex graphs and rectangle covers of rectangular regions
31. Reversal-bounded and visit-bounded realtime computations
32. On the restriction of some NP-complete graph problems to permutation graphs
33. Simplicial Powers of Graphs
34. On k- Versus (k + 1)-Leaf Powers
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.