Algorithmica, Volume 62
Volume 62, Numbers 1-2, February 2012
Mariano Zelke: Weighted Matching in the Semi-Streaming Model. 1-20- Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Complexity of Finding Graph Roots with Girth Conditions. 38-53
- Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane: Stronger Lempel-Ziv Based Compressed Text Indexing. 54-101
- Leah Epstein, Asaf Levin, Rob van Stee: Approximation Schemes for Packing Splittable Items with Cardinality Constraints. 102-129
- Olivier Bernardi, Omer Giménez: A Linear Algorithm for the Random Sampling from Regular Languages. 130-145
- Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès: A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. 146-168
- Beat Gfeller: Faster Swap Edge Computation in Minimum Diameter Spanning Trees. 169-191
- Jens M. Schmidt: Construction Sequences and Certifying 3-connectivity. 192-208
- Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. 224-257
- Kunal Agrawal, Anne Benoit, Fanny Dufossé, Yves Robert: Mapping Filtering Streaming Applications. 258-308
- Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. 309-332
- Nedialko B. Dimitrov, C. Greg Plaxton: Competitive Weighted Matching in Transversal Matroids. 333-348
- Matthew J. Katz, Gila Morgenstern: A Scheme for Computing Minimum Covers within Simple Regions. 349-360
- Sergio Cabello: Many Distances in Planar Graphs. 361-381
- Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij: Fast Algorithms for max independent set. 382-415
- Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack: Shortest Paths in Time-Dependent FIFO Networks. 416-435
- Gábor Ivanyos, Luc Sanselme, Miklos Santha: An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. 480-498
- Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-Path Problem for Claw-free Graphs. 499-519
- Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximability of the Firefighter Problem - Computing Cuts over Time. 520-536
- Pim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. 537-563
- Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar: The Parameterized Complexity of Stabbing Rectangles. 564-594
- Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. 595-629
- Alexandr O. Ivanov, Alexey A. Tuzhilin: The Steiner Ratio Gilbert-Pollak Conjecture Is Still Open - Clarification Statement. 630-632
- André Berger, Ojas Parekh: Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. 633-634
- Philippe Flajolet, the Father of Analytic Combinatorics. 635-636
Volume 62, Numbers 3-4, April 2012
- Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. 637-658
- Agustín Bompadre: Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems. 659-700
- Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang: Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. 713-732
- Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt: An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. 754-766
- Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu: Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks. 767-786
- Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi: Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. 787-806
- Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou: Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. 823-841
- Alireza Zarei, Mohammad Ghodsi: Efficient Observer-Dependent Simplification in Polygonal Domains. 842-862
- Michael L. Fredman: Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. 863-878
- Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi: On Smoothed Analysis of Quicksort and Hoare's Find. 879-905
- MohammadHossein Bateni, MohammadTaghi Hajiaghayi: Euclidean Prize-Collecting Steiner Forest. 906-929
- René van Bevern, Hannes Moser, Rolf Niedermeier: Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. 930-950
- Jing Xiao, Tiancheng Lou, Tao Jiang: An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants. 951-981
- Tobias Jacobs: On the Complexity of Optimal Hotlink Assignment. 982-1005
- Paola Flocchini, David Ilcinkas, Nicola Santoro: Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. 1006-1033
- Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. 1034-1049
- Imran A. Pirwani, Mohammad R. Salavatipour: A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. 1050-1072
- Liam Roditty: Fully Dynamic Geometric Spanners. 1073-1087
- Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting: Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window. 1088-1111
- Seok-Hee Hong, Hiroshi Nagamochi: A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. 1122-1158
- Olivier Bernardi, Éric Fusy: Schnyder Decompositions for Regular Plane Graphs and Application to Drawing. 1159-1197
- Greg N. Frederickson, Barry Wittman: Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems. 1198-1221
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team