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

• When can you fold a map?
  Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S.B. Mitchell, Saurabh Sethia, Steven S. Skiena
  Lecture Notes in Computer Science 2125, 2001, pp. 401-413
• Search trees with relaxed balance and near-optimal height
  Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen
  Lecture Notes in Computer Science 2125, 2001, pp. 414-425
• Optimal algorithms for two-guard walkability of simple polygons
  Binay Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
  Lecture Notes in Computer Science 2125, 2001, pp. 438-449
• Small maximal independent sets and faster exact graph coloring
  David Eppstein
  Lecture Notes in Computer Science 2125, 2001, pp. 462-470
• On external-memory planar depth first search
  Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
  Lecture Notes in Computer Science 2125, 2001, pp. 471-482
• Complete problems for Valiant's class of qp-computable families of polynomials
  Markus Bläser
  Lecture Notes in Computer Science 2108, 2001, pp. 1-10
• Parallelizability of some P-complete geometric problems in the EREW-PRAM
  Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara
  Lecture Notes in Computer Science 2108, 2001, pp. 59-63
• Towards compatible triangulations
  Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
  Lecture Notes in Computer Science 2108, 2001, pp. 101-110
• An improved upper bound on the size of planar convex-hulls
  Abdullah N. Arslan, Ömer Eğecioğlu
  Lecture Notes in Computer Science 2108, 2001, pp. 111-120
• On the planar two-watchtower problem
  Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu
  Lecture Notes in Computer Science 2108, 2001, pp. 121-130
• Packing two disks into a polygonal environment
  Prosenjit Bose, Pat Morin, Antoine Vigneron
  Lecture Notes in Computer Science 2108, 2001, pp. 142-149
• Maximum red/blue interval matching with applications
  Danny Z. Chen, Xiaobo (Sharon) Hu, Xiaodong Wu
  Lecture Notes in Computer Science 2108, 2001, pp. 150-158
• Computing farthest neighbors on a convex polytope
  Otfried Cheong, Chan-Su Shin, Antoine Vigneron
  Lecture Notes in Computer Science 2108, 2001, pp. 159-169
• Polynomial time algorithms for three-label point labeling
  Rob Duncan, Jianbo Qian, Binhai Zhu
  Lecture Notes in Computer Science 2108, 2001, pp. 191-200
• Optimizing a computational method for length lower bounds for reflecting sequences
  H.K. Dai
  Lecture Notes in Computer Science 2108, 2001, pp. 228-236
• Competitive facility location along a highway
  Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai Golin, René van Oostrum
  Lecture Notes in Computer Science 2108, 2001, pp. 237-246
• Membership for core of LP games and other games
  Qizhi Fang, Shanfeng Zhu, Maocheng Cai, Xiaotie Deng
  Lecture Notes in Computer Science 2108, 2001, pp. 247-256
• Strong solutions to the identification problem
  Pino Caballero-Gil, Candelaria Hernández-Goya
  Lecture Notes in Computer Science 2108, 2001, pp. 257-261
• Counting H-colorings of partial k-trees
  Josep Díaz, Maria Serna, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2108, 2001, pp. 298-307
• A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph
  L. Sunil Chandran
  Lecture Notes in Computer Science 2108, 2001, pp. 308-317
• Graph separators: A parameterized view
  Jochen Alber, Henning Fernau, Rolf Niedermeier
  Lecture Notes in Computer Science 2108, 2001, pp. 318-327
• Layered drawings of graphs with crossing constraints
  Irene Finocchi
  Lecture Notes in Computer Science 2108, 2001, pp. 357-367
• On the validity of hierarchical decompositions
  Irene Finocchi, Rossella Petreschi
  Lecture Notes in Computer Science 2108, 2001, pp. 368-374
• Edge connectivity vs. vertex connectivity in chordal graphs
  L. Sunil Chandran
  Lecture Notes in Computer Science 2108, 2001, pp. 384-389
• A notion of cross-perfect bipartite graphs
  Milind Dawande
  Lecture Notes in Computer Science 2108, 2001, pp. 409-413