default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 69
Volume 69, Number 1, May 2014
- C. Seshadhri, Jan Vondrák:
Is Submodularity Testable? 1-25 - Leah Epstein
, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. 26-57 - Atlas F. Cook IV, Carola Wenk:
Shortest Path Problems on a Polyhedral Surface. 58-77 - Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. 78-91 - Arash Farzan, Shahin Kamali:
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. 92-116 - Marcel Wild:
Counting or Producing All Fixed Cardinality Transversals. 117-129 - Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. 130-147 - David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
On the Least Trimmed Squares Estimator. 148-183 - Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. 184-215 - Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. 216-231 - Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Efficient Fully-Compressed Sequence Representations. 232-268
Volume 69, Number 2, June 2014
- Zhi-Zhong Chen, Wenji Ma, Lusheng Wang:
The Parameterized Complexity of the Shared Center Problem. 269-293 - David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian:
Necklaces, Convolutions, and X+Y. 294-314 - Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. 315-334 - Xavier Allamigeon:
On the Complexity of Strongly Connected Components in Directed Hypergraphs. 335-369 - Danny Z. Chen, Haitao Wang:
New Algorithms for Facility Location Problems on the Real Line. 370-383 - Philip Bille, Inge Li Gørtz:
Substring Range Reporting. 384-396 - Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. 397-409 - Danny Z. Chen, Haitao Wang:
Outlier Respecting Points Approximation. 410-430 - Keren Cohen, Raphael Yuster:
On Minimum Witnesses for Boolean Matrix Multiplication. 431-442 - M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems. 443-460 - Stasys Jukna:
Limitations of Incremental Dynamic Programming. 461-492
Volume 69, Number 3, July 2014
- Editor's Note. 493
- Romeo Rizzi, David Cariolaro:
Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. 494-500 - Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. 501-521 - Po-Shen Loh, Rasmus Pagh:
Thresholds for Extreme Orientability. 522-539 - George B. Mertzios:
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. 540-581 - Hiroshi Fujiwara, Tobias Jacobs:
On the Huffman and Alphabetic Tree Problem with General Cost Functions. 582-604 - T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function. 605-618 - Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. 619-640 - Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. 641-657 - Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor. 658-684 - Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. 685-740 - Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh:
Better Size Estimation for Sparse Matrix Products. 741-757
Volume 69, Number 4, August 2014
- Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Circle Graph Recognition. 759-788 - Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Split Decomposition via Graph-Labelled Trees. 789-843 - Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
On the Advantage of Overlapping Clusters for Minimizing Conductance. 844-863 - Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang:
Cache-Oblivious Hashing. 864-883 - Feodor F. Dragan, Ekkehard Köhler:
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. 884-905 - Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. 906-924 - Anne Benoit, Matthieu Gallet, Bruno Gaujal, Yves Robert:
Computing the Throughput of Probabilistic and Replicated Streaming Applications. 925-957 - Leonor Frias, Salvador Roura:
Multikey Quickselect. 958-973
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 2026-07-09 01:10 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
