Rossmanith, Peter

1. Linear kernels and single-exponential algorithms via protrusion decompositions
   2012/07/03 by Kim, Eun Jung, Langer, Alexander, Paul, Christophe +4 · 4 citations
   #05C85 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
2. Kernelization Using Structural Parameters on Sparse Graph Classes
   2013/02/27 by Jakub Gajarský, Gajarský, Jakub, Petr Hliněný +13 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Graph theory and applications
3. A Faster Parameterized Algorithm for Treedepth
   2014/01/29 by Felix Reidl, Peter Rossmanith, Reidl, Felix +5 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Limits and Structures in Graph Theory
4. Structural Sparsity of Complex Networks: Bounded Expansion in Random Models and Real-World Graphs
   2014/06/10 by Demaine, Erik D., Reidl, Felix, Rossmanith, Peter +3 · 1 citation
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI)