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=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear time algorithm for computing minmax regret 1-median on a tree network
Binay Bhattacharya
,
Tsunehiko Kameda
,
Zhao Song
Algorithmica
70
(1), 2014, pp. 2-21
A simple
D^2
-sampling based PTAS for
k
-means and other clustering problems
Ragesh Jaiswal
,
Amit Kumar
,
Sandeep Sen
Algorithmica
70
(1), 2014, pp. 22-46
Lower bounds against weakly-uniform threshold circuits
Ruiwen Chen
,
Valentine Kabanets
,
Jeff Kinne
Algorithmica
70
(1), 2014, pp. 47-75
Online unweighted knapsack problem with removal cost
Xin Han
,
Yasushi Kawase
,
Kazuhisa Makino
Algorithmica
70
(1), 2014, pp. 76-91
Online coloring of bipartite graphs with and without advice
Maria Paola Bianchi
,
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Lucia Keller
Algorithmica
70
(1), 2014, pp. 92-111
Geodesic order types
Oswin Aichholzer
,
Matias Korman
,
Alexander Pilz
,
Birgit Vogtenhuber
Algorithmica
70
(1), 2014, pp. 112-128
Towards optimal and expressive kernelization for
d
-hitting set
René van Bevern
Algorithmica
70
(1), 2014, pp. 129-147
A generalization of the convex Kakeya problem
Hee-Kap Ahn
,
Sang Won Bae
,
Otfried Cheong
,
Joachim Gudmundsson
,
Takeshi Tokuyama
,
Antoine Vigneron
Algorithmica
70
(2), 2014, pp. 152-170
An equivariance theorem with applications to renaming
Armando Castañeda
,
Maurice Herlihy
,
Sergio Rajsbaum
Algorithmica
70
(2), 2014, pp. 171-194
Solving the 2-disjoint connected subgraphs problem faster than
2^n
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Algorithmica
70
(2), 2014, pp. 195-207
A randomized sieving algorithm for approximate integer programming
Daniel Dadusch
Algorithmica
70
(2), 2014, pp. 208-244
Computing
H
-joins with application to 2-modular decomposition
Michel Habib
,
Antoine Mamcarz
,
Fabien de Montgolfier
Algorithmica
70
(2), 2014, pp. 245-266
Analysis of the strategy ``Hiring Above the TeX-th Best Candidate''
Ahmed Helmi
,
Conrado Martínez
,
Alois Panholzer
Algorithmica
70
(2), 2014, pp. 267-300
Random walks, bisections and gossiping in circulant graphs
Bernard Mans
,
Igor Shparlinski
Algorithmica
70
(2), 2014, pp. 301-325
The Feedback Arc Set problem with triangle inequality is a vertex cover problem
Monaldo Mastrolilli
Algorithmica
70
(2), 2014, pp. 326-339
Degree constrained node-connectivity problems
Zeev Nutov
Algorithmica
70
(2), 2014, pp. 340-364
A model for minimizing active processor time
Jessica Chang
,
Harold N. Gabow
,
Samir Khuller
Algorithmica
70
(3), 2014, pp. 368-405
The simplex tree: An efficient data structure for general simplicial complexes
Jean-Daniel Boissonnat
,
Clément Maria
Algorithmica
70
(3), 2014, pp. 406-427
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Martin Aumüller
,
Martin Dietzfelbinger
,
Philipp Woelfel
Algorithmica
70
(3), 2014, pp. 428-456
Polynomial-time algorithms for energy games with special weight structures
Krishnendu Chatterjee
,
Monika Henzinger
,
Sebastian Krinninger
,
Danupon Nanongkai
Algorithmica
70
(3), 2014, pp. 457-492
Resource buying games
Tobias Harks
,
Britta Peis
Algorithmica
70
(3), 2014, pp. 493-512
Parameterized complexity of induced graph matching on claw-free graphs
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Algorithmica
70
(3), 2014, pp. 513-560
Routing regardless of network stability
Bundit Laekhanukit
,
Adrian Vetta
,
Gordon Wilfong
Algorithmica
70
(3), 2014, pp. 561-593
On the computational complexity of measuring global stability of banking networks
Piotr Berman
,
Bhaskar DasGupta
,
Lakshmi Kaligounder
,
Marek Karpinski
Algorithmica
70
(4), 2014, pp. 595-647
A nearly linear-time PTAS for explicit fractional packing and covering linear programs
Christos Koufogiannakis
,
Neal E. Young
Algorithmica
70
(4), 2014, pp. 648-674
Seiten 1
2
3
4
5
>