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

• The I/O-complexity of ordered binary-decision diagram manipulation
  Lars Arge
  Lecture Notes in Computer Science 1004, 1995, pp. 82-91
• Finding dense subgraphs
  Yuichi Asahiro, Kazuo Iwama
  Lecture Notes in Computer Science 1004, 1995, pp. 102-111
• Weighted domination on cocomparability graphs
  Maw-Shang Chang
  Lecture Notes in Computer Science 1004, 1995, pp. 122-131
• The parallel complexity of approximatiing the high degree subgraph problem
  A.E. Andreev, A. Clementi, P. Crescenzi, E. Dahlhaus, S. de Agostino, J.D.P. Rolim
  Lecture Notes in Computer Science 1004, 1995, pp. 132-141
• Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
  Vineet Bafna, Piotr Berman, Toshihiro Fujito
  Lecture Notes in Computer Science 1004, 1995, pp. 142-151
• Linear-time in-place selection in less than 3n comparisons
  Svante Carlsson, Mikael Sundström
  Lecture Notes in Computer Science 1004, 1995, pp. 244-253
• Heap construction: Optimal in both worst and average cases?
  Svante Carlsson, Jingsen Chen
  Lecture Notes in Computer Science 1004, 1995, pp. 254-263
• A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets
  Siu-Wing Cheng, Chi-Keung Tang
  Lecture Notes in Computer Science 1004, 1995, pp. 322-331
• Spanning closed trail and Hamiltonian cycle in grid graphs
  Hwan-Gue Cho, Alexander Zelikovsky
  Lecture Notes in Computer Science 1004, 1995, pp. 342-351
• Illumination with orthogonal floodlights
  James Abello, Vladimir Estivill-Castro, Thomas Shermer, Jorge Urrutia
  Lecture Notes in Computer Science 1004, 1995, pp. 362-371
• No quadrangulation is extremely odd
  Prosenjit Bose, Godfried Toussaint
  Lecture Notes in Computer Science 1004, 1995, pp. 372-381
• Finding the medial axis of a simple polygon in linear time
  Francis Chin, Jack Snoeyink, Cao An Wang
  Lecture Notes in Computer Science 1004, 1995, pp. 382-391
• Matching nuts and bolts faster
  Phillip G. Bradford, Rudolf Fleischer
  Lecture Notes in Computer Science 1004, 1995, pp. 402-408
• NC-Algorithms for partitioning sparse graphs into induced forests with an application
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 1004, 1995, pp. 428-437
• A quantum jump in computer science
  Gilles Brassard
  Lecture Notes in Computer Science 1000, 1995, pp. 1-14
• Templates for linear algebra problems
  Zhaojun Bai, David Day, James Demmel, Jack Dongarra, Ming Gu, Axel Ruhe, Henk van der Vorst
  Lecture Notes in Computer Science 1000, 1995, pp. 115-140
• The ART behind IDEAS
  Thomas Beth, Andreas Klappenecker, Torsten Minkwitz, Armin Nückel
  Lecture Notes in Computer Science 1000, 1995, pp. 141-158
• Algorithmic number theory and its relationship to computational complexity
  Leonard M. Adleman
  Lecture Notes in Computer Science 1000, 1995, pp. 159-171
• Differential BBDs
  Anuchit Anuchitanukul, Zohar Manna, Tomás E. Uribe
  Lecture Notes in Computer Science 1000, 1995, pp. 218-233
• Algorithmic techniques for geometric optimization
  Pankaj K. Agarwal, Micha Sharir
  Lecture Notes in Computer Science 1000, 1995, pp. 234-253
• Mathematical system models as a basis of software engineering
  Manfred Broy
  Lecture Notes in Computer Science 1000, 1995, pp. 292-306
• Abstracting unification: A key step in the design of logic program analyses
  Maurice Bruynooghe, Michael Codish, Anne Mulkers
  Lecture Notes in Computer Science 1000, 1995, pp. 406-425
• Programming Satan's computer
  Ross Anderson, Roger Needham
  Lecture Notes in Computer Science 1000, 1995, pp. 426-440
• Symmetry and induction in model checking
  E.M. Clarke, S. Jha
  Lecture Notes in Computer Science 1000, 1995, pp. 455-470
• Multimedia authoring tools: State of the art and research challenges
  Dick C.A. Bulterman, Lynda Hardman
  Lecture Notes in Computer Science 1000, 1995, pp. 575-591