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 [2]	Hilfe

Suche: Series=LNCS AND Volume=1741

• Upper bounds for MaxSat: Further improved
  Nikhil Bansal, Venkatesh Raman
  Lecture Notes in Computer Science 1741, 1999, pp. 247-258
• A linear time algorithm for recognizing regular Boolean functions
  Kazuhisa Makino
  Lecture Notes in Computer Science 1741, 1999, pp. 259-268
• 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
• Reverse center location problem
  Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
  Lecture Notes in Computer Science 1741, 1999, pp. 279-294
• 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
• External memory algorithms for outerplanar graphs
  Anil Maheshwari, Norbert Zeh
  Lecture Notes in Computer Science 1741, 1999, pp. 307-316
• 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
• Approximation algorithms for channel assignment with constraints
  Jeannette Janssen, Lata Narayanan
  Lecture Notes in Computer Science 1741, 1999, pp. 327-336
• Algorithms for finding noncrossing Steiner forests in plane graphs
  Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
  Lecture Notes in Computer Science 1741, 1999, pp. 337-346
• A linear algorithm for finding total colorings of partial k-trees
  Shuji Isobe, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 1741, 1999, pp. 347-356
• Topology-oriented approach to robust geometric computation
  Kokichi Sugihara
  Lecture Notes in Computer Science 1741, 1999, pp. 357-366
• Approximating multicast congestion
  Santosh Vempala, Berthold Vöcking
  Lecture Notes in Computer Science 1741, 1999, pp. 367-372
• Approximating the minimum k-way cut in a graph via minimum 3-way cuts
  Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 1741, 1999, pp. 373-382
• Online scheduling of parallel communications with individual deadlines
  Jae-Ha Lee, Kyung-Yong Chwa
  Lecture Notes in Computer Science 1741, 1999, pp. 383-392
• 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
• Bisecting two subsets in 3-connected graphs
  Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
  Lecture Notes in Computer Science 1741, 1999, pp. 425-434
• 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