Volume 57, Number 1, May 2010

• 
  Henrik Blunck, Jan Vahrenhold: In-Place Algorithms for Computing (Layers of) Maxima. 1-21
• 
  Feodor F. Dragan, Chenyu Yan: Collective Tree Spanners in Graphs with Bounded Parameters. 22-43
• 
  Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. 44-61
• 
  Gopal Pandurangan, Wojciech Szpankowski: A Universal Online Caching Algorithm Based on Pattern Matching. 62-73
• 
  Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-Colorability of P₅-Free Graphs in Polynomial Time. 74-81
• 
  Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni: Secure Overlay Network Design. 82-96
• 
  Henning Fernau: A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. 97-118
• 
  Benjamin Doerr, Frank Neumann, Ingo Wegener: Editorial. 119-120
• 
  Anne Auger, Olivier Teytaud: Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms. 121-146
• 
  Madeleine Theile, Thomas Jansen: Stability in the Self-Organized Evolution of Networks. 147-169
• 
  Thomas Jansen, Dennis Weyland: Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. 170-186
• 
  Joachim Reichel, Martin Skutella: Evolutionary Algorithms and Matroid Optimization Problems. 187-206

Volume 57, Number 2, June 2010

• 
  Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi: Computing median and antimedian sets in median graphs. 207-216
• 
  Regant Y. S. Hung, Hing-Fung Ting: Design and Analysis of Online Batching Systems. 217-231
• 
  Mingen Lin, Yang Yang, Jinhui Xu: Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems. 232-251
• 
  Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir: On the Planar Piecewise Quadratic 1-Center Problem. 252-283
• 
  Nir Ailon: Aggregation of Partial Rankings, p-Ratings and Top-m Lists. 284-300
• 
  Angelo Fanelli, Michele Flammini, Luca Moscardelli: On the Convergence of Multicast Games in Directed Networks. 301-324
• 
  Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu: Approximating Tree Edit Distance through String Edit Distance. 325-348
• 
  Eric Anderson, Joseph Hall, Jason D. Hartline, M. Hobbes, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes: Algorithms for Data Migration. 349-380
• 
  Huaming Zhang: Planar Polyline Drawings via Graph Transformations. 381-397
• 
  Liming Cai, Xiuzhen Huang: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. 398-412
• 
  Annamária Kovács: New Approximation Bounds for Lpt Scheduling. 413-433

Volume 57, Number 3, July 2010

• 
  Joachim Gudmundsson: Editorial, SWAT 2008 Special Issue. 435
• 
  Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis: Boundary Labeling with Octilinear Leaders. 436-461
• 
  Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. 462-483
• 
  Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan: On Metric Clustering to Minimize the Sum of Radii. 484-498
• 
  Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. 499-516
• 
  Yossi Azar, Uriel Feige, Daniel Glasner: A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. 517-537
• 
  Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. 538-561
• 
  Bastian Degener, Joachim Gehweiler, Christiane Lammersen: Kinetic Facility Location. 562-584

Volume 57, Number 4, August 2010

• 
  Gonzalo Navarro, Rodrigo Paredes: On Sorting, Heaps, and Minimum Spanning Trees. 585-620
• 
  Peter Damaschke: Homogeneous String Segmentation using Trees and Weighted Independent Sets. 621-640
• 
  Amos Korman, David Peleg, Yoav Rodeh: Constructing Labeling Schemes through Universal Matrices. 641-652
• 
  Spyros C. Kontogiannis, Paul G. Spirakis: Well Supported Approximate Equilibria in Bimatrix Games. 653-667
• 
  Jörg Derungs, Riko Jacob, Peter Widmayer: Approximate Shortest Paths Guided by a Small Index. 668-688
• 
  Anne Benoit, Yves Robert: Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows. 689-724
• 
  Susanne Albers, Tobias Jacobs: An Experimental Study of New and Known Online Packet Buffering Algorithms. 725-746
• 
  Dániel Marx: Chordal Deletion is Fixed-Parameter Tractable. 747-768
• 
  Hans Kellerer, Vitaly A. Strusevich: Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. 769-795
• 
  Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta: Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. 796-818
• 
  Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. 819-847
• 
  Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan: Broadcasting on Networks of Workstations. 848-868
• 
  N. Innami, B. H. Kim, Y. Mashiko, K. Shiohama: The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open. 869-872
• 
  Sung-woo Cho, Ashish Goel: Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives. 873-892

last updated on Sat May 25 05:48:43 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page