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

• Modeling and analyzing massive terrain data sets
  Pankaj K. Agarwal
  Lecture Notes in Computer Science 4835, 2007, pp. 1-1
• Coloring triangle-free graphs on surfaces
  Zdenȇk Dvoȓák, Daniel Král', Robin Thomas
  Lecture Notes in Computer Science 4835, 2007, pp. 2-4
• Integer representation and counting in the bit probe model
  M. Ziaur Rahman, J. Ian Munro
  Lecture Notes in Computer Science 4835, 2007, pp. 5-16
• Minimum degree orderings
  Hiroshi Nagamochi
  Lecture Notes in Computer Science 4835, 2007, pp. 17-28
• Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs
  Toshimasa Ishii
  Lecture Notes in Computer Science 4835, 2007, pp. 29-40
• Dynamic distance hereditary graphs using split decomposition
  Emeric Gioan, Christophe Paul
  Lecture Notes in Computer Science 4835, 2007, pp. 41-51
• Unifying two graph decompositions with modular decomposition
  Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
  Lecture Notes in Computer Science 4835, 2007, pp. 52-64
• Escaping off-line searchers and a discrete isoperimetric theorem
  Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
  Lecture Notes in Computer Science 4835, 2007, pp. 65-74
• Geometric spanner of segments
  Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh
  Lecture Notes in Computer Science 4835, 2007, pp. 75-87
• Dilation-optimal edge deletion in polygonal cycles
  Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang
  Lecture Notes in Computer Science 4835, 2007, pp. 88-99
• Unbounded-error classical and quantum communication complexity
  Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
  Lecture Notes in Computer Science 4835, 2007, pp. 100-111
• A spectral method for MAX2SAT in the planted solution model
  Masaki Yamamoto
  Lecture Notes in Computer Science 4835, 2007, pp. 112-123
• On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
  Uffe Flarup, Pascal Koiran, Laurent Lyaudet
  Lecture Notes in Computer Science 4835, 2007, pp. 124-136
• The 1-versus-2 queries problem revisited
  Rahul Tripathi
  Lecture Notes in Computer Science 4835, 2007, pp. 137-147
• Approximating the crossing number of toroidal graphs
  Petr Hlinȇný, Gelasio Salazar
  Lecture Notes in Computer Science 4835, 2007, pp. 148-159
• Width-optimal visibility representations of plane graphs
  Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen
  Lecture Notes in Computer Science 4835, 2007, pp. 160-171
• Computing upward topological book embeddings of upward planar digraphs
  F. Giordano, G. Liotta, T. Mchedlidze, A. Symvonis
  Lecture Notes in Computer Science 4835, 2007, pp. 172-183
• Algorithms for the hypergraph and the minor crossing number problems
  Markus Chimani, Carsten Gutwenger
  Lecture Notes in Computer Science 4835, 2007, pp. 184-195
• On mixing and edge expansion properties in randomized broadcasting
  Thomas Sauerwald
  Lecture Notes in Computer Science 4835, 2007, pp. 196-207
• Linear reconfiguration of cube-style modular robots
  Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán, Stefanie Wuhrer
  Lecture Notes in Computer Science 4835, 2007, pp. 208-219
• Fast message dissemination in random geometric ad-hoc radio networks
  Artur Czumaj, Xin Wang
  Lecture Notes in Computer Science 4835, 2007, pp. 220-231
• Sensor network gossiping or how to break the broadcast lower bound
  Martín Farach-Colton, Miguel A. Mosteiro
  Lecture Notes in Computer Science 4835, 2007, pp. 232-243
• On the complexity of the ``most general'' undirected firing squad synchronization problem
  Darin Goldstein, Kojiro Kobayashi
  Lecture Notes in Computer Science 4835, 2007, pp. 244-255
• Capacitated domination problem
  Mong-Jen Kao, Chung-Shou Liao
  Lecture Notes in Computer Science 4835, 2007, pp. 256-267
• The complexity of finding subgraphs whose matching number equals the vertex cover number
  Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C.R. Subramanian
  Lecture Notes in Computer Science 4835, 2007, pp. 268-279