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

• Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
  Koichi Wada, Akinari Takaki, Kimio Kawaguchi
  Lecture Notes in Computer Science 903, 1995, pp. 319-330
• Fugitive-search games on graphs and related parameters
  Nick D. Dendris, Lefteris M. Kirousis, Dimitris M. Thilikos
  Lecture Notes in Computer Science 903, 1995, pp. 331-342
• New approximation results on graph matching and related problems
  Yoji Kajitani, Jun Dong Cho, Majid Sarrafzadeh
  Lecture Notes in Computer Science 903, 1995, pp. 343-358
• New lower bounds and hierarchy results for restricted branching programs
  Detlef Sieling, Ingo Wegener
  Lecture Notes in Computer Science 903, 1995, pp. 359-370
• On-line algorithms for satisfiability problems with uncertainty
  Roberto Giaccio
  Lecture Notes in Computer Science 903, 1995, pp. 371-386
• NC algorithms for antidirected Hamiltonian paths and cycles in tournaments
  E. Bampis, Y. Manoussakis, I. Milis
  Lecture Notes in Computer Science 903, 1995, pp. 387-394
• Directed path graph isomorphism
  Luitpold Babel, Ilia Ponomarenko, Gottfried Tinhofer
  Lecture Notes in Computer Science 903, 1995, pp. 395-406