The following pages link to Yngve Villanger (Q315524):
Displaying 50 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- (Q1740693) (redirect page) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
- Connecting Terminals and 2-Disjoint Connected Subgraphs (Q2864321) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- Minimum Fill-in of Sparse Graphs: Kernelization and Approximation (Q2911621) (← links)
- A Polynomial Kernel for Proper Interval Vertex Deletion (Q2912866) (← links)
- FPT Algorithms for Domination in Biclique-Free Graphs (Q2912896) (← links)
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318) (← links)
- (Q2921757) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Searching for better fill-in (Q2957867) (← links)
- Tight bounds for parameterized complexity of Cluster Editing (Q2957869) (← links)
- (Q2963897) (← links)
- (Q2965491) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs (Q3060791) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Exact Algorithm for the Maximum Induced Planar Subgraph Problem (Q3092237) (← links)
- Finding Induced Subgraphs via Minimal Triangulations (Q3113765) (← links)
- Kernel(s) for problems with no kernel (Q3189081) (← links)
- Algorithms and Computation (Q5191632) (← links)
- Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves (Q5389996) (← links)
