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 Volume=4288

• Stable matching problems
  Kazuo Iwama
  Lecture Notes in Computer Science 4288, 2006, pp. 1-1
• Delaunay meshing of surfaces
  Tamal K. Dey
  Lecture Notes in Computer Science 4288, 2006, pp. 2-2
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
  Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
  Lecture Notes in Computer Science 4288, 2006, pp. 3-15
• Branching and treewidth based exact algorithms
  Fedor V. Fomin, Serge Gaspers, Saket Saurabh
  Lecture Notes in Computer Science 4288, 2006, pp. 16-25
• Deterministic splitter finding in a stream with constant storage and guarantees
  Tobias Lenz
  Lecture Notes in Computer Science 4288, 2006, pp. 26-35
• Optimal algorithms for tower of Hanoi problems with relaxed placement rules
  Yefim Dinitz, Shay Solomon
  Lecture Notes in Computer Science 4288, 2006, pp. 36-47
• Flexible word design and graph labeling
  Ming-Yang Kao, Manan Sanghi, Robert Schweller
  Lecture Notes in Computer Science 4288, 2006, pp. 48-60
• Frequency allocation problems for linear cellular networks
  Joseph Wun-Tat Chan, Francis Y.L. Chin, Deshi Ye, Yong Zhang, Hong Zhu
  Lecture Notes in Computer Science 4288, 2006, pp. 61-70
• Finite-state online algorithms and their automated competitive analysis
  Takashi Horiyama, Kazuo Iwama, Jun Kawahara
  Lecture Notes in Computer Science 4288, 2006, pp. 71-80
• Offline sorting buffers on line
  Rohit Khandekar, Vinayaka Pandit
  Lecture Notes in Computer Science 4288, 2006, pp. 81-89
• Approximating tree edit distance through string edit distance
  Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu
  Lecture Notes in Computer Science 4288, 2006, pp. 90-99
• A 6-approximation algorithm for computing smallest common AoN-supertree with application to the reconstruction of Glycan trees
  Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
  Lecture Notes in Computer Science 4288, 2006, pp. 100-110
• Improved approximation for single-sink buy-at-bulk
  Fabrizio Grandoni, Giuseppe F. Italiano
  Lecture Notes in Computer Science 4288, 2006, pp. 111-120
• Approximability of partitioning graphs with supply and demand
  Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 4288, 2006, pp. 121-130
• Convex grid drawings of plane graphs with rectangular contours
  Akira Kamada, Kazuyuki Miura, Takao Nishizeki
  Lecture Notes in Computer Science 4288, 2006, pp. 131-140
• Algorithms on graphs with small dominating targets
  Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
  Lecture Notes in Computer Science 4288, 2006, pp. 141-152
• Efficient algorithms for weighted rank-maximal matchings and related problems
  Telikepalli Kavitha, Chintan D. Shah
  Lecture Notes in Computer Science 4288, 2006, pp. 153-162
• On estimating path aggregates over streaming graphs
  Sumit Ganguly, Barna Saha
  Lecture Notes in Computer Science 4288, 2006, pp. 163-172
• Diamond triangulations contain spanners of bounded degree
  Prosenjit Bose, Michiel Smid, Daming Xu
  Lecture Notes in Computer Science 4288, 2006, pp. 173-182
• Optimal construction of the city Voronoi diagram
  Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa
  Lecture Notes in Computer Science 4288, 2006, pp. 183-192
• Relations between two common types of rectangular tilings
  Yusu Wang
  Lecture Notes in Computer Science 4288, 2006, pp. 193-202
• Quality tetrahedral mesh generation for macromolecules
  Ho-Lun Cheng, Xinwei Shi
  Lecture Notes in Computer Science 4288, 2006, pp. 203-212
• On approximating the TSP with intersecting neighborhoods
  Khaled Elbassioni, Aleksei V. Fishkin, René Sitters
  Lecture Notes in Computer Science 4288, 2006, pp. 213-222
• Negation-limited complexity of parity and inverters
  Kazuo Iwama, Hiroki Morizumi, Jun Tarui
  Lecture Notes in Computer Science 4288, 2006, pp. 223-232
• The complexity of quasigroup isomorphism and the minimum generating set problem
  V. Arvind, Jacobo Torán
  Lecture Notes in Computer Science 4288, 2006, pp. 233-242