The following pages link to Dieter Kratsch (Q190506):
Displaying 50 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Total domination and transformation (Q287166) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Bandwidth of chain graphs (Q293476) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Exact algorithms for Kayles (Q476858) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Squares of low clique number (Q510991) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Exact exponential algorithms. (Q606873) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- A counterexample about poset reconstruction (Q1338126) (← links)
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (Q1348907) (← links)
