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

• On finding graph clusterings with maximum modularity
  Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner
  Lecture Notes in Computer Science 4769, 2007, pp. 121-132
• Mixing 3-colourings in bipartite graphs
  Luis Cereceda, Jan van den Heuvel, Matthew Johnson
  Lecture Notes in Computer Science 4769, 2007, pp. 166-177
• Complexity and approximation results for the connected vertex cover problem
  Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
  Lecture Notes in Computer Science 4769, 2007, pp. 202-213
• Segmenting strings homogeneously via trees
  Peter Damaschke
  Lecture Notes in Computer Science 4769, 2007, pp. 214-225
• How to use planarity efficiently: New tree-decomposition based algorithms
  Frederic Dorn
  Lecture Notes in Computer Science 4769, 2007, pp. 280-291
• How to be fickle
  Vas̑ek Chvátal
  Lecture Notes in Computer Science 4708, 2007, pp. 1-1
• Finite model theory on tame classes of structures
  Anuj Dawar
  Lecture Notes in Computer Science 4708, 2007, pp. 2-12
• Uncover low degree vertices and minimise the mess: Independent sets in random regular graphs
  William Duckworth, Michele Zito
  Lecture Notes in Computer Science 4708, 2007, pp. 56-66
• Rewriting conjunctive queries determined by views
  Foto Afrati
  Lecture Notes in Computer Science 4708, 2007, pp. 78-89
• On approximation of bookmark assignments
  Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
  Lecture Notes in Computer Science 4708, 2007, pp. 115-124
• Minimizing variants of visibly pushdown automata
  Patrick Chervet, Igor Walukiewicz
  Lecture Notes in Computer Science 4708, 2007, pp. 135-146
• Linear circuits, two-variable logic and weakly blocked monoids
  Christoph Behle, Andreas Krebs, Mark Mercer
  Lecture Notes in Computer Science 4708, 2007, pp. 147-158
• Adapting parallel algorithms to the W-stream model, with applications to graph problems
  Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
  Lecture Notes in Computer Science 4708, 2007, pp. 194-205
• Small alliances in graphs
  Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
  Lecture Notes in Computer Science 4708, 2007, pp. 218-227
• What are iteration theories?
  Jiȓí Adámek, Stefan Milius, Jiȓí Velebil
  Lecture Notes in Computer Science 4708, 2007, pp. 240-252
• Properties complementary to program self-reference
  John Case, Samuel E. Moelius III
  Lecture Notes in Computer Science 4708, 2007, pp. 253-263
• Real time language recognition on 2D cellular automata: Dealing with non-convex neighborhoods
  Martin Delacourt, Victor Poupet
  Lecture Notes in Computer Science 4708, 2007, pp. 298-309
• Towards a rice theorem on traces of cellular automata
  Julien Cervelle, Pierre Guillon
  Lecture Notes in Computer Science 4708, 2007, pp. 310-319
• Reachability problems in quaternion matrix and rotation semigroups
  Paul Bell, Igor Potapov
  Lecture Notes in Computer Science 4708, 2007, pp. 346-358
• Efficient provably-secure hierarchical key assignment schemes
  Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
  Lecture Notes in Computer Science 4708, 2007, pp. 371-382
• Nearly private information retrieval
  Amit Chakrabarti, Anna Shubina
  Lecture Notes in Computer Science 4708, 2007, pp. 383-393
• Dynamic matchings in convex bipartite graphs
  Gerth Stlting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
  Lecture Notes in Computer Science 4708, 2007, pp. 406-417
• Optimal gossiping in directed geometric radio networks in presence of dynamical faults
  Andrea E.F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
  Lecture Notes in Computer Science 4708, 2007, pp. 430-441
• A linear time algorithm for the k maximal sums problem
  Gerth Stlting Brodal, Allan Grnlund Jrgensen
  Lecture Notes in Computer Science 4708, 2007, pp. 442-453
• Analysis of maximal repetitions in strings
  Maxime Crochemore, Lucian Ilie
  Lecture Notes in Computer Science 4708, 2007, pp. 465-476