Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Series=LNCS AND Volume=8737
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nested set union
Daniel H. Larkin
,
Robert E. Tarjan
Lecture Notes in Computer Science
8737
, 2014, pp. 618-629
Improved explicit data structures in the bitprobe model
Moshe Lewenstein
,
J. Ian Munro
,
Patrick K. Nicholson
,
Venkatesh Raman
Lecture Notes in Computer Science
8737
, 2014, pp. 630-641
Deeper local search for better approximation on maximum internal spanning trees
Wenjun Li
,
Jianer Chen
,
Jianxin Wang
Lecture Notes in Computer Science
8737
, 2014, pp. 642-653
FPTAS for counting weighted edge covers
Jingcheng Liu
,
Pinyan Lu
,
Chihao Zhang
Lecture Notes in Computer Science
8737
, 2014, pp. 654-665
Solving
Multicut
faster than
2^n
Daniel Lokshtanov
,
Saket Saurabh
,
Ondȓej Suchý
Lecture Notes in Computer Science
8737
, 2014, pp. 666-676
Tight bounds for active self-assembly using an insertion primitive
Caleb Malchik
,
Andrew Winslow
Lecture Notes in Computer Science
8737
, 2014, pp. 677-688
Trace reconstruction revisited
Andrew McGregor
,
Eric Price
,
Sofya Vorotnikova
Lecture Notes in Computer Science
8737
, 2014, pp. 689-700
PReaCH: A fast lightweight reachability index using pruning and contraction hierarchies
Florian Merz
,
Peter Sanders
Lecture Notes in Computer Science
8737
, 2014, pp. 701-712
Polynomial-time approximation schemes for circle packing problems
Flávio K. Miyazawa
,
Lehilton L.C. Pedrosa
,
Rafael C.S. Schouery
,
Maxim Sviridenko
,
Yoshiko Wakabayashi
Lecture Notes in Computer Science
8737
, 2014, pp. 713-724
Document retrieval on repetitive collections
Gonzalo Navarro
,
Simon J. Puglisi
,
Jouni Sirén
Lecture Notes in Computer Science
8737
, 2014, pp. 725-736
An improved analysis of the Mömke-Svensson algorithm for graph-TSP on subquartic graphs
Alantha Newman
Lecture Notes in Computer Science
8737
, 2014, pp. 737-749
The input/output complexity of sparse matrix multiplication
Rasmus Pagh
,
Morten Stöckel
Lecture Notes in Computer Science
8737
, 2014, pp. 750-761
Faster FPTASes for counting and random generation of knapsack solutions
Romeo Rizzi
,
Alexandru I. Tomescu
Lecture Notes in Computer Science
8737
, 2014, pp. 762-773
Improved guarantees for tree cut sparsifiers
Harald Räcke
,
Chintan Shah
Lecture Notes in Computer Science
8737
, 2014, pp. 774-785
Representative families: A unified tradeoff-based approach
Hadas Shachnai
,
Meirav Zehavi
Lecture Notes in Computer Science
8737
, 2014, pp. 786-797
A branch and price procedure for the container premarshalling problem
Martijn van Brink
,
Ruben van der Zwaan
Lecture Notes in Computer Science
8737
, 2014, pp. 798-809
Space-efficient randomized algorithms for
k
-SUM
Joshua R. Wang
Lecture Notes in Computer Science
8737
, 2014, pp. 810-829
Equivalence between priority queues and sorting in external memory
Zhewei Wei
,
Ke Yi
Lecture Notes in Computer Science
8737
, 2014, pp. 830-841
Amortized bounds for dynamic orthogonal range reporting
Bryan T. Wilkinson
Lecture Notes in Computer Science
8737
, 2014, pp. 842-856
Seiten
<
1
2
3