The following pages link to Marek Cygan (Q255282):
Displaying 50 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Online knapsack revisited (Q260271) (← links)
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← 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)
- 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)
- Exact and approximate bandwidth (Q708223) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← 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)
- Channel assignment via fast zeta transform (Q1944122) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q2843251) (← links)
- Clique Cover and Graph Separation: New Incompressibility Results (Q2843253) (← links)
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q2849328) (← links)
- On the inequality between radius and Randić index for graphs (Q2856696) (← links)
- A planar linear arboricity conjecture (Q2891050) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Parameterized Complexity of Firefighting Revisited (Q2891334) (← 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)
- Deterministic Parameterized Connected Vertex Cover (Q2904546) (← 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)
- Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth (Q2922607) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- On Pairwise Spanners (Q2957885) (← links)
- Constant Factor Approximation for Capacitated k-Center with Outliers (Q2965488) (← links)
- Catch them if you can (Q2986895) (← links)
- Polynomial-Time Approximation Algorithms for Weighted LCS Problem (Q3011875) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
