SWAT 2014 Accepted Papers

Takuro Fukunaga. Covering problems in edge- and node-weighted graphs
György Dósa and Leah Epstein. Colorful bin packing
Konstantin Kutzkov and Rasmus Pagh. Triangle counting in dynamic graph streams
Edyta Szymanska, Marek Karpinski, Andrzej Ruciński and Andrzej Dudek. Approximate Counting of Matchings in (3,3)-Hypergraphs
Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn and Adrian Neumann. New Approximability Results for the Robust k-Median Problem
Djamal Belazzougui, Gerth Stølting Brodal and Jesper Sindahl Nielsen. Expected Linear Time Sorting for Word Size Ω(log2 n log log n)
Fedor Fomin, Mathieu Liedloff, Pedro Montealegre and Ioan Todinca. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Konstantin Kutzkov and Rasmus Pagh. Consistent Subset Sampling
Susanne Albers and Matthias Hellwig. Online Makespan Minimization with Parallel Schedules
Paul Bonsma, Marcin Kamiński and Marcin Wrochna. Reconfiguring Independent Sets in Claw-Free Graphs
Søren Vind and Roberto Grossi. Colored Range Searching in Linear Space
Francois Le Gall and Harumichi Nishimura. Quantum Algorithms for Matrix Products over Semirings
Vincent Froese, André Nichterlein and Rolf Niedermeier. Win-Win Kernelization for Degree Sequence Completion Problems
Yota Otachi and Pascal Schweitzer. Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher and Perouz Taslakian. Competitive Online Routing on Delaunay Triangulations
Ian Munro, Gonzalo Navarro, Rahul Shah and Sharma V. Thankachan. Ranked Document Selection
Mark de Berg, Ali Mehrabi and Farnaz Sheikhi. Separability of Imprecise Points
Toshihiro Fujito. On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem
Keigo Oka and Yoichi Iwata. Fast Dynamic Graph Algorithms for Parameterized Problems
Pavel Klavík, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell and Tomas Vyskocil. Extending Partial Representations of Proper and Unit Interval Graphs
Mathias Bæk Tejs Knudsen. Additive spanners: A simple construction
Søren Dahlgaard and Mikkel Thorup. Approximately Minwise Independence with Twisted Tabulation
Vittorio Bilo', Michele Flammini and Gianpiero Monaco. Approximating the Revenue Maximization Problem with Sharp Demands
Feodor Dragan, Ekkehard Köhler and Arne Leitert. Line-distortion, Bandwidth and Path-length of a graph
Ekkehard Köhler and Lalla Mouatadid. Linear Time LexDFS on Cocomparability Graphs
Therese Biedl. Trees and co-trees with bounded degrees in planar 3-connected graphs
Huxley Bennett and Chee Yap. Amortized Analysis of Smooth Quadtrees in All Dimensions
Lukasz Kowalik and Arkadiusz Socala. Assigning channels via the meet-in-the-middle approach
Peyman Afshani and Nodari Sitchinava. I/O-efficient Range Minima Queries
Trevor Brown. B-slack trees: Space Efficient B-trees
Gerth Stølting Brodal and Kasper Green Larsen. Optimal Planar Orthogonal Skyline Counting Queries
Boris Klemz, Tamara Mchedlidze and Martin Nöllenburg. Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
N.S. Narayanaswamy and Anup Joshi. Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments