The following pages link to Andreas Brandstädt (Q170457):
Displaying 50 items.
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
- New Polynomial Cases of the Weighted Efficient Domination Problem (Q2849909) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs (Q2953402) (← links)
- Dominating Induced Matchings for P 7-free Graphs in Linear Time (Q3104604) (← links)
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs (Q3128208) (← links)
- Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs (Q3181045) (← links)
- (Q3208085) (← links)
- (Q3314998) (← links)
- (Q3339304) (← links)
- (Q3346325) (← links)
- (Q3351395) (← links)
- Distance-Hereditary 5-Leaf Powers (Q3439543) (← links)
- On (k,ℓ)-Leaf Powers (Q3525598) (← links)
- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (Q3557057) (← links)
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem (Q3596359) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- (Q3657451) (← links)
- (Q3662617) (← links)
- (Q3677799) (← links)
- (Q3679238) (← links)
- (Q3694712) (← links)
- (Q3715153) (← links)
- (Q3731031) (← links)
- (Q3731620) (← links)
- (Q3737468) (← links)
- (Q3745281) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- (Q3789570) (← links)
- (Q3797239) (← links)
- On a Property of Homogeneous Gaussian <i>L</i>-Fields (Q3875032) (← links)
- (Q3916024) (← links)
- (Q3920666) (← links)
- (Q3938502) (← links)
- (Q3938523) (← links)
- (Q3948592) (← links)
- The jump number problem for biconvex graphs and rectangle covers of rectangular regions (Q3974856) (← links)
- (Q4164823) (← links)
- (Q4194463) (← links)
- (Q4195704) (← links)
- Dually Chordal Graphs (Q4210216) (← links)
- Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
- Graph Classes: A Survey (Q4243764) (← links)
- Convexity and HHD-Free Graphs (Q4255812) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- (Q4281625) (← links)
- (Q4414485) (← links)
- (Q4425951) (← links)
- (Q4533373) (← links)
