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=68
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for placing monitors in a flow network
Francis Chin
,
Marek Chrobak
,
Li Yan
Algorithmica
68
(1), 2014, pp. 1-15
A uniform paradigm to succinctly encode various families of trees
Arash Farzan
,
J. Ian Munro
Algorithmica
68
(1), 2014, pp. 16-40
Parameterized complexity of Eulerian deletion problems
Marek Cygan
,
Dániel Marx
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Ildikó Schlotter
Algorithmica
68
(1), 2014, pp. 41-61
Graph balancing: A special case of scheduling unrelated parallel machines
Tomás̑ Ebenlendr
,
Marek Krc̑ál
,
Jiȓí Sgall
Algorithmica
68
(1), 2014, pp. 62-80
A cubic-vertex kernel for flip consensus tree
Christian Komusiewicz
,
Johannes Uhlmann
Algorithmica
68
(1), 2014, pp. 81-108
Contracting graphs to paths and trees
Pinar Heggernes
,
Pim van 't Hof
,
Benjamin Lévêque
,
Daniel Lokshtanov
,
Christophe Paul
Algorithmica
68
(1), 2014, pp. 109-132
Online metric tracking and smoothing
Sixia Chen
,
Alexander Russell
Algorithmica
68
(1), 2014, pp. 133-151
Evolutionary algorithms for quantum computers
Daniel Johannsen
,
Piyush P. Kurur
,
Johannes Lengler
Algorithmica
68
(1), 2014, pp. 152-189
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
Matthias Englert
,
Heiko Röglin
,
Berthold Vöcking
Algorithmica
68
(1), 2014, pp. 190-264
Conflict-free chromatic art gallery coverage
Andreas Bärtschi
,
Subhash Suri
Algorithmica
68
(1), 2014, pp. 265-283
Erratum to ``Conflict-free chromatic art gallery coverage''
Andreas Bärtschi
,
Subhash Suri
Algorithmica
68
(1), 2014, pp. 284-285
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Glencora Borradaile
,
Erik D. Demaine
,
Siamak Tazari
Algorithmica
68
(2), 2014, pp. 287-311
Approximation algorithms for intersection graphs
Frank Kammer
,
Torsten Tholey
Algorithmica
68
(2), 2014, pp. 312-336
Finding best swap edges minimizing the routing cost of a spanning tree
Davide Bilò
,
Luciano Gualà
,
Guido Proietti
Algorithmica
68
(2), 2014, pp. 337-357
Emergency connectivity in ad-hoc networks with selfish nodes
George Karakostas
,
Euripides Markou
Algorithmica
68
(2), 2014, pp. 358-389
A randomized
O(\log^2k)
-competitive algorithm for metric bipartite matching
Nikhil Bansal
,
Niv Buchbinder
,
Anupam Gupta
,
Joseph (Seffi) Naor
Algorithmica
68
(2), 2014, pp. 390-403
Speed scaling on parallel processors
Susanne Albers
,
Fabian Müller
,
Swen Schmelzer
Algorithmica
68
(2), 2014, pp. 404-425
An optimal lower bound for buffer management in multi-queue switches
Marcin Bienkowski
Algorithmica
68
(2), 2014, pp. 426-447
Relative convex hulls in semi-dynamic arrangements
Mashhood Ishaque
,
Csaba D. Tóth
Algorithmica
68
(2), 2014, pp. 448-482
The complexity of the empire colouring problem
Andrew R.A. McGrae
,
Michele Zito
Algorithmica
68
(2), 2014, pp. 483-503
The kernelization complexity of connected domination in graphs with (no) small cycles
Neeldhara Misra
,
Geevarghese Philip
,
Venkatesh Raman
,
Saket Saurabh
Algorithmica
68
(2), 2014, pp. 504-530
On succinct greedy drawings of plane triangulations and 3-connected plane graphs
Xin He
,
Huaming Zhang
Algorithmica
68
(2), 2014, pp. 531-544
Sex-equal stable matchings: Complexity and exact algorithms
Eric McDermid
,
Robert W. Irving
Algorithmica
68
(3), 2014, pp. 545-570
Ranking-based black-box complexity
Benjamin Doerr
,
Carola Winzen
Algorithmica
68
(3), 2014, pp. 571-609
On Cartesian trees and range minimum queries
Erik D. Demaine
,
Gad M. Landau
,
Oren Weimann
Algorithmica
68
(3), 2014, pp. 610-625
Seiten 1
2
>