Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=7676

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

Future directions in computer science research
John E. Hopcroft
Lecture Notes in Computer Science 7676, 2012, pp. 1-1
Combinatorial geometry and approximation algorithms
Timothy M. Chan
Lecture Notes in Computer Science 7676, 2012, pp. 2-2
Origami robots and star trek replicators
Erik D. Demaine
Lecture Notes in Computer Science 7676, 2012, pp. 3-3
Strong conflict-free coloring for intervals
Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky
Lecture Notes in Computer Science 7676, 2012, pp. 4-13
Closing complexity gaps for coloring problems on H-free graphs
Petr A. Golovach, Daniël Paulusma, Jian Song
Lecture Notes in Computer Science 7676, 2012, pp. 14-23
Randomly coloring regular bipartite graphs and graphs with bounded common neighbors
Ching-Chen Kuo, Hsueh-I Lu
Lecture Notes in Computer Science 7676, 2012, pp. 24-33
Reconfiguration of list L(2,1)-labelings in a graph
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
Lecture Notes in Computer Science 7676, 2012, pp. 34-43
An 8/3 lower bound for online dynamic bin packing
Prudence W.H. Wong, Fencol C.C. Yung, Mihai Burcea
Lecture Notes in Computer Science 7676, 2012, pp. 44-53
Computing k-center over streaming data for small k
Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son
Lecture Notes in Computer Science 7676, 2012, pp. 54-63
Precision vs confidence tradeoffs for \ell_2-based frequency estimation in data streams
Sumit Ganguly
Lecture Notes in Computer Science 7676, 2012, pp. 64-74
Competitive design and analysis for machine-minimizing job scheduling problem
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
Lecture Notes in Computer Science 7676, 2012, pp. 75-84
A partially ordered structure and a generalization of the canonical partition for general graphs with perfect matchings
Nanao Kita
Lecture Notes in Computer Science 7676, 2012, pp. 85-94
Fast and simple fully-dynamic cut tree construction
Tanja Hartmann, Dorothea Wagner
Lecture Notes in Computer Science 7676, 2012, pp. 95-105
Green scheduling, flows and matchings
Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
Lecture Notes in Computer Science 7676, 2012, pp. 106-115
Popular and clan-popular b-matchings
Katarzyna Paluch
Lecture Notes in Computer Science 7676, 2012, pp. 116-125
Kernelization and parameterized complexity of star editing and union editing
Jiong Guo, Yash Raj Shrestha
Lecture Notes in Computer Science 7676, 2012, pp. 126-135
On the advice complexity of buffer management
Reza Dorrigiv, Meng He, Norbert Zeh
Lecture Notes in Computer Science 7676, 2012, pp. 136-145
On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree
Tatsuya Akutsu, Takeyuki Tamura
Lecture Notes in Computer Science 7676, 2012, pp. 146-155
Speeding up shortest path algorithms
Andrej Brodnik, Marko Grgurovic̑
Lecture Notes in Computer Science 7676, 2012, pp. 156-165
How many potatoes are in a mesh?
Marc van Kreveld, Maarten Löffler, János Pach
Lecture Notes in Computer Science 7676, 2012, pp. 166-176
On higher order Voronoi diagrams of line segments
Evanthia Papadopoulou, Maksym Zavershynskyi
Lecture Notes in Computer Science 7676, 2012, pp. 177-186
On the farthest line-segment Voronoi diagram
Evanthia Papadopoulou, Sandeep Kumar Dey
Lecture Notes in Computer Science 7676, 2012, pp. 187-196
Computing the longest common subsequence of two run-length encoded strings
Yoshifumi Sakai
Lecture Notes in Computer Science 7676, 2012, pp. 197-206
Efficient counting of square substrings in a tree
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
Lecture Notes in Computer Science 7676, 2012, pp. 207-216
A general method for improving insertion-based adaptive sorting
Riku Saikkonen, Eljas Soisalon-Soininen
Lecture Notes in Computer Science 7676, 2012, pp. 217-226

Seiten 1 2 3 >