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

• Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality
  N.W. Holloway, S. Ravindran, A.M. Gibbons
  Lecture Notes in Computer Science 790, 1993, pp. 11-20
• On reduction algorithms for graphs with small treewidth
  Hans Bodlaender
  Lecture Notes in Computer Science 790, 1993, pp. 45-56
• Algorithms and complexity of sandwich problems in graphs
  Martin Charles Golumbic, Haim Kaplan, Ron Shamir
  Lecture Notes in Computer Science 790, 1993, pp. 57-69
• Average case analysis of fully dynamic connectivity for directed graphs
  Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer
  Lecture Notes in Computer Science 790, 1993, pp. 87-98
• Fully dynamic maintenance of vertex cover
  Zoran Iković, Errol L. Lloyd
  Lecture Notes in Computer Science 790, 1993, pp. 99-111
• Dynamic algorithms for graphs with treewidth 2
  Hans L. Bodlaender
  Lecture Notes in Computer Science 790, 1993, pp. 112-124
• Short disjoint cycles in graphs with degree constraints
  Andreas Brandstädt, Heinz-Jürgen Voss
  Lecture Notes in Computer Science 790, 1993, pp. 125-131
• Graphs, hypergraphs and hashing
  George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
  Lecture Notes in Computer Science 790, 1993, pp. 153-165
• Coloring k-colorable graphs in constant expected parallel time
  Ludȇk Kuc̑era
  Lecture Notes in Computer Science 790, 1993, pp. 166-176
• A rainbow about T-colorings for complete graphs
  Klaus Jansen
  Lecture Notes in Computer Science 790, 1993, pp. 189-199
• Asteroidal triple-free graphs
  Derek G. Corneil, Stephan Olariu, Lorna Stewart
  Lecture Notes in Computer Science 790, 1993, pp. 211-224
• The parallel complexity of elimination ordering procedures
  Elias Dahlhaus
  Lecture Notes in Computer Science 790, 1993, pp. 225-236
• Dually chordal graphs
  Andreas Brandstädt, Feodor F. Dragan, Victor D. Chepoi, Vitaly I. Voloshin
  Lecture Notes in Computer Science 790, 1993, pp. 237-251
• Regular marked Petri nets
  Jörg Desel
  Lecture Notes in Computer Science 790, 1993, pp. 264-275
• The asynchronous committee meeting problem
  Javier Esparza, Bernhard von Stengel
  Lecture Notes in Computer Science 790, 1993, pp. 276-287
• Gossiping in vertex-disjoint paths mode in interconnection networks
  Juraj Hromkovic̑, Ralf Klasing, Elena A. Stöhr
  Lecture Notes in Computer Science 790, 1993, pp. 288-300
• Fast load balancing in Cayley graphs and in circuits
  Jacques E. Boillat
  Lecture Notes in Computer Science 790, 1993, pp. 315-326
• On multi-label linear interval routing schemes
  Evangelos Kranakis, Danny Krizanc, S.S. Ravi
  Lecture Notes in Computer Science 790, 1993, pp. 338-349
• An 'All Pairs Shortest Paths' distributed algorithm using 2n^2 messages
  S. Haldar
  Lecture Notes in Computer Science 790, 1993, pp. 350-363
• Graph ear decompositions and graph embeddings
  Jianer Chen, Saroja P. Kanchi
  Lecture Notes in Computer Science 790, 1993, pp. 376-387
• Two algorithms for finding rectangular duals of planar graphs
  Goos Kant, Xin He
  Lecture Notes in Computer Science 790, 1993, pp. 396-410
• A more compact visibility representation
  Goos Kant
  Lecture Notes in Computer Science 790, 1993, pp. 411-424
• Some observations about the nature of computer science
  Juris Hartmanis
  Lecture Notes in Computer Science 761, 1993, pp. 1-12
• Label-selective \lambda-calculus syntax and confluence
  Hassan Aït-Kaci, Jacques Garrigue
  Lecture Notes in Computer Science 761, 1993, pp. 24-40
• Conventional and uniqueness typing in graph rewrite systems
  Erik Barendsen, Sjaak Smetsers
  Lecture Notes in Computer Science 761, 1993, pp. 41-51