- Vissarion Fisikopoulos and Luis Peñaranda
Faster Geometric Algorithms via Dynamic Determinant Computation
- Emanuele G. Fusco and Andrzej Pelc
Knowledge, Level of Symmetry, and Time of Leader Election
- Sergio Cabello, Jean Cardinal, and Stefan Langerman
The Clique Problem in Ray Intersection Graphs
- Fidaa Abed and Chien-Chung Huang
Preemptive Coordination Mechanism for Unrelated Machines
- Eunhui Park and David M. Mount
A Self-adjusting Data Structure for Multi-dimensional Point Sets
- Bernard Chazelle and Wolfgang Mulzer
Data Structures on Event Graphs
- Djamal Belazzougui and Gonzalo Navarro
New Lower and Upper Bounds for Representing Sequences
- Jessica Chang, Harold N. Gabow and Samir Khuller
A Model for Minimizing Active Processor Time
- Mahmuda Ahmed, Carola Wenk
Constructing Street Networks from GPS Trajectories
- Abhijin Adiga, Jasine Babu and L. Sunil Chandran
Polynomial Time and Parameterized Approximation Algorithms for Boxicity
- Hubert T-H. Chan, Fei Chen, Li Ning
Optimizing Social Welfare for Network Bargaining Games
- G Brodal, P Davoodi, M Lewenstein, R Raman, S R Satti
Two Dimensional Range Minimum Queries and Fibonacci Lattices
- Bundit Laekhanukit, Adrian Vetta and Gordon Wilfong
Routing Regardless of Network Stability
- Marek Cygan, Guy Kortsarz, Zeev Nutov
Steiner Forest Orientation Problems
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
- Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou
Revenue Guarantees in Sponsored Search Auctions
- Martin Aumüller, Martin Dietzfelbinger and Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
- Gernot Veit Batz and Peter Sanders
Time-Dependent Route Planning with Generalized Objective Functions
- Martin Babka, Jan Bulánek, Vladimír Čunát, Michal Koucký, Michael Saks
On Online Labeling with Polynomially Many Labels
- Jan Bulánek, Michal Koucký, Michael Saks
The Online Labeling Problem
- Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
- J. Correa, J. Soto, O. Larre
TSP tours in Cubic Graphs: Beyond 4/3
- Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Polynomial-Time Algorithms for Energy Games with Special Weight Structures
- Sebastian Wild and Markus E. Nebel
Average Case Analysis of Java 7's Dual Pivot Quicksort
- Bjarni V. Halldórsson, Dima Blokh, Roded Sharan
Estimating population size via line graph reconstruction
- Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier
Preserving Inversion Phylogeny Reconstruction
- Akshay Deepak, Shelley McMahon, and David Fernández-Baca
Extracting Conflict-free Information from Multilabeled Trees
- Birte Kehr, Knut Reinert, Aaron Darling
Hidden Breakpoints in Genome Alignments
- Rayan Chikhi, Guillaume Rizk
Space-efficient and exact de Bruijn graph representation based on a Bloom filter
- Yi Shi, Xiaoping Liao, Xinhua Zhang, Guohui Lin, Dale Schuurmans
Sparse Learning based Linear Coherent Bi-clustering
- Phillip Compeau
A Simplified View of DCJ-Indel Distance
- Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
Succinct de Bruijn Graphs
- Niko Välimäki and Simon J. Puglisi
Distributed String Mining for High-Throughput Sequencing Data
- Manuel Lafond, Krister M. Swenson, Nadia El Mabrouk
An Optimal Reconciliation Algorithm for Gene Trees with Polytomies
- Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz and Michal Ziv-Ukelson
RNA Tree Comparisons Via Unrooted Unordered Alignments
- Markus J. Bauer, Anthony J. Cox, Giovanna Rosone and Marinella Sciortino
Lightweight LCP Construction for Next-Generation Sequencing Datasets
- Xuefeng Cui
How accurately can we model protein structures with dihedral angles?
- Rob Gysel, Kristian Stevens, Dan Gusfield
Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs
- Michael Elberfeld, Christoph Stockhusen, Till Tantau
On the Space Complexity of Parameterized Problems
- Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets
- Flum, Müller
Some definitorial suggestions for parameterized proof complexity
- Markus Bläser, Radu Curticapean
Weighted Counting of k-matchings is #W[1]-hard
- James Abello, Pavel Klavik, Jan Kratochvil and Tomas Vyskocil
MSOL Restricted Contractibility to Planar Graphs
- Yijia Chen, Kord Eickmeyer, Jörg Flum
ETH and the Parameterized Clique Problem
- Adam Bouland, Anuj Dawar and Eryk Kopczyński
On Tractable Parameterizations of Graph Isomorphism
- Lukasz Kowalik
Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
- Ivan Bliznets, Alexander Golovnev
A New Algorithm for Parameterized MAX-SAT
- Petr Golovach, Pinar Heggernes, Dieter Kratsch, and Reza Saei
An exact algorithm for Subset Feedback Vertex Set on chordal graphs
- Christoph Dürr, Ioannis Milis, Julien Robert and Georgios Zois
Approximating the Throughput by Coolest First Scheduling
- Akira Matsubayashi
Asymptotically Optimal Online Page Migration on Three Points
- Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro Lopez-Ortiz and Diego Seco.
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods
- Robert Georges, Frank Hoffmann, Klaus Kriegel
Online Exploration of Polygons with Holes
- Alejandro López-Ortiz, Alejandro Salinger
Minimizing Cache Usage in Paging
- Sara Ahmadian, Chaitanya Swamy
Improved Approximation Guarantees for Lower-Bounded Facility Location