List of Accepted Papers
There were 78 submissions and the following 36 papers were accepted:
- Imran Pirwani and Mohammad Salavatipour. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
- Stefan Kratsch and Pascal Schweitzer. Isomorphism for graphs of bounded feedback vertex set number
- Elad Horev, Roi Krakovski and Shakhar Smorodinsky. Conflict-Free Coloring Made Stronger
- Marek Cygan, Marcin Pilipczuk and Jakub Wojtaszczyk. Capacitated domination faster than O(2^n)
- Shakhar Smorodinsky and Yelena Yuditsky. Polychromatic coloring for half-planes
- Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin and Michiel Smid. Improved Methods For Generating Quasi-Gray Codes
- Bart Jansen. Polynomial Kernels for Hard Problems on Disk Graphs
- Marcin Bienkowski and Stefan Schmid. Online Function Tracking with Generalized Penalties
- Martin R. Ehmsen and Kim S. Larsen. Better Bounds on Online Unit Clustering
- Zhou Xu and Brian Rodrigues. A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- Fedor Fomin, Petr Golovach and Daniel Lokshtanov. Cops and Robber game without recharging
- Mark de Berg and Dirk H.P. Gerrits. Approximation algorithms for free-label maximization
- Bourgeois Nicolas, Bruno Escoffier, Vangelis Paschos and Johan M. M. van Rooij. A Bottom-Up Method and Fast Algorithms for max independent set
- Jie Gao and Dengpan Zhou. The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
- Michael Hoffmann, Jiri Matousek, Yoshio Okamoto and Philipp Zumstein. Minimum and maximum against $k$ lies
- Boaz Patt-Shamir and Dror Rawitz. Vector Bin Packing with Multiple-Choice
- A. Karim Abu-Affash, Rom Aschner, Paz Carmi and Matthew J. Katz. The MST of Symmetric Disk Graphs is Light
- Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel and Andrzej Pelc. Optimal Exploration of Terrains with Obstacles
- Klaus Jansen, Stefan Kratsch, Da'niel Marx and Ildiko' Schlotter. Bin packing with fixed number of bins revisited
- David P. Bunde and Michael H. Goldwasser. Dispatching Equal-length Jobs to Parallel Machines to Maximize Throughput
- Robert Crowston, Gregory Gutin, Mark Jones, EUN JUNG KIM and Imre Ruzsa. Max Lin Above Average Problem and Lower Bounds for Maxima of Pseudo-boolean Functions
- Karim Doui"eb, Prosenjit Bose, Vida Dujmovic and Rolf Fagerberg. An $O(\log \log n)$-Competitive Binary Search Tree with Optimal Worst-Case Access Times
- Marcel R. Ackermann and Johannes Blo"mer. Bregman Clustering for Separable Instances
- Yann Disser, Matus Mihalak and Peter Widmayer. Reconstructing a simple polygon from its angles
- Yixin Cao, Jianer Chen and Yang Liu. On Feedback Vertex Set: New Measure and New Structures
- Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau and Dimtrios M. Thilikos. Faster Parameterized Algorithms for Minor Containment
- Garud Iyengar, David Phillips and Cliff Stein. Feasible and accurate algorithms for covering semidefinite programs
- Tim Nonner. Capacitated max-Batching with Interval Graph Compatibilities
- Unnar Bachmann, Magnus M. Halldorsson and Hadas Shachnai. Online Scheduling Intervals and t-Intervals
- Danny Z. Chen, Chao Wang and Haitao Wang. Representing a Functional Curve by Curves with Fewer Peaks
- Amr Elmasry, Claus Jensen and Jyrki Katajainen. Strictly-Regular Number System and Data Structures
- Erik Demaine and Morteza Zadimoghaddam. Fast Rumor Spreading using Shortcut Edges
- Daniel Delling, Andreas Gemsa, Thomas Pajor and Martin Noellenburg. Path Schematization for Route Sketches
- Marcin Kamin'ski and Lukasz Kowalik. Approximating the maximum 3- and 4-edge-colorable subgraph
- Anand Louis and Nisheeth Vishnoi. Improved Algorithm for Degree Bounded Survivable Network Design Problem
- Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman and Saket Saurabh. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing