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

• From balls and bins to points and vertices
  Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes
  Lecture Notes in Computer Science 3827, 2005, pp. 757-766
• Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
  Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-Yi Cai
  Lecture Notes in Computer Science 3827, 2005, pp. 767-776
• Upper bounds on the computational power of an optical model of computation
  Damien Woods
  Lecture Notes in Computer Science 3827, 2005, pp. 777-788
• Complexity of the min-max (regret) versions of cut problems
  Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
  Lecture Notes in Computer Science 3827, 2005, pp. 789-798
• Improved algorithms for the k maximum-sums problems
  Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
  Lecture Notes in Computer Science 3827, 2005, pp. 799-808
• Network load games
  Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
  Lecture Notes in Computer Science 3827, 2005, pp. 809-818
• Minimum entropy coloring
  Jean Cardinal, Samuel Fiorini, Gwenaël Joret
  Lecture Notes in Computer Science 3827, 2005, pp. 819-828
• Algorithms for max Hamming exact satisfiability
  Vilhelm Dahllöf
  Lecture Notes in Computer Science 3827, 2005, pp. 829-838
• Counting stable strategies in random evolutionary games
  Spyros Kontogiannis, Paul Spirakis
  Lecture Notes in Computer Science 3827, 2005, pp. 839-848
• Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles
  Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel Smid
  Lecture Notes in Computer Science 3827, 2005, pp. 849-858
• On the computation of colored domino tilings of simple and non-simple orthogonal polygons
  Chris Worman, Boting Yang
  Lecture Notes in Computer Science 3827, 2005, pp. 859-868
• Optimal paths for mutually visible agents
  Joel Fenwick, V. Estivill-Castro
  Lecture Notes in Computer Science 3827, 2005, pp. 869-881
• Stacking and bundling two convex polygons
  Hee-Kap Ahn, Otfried Cheong
  Lecture Notes in Computer Science 3827, 2005, pp. 882-891
• Algorithms for range-aggregate query problems involving geometric aggregation operations
  Prosenjit Gupta
  Lecture Notes in Computer Science 3827, 2005, pp. 892-901
• A (2-c \frac{1}{\sqrt N})-approximation algorithm for the stable marriage problem
  Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi
  Lecture Notes in Computer Science 3827, 2005, pp. 902-914
• Approximating the traffic grooming problem
  Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
  Lecture Notes in Computer Science 3827, 2005, pp. 915-924
• Scheduling to minimize makespan with time-dependent processing times
  L.Y. Kang, T.C.E. Cheng, C.T. Ng, M. Zhao
  Lecture Notes in Computer Science 3827, 2005, pp. 925-933
• On complexity and approximability of the labeled maximum/perfect matching problems
  Jérôme Monnot
  Lecture Notes in Computer Science 3827, 2005, pp. 934-943
• Finding a weight-constrained maximum-density subtree in a tree
  Sun-Yuan Hsieh, Ting-Yu Chou
  Lecture Notes in Computer Science 3827, 2005, pp. 944-953
• Finding two disjoint paths in a network with normalized \alpha^+-MIN-SUM objective function
  Bing Yang, S.Q. Zheng, Enyue Lu
  Lecture Notes in Computer Science 3827, 2005, pp. 954-963
• Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time
  Seth Pettie
  Lecture Notes in Computer Science 3827, 2005, pp. 964-973
• Approximation algorithms for layered multicast scheduling
  Qingbo Cai, Vincenzo Liberatore
  Lecture Notes in Computer Science 3827, 2005, pp. 974-983
• Minimum weight triangulation by cutting out triangles
  Magdalene Grantson, Christian Borgelt, Christos Levcopoulos
  Lecture Notes in Computer Science 3827, 2005, pp. 984-994
• Multi-directional width-bounded geometric separator and protein folding
  Bin Fu, Sorinel A. Oprisan, Lizhe Xu
  Lecture Notes in Computer Science 3827, 2005, pp. 995-1006
• Shortest paths and Voronoi diagrams with transportation networks under general distances
  Sang Won Bae, Kyung-Yong Chwa
  Lecture Notes in Computer Science 3827, 2005, pp. 1007-1018