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	Hilfe

Suche: Series=LNCS AND Volume=1335

• Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems
  David P. Williamson
  Lecture Notes in Computer Science 1335, 1997, pp. 1-1
• 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-line algorithms for networks of temporal constraints
  Fabrizio d'Amore, Fabio Iacobini
  Lecture Notes in Computer Science 1335, 1997, pp. 144-156
• Parallel algorithms for treewidth two
  Babette de Fluiter, Hans L. Bodlaender
  Lecture Notes in Computer Science 1335, 1997, pp. 157-170
• 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
• Off-line and on-line call-scheduling in stars and trees
  Thomas Erlebach, Klaus Jansen
  Lecture Notes in Computer Science 1335, 1997, pp. 199-213
• Computational complexity of the Krausz dimension of graphs
  Petr Hlinȇný, Jan Kratochvíl
  Lecture Notes in Computer Science 1335, 1997, pp. 214-228
• Asteroidal sets in graphs
  Ton Kloks, Dieter Kratsch, Haiko Müller
  Lecture Notes in Computer Science 1335, 1997, pp. 229-241
• Complexity of colored graph covers I. Colored directed multigraphs
  Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
  Lecture Notes in Computer Science 1335, 1997, pp. 242-257
• A syntactic approach to random walks on graphs
  M. Mosbah, N. Saheb
  Lecture Notes in Computer Science 1335, 1997, pp. 258-272
• Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs
  Erich Prisner
  Lecture Notes in Computer Science 1335, 1997, pp. 273-287
• Large networks with small diameter
  Michael Sampels
  Lecture Notes in Computer Science 1335, 1997, pp. 288-302
• The bounded tree-width problem of context-free graph languages
  K. Skodinis
  Lecture Notes in Computer Science 1335, 1997, pp. 303-317