The following pages link to Haiko Müller (Q190507):
Displayed 50 items.
- Bandwidth of chain graphs (Q293476) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (Q1348907) (← links)
- Partial orders and their convex subsets (Q1356772) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Partial orders on weak orders convex subsets (Q1590175) (← links)
- Counting independent sets in cocomparability graphs (Q1721932) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- On the domination search number (Q1811076) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q2301551) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- (Q2741345) (← links)
- (Q2766679) (← links)
- (Q2766686) (← links)
- (Q2816043) (← links)
- An FPT Certifying Algorithm for the Vertex-Deletion Problem (Q2870064) (← links)
- Colouring AT-Free Graphs (Q2912887) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- (Q3731620) (← links)
- (Q3782804) (← links)
- A note on balanced immunity (Q4032929) (← links)
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs (Q4215725) (← links)
- (Q4218149) (← links)
- (Q4232780) (← links)
- (Q4251049) (← links)
- Independent Sets in Asteroidal Triple-Free Graphs (Q4255822) (← links)
- (Q4373684) (← links)
- Rankings of Graphs (Q4388986) (← links)
- Additive Tree Spanners (Q4443141) (← links)
- (Q4448745) (← links)