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
Hilfe
Suche: Journal=Algorithmica AND YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unified compression-based acceleration of edit-distance computation
Danny Hermelin
,
Gad M. Landau
,
Shir Landau
,
Oren Weimann
Algorithmica
65
(2), 2013, pp. 339-353
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Kuan-Yu Chen
,
Kun-Mao Chao
Algorithmica
65
(2), 2013, pp. 354-370
I/O efficient dynamic data structures for longest prefix queries
Moshe Hershcovitch
,
Haim Kaplan
Algorithmica
65
(2), 2013, pp. 371-390
Two-stage robust network design with exponential scenarios
Rohit Khandekar
,
Guy Kortsarz
,
Vahab Mirrokni
,
Mohammad R. Salavatipour
Algorithmica
65
(2), 2013, pp. 391-408
Streaming graph computations with a helpful advisor
Graham Cormode
,
Michael Mitzenmacher
,
Justin Thaler
Algorithmica
65
(2), 2013, pp. 409-442
Power domination in circular-arc graphs
Chung-Shou Liao
,
D.T. Lee
Algorithmica
65
(2), 2013, pp. 443-466
A simpler and more efficient algorithm for the next-to-shortest path problem
Bang Ye Wu
Algorithmica
65
(2), 2013, pp. 467-479
Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
A. García
,
P. Jodrá
,
J. Tejel
Algorithmica
65
(3), 2013, pp. 481-497
Improved approximation algorithms for the spanning star forest problem
Ning Chen
,
Roee Engelberg
,
C. Thach Nguyen
,
Prasad Raghavendra
,
Atri Rudra
Algorithmica
65
(3), 2013, pp. 498-516
The parameterized complexity of unique coverage and its variants
Neeldhara Misra
,
Hannes Moser
,
Venkatesh Raman
,
Saket Saurabh
Algorithmica
65
(3), 2013, pp. 517-544
Approximation algorithms for the directed
k
-Tour and
k
-Stroll problems
MohammadHossein Bateni
,
Julia Chuzhoy
Algorithmica
65
(3), 2013, pp. 545-561
Computing without communicating: Ring exploration by asynchronous oblivious robots
Paola Flocchini
,
David Ilcinkas
,
Andrzej Pelc
,
Nicola Santoro
Algorithmica
65
(3), 2013, pp. 562-583
Computing optimal Steiner trees in polynomial space
Fedor V. Fomin
,
Fabrizio Grandoni
,
Dieter Kratsch
,
Daniel Lokshtanov
Algorithmica
65
(3), 2013, pp. 584-604
Online speed scaling based on active job count to minimize flow plus energy
Tak-Wah Lam
,
Lap-Kei Lee
,
Isaac K.K. To
,
Prudence W.H. Wong
Algorithmica
65
(3), 2013, pp. 605-633
Stochastic budget optimization in Internet advertising
Bhaskar DasGupta
,
S. Muthukrishnan
Algorithmica
65
(3), 2013, pp. 634-661
Succinct 2D dictionary matching
Shoshana Neuburger
,
Dina Sokol
Algorithmica
65
(3), 2013, pp. 662-684
Sublinear algorithms for approximating string compressibility
Sofya Raskhodnikova
,
Dana Ron
,
Ronitt Rubinfeld
,
Adam Smith
Algorithmica
65
(3), 2013, pp. 685-709
Small vertex cover makes Petri net coverability and boundedness easier
M. Praveen
Algorithmica
65
(4), 2013, pp. 713-753
Fixed-parameter evolutionary algorithms and the vertex cover problem
Stefan Kratsch
,
Frank Neumann
Algorithmica
65
(4), 2013, pp. 754-771
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Benjamin A. Burton
,
Melih Ozlen
Algorithmica
65
(4), 2013, pp. 772-801
Parameterized two-player Nash equilibrium
Danny Hermelin
,
Chien-Chung Huang
,
Stefan Kratsch
,
Magnus Wahlström
Algorithmica
65
(4), 2013, pp. 802-816
On the exact complexity of evaluating quantified
k
-CNF
Chris Calabro
,
Russell Impagliazzo
,
Ramamohan Paturi
Algorithmica
65
(4), 2013, pp. 817-827
Finding and counting vertex-colored subtrees
Sylvain Guillemot
,
Florian Sikora
Algorithmica
65
(4), 2013, pp. 828-844
Proper interval vertex deletion
Pim van 't Hof
,
Yngve Villanger
Algorithmica
65
(4), 2013, pp. 845-867
Fast polynomial-space algorithms using inclusion-exclusion
Jesper Nederlof
Algorithmica
65
(4), 2013, pp. 868-884
Seiten
<
1
2
3
4
5
>