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

• A note on uniform circuit lower bounds for the counting hierarchy
  Eric Allender
  Lecture Notes in Computer Science 1090, 1996, pp. 127-135
• Finding large planar subgraphs and large subgraphs of a given genus
  Gruia Călinescu, Cristina G. Fernandes
  Lecture Notes in Computer Science 1090, 1996, pp. 152-161
• Reduction algorithms for constructing solutions in graphs with small treewidth
  Hans L. Bodlaender, Babette de Fluiter
  Lecture Notes in Computer Science 1090, 1996, pp. 199-208
• A note on the self-witnessing property of computational problems
  V. Arvind
  Lecture Notes in Computer Science 1090, 1996, pp. 241-249
• Approximating minimum keys and optimal substructure screens
  Tatsuya Akutsu, Feng Bao
  Lecture Notes in Computer Science 1090, 1996, pp. 290-299
• Reductions and convergence rates of average time
  Jay Belanger, Jie Wang
  Lecture Notes in Computer Science 1090, 1996, pp. 300-309
• Improved non-approximability results for vertex cover with density constraints
  Andrea E.F. Clementi, Luca Trevisan
  Lecture Notes in Computer Science 1090, 1996, pp. 333-342
• Weight biased leftist trees and modified skip lists
  Seonghun Cho, Sartaj Sahni
  Lecture Notes in Computer Science 1090, 1996, pp. 361-370
• Colourful linear programming
  Imre Bárány, Shmuel Onn
  Lecture Notes in Computer Science 1084, 1996, pp. 1-15
• Algorithms and extended formulations for one and two facility network design
  Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry
  Lecture Notes in Computer Science 1084, 1996, pp. 44-57
• Integer multicommodity flow problems
  Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance
  Lecture Notes in Computer Science 1084, 1996, pp. 58-71
• A heuristic algorithm for the set covering problem
  Alberto Caprara, Matteo Fischetti, Paolo Toth
  Lecture Notes in Computer Science 1084, 1996, pp. 72-84
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
  Rainer E. Burkard, Eranda Çela, Günther Rote, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1084, 1996, pp. 204-218
• On optimizing multiplications of sparse matrices
  Edith Cohen
  Lecture Notes in Computer Science 1084, 1996, pp. 219-233
• Continuous relaxations for constrained maximum-entropy sampling
  Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
  Lecture Notes in Computer Science 1084, 1996, pp. 234-248
• On dependent randomized rounding algorithms
  Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
  Lecture Notes in Computer Science 1084, 1996, pp. 330-344
• Coloring bipartite hypergraphs
  Hui Chen, Alan Frieze
  Lecture Notes in Computer Science 1084, 1996, pp. 345-358
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
  Robert Carr
  Lecture Notes in Computer Science 1084, 1996, pp. 460-474
• The Travelling Salesman and the PQ-tree
  Rainer E. Burkard, Vladimir G. Deĭneko, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1084, 1996, pp. 490-504
• A faster algorithm for approximate string matching
  Ricardo Baeza-Yates, Gonzalo Navarro
  Lecture Notes in Computer Science 1075, 1996, pp. 1-23
• Approximate dictionary queries
  Gerth Stlting Brodal, Leszek Ga̧sieniec
  Lecture Notes in Computer Science 1075, 1996, pp. 65-74
• A 2\frac{2}{3}-approximation algorithm for the shortest superstring problem
  Chris Armen, Clifford Stein
  Lecture Notes in Computer Science 1075, 1996, pp. 87-101
• Suffix trees on words
  Arne Andersson, N. Jesper Larsson, Kurt Swanson
  Lecture Notes in Computer Science 1075, 1996, pp. 102-115
• The suffix tree of a tree and minimizing sequential transducers
  Dany Breslauer
  Lecture Notes in Computer Science 1075, 1996, pp. 116-129
• Fast sorting by reversal
  Piotr Berman, Sridhar Hannenhalli
  Lecture Notes in Computer Science 1075, 1996, pp. 168-185