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.
Approximate guarding of monotone and rectilinear polygons
Erik A. Krohn
,
Bengt J. Nilsson
Algorithmica
66
(3), 2013, pp. 564-594
Median trajectories
Kevin Buchin
,
Maike Buchin
,
Marc van Kreveld
,
Maarten Löffler
,
Rodrigo I. Silveira
,
Carola Wenk
,
Lionov Wiratma
Algorithmica
66
(3), 2013, pp. 595-614
Improved algorithms for some competitive location centroid problems on paths, trees and graphs
Avivit Lazar
,
Arie Tamir
Algorithmica
66
(3), 2013, pp. 615-640
On finding Min-Min disjoint paths
Longkun Guo
,
Hong Shen
Algorithmica
66
(3), 2013, pp. 641-653
A linear time algorithm for
L(2,1)
-labeling of trees
Toru Hasunuma
,
Toshimasa Ishii
,
Hirotaka Ono
,
Yushi Uno
Algorithmica
66
(3), 2013, pp. 654-681
Approximating points by a piecewise linear function
Danny Z. Chen
,
Haitao Wang
Algorithmica
66
(3), 2013, pp. 682-713
Encoding and constructing 1-nested phylogenetic networks with trinets
K.T. Huber
,
V. Moulton
Algorithmica
66
(3), 2013, pp. 714-738
A central limit theorem for the number of degree-
k
vertices in random maps
Michael Drmota
,
Konstantinos Panagiotou
Algorithmica
66
(4), 2013, pp. 741-761
Analysis of the ``hiring above the median'' selection strategy for the hiring problem
Ahmed Helmi
,
Alois Panholzer
Algorithmica
66
(4), 2013, pp. 762-803
Inequalities for the number of walks in graphs
Hanjo Täubig
,
Jeremias Weihmann
,
Sven Kosub
,
Raymond Hemmecke
,
Ernst W. Mayr
Algorithmica
66
(4), 2013, pp. 804-828
Asymptotic enumeration of extensional acyclic digraphs
Stephan Wagner
Algorithmica
66
(4), 2013, pp. 829-847
Message passing algorithms for MLS-3LIN problem
Osamu Watanabe
Algorithmica
66
(4), 2013, pp. 848-868
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
Seiten
<
1
2
3
4
5
>