Stefan Kratsch

	2012
35		Stefan Kratsch: Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. SODA 2012: 114-122
34		Stefan Kratsch, Magnus Wahlström: Compression via matroids: a randomized polynomial kernel for odd cycle transversal. SODA 2012: 94-103
33		Stefan Kratsch: Polynomial Kernelizations for MIN F+Π1 and MAX NP. Algorithmica 63(1-2): 532-550 (2012)
32		Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-parameter tractability of multicut in directed acyclic graphs CoRR abs/1202.5749: (2012)
	2011
31		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
30		Bart M. P. Jansen, Stefan Kratsch: Data Reduction for Graph Coloring Problems. FCT 2011: 90-101
29		Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448
28		Bart M. P. Jansen, Stefan Kratsch: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. IPEC 2011: 132-144
27		Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158
26		Jiong Guo, Iyad A. Kanj, Stefan Kratsch: Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180
25		Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176
24		Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226
23		Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization CoRR abs/1104.4217: (2011)
22		Bart M. P. Jansen, Stefan Kratsch: Data Reduction for Graph Coloring Problems CoRR abs/1104.4229: (2011)
21		Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems CoRR abs/1106.4141: (2011)
20		Stefan Kratsch, Magnus Wahlström: Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal CoRR abs/1107.3068: (2011)
19		Bart M. P. Jansen, Stefan Kratsch: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal CoRR abs/1107.3658: (2011)
18		Stefan Kratsch: Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem CoRR abs/1107.3704: (2011)
17		Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu: Hierarchies of Inefficient Kernelizability CoRR abs/1110.0976: (2011)
16		Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique cover and graph separation: New incompressibility results CoRR abs/1111.0570: (2011)
15		Stefan Kratsch, Magnus Wahlström: Representative sets and irrelevant vertices: New tools for kernelization CoRR abs/1111.2195: (2011)
14		Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing CoRR abs/1112.4419: (2011)
	2010
13		Stefan Kratsch, Magnus Wahlström: Preprocessing of Min Ones Problems: A Dichotomy. ICALP (1) 2010: 653-665
12		Stefan Kratsch, Dániel Marx, Magnus Wahlström: Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. MFCS 2010: 489-500
11		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
10		Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter: Bin Packing with Fixed Number of Bins Revisited. SWAT 2010: 260-272
9		Stefan Kratsch, Pascal Schweitzer: Isomorphism for Graphs of Bounded Feedback Vertex Set Number. SWAT 2010: 81-92
8		Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström: Parameterized Two-Player Nash Equilibrium CoRR abs/1006.2063: (2010)
7		Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds CoRR abs/1011.4224: (2010)
6		Stefan Kratsch: Kernelization of generic problems: upper and lower bounds. Saarland University 2010
	2009
5		Stefan Kratsch, Frank Neumann: Fixed-parameter evolutionary algorithms and the vertex cover problem. GECCO 2009: 293-300
4		Stefan Kratsch, Magnus Wahlström: Two Edge Modification Problems without Polynomial Kernels. IWPEC 2009: 264-275
3		Stefan Kratsch: Polynomial Kernelizations for MIN F+Pi1 and MAX NP. STACS 2009: 601-612
2		Stefan Kratsch: Polynomial Kernelizations for $\MINF_1$ and $\MNP$ CoRR abs/0902.1835: (2009)
1		Stefan Kratsch, Magnus Wahlström: Preprocessing of Min Ones Problems: A Dichotomy CoRR abs/0910.4518: (2009)

Coauthor Index

1	Hans L. Bodlaender	[7] [21] [23] [25] [27] [29]
2	Marek Cygan	[16]
3	Fedor V. Fomin	[14]
4	Jiong Guo	[26]
5	Pinar Heggernes	[31]
6	Danny Hermelin	[8] [17] [24]
7	Pim van 't Hof	[31]
8	Chien-Chung Huang	[8] [24]
9	Bart M. P. Jansen	[7] [19] [21] [22] [23] [25] [27] [28] [29] [30] [31]
10	Klaus Jansen	[10]
11	Iyad A. Kanj	[26]
12	Per Kristian Lehre	[11]
13	Dániel Marx	[10] [12]
14	Frank Neumann	[5] [11]
15	Pietro Simone Oliveto	[11]
16	Marcin Pilipczuk	[14] [16] [32]
17	Michal Pilipczuk	[14] [16] [32]
18	Ildikó Schlotter	[10]
19	Pascal Schweitzer	[9]
20	Karolina Soltys	[17]
21	Yngve Villanger	[14] [31]
22	Magnus Wahlström	[1] [4] [8] [12] [13] [15] [16] [17] [20] [24] [32] [34]
23	Xi Wu	[17]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page