Stefan Kratsch

From MaRDI portal
Person:269480

Available identifiers

zbMath Open kratsch.stefanMaRDI QIDQ269480

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61473582024-01-15Paper
Efficient parameterized algorithms for computing all-pairs shortest paths2023-11-13Paper
https://portal.mardi4nfdi.de/entity/Q58743022023-02-07Paper
Elimination distances, blocking sets, and kernels for Vertex Cover2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58743112023-02-07Paper
Approximate Turing Kernelization for Problems Parameterized by Treewidth2023-02-07Paper
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover2022-08-31Paper
https://portal.mardi4nfdi.de/entity/Q50912302022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50904862022-07-18Paper
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack2022-05-11Paper
Multi-Budgeted Directed Cuts2021-08-04Paper
Efficient and Adaptive Parameterized Algorithms on Modular Decompositions2021-08-04Paper
Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting2021-04-23Paper
Representative Sets and Irrelevant Vertices2020-11-11Paper
Multi-budgeted directed cuts2020-08-12Paper
Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting.2020-05-27Paper
Smaller Parameters for Vertex Cover Kernelization2020-05-27Paper
Bipartite graphs of small readability2020-01-16Paper
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex2019-10-30Paper
The parameterized complexity of the minimum shared edges problem2019-08-30Paper
https://portal.mardi4nfdi.de/entity/Q49671642019-07-03Paper
Point Line Cover: The Easy Kernel is Essentially Tight2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q57433802019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57433822019-05-10Paper
The minimum feasible tileset problem2019-03-11Paper
Fast Hamiltonicity Checking Via Bases of Perfect Matchings2018-12-06Paper
Point Line Cover2018-11-05Paper
Co-Nondeterminism in Compositions2018-10-30Paper
Compression via Matroids2018-10-30Paper
Bipartite graphs of small readability2018-10-04Paper
Two edge modification problems without polynomial kernels2018-08-17Paper
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter2018-07-27Paper
The parameterized complexity of finding a 2-sphere in a simplicial complex2018-04-19Paper
Robust and Adaptive Search2018-04-19Paper
Preprocessing Under Uncertainty: Matroid Intersection.2018-03-21Paper
Parameterized complexity of team formation in social networks2018-03-13Paper
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter2018-03-02Paper
A randomized polynomial kernel for subset feedback vertex set2018-03-01Paper
Preprocessing under uncertainty2018-01-24Paper
A Randomized Polynomial Kernel for Subset Feedback Vertex Set2018-01-24Paper
On kernelization and approximation for the vector connectivity problem2017-10-10Paper
On Kernelization and Approximation for the Vector Connectivity Problem2017-09-29Paper
Assessing the Computational Complexity of Multi-layer Subgraph Detection2017-07-21Paper
The Parameterized Complexity of the Minimum Shared Edges Problem2017-07-13Paper
On the complexity of the identifiable subgraph problem, revisited2017-06-14Paper
Tight bounds for parameterized complexity of Cluster Editing2017-01-30Paper
On Polynomial Kernels for Sparse Integer Linear Programs.2017-01-30Paper
Characterizing width two for variants of treewidth2016-11-24Paper
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs2016-11-24Paper
Polynomial kernels for weighted problems2016-11-14Paper
Parameterized Complexity of Team Formation in Social Networks2016-11-09Paper
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs2016-10-24Paper
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems2016-10-24Paper
Finding shortest paths between graph colourings2016-09-07Paper
Polynomial kernels and user reductions for the workflow satisfiability problem2016-09-07Paper
On polynomial kernels for sparse integer linear programs2016-04-18Paper
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs2015-11-27Paper
The minimum feasible tileset problem2015-11-20Paper
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity2015-11-19Paper
Polynomial kernels for weighted problems2015-09-16Paper
A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time2015-09-16Paper
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem2015-09-15Paper
Finding Shortest Paths Between Graph Colourings2015-09-15Paper
On Kernels for Covering and Packing ILPs with Small Coefficients2015-09-15Paper
Clique Cover and Graph Separation2015-09-03Paper
Approximability and parameterized complexity of multicover by \(c\)-intervals2015-06-15Paper
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth2015-06-09Paper
A completeness theory for polynomial (Turing) kernelization2015-05-04Paper
Streaming Kernelization2014-10-14Paper
Fast Hamiltonicity Checking Via Bases of Perfect Matchings2014-08-07Paper
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda2014-07-30Paper
Kernelization Lower Bounds by Cross-Composition2014-06-19Paper
Tight bounds for parameterized complexity of cluster editing with a small number of clusters2014-06-10Paper
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization2014-04-10Paper
Data reduction for graph coloring problems2014-01-16Paper
Kernel bounds for path and cycle problems2014-01-13Paper
Parameterized complexity of vertex deletion into perfect graph classes2014-01-13Paper
How to Put through Your Agenda in Collective Binary Decisions2013-12-17Paper
A Completeness Theory for Polynomial (Turing) Kernelization2013-12-10Paper
The Jump Number Problem: Exact and Parameterized2013-12-10Paper
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth2013-12-06Paper
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility2013-09-17Paper
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs2013-08-12Paper
Clique Cover and Graph Separation: New Incompressibility Results2013-08-12Paper
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth2013-08-06Paper
Fixed-parameter evolutionary algorithms and the vertex cover problem2013-05-16Paper
Parameterized two-player Nash equilibrium2013-05-16Paper
Bin packing with fixed number of bins revisited2013-02-21Paper
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs2012-11-06Paper
Kernel Bounds for Structural Parameterizations of Pathwidth2012-08-14Paper
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs2012-08-14Paper
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal2012-06-15Paper
Kernel Bounds for Path and Cycle Problems2012-06-15Paper
Safe Approximation and Its Relation to Kernelization2012-06-15Paper
Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP2012-04-26Paper
Polynomial Kernelizations For MIN F+Pi1 And MAX NP2012-04-24Paper
https://portal.mardi4nfdi.de/entity/Q31136812012-01-23Paper
Parameterized two-player Nash equilibrium2011-12-16Paper
Data Reduction for Graph Coloring Problems2011-08-19Paper
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes2011-08-19Paper
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization2011-07-06Paper
Preprocessing of Min Ones Problems: A Dichotomy2010-09-07Paper
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems2010-09-03Paper
Isomorphism for Graphs of Bounded Feedback Vertex Set Number2010-06-22Paper
Bin Packing with Fixed Number of Bins Revisited2010-06-22Paper
Two Edge Modification Problems without Polynomial Kernels2010-01-14Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stefan Kratsch