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

• Bit-vector encoding for partially ordered sets
  Michel Habib, Lhouari Nourine
  Lecture Notes in Computer Science 831, 1994, pp. 1-12
• Intervals and orders: What comes after interval orders?
  Kenneth P. Bogart
  Lecture Notes in Computer Science 831, 1994, pp. 13-32
• Dimensions and algorithms
  J. Spinrad
  Lecture Notes in Computer Science 831, 1994, pp. 33-52
• Upward drawings to fit surfaces
  S. Mehdi Hashemi, Ivan Rival
  Lecture Notes in Computer Science 831, 1994, pp. 53-58
• A cleanup on transitive orientation
  Klaus Simon, Paul Trunz
  Lecture Notes in Computer Science 831, 1994, pp. 59-85
• A characterization of graphs with vertex cover up to five
  Kevin Cattel, Michael J. Dinneen
  Lecture Notes in Computer Science 831, 1994, pp. 86-99
• Testing hereditary properties efficiently on average
  Jens Gustedt, Angelika Steger
  Lecture Notes in Computer Science 831, 1994, pp. 100-116
• Orders, k-sets and fast halfplane search on paged memory
  Paolo G. Franciosa, Maurizio Talamo
  Lecture Notes in Computer Science 831, 1994, pp. 117-127
• Triangle graphs and their coloring
  Yaw-Ling Lin
  Lecture Notes in Computer Science 831, 1994, pp. 128-142
• Representation of an order as union of interval orders
  Christian Capelle
  Lecture Notes in Computer Science 831, 1994, pp. 143-161
• Minimal representation of semiorders with intervals of same length
  Jutta Mitas
  Lecture Notes in Computer Science 831, 1994, pp. 162-175
• The computation of the jump number of convex graphs
  Elias Dahlhaus
  Lecture Notes in Computer Science 831, 1994, pp. 176-185
• Fast lattice browsing on sparse representation
  Maurizio Talamo, Paola Vocca
  Lecture Notes in Computer Science 831, 1994, pp. 186-204