Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=6078

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Towards a distributed search engine
Ricardo Baeza-Yates
Lecture Notes in Computer Science 6078, 2010, pp. 1-5
Mechanisms for the marriage and the assignment game
Paul Dütting, Monika Henzinger
Lecture Notes in Computer Science 6078, 2010, pp. 6-12
Resilient algorithms and data structures
Giuseppe F. Italiano
Lecture Notes in Computer Science 6078, 2010, pp. 13-24
An exact algorithm for Connected Red-Blue Dominating Set
Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff
Lecture Notes in Computer Science 6078, 2010, pp. 25-36
Maximizing PageRank with new backlinks
Martin Olsen
Lecture Notes in Computer Science 6078, 2010, pp. 37-48
Enumerating rooted graphs with reflectional block structures
Bingbing Zhuang, Hiroshi Nagamochi
Lecture Notes in Computer Science 6078, 2010, pp. 49-60
Improved approximations for TSP with simple precedence constraints
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
Lecture Notes in Computer Science 6078, 2010, pp. 61-72
Polynomial space algorithms for counting dominating sets and the domatic number
Johan M.M. van Rooij
Lecture Notes in Computer Science 6078, 2010, pp. 73-84
Parameterized complexity of even/odd subgraph problems
Leizhen Cai, Boting Yang
Lecture Notes in Computer Science 6078, 2010, pp. 85-96
Popular matchings in the Marriage and Roommates Problems
Péter Biró, Robert W. Irving, David F. Manlove
Lecture Notes in Computer Science 6078, 2010, pp. 97-108
Bounding the number of tolerable faults in majority-based systems
Ching-Lueh Chang, Yuh-Dauh Lyuu
Lecture Notes in Computer Science 6078, 2010, pp. 109-119
A parameterized algorithm for Chordal Sandwich
Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger
Lecture Notes in Computer Science 6078, 2010, pp. 120-130
Testing computability by width-2 OBDDs where the variable order is unknown
Dana Ron, Gilad Tsur
Lecture Notes in Computer Science 6078, 2010, pp. 131-142
Graph unique-maximum and conflict-free colorings
Panagiotis Cheilaris, Géza Tóth
Lecture Notes in Computer Science 6078, 2010, pp. 143-154
Strategic coloring of a graph
Bruno Escoffier, Laurent Gourv`es, Jérôme Monnot
Lecture Notes in Computer Science 6078, 2010, pp. 155-166
Multicut algorithms via tree decompositions
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Lecture Notes in Computer Science 6078, 2010, pp. 167-179
The Steiner tree reoptimization problem with sharpened triangle inequality
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic̑, Tobias Mömke, Andreas Sprock, Björn Steffen
Lecture Notes in Computer Science 6078, 2010, pp. 180-191
Kernelization for maximum leaf spanning tree with positive vertex weights
Bart Jansen
Lecture Notes in Computer Science 6078, 2010, pp. 192-203
A planar linear arboricity conjecture
Marek Cygan, Łukasz Kowalik, Borut Luz̑ar
Lecture Notes in Computer Science 6078, 2010, pp. 204-216
On the number of higher order Delaunay triangulations
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
Lecture Notes in Computer Science 6078, 2010, pp. 217-228
How simple robots benefit from looking back
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús̑ Mihalák, Peter Widmayer
Lecture Notes in Computer Science 6078, 2010, pp. 229-239
On strategy improvement algorithms for simple stochastic games
Rahul Tripathi, Elena Valkanova, V.S. Anil Kumar
Lecture Notes in Computer Science 6078, 2010, pp. 240-251
Online cooperative cost sharing
Janina Brenner, Guido Schäfer
Lecture Notes in Computer Science 6078, 2010, pp. 252-263
On the power of nodes of degree four in the local max-cut problem
Burkhard Monien, Tobias Tscheuschner
Lecture Notes in Computer Science 6078, 2010, pp. 264-275
Packing bipartite graphs with covers of complete bipartite graphs
Jérémie Chalopin, Daniël Paulusma
Lecture Notes in Computer Science 6078, 2010, pp. 276-287

Seiten 1 2 >