Stefan Kratsch and Magnus Wahlström - Free people check

(1 - 15 from 16

)

www.royalholloway.ac.uk › computer-science › news › magnus-wahl...Magnus Wahlström was awarded the Nerode Prize

www.royalholloway.ac.uk

... via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal" by Stefan Kratsch and our colleague Magnus Wahlström. Magnus ...

IWPEC 2009

people.engr.tamu.edu

Stefan Kratsch and Magnus Wahlström. Two Edge Modification Problems Without Polynomial Kernels. (Revised) [PDF ] Robert Ganian, Petr Hlineny, Joachim ...

books.google.com › booksHandbook of Graph Theory, Combinatorial Optimization, and ...

books.google.de

[38] [42] [43] [44] [45] [46] [32] Stefan Kratsch and Magnus Wahlström. Compression via matroids: a randomized polynomial kernel for odd cycle transversal.

[ ] Clique cover and graph separation: New incompressibility...

arxiv.org

Marek Cygan Stefan Kratsch Marcin Pilipczuk Michal Pilipczuk Magnus Wahlström

SODA12 – List of Accepted Papers

www.siam.org

SODA12 – List of Accepted Papers. Sublinear Time, Measurement-Optimal, Sparse ... Stefan Kratsch and Magnus Wahlström

dblp: Magnus Wahlström

dblp.uni-trier.de

List of computer science publications by Magnus Wahlström

A Completeness Theory for Polynomial (Turing) Kernelization |...

link.springer.com

A Completeness Theory for Polynomial (Turing) Kernelization. Danny Hermelin,; Stefan Kratsch,; Karolina Sołtys,; Magnus Wahlström,; Xi Wu … show all 5 hide.

Wikipedia: Nerode Prize - Wikipedia

The EATCS--IPEC Nerode Prize is a theoretical computer science prize awarded for : Stefan Kratsch and Magnus Wahlström for their work using matroid theory to develop polynomial-size kernels for odd cycle transversal and related ...

Table of FPT races - Parameterized Complexity

fpt.wikidot.com

Table of FPT races Welcome » Table of FPT ... Stefan Kratsch, Magnus Wahlström: Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal.

› abs[ v1] Representative sets and irrelevant vertices ...

arxiv.org

Authors:Stefan Kratsch, Magnus Wahlström. (Submitted on 9 Nov (this version), latest version 26 Jun (v2)). Abstract: Recent work of the present ...

lemon.cs.elte.hu › egres › open › Small_representations_of_gammoidsSmall representations of gammoids - Egres Open - lemon

lemon.cs.elte.hu

In a paper about kernelization, Stefan Kratsch and Magnus Wahlström showed that any gammoid can be represented by a digraph of size at ...

Yngve Villanger
Petr Hlineny
Dieter Kratsch

Vladan Jovičić
Matthias Mnich
Robert Ganian

People
Forename "Stefan" (30784)
Name "Kratsch" (41)

sorted by relevance / date

Advanced Search

Search name: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Stefan Kratsch and Magnus Wahlström Free People Check

www.royalholloway.ac.uk › computer-science › news › magnus-wahl...Magnus Wahlström was awarded the Nerode Prize

IWPEC 2009

books.google.com › booksHandbook of Graph Theory, Combinatorial Optimization, and ...

[ ] Clique cover and graph separation: New incompressibility...

SODA12 – List of Accepted Papers

dblp: Magnus Wahlström

A Completeness Theory for Polynomial (Turing) Kernelization |...

Wikipedia: Nerode Prize - Wikipedia

Table of FPT races - Parameterized Complexity

› abs[ v1] Representative sets and irrelevant vertices ...

lemon.cs.elte.hu › egres › open › Small_representations_of_gammoidsSmall representations of gammoids - Egres Open - lemon

Connectivity-related matroids | The Matroid Union

www.infona.pl › resourceTwo edge modification problems without polynomial kernels

Slides: WG2011

IWPEC Accepted Papers - ALGO 2009

All web results to the name "Stefan Kratsch"