Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5878

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

Computing the map of geometric minimal cuts
Jinhui Xu, Lei Xu, Evanthia Papadopoulou
Lecture Notes in Computer Science 5878, 2009, pp. 244-254
On the camera placement problem
Rudolf Fleischer, Yihui Wang
Lecture Notes in Computer Science 5878, 2009, pp. 255-264
Graph orientations with set connectivity requirements
Takuro Fukunaga
Lecture Notes in Computer Science 5878, 2009, pp. 265-274
A linear vertex kernel for Maximum Internal Spanning Tree
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
Lecture Notes in Computer Science 5878, 2009, pp. 275-282
Geometric minimum diameter minimum cost spanning tree problem
Dae Young Seo, D.T. Lee, Tien-Ching Lin
Lecture Notes in Computer Science 5878, 2009, pp. 283-292
On shortest disjoint paths in planar graphs
Yusuke Kobayashi, Christian Sommer
Lecture Notes in Computer Science 5878, 2009, pp. 293-302
An optimal labeling for node connectivity
Tai-Hsin Hsu, Hsueh-I Lu
Lecture Notes in Computer Science 5878, 2009, pp. 303-310
SOFA: Strategyproof online frequency allocation for multihop wireless networks
Ping Xu, Xiang-Yang Li
Lecture Notes in Computer Science 5878, 2009, pp. 311-320
1-bounded space algorithms for 2-dimensional bin packing
Francis Y.L. Chin, Hing-Fung Ting, Yong Zhang
Lecture Notes in Computer Science 5878, 2009, pp. 321-330
On the advice complexity of online problems
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic̑, Richard Královic̑, Tobias Mömke
Lecture Notes in Computer Science 5878, 2009, pp. 331-340
Online knapsack problems with limited cuts
Xin Han, Kazuhisa Makino
Lecture Notes in Computer Science 5878, 2009, pp. 341-351
Online paging for flash memory devices
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
Lecture Notes in Computer Science 5878, 2009, pp. 352-361
Shifting strategy for geometric graphs without geometry
Imran A. Pirwani
Lecture Notes in Computer Science 5878, 2009, pp. 362-371
Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics
Minming Li
Lecture Notes in Computer Science 5878, 2009, pp. 372-382
Approximation algorithms for min-max path cover problems with service handling time
Zhou Xu, Liang Xu
Lecture Notes in Computer Science 5878, 2009, pp. 383-392
Minimum covering with travel cost
Sándor P. Fekete, Joseph S.B. Mitchell, Christiane Schmidt
Lecture Notes in Computer Science 5878, 2009, pp. 393-402
Route-enabling graph orientation problems
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
Lecture Notes in Computer Science 5878, 2009, pp. 403-412
Complexity of approximating the vertex centroid of a polyhedron
Khaled Elbassioni, Hans Raj Tiwary
Lecture Notes in Computer Science 5878, 2009, pp. 413-422
Popular matchings with variable job capacities
Telikepalli Kavitha, Meghana Nasre
Lecture Notes in Computer Science 5878, 2009, pp. 423-433
On the tightness of the Buhrman-Cleve-Wigderson simulation
Shengyu Zhang
Lecture Notes in Computer Science 5878, 2009, pp. 434-440
Bounds on contention management algorithms
Johannes Schneider, Roger Wattenhofer
Lecture Notes in Computer Science 5878, 2009, pp. 441-451
Algorithmic folding complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
Lecture Notes in Computer Science 5878, 2009, pp. 452-461
Min-energy scheduling for aligned jobs in accelerate model
Weiwei Wu, Minming Li, Enhong Chen
Lecture Notes in Computer Science 5878, 2009, pp. 462-472
Posi-modular systems with modulotone requirements under permutation constraints
Toshimasa Ishii, Kazuhisa Makino
Lecture Notes in Computer Science 5878, 2009, pp. 473-482
Generalized reduction to compute toric ideals
Deepanjan Kesh, Shashank K. Mehta
Lecture Notes in Computer Science 5878, 2009, pp. 483-492

Seiten < 1 2 3 4 5 >