Your search returned the following 14 documents:

14. Clique Cover and Graph Separation: New Incompressibility Results
    Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 254-265
    
13. Compression via matroids: a randomized polynomial kernel for odd cycle transversal
    Stefan Kratsch and Magnus Wahlström
    In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 94-103
    
12. Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
    Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
    In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 581-593
    
11. Representative Sets and Irrelevant Vertices: New Tools for Kernelization
    Stefan Kratsch and Magnus Wahlström
    In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), New Brunswick, NJ, 2012, 450-459
    
10. Parameterized Two-Player Nash Equilibrium
    Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, and Magnus Wahlström
    In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, 2011, 215-226
    
9. Bin Packing with Fixed Number of Bins Revisited
   Klaus Jansen, Stefan Kratsch, Dániel Marx, and Ildikó Schlotter
   In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, 2010, 260-272
   
8. Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
   Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Simone Oliveto
   In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Kraków, Poland, 2010, 204-213
   
7. Isomorphism for Graphs of Bounded Feedback Vertex Set Number
   Stefan Kratsch and Pascal Schweitzer
   In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, 2010, 81-92
   
6. Kernelization of generic problems : upper and lower bounds
   Stefan Kratsch
   Doctoral dissertation, Universität des Saarlandes, 2010
   
5. Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
   Stefan Kratsch, Dániel Marx, and Magnus Wahlström
   In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, Brno, Czech Republic, 2010, 489-500
   
4. Preprocessing of Min Ones Problems: A Dichotomy
   Stefan Kratsch and Magnus Wahlström
   In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 653-665
   
3. Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
   Stefan Kratsch and Frank Neumann
   In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 293-300. Note: Best Paper Award in the track "Combinatorial Optimization and Metaheuristics"
   
2. Polynomial Kernelizations For MIN F+Pi1 And MAX NP
   Stefan Kratsch
   In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), Freiburg, Germany, 2009, 601-612
   
1. Two Edge Modification Problems without Polynomial Kernels
   Stefan Kratsch and Magnus Wahlström
   In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, Denmark, Copenhagen, 2009, 264-275