default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd ESA 2014: Wroclaw, Poland
- Andreas S. Schulz, Dorothea Wagner:
Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. Lecture Notes in Computer Science 8737, Springer 2014, ISBN 978-3-662-44776-5 - Amir Abboud, Kevin Lewi, Ryan Williams
:
Losing Weight by Gaining Edges. 1-12 - Fidaa Abed, José R. Correa, Chien-Chung Huang:
Optimal Coordination Mechanisms for Multi-job Scheduling Games. 13-24 - Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Theory and Practice of Chunked Sequences. 25-36 - Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls under Uncertainty. 37-48 - Rachit Agarwal:
The Space-Stretch-Time Tradeoff in Distance Oracles. 49-60 - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink:
Distribution-Sensitive Construction of the Greedy Spanner. 61-73 - Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing Shrinkable Complexes Is NP-Complete. 74-86 - Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. 87-99 - Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. 100-111 - Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai:
The Batched Predecessor Problem in External Memory. 112-124 - Arnab Bhattacharyya:
Polynomial Decompositions in Polynomial Time. 125-136 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. 137-148 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. 149-160 - Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. 161-172 - Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. 173-184 - Jean-Daniel Boissonnat, Clément Maria:
Computing Persistent Homology with Various Coefficient Fields in a Single Pass. 185-196 - Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. 197-208 - Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Algorithms for Restricted Caching and Matroid Caching. 209-221 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved Algorithms for Resource Allocation under Varying Capacity. 222-234 - Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer:
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. 235-246 - Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications to Path Reporting. 247-259 - Moses Charikar, Monika Henzinger, Huy L. Nguyen:
Online Bipartite Matching with Decomposable Weights. 260-271 - Siu-Wing Cheng, Liam Mencel, Antoine Vigneron:
A Faster Algorithm for Computing Straight Skeletons. 272-283 - Omar Darwish, Amr Elmasry:
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem. 284-295 - Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. 296-308 - Brian C. Dean, Rommel Jalasutram, Chad G. Waters:
Lightweight Approximate Selection. 309-320 - Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. 321-333 - Zdenek Dvorák, Martin Kupec, Vojtech Tuma:
A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth. 334-345 - Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. 346-357 - Alexandros Efentakis, Dieter Pfoser:
GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem. 358-370 - Charilaos Efthymiou:
Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold. 371-381 - Alina Ene, Huy L. Nguyên:
From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route? 382-393 - Guy Even, Moti Medina, Dana Ron:
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. 394-405 - Andrea Farruggia, Paolo Ferragina, Rossano Venturini:
Bicriteria Data Compression: Efficient and Usable. 406-417 - Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. 418-429 - Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. 430-442 - Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Sets of Product Families. 443-454 - Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted Ancestors in Suffix Trees. 455-466 - Mina Ghashami, Amey Desai, Jeff M. Phillips:
Improved Practical Matrix Sketching with Guarantees. 467-479 - Matt Gibson, Kasturi R. Varadarajan, Xiaodong Wu:
Computing Regions Decomposable into m Stars. 480-491 - Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. 492-504 - Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman:
Dimension Reduction via Colour Refinement. 505-516 - Anupam Gupta, Marco Molinaro:
How Experts Can Solve LPs Online. 517-529 - Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the k-Arc Chinese Postman Problem. 530-541 - Sariel Har-Peled, Subhro Roy:
Approximating the Maximum Overlap of Polygons under Translation. 542-553 - Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without Forbidden Patterns. 554-565 - Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. 566-578 - Bart M. P. Jansen:
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. 579-591 - Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal Parallel Quantum Query Algorithms. 592-604 - Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Sublinear Space Algorithms for the Longest Common Substring Problem. 605-617 - Daniel H. Larkin, Robert Endre Tarjan:
Nested Set Union. 618-629 - Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman:
Improved Explicit Data Structures in the Bitprobe Model. 630-641 - Wenjun Li, Jianer Chen, Jianxin Wang:
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees. 642-653 - Jingcheng Liu, Pinyan Lu, Chihao Zhang:
FPTAS for Counting Weighted Edge Covers. 654-665 - Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Solving Multicut Faster Than 2 n. 666-676 - Caleb Malchik, Andrew Winslow:
Tight Bounds for Active Self-assembly Using an Insertion Primitive. 677-688 - Andrew McGregor, Eric Price, Sofya Vorotnikova:
Trace Reconstruction Revisited. 689-700 - Florian Merz, Peter Sanders:
PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies. 701-712 - Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle Packing Problems. 713-724 - Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Document Retrieval on Repetitive Collections. 725-736 - Alantha Newman:
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs. 737-749 - Rasmus Pagh, Morten Stöckel:
The Input/Output Complexity of Sparse Matrix Multiplication. 750-761 - Romeo Rizzi, Alexandru I. Tomescu:
Faster FPTASes for Counting and Random Generation of Knapsack Solutions. 762-773 - Harald Räcke, Chintan Shah:
Improved Guarantees for Tree Cut Sparsifiers. 774-785 - Hadas Shachnai, Meirav Zehavi:
Representative Families: A Unified Tradeoff-Based Approach. 786-797 - Martijn van Brink, Ruben van der Zwaan:
A Branch and Price Procedure for the Container Premarshalling Problem. 798-809 - Joshua R. Wang:
Space-Efficient Randomized Algorithms for K-SUM. 810-829 - Zhewei Wei, Ke Yi:
Equivalence between Priority Queues and Sorting in External Memory. 830-841 - Bryan T. Wilkinson:
Amortized Bounds for Dynamic Orthogonal Range Reporting. 842-856
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 2025-12-13 20:28 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:
