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 YEAR=1999

• Multiple spinblock decisions
  Peter Damaschke
  Lecture Notes in Computer Science 1741, 1999, pp. 27-36
• Hardness of approximating independent domination in circle graphs
  Mirela Damian-Iordache, Sriram V. Pemmaraju
  Lecture Notes in Computer Science 1741, 1999, pp. 56-69
• Constant-factor approximation algorithms for domination problems on circle graphs
  Mirela Damian-Iordache, Sriram V. Pemmaraju
  Lecture Notes in Computer Science 1741, 1999, pp. 70-82
• Online routing in triangulations
  Prosenjit Bose, Pat Morin
  Lecture Notes in Computer Science 1741, 1999, pp. 113-122
• The query complexity of program checking by constant-depth circuits
  V. Arvind, K.V. Subrahmanyan, N.V. Vinodchandran
  Lecture Notes in Computer Science 1741, 1999, pp. 123-132
• Approximation algorithms in batch processing
  Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang
  Lecture Notes in Computer Science 1741, 1999, pp. 153-162
• LexBFS-ordering in asteroidal triple-free graphs
  Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko
  Lecture Notes in Computer Science 1741, 1999, pp. 163-172
• Survivable networks with bounded delay: The edge failure case
  Serafino Cicerone, Gabriele di Stefano, Dagmar Handke
  Lecture Notes in Computer Science 1741, 1999, pp. 205-214
• Energy-efficient initialization protocols for ad-hoc radio networks
  J.L. Bordim, J. Cui, T. Hayashi, K. Nakano, S. Olariu
  Lecture Notes in Computer Science 1741, 1999, pp. 215-224
• Upper bounds for MaxSat: Further improved
  Nikhil Bansal, Venkatesh Raman
  Lecture Notes in Computer Science 1741, 1999, pp. 247-258
• Station layouts in the presence of location constraints
  Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizank, David Peleg
  Lecture Notes in Computer Science 1741, 1999, pp. 269-278
• Performance comparison of linear sieve and cubic sieve algorithms for discrete logarithms over prime fields
  Abhijit Das, C.E. Veni Madhavan
  Lecture Notes in Computer Science 1741, 1999, pp. 295-306
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
  Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
  Lecture Notes in Computer Science 1741, 1999, pp. 317-326
• A faster algorithm for finding disjoint paths in grids
  Wun-Tat Chan, Francis Y.L. Chin, Hing-Fung Ting
  Lecture Notes in Computer Science 1741, 1999, pp. 393-402
• Output-sensitive algorithms for uniform partitions of points
  Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
  Lecture Notes in Computer Science 1741, 1999, pp. 403-414
• Convexifying monotone polygons
  Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
  Lecture Notes in Computer Science 1741, 1999, pp. 415-424
• Generalized maximum independent sets for trees in subquadratic time
  B.K. Bhattacharya, M.E. Houle
  Lecture Notes in Computer Science 1741, 1999, pp. 435-445
• Dynamic compressed hyperoctrees with application to the N-body problem
  Srinivas Aluru, Fatih E. Sevilgen
  Lecture Notes in Computer Science 1738, 1999, pp. 21-33
• Largest empty rectangle among a point set
  Jeet Chaudhuri, Subhas C. Nandy
  Lecture Notes in Computer Science 1738, 1999, pp. 34-46
• Product interval automata: A subclass of timed automata
  Deepak D'Souza, P.S. Thiagarajan
  Lecture Notes in Computer Science 1738, 1999, pp. 60-71
• Fast allocation and deallocation with an improved buddy system
  Erik D. Demaine, Ian J. Munro
  Lecture Notes in Computer Science 1738, 1999, pp. 84-96
• A top-down look at a secure message
  Martín Abadi, Cédric Fournet, Georges Gonthier
  Lecture Notes in Computer Science 1738, 1999, pp. 122-141
• Approximation algorithms for routing and call scheduling in all-optical chains and rings
  Luca Becchetti, Miriam di Ianni, Alberto Marchetti-Spaccamela
  Lecture Notes in Computer Science 1738, 1999, pp. 201-212
• Synthesizing distributed transition systems from global specifications
  Ilaria Castellani, Madhavan Mukund, P.S. Thiagarajan
  Lecture Notes in Computer Science 1738, 1999, pp. 219-231
• Implicit temporal query languages: Towards completeness
  Nicole Bidoit, Sandra de Amo
  Lecture Notes in Computer Science 1738, 1999, pp. 245-257