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=58
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fractional path coloring in bounded degree trees with applications
I. Caragiannis
,
A. Ferreira
,
C. Kaklamanis
,
S. Pérennes
,
H. Rivano
Algorithmica
58
(2), 2010, pp. 516-540
Algorithmic aspects of proportional symbol maps
Sergio Cabello
,
Herman Haverkort
,
Marc van Kreveld
,
Bettina Speckmann
Algorithmica
58
(3), 2010, pp. 543-565
On the fastest Vickrey algorithm
Elena Grigorieva
,
P. Jean-Jacques Herings
,
Rudolf Müller
,
Dries Vermeulen
Algorithmica
58
(3), 2010, pp. 566-590
Approximate Boyer-Moore string matching for small alphabets
Leena Salmela
,
Jorma Tarhio
,
Petri Kalsi
Algorithmica
58
(3), 2010, pp. 591-609
Multi-color pebble motion on graphs
Gilad Goraly
,
Refael Hassin
Algorithmica
58
(3), 2010, pp. 610-636
A fully dynamic graph algorithm for recognizing interval graphs
Louis Ibarra
Algorithmica
58
(3), 2010, pp. 637-678
The 1-fixed-endpoint path cover problem is polynomial on interval graphs
Katerina Asdre
,
Stavros D. Nikolopoulos
Algorithmica
58
(3), 2010, pp. 679-710
Computing the greedy spanner in near-quadratic time
Prosenjit Bose
,
Paz Carmi
,
Mohammad Farshi
,
Anil Maheshwari
,
Michiel Smid
Algorithmica
58
(3), 2010, pp. 711-729
Analysis of the expected number of bit comparisons required by Quickselect
James Allen Fill
,
Takéhiko Nakama
Algorithmica
58
(3), 2010, pp. 730-769
Fast 3-coloring triangle-free planar graphs
Lukasz Kowalik
Algorithmica
58
(3), 2010, pp. 770-789
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Frederic Dorn
,
Eelko Penninkx
,
Hans L. Bodlaender
,
Fedor V. Fomin
Algorithmica
58
(3), 2010, pp. 790-810
On the benefits of adaptivity in property testing of dense graphs
Mira Gonen
,
Dana Ron
Algorithmica
58
(4), 2010, pp. 811-830
On locally decodable codes, self-correctable codes, and
t
-private PIR
Omer Barkol
,
Yuval Ishai
,
Enav Weinreb
Algorithmica
58
(4), 2010, pp. 831-859
A sequential algorithm for generating random graphs
Mohsen Bayati
,
Jeong Han Kim
,
Amin Saberi
Algorithmica
58
(4), 2010, pp. 860-910
Slow mixing of Markov chains using fault lines and fat contours
Sam Greenberg
,
Dana Randall
Algorithmica
58
(4), 2010, pp. 911-927
Introduction to the special section on Internet and Network Economics
Xiaotie Deng
,
Fan Chung Graham
Algorithmica
58
(4), 2010, pp. 928-929
Gaming prediction markets: Equilibrium strategies with a market maker
Yiling Chen
,
Stanko Dimitrov
,
Rahul Sami
,
Daniel M. Reeves
,
David M. Pennock
,
Robin D. Hanson
,
Lance Fortnow
,
Rica Gonen
Algorithmica
58
(4), 2010, pp. 930-969
On robustness of forward-looking in sponsored search auction
Tian-Ming Bu
,
Li Liang
,
Qi Qi
Algorithmica
58
(4), 2010, pp. 970-989
Maintaining equilibria during exploration in sponsored search auctions
John Langford
,
Lihong Li
,
Yevgeniy Vorobeychik
,
Jennifer Wortman
Algorithmica
58
(4), 2010, pp. 990-1021
Stochastic models for budget optimization in search-based advertising
S. Muthukrishnan
,
Martin Pál
,
Zoya Svitkina
Algorithmica
58
(4), 2010, pp. 1022-1044
Seiten
<
1
2