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

• Segmental mapping and distance for rooted labeled ordered trees
  Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata
  Lecture Notes in Computer Science 7676, 2012, pp. 485-494
• Detecting induced minors in AT-free graphs
  Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
  Lecture Notes in Computer Science 7676, 2012, pp. 495-505
• Degree-constrained orientations of embedded graphs
  Yann Disser, Jannik Matuschke
  Lecture Notes in Computer Science 7676, 2012, pp. 506-516
• Interval graph representation with given interval and intersection lengths
  Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe
  Lecture Notes in Computer Science 7676, 2012, pp. 517-526
• Finger search in the implicit model
  Gerth Stlting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
  Lecture Notes in Computer Science 7676, 2012, pp. 527-536
• A framework for succinct labeled ordinal trees over large alphabets
  Meng He, J. Ian Munro, Gelin Zhou
  Lecture Notes in Computer Science 7676, 2012, pp. 537-547
• A space-efficient framework for dynamic point location
  Meng He, Patrick K. Nicholson, Norbert Zeh
  Lecture Notes in Computer Science 7676, 2012, pp. 548-557
• Selection in the presence of memory faults, with applications to in-place resilient sorting
  Tsvi Kopelowitz, Nimrod Talmon
  Lecture Notes in Computer Science 7676, 2012, pp. 558-567
• An improved algorithm for static 3D dominance reporting in the pointer machine
  Christos Makris, Konstantinos Tsakalidis
  Lecture Notes in Computer Science 7676, 2012, pp. 568-577
• The multi-service center problem
  Hung-I Yu, Cheng-Chung Li
  Lecture Notes in Computer Science 7676, 2012, pp. 578-587
• Computing minmax regret 1-median on a tree network with positive/negative vertex weights
  Binay Bhattacharya, Tsunehiko Kameda, Zhao Song
  Lecture Notes in Computer Science 7676, 2012, pp. 588-597
• Fence patrolling by mobile agents with distinct speeds
  Akitoshi Kawamura, Yusuke Kobayashi
  Lecture Notes in Computer Science 7676, 2012, pp. 598-608
• Weak visibility queries of line segments in simple polygons
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 7676, 2012, pp. 609-618
• Beyond homothetic polygons: Recognition and maximum clique
  Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Paweƚ Rza̧żewski
  Lecture Notes in Computer Science 7676, 2012, pp. 619-628
• Area bounds of rectilinear polygons realized by angle sequences
  Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
  Lecture Notes in Computer Science 7676, 2012, pp. 629-638
• A time-efficient output-sensitive quantum algorithm for Boolean matrix multiplication
  François Le Gall
  Lecture Notes in Computer Science 7676, 2012, pp. 639-648
• On almost disjunct matrices for group testing
  Arya Mazumdar
  Lecture Notes in Computer Science 7676, 2012, pp. 649-658
• Parameterized clique on scale-free networks
  Tobias Friedrich, Anton Krohmer
  Lecture Notes in Computer Science 7676, 2012, pp. 659-668
• Multi-unit auctions with budgets and non-uniform valuations
  H.F. Ting, Xiangzhong Xiang
  Lecture Notes in Computer Science 7676, 2012, pp. 669-678
• Efficient computation of power indices for weighted majority games
  Takeaki Uno
  Lecture Notes in Computer Science 7676, 2012, pp. 679-689
• Revenue maximization in a Bayesian double auction market
  Xiaotie Deng, Paul Goldberg, Bo Tang, Jinshan Zhang
  Lecture Notes in Computer Science 7676, 2012, pp. 690-699