ELC Workshop on Parameterized Algorithms

Dates: February 28-March 1, 2015
Place: The University of Electro-Communications
       Building E-3, 3rd Floor
       (Building No. 27 in http://www.uec.ac.jp/eng/about/access/)

       1-5-1 Chofugaoka, Chofu, Tokyo 182-8585

Program:

Saturday February 28th
  10:00 – 10:15 | Welcoming participants (opening address)
  10:15 – 11:15 | Michał Pilipczuk (New results on computing tree decompositions of graphs)
  11:15 – 13:00 | Lunch
  13:00 – 14:00 | Valia Mitsou (The computational complexity of two card games with theoretical applications)
  14:00 – 14:15 | Coffee break
  14:15 – 15:15 | Bingkai Lin (The parameterized complexity of k-Biclique)
  15:15 – 15:30 | Coffee break
  15:30 – 16:15 | Yushi Uno (Fixed-parameter algorithms for vector dominations)
  16:15 – 16:30 | Coffee break
  16:30 – 17:30 | Discussion and open problems

  18:30 -       | Reception

Sunday March 1st
  09:30 – 10:30 | Saket Saurabh (Graph Modification Problems: A Modern Perspective)
  10:30 – 10:45 | Coffee break
  10:45 – 11:45 | Michael Lampis (Parameterized Approximation Schemes Using Graph Widths)
  11:45 – 13:00 | Lunch
  13:00 – 14:00 | Yixin Cao (Linear Recognition of Almost Interval Graphs)
  14:00 – 14:15 | Coffee break
  14:15 – 15:15 | Rémi Watrigant (Cardinality constraint optimisation problems)
  15:15 – 15:30 | Coffee break
  15:30 – 17:00 | Discussion and open problems

Organizers:
  Rémy Belmonte
  Naoki Katoh
  Yoshio Okamoto