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 Volume=65
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing unrestricted synopses under maximum error bound
Chaoyi Pang
,
Qing Zhang
,
Xiaofang Zhou
,
David Hansen
,
Sen Wang
Algorithmica
65
(1), 2013, pp. 1-42
Mapping simple polygons: How robots benefit from looking back
Jérémie Chalopin
,
Shantanu Das
,
Yann Disser
,
Matús̑ Mihalák
,
Peter Widmayer
Algorithmica
65
(1), 2013, pp. 43-59
Collecting weighted items from a dynamic queue
Marcin Bienkowski
,
Marek Chrobak
,
Christoph Dürr
,
Mathilde Hurand
Algorithmica
65
(1), 2013, pp. 60-94
Exact and parameterized algorithms for
Max Internal Spanning Tree
Daniel Binkele-Raible
,
Henning Fernau
,
Serge Gaspers
,
Mathieu Liedloff
Algorithmica
65
(1), 2013, pp. 95-128
Exact algorithms for finding longest cycles in claw-free graphs
Hajo Broersma
,
Fedor V. Fomin
,
Pim van 't Hof
,
Daniël Paulusma
Algorithmica
65
(1), 2013, pp. 129-145
Relaxed spanners for directed disk graphs
D. Peleg
,
L. Roditty
Algorithmica
65
(1), 2013, pp. 146-158
Exponential inapproximability of selecting a maximum volume sub-matrix
Ali Çivril
,
Malik Magdon-Ismail
Algorithmica
65
(1), 2013, pp. 159-176
The longest path problem is polynomial on cocomparability graphs
Kyriaki Ioannidou
,
Stavros D. Nikolopoulos
Algorithmica
65
(1), 2013, pp. 177-205
Optimal tracking of distributed heavy hitters and quantiles
Ke Yi
,
Qin Zhang
Algorithmica
65
(1), 2013, pp. 206-223
Adaptive drift analysis
Benjamin Doerr
,
Leslie Ann Goldberg
Algorithmica
65
(1), 2013, pp. 224-250
Online clustering with variable sized clusters
János Csirik
,
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Algorithmica
65
(2), 2013, pp. 251-274
Cleaning interval graphs
Dániel Marx
,
Ildikó Schlotter
Algorithmica
65
(2), 2013, pp. 275-316
Route-enabling graph orientation problems
Takehiro Ito
,
Yuichiro Miyamoto
,
Hirotaka Ono
,
Hisao Tamaki
,
Ryuhei Uehara
Algorithmica
65
(2), 2013, pp. 317-338
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
Seiten 1
2
>