Volume 101, Number 1, January 2007

• 
  Joost Engelfriet, Tjalling Gelsema: An exercise in structural congruence. 1-5
• 
  Houman Alborzi, Hanan Samet: Execution time analysis of a top-down R-tree construction algorithm. 6-12
• 
  Eric McDermid, Christine T. Cheng, Ichiro Suzuki: Hardness results on the man-exchange stable marriage problem with short preference lists. 13-19
• 
  Junhu Wang: Binary equality implication constraints, normal forms and data redundancy. 20-25
• 
  Uriel Feige, James R. Lee: An improved approximation ratio for the minimum linear arrangement problem. 26-29
• 
  Vardges Melkonian: Flows in dynamic networks with aggregate arc capacities. 30-35
• 
  Faisal N. Abu-Khzam, Michael A. Langston: Linear-time algorithms for problems on planar graphs with fixed disk dimension. 36-40
• 
  Richard S. Bird, Stefan Sadnicki: Minimal on-line labelling. 41-45
• 
  Yoshinobu Kawabe, Ken Mano, Hideki Sakurada, Yasuyuki Tsukada: Theorem-proving anonymity of infinite-state systems. 46-51

Volume 101, Number 2, January 2007

• 
  Peter Clifford, Raphaël Clifford: Simple deterministic wildcard matching. 53-54
• 
  Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro: On the longest increasing subsequence of a circular list. 55-59
• 
  Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi: Wait-free regular storage from Byzantine components. 60-65
• 
  Daniel Sawitzki: Lower bounds on the OBDD size of two fundamental functions' graphs. 66-71
• 
  Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata: Isomorphic factorization, the Kronecker product and the line digraph. 72-77
• 
  MoonBae Song, KwangJin Park, Ki-Sik Kong, SangKeun Lee: Bottom-up nearest neighbor search for R-trees. 78-85
• 
  Eric Bach: Bounds for the expected duration of the monopolist game. 86-92

Volume 101, Number 3, February 2007

• 
  Chang-Hsiung Tsai, Shu-Yun Jiang: Path bipancyclicity of hypercubes. 93-97
• 
  Lev Reyzin, Nikhil Srivastava: On the longest path algorithm for reconstructing trees from distance matrices. 98-100
• 
  Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto: An improved exact algorithm for the domatic number problem. 101-106
• 
  Ulrich Ultes-Nitsche: A power-set construction for reducing Büchi automata to non-determinism degree two. 107-111
• 
  Dana Ron, Amir Rosenfeld, Salil P. Vadhan: The hardness of the Expected Decision Depth problem. 112-118
• 
  Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter: On transitive orientations with restricted covering graphs. 119-125
• 
  Marcin Peczarski: The Ford-Johnson algorithm still unbeaten for less than 47 elements. 126-128
• 
  Michael J. Collins, David Kempe, Jared Saia, Maxwell Young: Nonnegative integral subset representations of integer sets. 129-133
• 
  Min Chen, André Raspaud, Weifan Wang: Three-coloring planar graphs without short cycles. 134-138

Volume 101, Number 4, February 2007

• 
  Joost Engelfriet: A Kleene characterization of computability. 139-140
• 
  Katrin Erk, Joachim Niehren: Dominance constraints in stratified context unification. 141-147
• 
  Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A global parallel algorithm for the hypergraph transversal problem. 148-155
• 
  Yoann Dieudonné, Franck Petit: Circle formation of weak robots and Lyndon words. 156-162
• 
  Jan Krajícek: Substitutions into propositional tautologies. 163-167
• 
  Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang: A self-stabilizing (Delta+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems. 168-173
• 
  Wenbin Chen, Jiangtao Meng: An improved lower bound for approximating Shortest Integer Relation in l_infinity norm (SIR_infinity). 174-179

Volume 101, Number 5, March 2007

• 
  David Eisenstat, Dana Angluin: The VC dimension of k-fold union. 181-184
• 
  Min Xu, Jun-Ming Xu: The forwarding indices of augmented cubes. 185-189
• 
  Emmanuelle Anceaume, Roy Friedman, Maria Gradinariu: Managed Agreement: Generalizing two fundamental distributed agreement problems. 190-198
• 
  Péter Biró, Katarína Cechlárová: Inapproximability of the kidney exchange problem. 199-202
• 
  Shiyan Hu: A linear time algorithm for max-min length triangulation of a convex polygon. 203-208
• 
  Carlos Martín-Vide, Victor Mitrana: Remarks on arbitrary multiple pattern interpretations. 209-214
• 
  Louis Esperet, Pascal Ochem: Oriented colorings of 2-outerplanar graphs. 215-219
• 
  J. Guadalupe Ramos, Josep Silva, Germán Vidal: Ensuring the quasi-termination of needed narrowing computations. 220-226

Volume 101, Number 6, March 2007

• 
  Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai: Geodesic pancyclicity and balanced pancyclicity of Augmented cubes. 227-232
• 
  Vardges Melkonian: LP-based solution methods for the asymmetric TSP. 233-238
• 
  Shuang Luan, Jared Saia, Maxwell Young: Approximation algorithms for minimizing segments in radiation therapy. 239-244
• 
  Martin Dietzfelbinger, Henning Wunderlich: A characterization of average case communication complexity. 245-249
• 
  Moritz G. Maaß: Computing suffix links for suffix trees and arrays. 250-254
• 
  Paulo Sérgio Almeida, Carlos Baquero, Nuno M. Preguiça, David Hutchison: Scalable Bloom Filters. 255-261
• 
  Rami Al Na'mneh, W. David Pan: Five-step FFT algorithm with reduced computational complexity. 262-267

last updated on Mon May 20 03:18:53 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page