Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND YEAR=1997

• Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT
  Paola Alimonti
  Lecture Notes in Computer Science 1335, 1997, pp. 2-14
• On the number of simple cycles in planar graphs
  Helmut Alt, Ulrich Fuchs, Klaus Kriegel
  Lecture Notes in Computer Science 1335, 1997, pp. 15-24
• On the separable-homogeneous decomposition of graphs
  Luitpold Babel, Stephan Olariu
  Lecture Notes in Computer Science 1335, 1997, pp. 25-37
• Pseudo-Hamiltonian graphs
  Luitpold Babel, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1335, 1997, pp. 38-51
• Acyclic orientations for deadlock prevention in interconnection networks
  Jean-Claude Bermond, Miriam di Ianni, Michele Flammini, Stephane Perennes
  Lecture Notes in Computer Science 1335, 1997, pp. 52-64
• Weak-order extensions of an order
  Karell Bertet, Jens Gustedt, Michel Morvan
  Lecture Notes in Computer Science 1335, 1997, pp. 65-77
• An upper bound for the maximum cut mean value
  Alberto Bertoni, Paola Campadelli, Roberto Posenato
  Lecture Notes in Computer Science 1335, 1997, pp. 78-84
• NP-completeness results for minimum planar spanners
  Ulrik Brandes, Dagmar Handke
  Lecture Notes in Computer Science 1335, 1997, pp. 85-99
• Computing the independence number of dense triangle-free graphs
  Stephan Brandt
  Lecture Notes in Computer Science 1335, 1997, pp. 100-108
• Algorithms for the treewidth and minimum fill-in of HHD-free graphs
  H.J. Broersma, E. Dahlhaus, T. Kloks
  Lecture Notes in Computer Science 1335, 1997, pp. 109-117
• Block decomposition of inheritance hierarchies
  Christian Capelle
  Lecture Notes in Computer Science 1335, 1997, pp. 118-131
• Minimal elimination ordering inside a given chordal graph
  Elias Dahlhaus
  Lecture Notes in Computer Science 1335, 1997, pp. 132-143
• On optimal graphs embedded into paths and rings, with analysis using l_1-spheres
  Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
  Lecture Notes in Computer Science 1335, 1997, pp. 171-183
• On greedy matching ordering and greedy matchable graphs
  Feodor F. Dragan
  Lecture Notes in Computer Science 1335, 1997, pp. 184-198
• Performing tasks on restartable message-passing processors
  Bogdan S. Chlebus, Roberto de Prisco, Alex A. Shvartsman
  Lecture Notes in Computer Science 1320, 1997, pp. 96-110
• Heartbeat: A timeout-free failure detector for quiescent reliable communication
  Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
  Lecture Notes in Computer Science 1320, 1997, pp. 126-140
• Reliable communication over partially authenticated networks
  Amos Beimel, Matthew Franklin
  Lecture Notes in Computer Science 1320, 1997, pp. 245-259
• EDPEPPS: An integrated graphical toolset for the design and performance evaluation of portable parallel software
  T. Delaitre, P. Vekariya, R. Bigeard, G.R. Justo, S.C. Winter, M.J. Zemerly
  Lecture Notes in Computer Science 1300, 1997, pp. 140-149
• A processors management system for PVM
  Jose Aguilar, Tania Jimenez
  Lecture Notes in Computer Science 1300, 1997, pp. 158-161
• Broadcast and associative oprations on fat-trees
  G. Bilardi, B. Codenotti, G. del Corso, C. Pinotti, G. Resta
  Lecture Notes in Computer Science 1300, 1997, pp. 196-207
• Minimal routing in the triangular grid and in a family of related tori
  Dominique Désérable
  Lecture Notes in Computer Science 1300, 1997, pp. 218-225
• Finding a pair on a mesh with multiple broadcasting is hard
  Peter Damaschke
  Lecture Notes in Computer Science 1300, 1997, pp. 266-271
• Routing on the PADAM: Degrees of optimality
  Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
  Lecture Notes in Computer Science 1300, 1997, pp. 272-279
• Handling memory cache policy with integer points countings
  Philippe Clauss
  Lecture Notes in Computer Science 1300, 1997, pp. 285-293
• Runtime interprocedural data placement optimisation for lazy parallel libraries
  Olav Beckman, Paul H.J. Kelly
  Lecture Notes in Computer Science 1300, 1997, pp. 306-309