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=60
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Colored simultaneous geometric embeddings and universal pointsets
Ulrik Brandes
,
Cesim Erten
,
Alejandro Estrella-Balderrama
,
J. Joseph Fowler
,
Fabrizio Frati
,
Markus Geyer
,
Carsten Gutwenger
,
Seok-Hee Hong
,
Michael Kaufmann
,
Stephen G. Kobourov
,
Giuseppe Liotta
,
Petra Mutzel
,
Antonios Symvonis
Algorithmica
60
(3), 2011, pp. 569-592
On the planarization of wireless sensor networks
Fenghui Zhang
,
Anxiao (Andrew) Jiang
,
Jianer Chen
Algorithmica
60
(3), 2011, pp. 593-608
Spiraling and folding: The word view
Marcus Schaefer
,
Eric Sedgwick
,
Daniel S̑tefankovic̑
Algorithmica
60
(3), 2011, pp. 609-626
Minimum weight convex Steiner partitions
Adrian Dumitrescu
,
Csaba D. Tóth
Algorithmica
60
(3), 2011, pp. 627-652
Knowledge state algorithms
Wolfgang Bein
,
Lawrence L. Larmore
,
John Noga
,
Rüdiger Reischuk
Algorithmica
60
(3), 2011, pp. 653-678
Crossing numbers of graphs with rotation systems
Michael J. Pelsmajer
,
Marcus Schaefer
,
Daniel S̑tefankovic̑
Algorithmica
60
(3), 2011, pp. 679-702
Sweeping points
Adrian Dumitrescu
,
Minghui Jiang
Algorithmica
60
(3), 2011, pp. 703-717
Trade-offs between the size of advice and broadcasting time in trees
Emanuele G. Fusco
,
Andrzej Pelc
Algorithmica
60
(4), 2011, pp. 719-734
Approximating minimum-power degree and connectivity problems
Guy Kortsarz
,
Vahab S. Mirrokni
,
Zeev Nutov
,
Elena Tsanko
Algorithmica
60
(4), 2011, pp. 735-742
Competitive cost sharing with economies of scale
Martin Hoefer
Algorithmica
60
(4), 2011, pp. 743-765
Testing convexity properties of tree colorings
Eldar Fischer
,
Orly Yahalom
Algorithmica
60
(4), 2011, pp. 766-805
Linear time algorithms for generalizations of the longest common substring problem
Michael Arnold
,
Enno Ohlebusch
Algorithmica
60
(4), 2011, pp. 806-818
On word equations in one variable
Robert Da̧browski
,
Wojciech Plandowski
Algorithmica
60
(4), 2011, pp. 819-828
Detecting regular visit patterns
Bojan Djordjevic
,
Joachim Gudmundsson
,
Anh Pham
,
Thomas Wolle
Algorithmica
60
(4), 2011, pp. 829-852
Permutation betting markets: Singleton betting with extra information
Mohammad Ghodsi
,
Hamid Mahini
,
Vahab S. Mirrokni
,
Morteza Zadimoghaddam
Algorithmica
60
(4), 2011, pp. 853-876
Average rate speed scaling
Nikhil Bansal
,
David P. Bunde
,
Ho-Leung Chan
,
Kirk Pruhs
Algorithmica
60
(4), 2011, pp. 877-889
Finding a minimum-depth embedding of a planar graph in
O(n^4)
time
Patrizio Angelini
,
Giuseppe Di Battista
,
Maurizio Patrignani
Algorithmica
60
(4), 2011, pp. 890-937
A stronger model of dynamic programming algorithms
Joshua Buresh-Oppenheim
,
Sashka Davis
,
Russell Impagliazzo
Algorithmica
60
(4), 2011, pp. 938-968
An approximation algorithm for the minimum co-path set problem
Zhi-Zhong Chen
,
Guohui Lin
,
Lusheng Wang
Algorithmica
60
(4), 2011, pp. 969-986
Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms
Athanassios Koutsonas
,
Dimitrios M. Thilikos
Algorithmica
60
(4), 2011, pp. 987-1003
Algorithms for marketing-mix optimization
Joachim Gudmundsson
,
Pat Morin
,
Michiel Smid
Algorithmica
60
(4), 2011, pp. 1004-1016
The directed orienteering problem
Viswanath Nagarajan
,
R. Ravi
Algorithmica
60
(4), 2011, pp. 1017-1030
Seiten
<
1
2