Theoretical Computer Science, Volume 406

Volume 406, Numbers 1-2, October 2008

• Kees Joost Batenburg, Antal Nagy, Maurice Nivat:
  Preface. 1
  

• Kees Joost Batenburg, Antal Nagy, Maurice Nivat:
  In Memoriam Attila Kuba (1953-2006). 2-7
  

• Eric Andres:
  The supercover of an m-flat is a discrete analytical object. 8-14
  
• Péter Balázs:
  A framework for generating some discrete sets with disjoint components by using uniform distributions. 15-23
  
• Valentin E. Brimkov, Reneta P. Barneva:
  On the polyhedral complexity of the integer points in a hyperball. 24-30
  
• Srecko Brlek, Gilbert Labelle, Annie Lacasse:
  Discrete sets with minimal moment of inertia. 31-42
  
• S. Brocchi, Andrea Frosini, Christophe Picouleau:
  Reconstruction of binary matrices under fixed size neighborhood constraints. 43-54
  
• Sara Brunetti, Alain Daurat:
  Reconstruction of convex lattice sets from tomographic projections in quartic time. 55-62
  
• Sara Brunetti, Alberto Del Lungo, Peter Gritzmann, Sven de Vries:
  On the reconstruction of binary and permutation matrices under (binary) tomographic constraints. 63-71
  
• David Coeurjolly, Jérôme Hulin, Isabelle Sivignon:
  Finding a minimum medial axis of a discrete shape is NP-hard. 72-79
  
• Paolo Dulio:
  Convex decomposition of U-polygons. 80-89
  
• Andrea Frosini, Maurice Nivat, Simone Rinaldi:
  Scanning integer matrices by means of two rectangular windows. 90-96
  
• T. Yung Kong:
  Minimal non-deletable sets and minimal non-codeletable sets in binary images. 97-118
  
• Kálmán Palágyi:
  A 3D fully parallel surface-thinning algorithm. 119-135
  
• Miguel Santoyo, Ernesto Vallejo:
  Additivity obstructions for integral matrices and pyramids. 136-145
  
• Daniel Vainsencher, Alfred M. Bruckstein:
  On isoperimetrically optimal polyforms. 146-159
  
• Rafal Zdunek:
  On image reconstruction algorithms for binary electromagnetic geotomography. 160-170
  

Volume 406, Number 3, October 2008

• Christos Kaklamanis:
  Preface. 171-172
  

• Pasquale Ambrosio, Vincenzo Auletta:
  Deterministic monotone algorithms for scheduling on related machines. 173-186
  
• Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
  A new model for selfish routing. 187-206
  
• Miroslav Chlebík, Janka Chlebíková:
  The Steiner tree problem on graphs: Inapproximability results. 207-214
  
• Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis:
  Large independent sets in general random intersection graphs. 215-224
  
• Ralf Klasing, Nelson Morales, Stéphane Pérennes:
  On the complexity of bandwidth allocation in radio networks. 225-239
  
• Carme Àlvarez, Josep Díaz, Jordi Petit, José D. P. Rolim, Maria J. Serna:
  High level communication functionalities for wireless sensor networks. 240-247
  
• Colin Cooper, Ralf Klasing, Tomasz Radzik:
  A randomized algorithm for the joining protocol in dynamic distributed networks. 248-262