The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Stefan Kratsch" ( http://dblp.L3S.de/Authors/Stefan_Kratsch )

  Author page on DBLP  Author page in RDF  Community of Stefan Kratsch in ASPL-2

Publication years (Num. hits)
2009 (5) 2010 (8) 2011 (18) 2012 (4)
Publication types (Num. hits)
article(16) inproceedings(18) phdthesis(1)
Venues (Conferences, Journals, ...)
CoRR(15) IPEC(3) FCT(2) ICALP(2) SODA(2) STACS(2) SWAT(2) Algorithmica(1) GECCO(1) IWPEC(1) MFCS(1) PPSN(1) WG(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 35 publication records. Showing 35 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Stefan Kratsch Polynomial Kernelizations for MIN F+Π1 and MAX NP. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström Fixed-parameter tractability of multicut in directed acyclic graphs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Compression via matroids: a randomized polynomial kernel for odd cycle transversal. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Stefan Kratsch Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch Data Reduction for Graph Coloring Problems Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Stefan Kratsch Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström Clique cover and graph separation: New incompressibility results Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Representative sets and irrelevant vertices: New tools for kernelization Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu Hierarchies of Inefficient Kernelizability Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger Subexponential fixed-parameter tractability of cluster editing Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Kernel Bounds for Path and Cycle Problems Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström Parameterized Two-Player Nash Equilibrium. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Stefan Kratsch Safe Approximation and Its Relation to Kernelization. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Kernel Bounds for Path and Cycle Problems. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Cross-Composition: A New Technique for Kernelization Lower Bounds. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch Data Reduction for Graph Coloring Problems. Search on Bibsonomy FCT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. Search on Bibsonomy FCT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Kernelization of generic problems: upper and lower bounds. Search on Bibsonomy 2010   RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Cross-Composition: A New Technique for Kernelization Lower Bounds Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström Parameterized Two-Player Nash Equilibrium Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. Search on Bibsonomy PPSN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Preprocessing of Min Ones Problems: A Dichotomy. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Dániel Marx, Magnus Wahlström Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter Bin Packing with Fixed Number of Bins Revisited. Search on Bibsonomy SWAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Pascal Schweitzer Isomorphism for Graphs of Bounded Feedback Vertex Set Number. Search on Bibsonomy SWAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Polynomial Kernelizations for $\MINF_1$ and $\MNP$ Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Preprocessing of Min Ones Problems: A Dichotomy Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Stefan Kratsch, Frank Neumann Fixed-parameter evolutionary algorithms and the vertex cover problem. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF evolutionary algorithms, combinatorial optimization, multi-objective optimization, runtime analysis
1Stefan Kratsch, Magnus Wahlström Two Edge Modification Problems without Polynomial Kernels. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Polynomial Kernelizations for MIN F+Pi1 and MAX NP. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #35 of 35 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.