default search action
21. ESA 2013: Sophia Antipolis, France
- Hans L. Bodlaender
, Giuseppe F. Italiano:
Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Lecture Notes in Computer Science 8125, Springer 2013, ISBN 978-3-642-40449-8 - David Adjiashvili, Gianpaolo Oriolo, Marco Senatore:
The Online Replacement Path Problem. 1-12 - Oswin Aichholzer, Wolfgang Mulzer
Flip Distance between Triangulations of a Simple Polygon is NP-Complete. 13-24 - Deepak Ajwani
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. 25-36 - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
Computing the Greedy Spanner in Linear Space. 37-48 - Elliot Anshelevich
Friendship and Stable Matching. 49-60 - Lars Arge, Gerth Stølting Brodal
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. 61-72 - Vincenzo Auletta
Logit Dynamics with Concurrent Updates for Local Interaction Games. 73-84 - Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano
On Resilient Graph Spanners. 85-96 - Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. 97-108 - Jérémy Barbay
Theory and Implementation of Online Multiselection Algorithms. 109-120 - Andreas Beckmann, Ulrich Meyer, David Veith:
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. 121-132 - Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. 133-144 - Christoph Berkholz, Paul S. Bonsma, Martin Grohe
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. 145-156 - Davide Bilò
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. 157-168 - Timo Bingmann, Peter Sanders:
Parallel String Sample Sort. 169-180 - Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. 181-192 - Ivan Bliznets
Largest Chordal and Interval Subgraphs Faster Than 2 n. 193-204 - Prosenjit Bose
Revisiting the Problem of Searching on a Line. 205-216 - Jop Briët, Daniel Dadush
On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity. 217-228 - Gerth Stølting Brodal
The Encoding Complexity of Two Dimensional Range Minimum Data Structures. 229-240 - Kevin Buchin
Computing the Fréchet Distance with a Retractable Leash. 241-252 - Kevin Buchin
Vertex Deletion for 3D Delaunay Triangulations. 253-264 - Lucas Moutinho Bueno, Jorge Stolfi:
Economic 3-Colored Subdivision of Triangulations. 265-276 - Ioannis Caragiannis
Limitations of Deterministic Auction Design for Correlated Bidders. 277-288 - Deepesh Agarwal, Júlio César Silva Araújo
Connectivity Inference in Mass Spectrometry Based Structure Determination. 289-300 - Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. 301-312 - Rajesh Hemant Chitnis
List H-Coloring a Graph by Removing Few Vertices. 313-324 - Andrea Clementi, Pierluigi Crescenzi
Rumor Spreading in Random Evolving Graphs. 325-336 - Michael S. Crouch
Dynamic Graphs in the Sliding-Window Model. 337-348 - Radu Curticapean, Marvin Künnemann:
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. 349-360 - Marek Cygan
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). 361-372 - Mark de Berg, Dirk H. P. Gerrits:
Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap. 373-384 - Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
Inefficiency of Standard Multi-unit Auctions. 385-396 - Hu Ding, Jinhui Xu:
FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations. 397-408 - Wolfgang Dvorák, Monika Henzinger, David P. Williamson:
Maximizing a Submodular Function with Viability Constraints. 409-420 - William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Table Cartograms. 421-432 - Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Network Bargaining with General Capacities. 433-444 - Nadia Fawaz
Nearly Optimal Private Convolution. 445-456 - Michael R. Fellows
Tractable Parameterizations for the Minimum Linear Arrangement Problem. 457-468 - Paolo Ferragina
Compressed Cache-Oblivious String B-tree. 469-480 - Hendrik Fichtenberger
BICO: BIRCH Meets Coresets for k-Means Clustering. 481-492 - Fedor V. Fomin
Long Circuits and Large Euler Subgraphs. 493-504 - Fedor V. Fomin
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. 505-516 - Travis Gagie
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. 517-528 - Jakub Gajarský, Petr Hlinený
Kernelization Using Structural Parameters on Sparse Graph Classes. 529-540 - Panos Giannopoulos, Christian Knauer, Daniel Werner:
On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. 541-552 - Roberto Grossi, John Iacono
Encodings for Range Selection and Top-k Queries. 553-564 - Joachim Gudmundsson
Fréchet Queries in Geometric Trees. 565-576 - Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. 577-588 - Thomas Kesselheim, Klaus Radke, Andreas Tönnis
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. 589-600 - Megha Khosla:
Balls into Bins Made Faster. 601-612 - Moritz Kobitzsch:
An Alternative Approach to Alternative Routes: HiDAR. 613-624 - Tomasz Kociumaka
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. 625-636 - Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
Better Approximation Algorithms for Technology Diffusion. 637-646 - Stefan Kratsch:
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility. 647-658 - Sándor Laki
Balanced Neighbor Selection for BitTorrent-Like Networks. 659-670 - Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. 671-682 - Pasin Manurangsi, Dana Moshkovitz:
Improved Approximation Algorithms for Projection Games - (Extended Abstract). 683-694 - Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. 695-706 - Jannik Matuschke, Andreas Bley
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. 707-718 - George B. Mertzios:
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial. 719-730 - Shin-ichi Minato:
Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets. 731-742 - Yakov Nekrich
Optimal Color Range Reporting in One Dimension. 743-754 - Kim Thang Nguyen:
Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling. 755-766 - Martin Nöllenburg
Euclidean Greedy Drawings of Trees. 767-778 - Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Trees. 779-790 - Subhash Suri, Kevin Verbeek, Hakan Yildiz
On the Most Likely Convex Hull of Uncertain Points. 791-802 - Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter
Top-k Document Retrieval in External Memory. 803-814 - Kai Xiao, Danny Ziyi Chen, Xiaobo Sharon Hu
Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures. 815-826
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-25 22:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: