The following pages link to Marcin Pilipczuk (Q255284):
Displaying 50 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Bandwidth and distortion revisited (Q412348) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- On the Zagreb index inequality of graphs with prescribed vertex degrees (Q534355) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball (Q941694) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms (Q1941715) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Hardness of metric dimension in graphs of constant treewidth (Q2093561) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- An exponential lower bound for cut sparsifiers in planar graphs (Q2324242) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Caterpillars in Erdős-Hajnal (Q2421547) (← 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)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- Clique Cover and Graph Separation: New Incompressibility Results (Q2843253) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (Q2894465) (← links)
- Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs (Q2904571) (← links)
- Approximation Algorithms for Union and Intersection Covering Problems (Q2911608) (← links)
- Sitting Closer to Friends Than Enemies, Revisited (Q2912728) (← links)
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees (Q2912854) (← links)
