International Workshop on Approximation,
Parameterized and EXact algorithms
February 28-29, 2012, Paris,
France
http://apex.lip6.fr/
- Registration is
open:http://apex.lip6.fr/registration.html
No fees are
required.
However, the registration is mandatory due to
administrative reasons.
- Program:
*** Tuesday,
February 28, 2012 ***
9h00-9h30 Welcome
9h30-10h30 Invited talk: Henning Fernau
Definitions, motivations, techniques and limitations of
parameterized approximation
10h30-10h45 Coffee break
10h45-11h15 A. Langer, F. Reidl, P. Rossmanith and S. Sikdar
Linear Kernels on Graphs Excluding Topological
Minors
11h15-11h45 P. Golovach, M. Kaminski, D. Paulusma and D.
Thilikos
Increasing the Minimum
Degree of a
Graph by Contractions
11h45-12h15 A. Perez and S. Bessy
A quartic kernel for Proper Interval Completion
12h15-14h30 Lunch
14h30-15h30 Invited talk: Martin
Skutella
Unsplittable and k-splittable flows in
single-source
networks
15h30-15h45 Coffee break
15h45-16h15 S. Mengel and A. Durand
The
Complexity of Weighted Counting for Acyclic
Conjunctive
Queries
16h15-16h45 R. Watrigant, M. Bougeret, R.
Giroudeau and J.-C. König
On the
approximability of the Sum-Max graph
partitioning problem
16h45-17h00 Coffee break
17h00-17h30 Ch. Lenté, M.
Liedloff, A. Soukhal and V. T'Kindt
Scheduling
parallel machines with exponential algorithms
17h30-18h00 R.
Crowston, M. Jones and M. Mnich
Max-Cut
Parameterized Above the Edwards-Erdös Bound
*** Wednesday,
February 29, 2012 ***
9h30-10h00 K. Jansen
A (3/2+\epsilon) approximation algorithm for scheduling
malleable and non-malleable parallel tasks
10h00-10h30 T.
Dokka, A. Kouvela and F. Spieksma
Approximating the
multi-level bottleneck assignment
problem
10h30-10h45
Coffee break
10h45-11h15 M. Chapelle
Domination-like problems parameterized by tree-width
11h15-11h45
E.-J. Kim and D. Goncalves
On Exact Algorithms for
Permutation CSP
11h45-12h15 K. Meeks and A. Scott
The parameterised complexity of list problems on graphs of
bounded treewidth
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
