Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=7878

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

Approximation algorithms for disjoint st-paths with minimum activation cost
Hasna Mohsen Alqahtani, Thomas Erlebach
Lecture Notes in Computer Science 7878, 2013, pp. 1-12
Parameterized complexity and kernel bounds for hard planning problems
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Lecture Notes in Computer Science 7878, 2013, pp. 13-24
Selfish resource allocation in optical networks
Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis
Lecture Notes in Computer Science 7878, 2013, pp. 25-36
Average optimal string matching in packed strings
Djamal Belazzougui, Mathieu Raffinot
Lecture Notes in Computer Science 7878, 2013, pp. 37-48
Parameterized complexity of DAG partitioning
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondȓej Suchý
Lecture Notes in Computer Science 7878, 2013, pp. 49-60
Four measures of nonlinearity
Joan Boyar, Magnus Find, René Peralta
Lecture Notes in Computer Science 7878, 2013, pp. 61-72
On the characterization of plane bus graphs
Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
Lecture Notes in Computer Science 7878, 2013, pp. 73-84
Online multi-dimensional dynamic bin packing of unit-fraction items
Mihai Burcea, Prudence W.H. Wong, Fencol C.C. Yung
Lecture Notes in Computer Science 7878, 2013, pp. 85-96
A greedy approximation algorithm for minimum-gap scheduling
Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
Lecture Notes in Computer Science 7878, 2013, pp. 97-109
Exponential complexity of satisfiability testing for linear-size Boolean formulas
Evgeny Dantsin, Alexander Wolpert
Lecture Notes in Computer Science 7878, 2013, pp. 110-121
Linear time distributed swap edge algorithms
Ajoy K. Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
Lecture Notes in Computer Science 7878, 2013, pp. 122-133
Decentralized throughput scheduling
Jasper de Jong, Marc Uetz, Andreas Wombacher
Lecture Notes in Computer Science 7878, 2013, pp. 134-145
New results on stabbing segments with a polygon
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira
Lecture Notes in Computer Science 7878, 2013, pp. 146-157
Improving the H_k-bound on the price of stability in undirected shapley network design games
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús̑ Mihalák
Lecture Notes in Computer Science 7878, 2013, pp. 158-169
Complexity of barrier coverage with relocatable sensors in the plane
Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil Shende, Jorge Urrutia
Lecture Notes in Computer Science 7878, 2013, pp. 170-182
Succinct permanent is NEXP-hard with many hard instances
Shlomi Dolev, Nova Fandina, Dan Gutfreund
Lecture Notes in Computer Science 7878, 2013, pp. 183-196
Money-based coordination of network packets
Pavlos S. Efraimidis, Remous-Aris Koutsiamanis
Lecture Notes in Computer Science 7878, 2013, pp. 197-208
Truthful many-to-many assignment with private weights
Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
Lecture Notes in Computer Science 7878, 2013, pp. 209-220
Competitive online clique clustering
Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
Lecture Notes in Computer Science 7878, 2013, pp. 221-233
Optimal network decontamination with threshold immunity
Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro
Lecture Notes in Computer Science 7878, 2013, pp. 234-245
Finding all convex cuts of a plane graph in cubic time
Roland Glantz, Henning Meyerhenke
Lecture Notes in Computer Science 7878, 2013, pp. 246-263
Shortest paths with bundles and non-additive weights is hard
Paul W. Goldberg, Antony McCabe
Lecture Notes in Computer Science 7878, 2013, pp. 264-275
Cliques and clubs
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
Lecture Notes in Computer Science 7878, 2013, pp. 276-287
List coloring in the absence of two subgraphs
Petr A. Golovach, Daniël Paulusma
Lecture Notes in Computer Science 7878, 2013, pp. 288-299
Query complexity of matroids
Raghav Kulkarni, Miklos Santha
Lecture Notes in Computer Science 7878, 2013, pp. 300-311

Seiten 1 2 >