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=657

• On improved time bounds for permutation graph problems
  Andreas Brandstädt
  Lecture Notes in Computer Science 657, 1993, pp. 1-10
• A simple test for interval graphs
  Wen-Lian Hsu
  Lecture Notes in Computer Science 657, 1993, pp. 11-16
• Tolerance graphs and orders
  Stefan Felsner
  Lecture Notes in Computer Science 657, 1993, pp. 17-26
• On scheduling problems restricted to interval orders
  Klaus Jansen
  Lecture Notes in Computer Science 657, 1993, pp. 27-36
• Scheduling with incompatible jobs
  Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
  Lecture Notes in Computer Science 657, 1993, pp. 37-49
• Generalized coloring for tree-like graphs
  Klaus Jansen, Petra Scheffler
  Lecture Notes in Computer Science 657, 1993, pp. 50-59
• Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes
  Elias Dahlhaus
  Lecture Notes in Computer Science 657, 1993, pp. 60-69
• Topology of parallel networks and computational complexity
  Juraj Hromkovic̑
  Lecture Notes in Computer Science 657, 1993, pp. 70-77
• Parallel triangulation of nonconvex polytopes
  W. Preilowski
  Lecture Notes in Computer Science 657, 1993, pp. 78-89
• Kayles on special classes of graphs - An application of Sprague-Grundy theory
  Hans L. Bodlaender
  Lecture Notes in Computer Science 657, 1993, pp. 90-102
• A linear time algorithm for isomorphism of graphs of bounded average genus
  Jianer Chen
  Lecture Notes in Computer Science 657, 1993, pp. 103-113
• Improved algorithms for routing on two-dimensional grids
  Dinesh Bhatia, Tom Leighton, Fillia Makedon, Carolyn H. Norton
  Lecture Notes in Computer Science 657, 1993, pp. 114-122
• Minimum rectilinear Steiner trees for intervals on two parallel lines
  Edmund Ihler
  Lecture Notes in Computer Science 657, 1993, pp. 123-134
• A new characterization of tree medians with applications to distributed algorithms
  O. Gerstel, S. Zaks
  Lecture Notes in Computer Science 657, 1993, pp. 135-144
• The 3-edge components and a structured description of all 3-edge-cuts in a graph
  Efim Dinitz
  Lecture Notes in Computer Science 657, 1993, pp. 145-157
• On assembly of 4-connected graphs
  Jianer Chen, Arkady Kanevsky
  Lecture Notes in Computer Science 657, 1993, pp. 158-169
• On the homogeneous decomposition of graphs
  Beverly Jamison, Stephan Olariu
  Lecture Notes in Computer Science 657, 1993, pp. 170-183
• Embeddings in recursive combinatorial networks
  Sajal K. Das, Aisheng Mao
  Lecture Notes in Computer Science 657, 1993, pp. 184-204
• On shortcutting digraphs
  Mikkel Thorup
  Lecture Notes in Computer Science 657, 1993, pp. 205-211
• An efficient algorithm to recognize prime undirected graphs
  Alain Cournier, Michel Habib
  Lecture Notes in Computer Science 657, 1993, pp. 212-224
• On the complexity of partial order properties
  Stefan Felsner, Dorothea Wagner
  Lecture Notes in Computer Science 657, 1993, pp. 225-235
• Probabilistic graph grammars
  Mohamed Mosbah
  Lecture Notes in Computer Science 657, 1993, pp. 236-247
• Single vs.\ double pushout derivations of graphs
  Francesco Parisi-Presicce
  Lecture Notes in Computer Science 657, 1993, pp. 248-262
• Hexagonal grid drawings
  Goos Kant
  Lecture Notes in Computer Science 657, 1993, pp. 263-276
• Graph algorithms = iteration + data structures? The structure of graph algorithms and a corresponding style of programming
  Martin Erwig
  Lecture Notes in Computer Science 657, 1993, pp. 277-292