ESA A

70 papers

YearTitle / Authors
2013A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs.
Nir Halman, Giacomo Nannicini, James B. Orlin
2013A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree.
Davide Bilò, Luciano Gualà, Guido Proietti
2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems.
Radu Curticapean, Marvin Künnemann
2013Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings
Hans L. Bodlaender, Giuseppe F. Italiano
2013An Alternative Approach to Alternative Routes: HiDAR.
Moritz Kobitzsch
2013An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering.
Andreas Beckmann, Ulrich Meyer, David Veith
2013An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions.
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
2013An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.
Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis
2013Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.
Jannik Matuschke, Andreas Bley, Benjamin Müller
2013BICO: BIRCH Meets Coresets for k-Means Clustering.
Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler
2013Balanced Neighbor Selection for BitTorrent-Like Networks.
Sándor Laki, Tamás Lukovszki
2013Balls into Bins Made Faster.
Megha Khosla
2013Better Approximation Algorithms for Technology Diffusion.
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
2013Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013Compressed Cache-Oblivious String B-tree.
Paolo Ferragina, Rossano Venturini
2013Computing the Fréchet Distance with a Retractable Leash.
Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer
2013Computing the Greedy Spanner in Linear Space.
Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
2013Connectivity Inference in Mass Spectrometry Based Structure Determination.
Deepesh Agarwal, Júlio César Silva Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes
2013Dynamic Graphs in the Sliding-Window Model.
Michael S. Crouch, Andrew McGregor, Daniel M. Stubbs
2013Economic 3-Colored Subdivision of Triangulations.
Lucas Moutinho Bueno, Jorge Stolfi
2013Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2013Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures.
Deepak Ajwani, Nodari Sitchinava
2013Encodings for Range Selection and Top-k Queries.
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
2013Euclidean Greedy Drawings of Trees.
Martin Nöllenburg, Roman Prutkin
2013Exclusive Graph Searching.
Lélia Blin, Janna Burman, Nicolas Nisse
2013FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations.
Hu Ding, Jinhui Xu
2013Flip Distance between Triangulations of a Simple Polygon is NP-Complete.
Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz
2013Friendship and Stable Matching.
Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer
2013Fréchet Queries in Geometric Trees.
Joachim Gudmundsson, Michiel H. M. Smid
2013Improved Approximation Algorithms for Projection Games - (Extended Abstract).
Pasin Manurangsi, Dana Moshkovitz
2013Inefficiency of Standard Multi-unit Auctions.
Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis
2013Kernelization Using Structural Parameters on Sparse Graph Classes.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap.
Mark de Berg, Dirk H. P. Gerrits
2013Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling.
Kim Thang Nguyen
2013Largest Chordal and Interval Subgraphs Faster Than 2 n.
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013Limitations of Deterministic Auction Design for Correlated Bidders.
Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2013List H-Coloring a Graph by Removing Few Vertices.
Rajesh Hemant Chitnis, László Egri, Dániel Marx
2013Logit Dynamics with Concurrent Updates for Local Interaction Games.
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2013Long Circuits and Large Euler Subgraphs.
Fedor V. Fomin, Petr A. Golovach
2013Maximizing Barrier Coverage Lifetime with Mobile Sensors.
Amotz Bar-Noy, Dror Rawitz, Peter Terlecky
2013Maximizing a Submodular Function with Viability Constraints.
Wolfgang Dvorák, Monika Henzinger, David P. Williamson
2013Nearly Optimal Private Convolution.
Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov
2013Network Bargaining with General Capacities.
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
2013On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility.
Stefan Kratsch
2013On Resilient Graph Spanners.
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini
2013On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3.
Panos Giannopoulos, Christian Knauer, Daniel Werner
2013On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity.
Jop Briët, Daniel Dadush, Sebastian Pokutta
2013On the Most Likely Convex Hull of Uncertain Points.
Subhash Suri, Kevin Verbeek, Hakan Yildiz
2013Optimal Color Range Reporting in One Dimension.
Yakov Nekrich, Jeffrey Scott Vitter
2013Parallel String Sample Sort.
Timo Bingmann, Peter Sanders
2013Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2013Revisiting the Problem of Searching on a Line.
Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher
2013Rumor Spreading in Random Evolving Graphs.
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013Secluded Connectivity Problems.
Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2013Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures.
Kai Xiao, Danny Ziyi Chen, Xiaobo Sharon Hu, Bo Zhou
2013Sparse Fault-Tolerant BFS Trees.
Merav Parter, David Peleg
2013Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph.
Fedor V. Fomin, Michal Pilipczuk
2013Table Cartograms.
William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
2013The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.
Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria
2013The Encoding Complexity of Two Dimensional Range Minimum Data Structures.
Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi
2013The Online Replacement Path Problem.
David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
2013The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial.
George B. Mertzios
2013Theory and Implementation of Online Multiselection Algorithms.
Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
2013Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract).
Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2013Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
Christoph Berkholz, Paul S. Bonsma, Martin Grohe
2013Top-k Document Retrieval in External Memory.
Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter
2013Tractable Parameterizations for the Minimum Linear Arrangement Problem.
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2013Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.
Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
2013Vertex Deletion for 3D Delaunay Triangulations.
Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Richard Shewchuk
2013Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets.
Shin-ichi Minato