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

• Self-assembling rulers for approximating generalized Sierpinski carpets
  Steven M. Kautz, Brad Shutters
  Lecture Notes in Computer Science 6842, 2011, pp. 284-296
• Approximately uniform online checkpointing
  Lauri Ahlroth, Olli Pottonen, André Schumacher
  Lecture Notes in Computer Science 6842, 2011, pp. 297-306
• Bandwidth of convex bipartite graphs and related graphs
  Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno
  Lecture Notes in Computer Science 6842, 2011, pp. 307-318
• Algorithms for partition of some class of graphs under compaction
  Narayan Vikas
  Lecture Notes in Computer Science 6842, 2011, pp. 319-330
• A generic approach to decomposition algorithms, with an application to digraph decomposition
  Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
  Lecture Notes in Computer Science 6842, 2011, pp. 331-342
• Matching and P_2-packing: Weighted versions
  Qilong Feng, Jianxin Wang, Jianer Chen
  Lecture Notes in Computer Science 6842, 2011, pp. 343-353
• On totally unimodularity of edge-edge adjacency matrices
  Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
  Lecture Notes in Computer Science 6842, 2011, pp. 354-365
• The topology aware file distribution problem
  Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 6842, 2011, pp. 366-378
• Exploiting the robustness on power-law networks
  Yilin Shen, Nam P. Nguyen, My T. Thai
  Lecture Notes in Computer Science 6842, 2011, pp. 379-390
• Competitive algorithms for online pricing
  Yong Zhang, Francis Y.L. Chin, Hing-Fung Ting
  Lecture Notes in Computer Science 6842, 2011, pp. 391-401
• Making abstraction-refinement efficient in model checking
  Cong Tian, Zhenhua Duan
  Lecture Notes in Computer Science 6842, 2011, pp. 402-413
• An integer programming approach for the Rural Postman Problem with Time Dependent Travel Times
  Guozhen Tan, Jinghao Sun
  Lecture Notes in Computer Science 6842, 2011, pp. 414-431
• Property testing for cyclic groups and beyond
  François Le Gall, Yuichi Yoshida
  Lecture Notes in Computer Science 6842, 2011, pp. 432-443
• Canonizing hypergraphs under Abelian group action
  V. Arvind, Johannes Köbler
  Lecture Notes in Computer Science 6842, 2011, pp. 444-455
• Linear time algorithms for the basis of Abelian groups
  Gregory Karagiorgos, Dimitrios Poulakis
  Lecture Notes in Computer Science 6842, 2011, pp. 456-466
• Characterizations of locally testable linear- and affine-invariant families
  Angsheng Li, Yicheng Pan
  Lecture Notes in Computer Science 6842, 2011, pp. 467-478
• A new conditionally anonymous ring signature
  Shengke Zeng, Shaoquan Jiang, Zhiguang Qin
  Lecture Notes in Computer Science 6842, 2011, pp. 479-491
• On the right-seed array of a string
  Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
  Lecture Notes in Computer Science 6842, 2011, pp. 492-502
• Compressed directed acyclic word graph with application in local alignment
  Do Huy Hoang, Sung Wing Kin
  Lecture Notes in Computer Science 6842, 2011, pp. 503-518
• Unavoidable regularities in long words with bounded number of symbol occurrences
  Juha Kortelainen, Tuomas Kortelainen, Ari Vesanen
  Lecture Notes in Computer Science 6842, 2011, pp. 519-530
• Summing symbols in mutual recurrences
  Berkeley R. Churchill, Edmund A. Lamagna
  Lecture Notes in Computer Science 6842, 2011, pp. 531-542
• Flipping triangles and rectangles
  Minghui Jiang
  Lecture Notes in Computer Science 6842, 2011, pp. 543-554
• Unconstrained and constrained fault-tolerant resource allocation
  Kewen Liao, Hong Shen
  Lecture Notes in Computer Science 6842, 2011, pp. 555-566
• Finding paths with minimum shared edges
  Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
  Lecture Notes in Computer Science 6842, 2011, pp. 567-578
• Combinatorial group testing for corruption localizing hashing
  Annalisa De Bonis, Giovanni Di Crescenzo
  Lecture Notes in Computer Science 6842, 2011, pp. 579-591