ESA A

70 papers

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