Volume 61, Number 1, September 2011

• 
  Amos Fiat: Special Issue: European Symposium on Algorithms, Design and Analysis. 1-2
• 
  Markus Bläser, Christian Hoffmann: Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. 3-35
• 
  Andrzej Lingas: A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. 36-50
• 
  Paolo Ferragina, Igor Nitto, Rossano Venturini: On Optimally Partitioning a Text to Improve Its Compression. 51-74
• 
  David Pritchard, Deeparnab Chakrabarty: Approximability of Sparse Integer Programs. 75-93
• 
  Adrian Dumitrescu, Minghui Jiang: Piercing Translates and Homothets of a Convex Body. 94-115
• 
  George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the Performance of Approximate Equilibria in Congestion Games. 116-140
• 
  Yuval Emek: k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. 141-160
• 
  Navin Goyal, Neil Olver, F. Bruce Shepherd: Dynamic vs. Oblivious Routing in Network Design. 161-173
• 
  Haim Kaplan, Yahav Nussbaum: Maximum Flow in Directed Planar Graphs with Vertex Capacities. 174-189
• 
  Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for Label Cover Problems. 190-206
• 
  Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. 207-225

Volume 61, Number 2, October 2011

• 
  Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. 227-251
• 
  Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. 252-273
• 
  Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli: Graphical Congestion Games. 274-297
• 
  René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders: Energy-Efficient Paths in Radio Networks. 298-319
• 
  Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos: The Longest Path Problem has a Polynomial Solution on Interval Graphs. 320-341
• 
  Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximation Algorithms for the Interval Constrained Coloring Problem. 342-361
• 
  Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. 362-388
• 
  Liam Roditty, Uri Zwick: On Dynamic Shortest Paths Problems. 389-401
• 
  Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan: A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. 402-418
• 
  Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer: Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks. 419-446
• 
  Xi Chen, Xiaotie Deng, Becky Jie Liu: On Incentive Compatible Competitive Selection Protocols. 447-462
• 
  Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. 463-505

Volume 61, Number 3, November 2011

• 
  Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. 507-517
• 
  Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young: Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks. 518-554
• 
  Benjamin A. Burton: Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density. 555-579
• 
  Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. 580-605
• 
  Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli: Tight Bounds for Selfish and Greedy Load Balancing. 606-637
• 
  Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. 638-655
• 
  Danny Z. Chen, Konrad Engel, Chao Wang: A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy. 656-673
• 
  Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer: Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. 674-693
• 
  Haim Kaplan, Yahav Nussbaum: A Simpler Linear-Time Recognition of Circular-Arc Graphs. 694-737
• 
  Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. 738-757
• 
  Chris Dowden, Louigi Addario-Berry: Subgraphs of 4-Regular Planar Graphs. 758-776

Volume 61, Number 4, December 2011

• 
  Seok-Hee Hong, Hiroshi Nagamochi: Editorial: ISAAC 2008 Special Issue. 777-778
• 
  Jin-yi Cai, Pinyan Lu: Signature Theory in Holographic Algorithms. 779-816
• 
  Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-in. 817-838
• 
  Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph? 839-856
• 
  Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian: The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. 857-881
• 
  Joachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. 882-897
• 
  Maxim A. Babenko: An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. 898-922
• 
  Editors' Note: ISAAC 2009 Special Section. 923
• 
  Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa: Exact Algorithms for the Bottleneck Steiner Tree Problem. 924-948
• 
  Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. 949-970
• 
  Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr: Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. 971-999
• 
  Minming Li, Peng-Jun Wan, F. Frances Yao: Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. 1000-1021
• 
  Seok-Hee Hong, Hiroshi Nagamochi: Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. 1022-1076
• 
  Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui: An Improved Approximation Algorithm for the Traveling Tournament Problem. 1077-1091
• 
  Decheng Dai, Rong Ge: Another Sub-exponential Algorithm for the Simple Stochastic Game. 1092-1104

last updated on Thu May 23 01:54:08 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page