Notes on Parameterized Complexity, Dagstuhl, June 2012.

More documents

Recommendations

Info

BACK TO THE EARLY YEARS II ◮ We had a first draft “A Completeness Theory for Fixed Parameter Problems” ◮ New definitions, weft ideas, some hardness proofs, ◮ k-PERFECT CODE, k-NOT ALL EQUAL SAT, k-CNF SAT, k-DOMINATING SET, k-INDEPENDENT DOMINATING SET, mostly correct. ◮ FTP examples like FEEDBACK VERTEX SET, PLANAR FACE COVER NUMBER, MIN CUT LINEAR ARRANGEMENT, GRAPH GENUS ◮ Mike gave the first talk on this around this time in Manitoba. Plus we submitted probably the best paper ever in Congressus Numerantium. ◮ Submitted to FOCS.
THE GREAT KIWI ROADTRIP map new zealand north island - Google Maps https://maps.google.co.uk/maps?hl=en&client=firefox-a&q=m... Address Waikato New Zealand
Page 1 and 2: Notes on Parametri
Page 4: WHY WAS I THERE? ◮ Well, there wa
Page 8 and 9: MIKE’S TALK ◮ Mike gave a contr
Page 10 and 11: I WAS EXCITED! ◮ At a certain poi
Page 12 and 13: ◮ For that visit, Mike remembered
Page 14 and 15: THE MODERN VIEW ◮ Whilst these ar
Page 16: BACK TO THE EARLY YEARS I ◮ Mike
Page 26 and 27: MATHS ON THE TRIP ◮ We figured ou
Page 28 and 29: WHAT DOES THE MATERIAL FROM THEN SH
Page 30 and 31: THE MODERN INCARNATION ◮ This is
Page 32 and 33: AW AND PSPACE ◮ Mike in an e-mail
Page 34 and 35: OTHER 90’S THINGS ◮ Downey-Fell
Page 36 and 37: COMPLEXITY POST-DF ◮ Entry of Mar

Notes on Parameterized Complexity, Dagstuhl, June 2012.

Create successful ePaper yourself

Delete template?

Save as template?