Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5757

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

Algorithms meet art, puzzles, and magic
Erik D. Demaine
Lecture Notes in Computer Science 5757, 2009, pp. 289-289
Polynomial-time algorithm for the leafage of chordal graphs
Michel Habib, Juraj Stacho
Lecture Notes in Computer Science 5757, 2009, pp. 290-300
Breaking the O(m2^n) barrier for minimum cycle bases
Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi
Lecture Notes in Computer Science 5757, 2009, pp. 301-312
Shape fitting on point sets with probability distributions
Maarten Löffler, Jeff M. Phillips
Lecture Notes in Computer Science 5757, 2009, pp. 313-324
An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants
Jing Xiao, Tiancheng Lou, Tao Jiang
Lecture Notes in Computer Science 5757, 2009, pp. 325-336
Complete parsimony haplotype inference problem and algorithms
Gerold Jäger, Sharlee Climer, Weixiong Zhang
Lecture Notes in Computer Science 5757, 2009, pp. 337-348
Linear-time recognition of probe interval graphs
M. Ross McConnell, Yahav Nussbaum
Lecture Notes in Computer Science 5757, 2009, pp. 349-360
Wireless scheduling with power control
Magnús M. Halldórsson
Lecture Notes in Computer Science 5757, 2009, pp. 361-372
On the power of uniform power: Capacity of wireless networks with bounded resources
Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet
Lecture Notes in Computer Science 5757, 2009, pp. 373-384
Approximability of OFDMA scheduling
Marcel Ochel, Berthold Vöcking
Lecture Notes in Computer Science 5757, 2009, pp. 385-396
Maximum flow in directed planar graphs with vertex capacities
Haim Kaplan, Yahav Nussbaum
Lecture Notes in Computer Science 5757, 2009, pp. 397-407
A fast output-sensitive algorithm for Boolean matrix multiplication
Andrzej Lingas
Lecture Notes in Computer Science 5757, 2009, pp. 408-419
On optimally partitioning a text to improve its compression
Paolo Ferragina, Igor Nitto, Rossano Venturini
Lecture Notes in Computer Science 5757, 2009, pp. 420-431
An average-case analysis for rate-monotonic multiprocessor real-time scheduling
Andreas Karrenbauer, Thomas Rothvoß
Lecture Notes in Computer Science 5757, 2009, pp. 432-443
Minimizing maximum response time and delay factor in broadcast scheduling
Chandra Chekuri, Sungjin Im, Benjamin Moseley
Lecture Notes in Computer Science 5757, 2009, pp. 444-455
Preemptive online scheduling with reordering
György Dósa, Leah Epstein
Lecture Notes in Computer Science 5757, 2009, pp. 456-467
d-dimensional knapsack in the streaming model
Sumit Ganguly, Christian Sohler
Lecture Notes in Computer Science 5757, 2009, pp. 468-479
Sparse cut projections in graph streams
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy
Lecture Notes in Computer Science 5757, 2009, pp. 480-491
Bipartite graph matchings in the semi-streaming model
Sebastian Eggert, Lasse Kliemann, Anand Srivastav
Lecture Notes in Computer Science 5757, 2009, pp. 492-503
The oil searching problem
Andrew McGregor, Krzysztof Onak, Rina Panigrahy
Lecture Notes in Computer Science 5757, 2009, pp. 504-515
Hyperbolic dovetailing
David Kirkpatrick
Lecture Notes in Computer Science 5757, 2009, pp. 516-527
On the expansion and diameter of bluetooth-like topologies
Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci
Lecture Notes in Computer Science 5757, 2009, pp. 528-539
Minimum makespan multi-vehicle Dial-a-Ride
Inge Li Grtz, Viswanath Nagarajan, R. Ravi
Lecture Notes in Computer Science 5757, 2009, pp. 540-552
Google's auction for TV ads
Noam Nisan
Lecture Notes in Computer Science 5757, 2009, pp. 553-553
Inclusion/exclusion meets measure and conquer - Exact algorithms for counting dominating sets
Johan M.M. van Rooij, Jesper Nederlof, Thomas C. van Dijk
Lecture Notes in Computer Science 5757, 2009, pp. 554-565

Seiten < 1 2 3 >