- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j4 |      | Stefan Kratsch, Frank Neumann: Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. Algorithmica 65(4): 754-771 (2013) |
| j3 | | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. Algorithmica 65(4): 802-816 (2013) |
| j2 | | Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1): 39-49 (2013) |
| c27 | | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43 |
| c26 | | |
| i22 | | |
| i21 | | Stefan Kratsch: On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility. CoRR abs/1302.3496 (2013) |
| 2012 | ||
| j1 | | Stefan Kratsch: Polynomial Kernelizations for MIN F+Π1 and MAX NP. Algorithmica 63(1-2): 532-550 (2012) |
| c25 | | Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch: A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012 |
| c24 | | Stefan Kratsch, Magnus Wahlström: Representative Sets and Irrelevant Vertices: New Tools for Kernelization. FOCS 2012: 450-459 |
| c23 | | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) 2012: 254-265 |
| c22 | | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) 2012: 581-593 |
| c21 | | Stefan Kratsch, Magnus Wahlström: Compression via matroids: a randomized polynomial kernel for odd cycle transversal. SODA 2012: 94-103 |
| c20 | | Stefan Kratsch: Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. SODA 2012: 114-122 |
| c19 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT 2012: 352-363 |
| c18 | | Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman: Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT 2012: 364-375 |
| c17 | | Stefan Kratsch, Pascal Schweitzer: Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. WG 2012: 34-45 |
| i20 | | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-parameter tractability of multicut in directed acyclic graphs. CoRR abs/1202.5749 (2012) |
| i19 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernelization Lower Bounds By Cross-Composition. CoRR abs/1206.5941 (2012) |
| i18 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR abs/1207.4900 (2012) |
| i17 | | Stefan Kratsch, Pascal Schweitzer: Graph Isomorphism for Graph Classes Characterized by two Forbidden Induced Subgraphs. CoRR abs/1208.0142 (2012) |
| i16 | | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof: Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR abs/1211.1505 (2012) |
| i15 | | Marek Cygan, Stefan Kratsch, Jesper Nederlof: Fast Hamiltonicity checking via bases of perfect matchings. CoRR abs/1211.1506 (2012) |
| 2011 | ||
| c16 | | |
| c15 | | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251 |
| c14 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448 |
| c13 | | Bart M. P. Jansen, Stefan Kratsch: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. IPEC 2011: 132-144 |
| c12 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158 |
| c11 | | Jiong Guo, Iyad A. Kanj, Stefan Kratsch: Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180 |
| c10 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176 |
| c9 | | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226 |
| i14 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. CoRR abs/1104.4217 (2011) |
| i13 | | Bart M. P. Jansen, Stefan Kratsch: Data Reduction for Graph Coloring Problems. CoRR abs/1104.4229 (2011) |
| i12 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. CoRR abs/1106.4141 (2011) |
| i11 | | Stefan Kratsch, Magnus Wahlström: Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. CoRR abs/1107.3068 (2011) |
| i10 | | Bart M. P. Jansen, Stefan Kratsch: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. CoRR abs/1107.3658 (2011) |
| i9 | | Stefan Kratsch: Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem. CoRR abs/1107.3704 (2011) |
| i8 | | Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu: Hierarchies of Inefficient Kernelizability. CoRR abs/1110.0976 (2011) |
| i7 | | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011) |
| i6 | | Stefan Kratsch, Magnus Wahlström: Representative sets and irrelevant vertices: New tools for kernelization. CoRR abs/1111.2195 (2011) |
| i5 | | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011) |
| 2010 | ||
| b1 | | |
| c8 | | Stefan Kratsch, Magnus Wahlström: Preprocessing of Min Ones Problems: A Dichotomy. ICALP (1) 2010: 653-665 |
| c7 | | Stefan Kratsch, Dániel Marx, Magnus Wahlström: Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. MFCS 2010: 489-500 |
| c6 | | Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto: Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. PPSN (1) 2010: 204-213 |
| c5 | | Stefan Kratsch, Pascal Schweitzer: Isomorphism for Graphs of Bounded Feedback Vertex Set Number. SWAT 2010: 81-92 |
| c4 | | Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter: Bin Packing with Fixed Number of Bins Revisited. SWAT 2010: 260-272 |
| i4 | | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. CoRR abs/1006.2063 (2010) |
| i3 | | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR abs/1011.4224 (2010) |
| 2009 | ||
| c3 | | Stefan Kratsch, Frank Neumann: Fixed-parameter evolutionary algorithms and the vertex cover problem. GECCO 2009: 293-300 |
| c2 | | Stefan Kratsch, Magnus Wahlström: Two Edge Modification Problems without Polynomial Kernels. IWPEC 2009: 264-275 |
| c1 | | |
| i2 | | |
| i1 | | Stefan Kratsch, Magnus Wahlström: Preprocessing of Min Ones Problems: A Dichotomy. CoRR abs/0910.4518 (2009) |
Colors in the list of coauthors
Last update Thu May 23 13:00:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page