The following pages link to Stefan Kratsch (Q269480):
Displayed 50 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- Bin packing with fixed number of bins revisited (Q1936245) (← links)
- Fixed-parameter evolutionary algorithms and the vertex cover problem (Q1949737) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (Q2020618) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- On the complexity of the identifiable subgraph problem, revisited (Q2357777) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
- Clique Cover and Graph Separation: New Incompressibility Results (Q2843253) (← links)
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility (Q2849354) (← links)
- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth (Q2864293) (← links)
- A Completeness Theory for Polynomial (Turing) Kernelization (Q2867084) (← links)
- The Jump Number Problem: Exact and Parameterized (Q2867086) (← links)
- How to Put through Your Agenda in Collective Binary Decisions (Q2868543) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Kernel Bounds for Structural Parameterizations of Pathwidth (Q2904570) (← links)
- Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs (Q2904571) (← links)
- Streaming Kernelization (Q2922615) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem (Q2946020) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- On Kernels for Covering and Packing ILPs with Small Coefficients (Q2946030) (← links)
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
- (Q2957869) (← links)
- (Q2957873) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)