Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School

Source URL: algo2017.ac.tuwien.ac.at

Kernelization using structural parameters on sparse graph classes ˇ 1 Jan Obdržálek1 Jakub Gajarský1 Petr Hlinený 1 Sebastian Ordyniak

Source URL: tcs.rwth-aachen.de

Kernelization: The basics Bart M. P. Jansen Parameterized Complexity Summer School @ Vienna September 2nd 2017, Vienna, Austria

Source URL: algo2017.ac.tuwien.ac.at

Fixed-parameter tractability of multicut parameterized by the size of the cutset Dániel Marx Humboldt-Universität zu Berlin (Joint work with Igor Razgon) WorKer 2010: Workshop on Kernelization

Source URL: www.cs.bme.hu

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams Rajesh Chitnis∗ Graham Cormode† Hossein Esfandiari‡ §

Source URL: dimacs.rutgers.edu

Meta-kernelization using Well-structured Modulators∗ Eduard Eiben, Robert Ganian, and Stefan Szeider Algorithms and Complexity Group, TU Wien Vienna, Austria

Source URL: drops.dagstuhl.de

CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

Source URL: theory.stanford.edu

• NP-complete problems
• Vertex cover
• Maximum cut
• Dynamic programming
• Algorithm
• Kernelization
• Approximation algorithm

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Source URL: www.cs.siu.edu

• NP-complete problems
• Theoretical computer science
• Analysis of algorithms
• Parameterized complexity
• Independent set
• Algorithm
• Kernelization
• Book:Graph Theory
• Book:Graph Algorithms

What’s next? Reductions other than kernelization Dániel Marx Humboldt-Universität zu Berlin (with help from Fedor Fomin,

Source URL: www.cs.bme.hu

Kernelization Through Tidying---A Case Study Based on s-Plex Cluster Vertex Deletion

Source URL: theinf1.informatik.uni-jena.de