The following pages link to Michał Pilipczuk (Q262250):
Displaying 50 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- On ultralimits of sparse graph classes (Q286118) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- On directed feedback vertex set parameterized by treewidth (Q1627154) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space (Q2110607) (← links)
- On objects dual to tree-cut decompositions (Q2171026) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Integer programming and incidence treedepth (Q2293088) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Shortest Paths in One-Counter Systems (Q2811358) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Clique Cover and Graph Separation: New Incompressibility Results (Q2843253) (← links)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (Q2849341) (← links)
- (Q2856696) (← links)
- Computing Tree-Depth Faster Than 2 n (Q2867079) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
