APEX 2013 - Satellite Workshop of ICALP 2013

International Workshop on Approximation, Parameterized and EXact algorithms

July 7, 2013, Riga, Latvia

Accepted papers

The short papers can be downloaded here.

Silvia Mapa and Sebastian Urrutia. A 1/2-approximation algorithm for the Maximum Acyclic Subgraph problem under Negative Disjunctive Constraints
Zeev Nutov. A unified approach to source location via rooted network augmentation
Yongjie Yang and Jiong Guo. Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
Eric Angel, Romain Campigotto and Christian Laforest. A Memory-Efficient Algorithm for Vertex Covering on Huge Graphs
Christian Laforest and Raksmey Phan. Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic: Experimental Approach
Peng Cui. Strengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion
Nachshon Cohen and Zeev Nutov. Approximating $\{0,1,2\}$-Survivable Networks with Minimum Number of Steiner Points
Klaus Jansen, Felix Land and Kati Land. Bounding the Running Time of Algorithms for Scheduling and Packing Problems
Nicolas Boria, Federico Della Croce and Fabio Salassa. Machine Scheduling and Reoptimization
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi and Florian Sikora. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem
Sepp Hartung and André Nichterlein. On the Parameterized and Approximation Hardness of Metric Dimension
Konrad Dabrowski, Marc Demange and Vadim Lozin. The Complexity of Risk-free Marriage
Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff and Anthony Perez. Exact algorithms for Weak Roman Domination
Giorgio Lucarelli and Ioannis Milis. Improved approximation algorithms for the Max Edge-Coloring problem