The APEX (Approximation, Parameterized and EXact algorithms) workshop is supported by the French National Agency for Research (ANR) under the TODO (Time versus Optimality in Discrete Optimization) ANR project. It aims to bring together researchers working on the design and analysis of algorithms (exact, moderately exponential, approximation and low memory,...) for combinatorial optimization problems.
APEX is co-located with STACS 2012 in Paris.
Papers are solicited in all areas of approximation and exact algorithms, including but not limited to:
- exact and parameterized algorithms
- approximation and online algorithms
- massive data computation
- low memory and streaming algorithms
- analysis and experimental evaluation of algorithms
Submissions deadline: December 7, 2011 December 14, 2011, 23:59 (GMT)
Notification of authors: December 21, 2011
Conference: February 28-29, 2012
- Henning Fernau, Universität Trier, Germany
- Martin Skutella, TU Berlin, Germany
- Eric Angel, Université d'Évry, France
- Evripidis Bampis, Université Pierre et Marie Curie, France (co-chair)
- Hans L. Bodlaender, Universiteit Utrecht, Netherlands
- Marc Demange, ESSEC Business School, France
- Bruno Escoffier, Université Paris Dauphine, France
- Michael R. Fellows, Charles Darwin University, Australia
- Klaus Jansen, Christian-Albrechts-Universität, Germany
- Christian Laforest, Université Blaise Pascal, France
- Stefano Leonardi, Università di Roma "La Sapienza", Italy
- Dániel Marx, Humboldt-Universität zu Berlin, Germany
- Vangelis Paschos, Université Paris Dauphine, France (co-chair)
- Hadas Shachnai, Technion, Israel
- Evripidis Bampis, Université Pierre et Marie Curie
- Bruno Escoffier, Université Paris Dauphine
- Katerina Kinta, Université Paris Dauphine
- Giorgio Lucarelli, Université Pierre et Marie Curie
- Vangelis Paschos, Université Paris Dauphine
Abstracts of 2-3 pages must be submitted using a pdf format.
APEX submissions undergo a selection process based on a light refereeing by the PC. APEX will not publish proceedings. Hence, presenting your paper at APEX will not prevent you from submitting it to journals or to other conferences. Similarly, it is acceptable to submit a paper that was presented at an earlier conference. Submissions by PC members are allowed.
Talks will have around 20 minutes.
Papers must be submitted electronically at Easychair.
The submission must be received by 23:59 (GMT) on December 7, 2011.
- Alexander Langer, Felix Reidl, Peter Rossmanith and Somnath Sikdar. Linear Kernels on Graphs Excluding Topological Minors
- Klaus Jansen. A (3/2+\epsilon) approximation algorithm for scheduling malleable and non-malleable parallel tasks
- Kitty Meeks and Alex Scott. The parameterised complexity of list problems on graphs of bounded treewidth
- Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau and Jean-Claude König. On the approximability of the Sum-Max graph partitioning problem
- Robert Crowston, Mark Jones and Matthias Mnich. Max-Cut Parameterized Above the Edwards-Erdös Bound
- Eun Jung Kim and Daniel Goncalves. On Exact Algorithms for Permutation CSP
- Petr Golovach, Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos. Increasing the Minimum Degree of a Graph by Contractions
- Stefan Mengel and Arnaud Durand. The Complexity of Weighted Counting for Acyclic Conjunctive Queries
- Christophe Lenté, Mathieu Liedloff, Ameur Soukhal and T'Kindt Vincent. Scheduling parallel machines with exponential algorithms
- Trivikram Dokka, Anastasia Kouvela and Frits Spieksma. Approximating the multi-level bottleneck assignment problem
- Anthony Perez and Stéphane Bessy. A quartic kernel for Proper Interval Completion
- Mathieu Chapelle. Domination-like problems parameterized by tree-width
To download the program in pdf format, click here.
The conference will take place at the site "Les cordeliers" of the University Pierre et Marie Curie.
The address is Campus des Cordelier, 21, rue de l'école de médecine, 75006 Paris, Métro Odéon.
For information about accomodation, child care and restaurants see in the STACS 2012 website.