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

• Routing and coloring for maximal number of trees
  Xujin Chen, Xiaodong Hu, Tianping Shuai
  Lecture Notes in Computer Science 3595, 2005, pp. 199-209
• String coding of trees with locality and heritability
  Saverio Caminiti, Rossella Petreschi
  Lecture Notes in Computer Science 3595, 2005, pp. 251-262
• On-line simultaneous maximization of the size and the weight for degradable intervals schedules
  Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
  Lecture Notes in Computer Science 3595, 2005, pp. 308-317
• Off-line algorithms for minimizing total flow time in broadcast scheduling
  Wun-Tat Chan, Francis Y.L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W.H. Wong
  Lecture Notes in Computer Science 3595, 2005, pp. 318-328
• Oblivious and adaptive strategies for the majority and plurality problems
  Fan Chung, Ron Graham, Jia Mao, Andrew Yao
  Lecture Notes in Computer Science 3595, 2005, pp. 329-338
• A note on zero error algorithms having oracle access to one NP query
  Jin-Yi Cai, Venkatesan T. Chakaravarthy
  Lecture Notes in Computer Science 3595, 2005, pp. 339-348
• Simple distributed algorithms for approximating minimum Steiner trees
  Parinya Chalermsook, Jittat Fakcharoenphol
  Lecture Notes in Computer Science 3595, 2005, pp. 380-389
• Radial coordinate assignment for level graphs
  Christian Bachmaier, Florian Fischer, Michael Forster
  Lecture Notes in Computer Science 3595, 2005, pp. 401-410
• A PTAS for a disc covering problem using width-bounded separators
  Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
  Lecture Notes in Computer Science 3595, 2005, pp. 490-503
• An upper bound on the number of rectangulations of a point set
  Eyal Ackerman, Gill Barequet, Ron Y. Pinter
  Lecture Notes in Computer Science 3595, 2005, pp. 554-559
• Error-set codes and related objects
  An Braeken, Ventzislav Nikov, Svetla Nikova
  Lecture Notes in Computer Science 3595, 2005, pp. 577-585
• On Walrasian price of CPU time
  Xiaotie Deng, Li-Sha Huang, Minming Li
  Lecture Notes in Computer Science 3595, 2005, pp. 586-595
• On-line algorithms for market equilibria
  Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas
  Lecture Notes in Computer Science 3595, 2005, pp. 596-607
• Improved algorithms for the K-maximum subarray problem for small K
  Sung E. Bae, Tadao Takaoka
  Lecture Notes in Computer Science 3595, 2005, pp. 621-631
• Server allocation algorithms for tiered systems
  Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Tarjan, Yunhong Zhou
  Lecture Notes in Computer Science 3595, 2005, pp. 632-643
• The reverse greedy algorithm for the metric k-median problem
  Marek Chrobak, Claire Kenyon, Neal E. Young
  Lecture Notes in Computer Science 3595, 2005, pp. 654-660
• Optimally balanced forward degree sequence
  Xiaomin Chen, Mario Szegedy, Lei Wang
  Lecture Notes in Computer Science 3595, 2005, pp. 680-689
• A tight analysis of the maximal matching heuristic
  Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
  Lecture Notes in Computer Science 3595, 2005, pp. 701-709
• On the power of lookahead in on-line vehicle routing problems
  Luca Allulli, Giorgio Ausiello, Luigi Laura
  Lecture Notes in Computer Science 3595, 2005, pp. 728-736
• On the recognition of probe graphs of some self-complementary classes of perfect graphs
  Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
  Lecture Notes in Computer Science 3595, 2005, pp. 808-817
• Complexity and approximation of satisfactory partition problems
  Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
  Lecture Notes in Computer Science 3595, 2005, pp. 829-838
• An O(2^{O(k)}n^3) FPT algorithm for the undirected feedback vertex set problem
  Frank Dehne, Michael Fellows, Michael A. Langston, Frances Rosamond, Kim Stevens
  Lecture Notes in Computer Science 3595, 2005, pp. 859-869
• Approximating the longest cycle problem on graphs with bounded degree
  Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
  Lecture Notes in Computer Science 3595, 2005, pp. 870-884
• Overlaps help: Improved bounds for group testing with interval queries
  Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
  Lecture Notes in Computer Science 3595, 2005, pp. 935-944
• A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm
  Zhixiang Chen, Bin Fu
  Lecture Notes in Computer Science 3595, 2005, pp. 955-964