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=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Three-sided stable matchings with cyclic preferences
Péter Biró
,
Eric McDermid
Algorithmica
58
(1), 2010, pp. 5-18
Housing markets through graphs
Katarína Cechlárová
,
Tamás Fleiner
Algorithmica
58
(1), 2010, pp. 19-33
Understanding the generalized median stable matchings
Christine T. Cheng
Algorithmica
58
(1), 2010, pp. 34-51
An efficient algorithm for batch stability testing
John Dabney
,
Brian C. Dean
Algorithmica
58
(1), 2010, pp. 52-58
Faster algorithms for stable allocation problems
Brian C. Dean
,
Siddharth Munshi
Algorithmica
58
(1), 2010, pp. 59-81
The stable roommates problem with choice functions
Tamás Fleiner
Algorithmica
58
(1), 2010, pp. 82-101
Almost stable matchings by truncating the Gale-Shapley algorithm
Patrik Floréen
,
Petteri Kaski
,
Valentin Polishchuk
,
Jukka Suomela
Algorithmica
58
(1), 2010, pp. 102-118
Assigning papers to referees
Naveen Garg
,
Telikepalli Kavitha
,
Amit Kumar
,
Kurt Mehlhorn
,
Julián Mestre
Algorithmica
58
(1), 2010, pp. 119-136
Circular stable matching and 3-way kidney transplant
Chien-Chung Huang
Algorithmica
58
(1), 2010, pp. 137-150
Cheating strategies for the Gale-Shapley algorithm with complete preference lists
Hirotatsu Kobayashi
,
Tomomi Matsui
Algorithmica
58
(1), 2010, pp. 151-169
Parameterized complexity and local search approaches for the Stable Marriage problem with ties
Dániel Marx
,
Ildikó Schlotter
Algorithmica
58
(1), 2010, pp. 170-187
A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games
Jun Wako
Algorithmica
58
(1), 2010, pp. 188-220
Near-entropy hotlink assignments
Karim Douïeb
,
Stefan Langerman
Algorithmica
58
(2), 2010, pp. 221-244
The complexity of bottleneck labeled graph problems
Refael Hassin
,
Jérôme Monnot
,
Danny Segev
Algorithmica
58
(2), 2010, pp. 245-262
Compressed indexes for approximate string matching
Ho-Leung Chan
,
Tak-Wah Lam
,
Wing-Kin Sung
,
Siu-Lung Tam
,
Swee-Seong Wong
Algorithmica
58
(2), 2010, pp. 263-281
Fingerprint clustering with bounded number of missing values
Paola Bonizzoni
,
Gianluca Della Vedova
,
Ricardo Dondi
,
Giancarlo Mauri
Algorithmica
58
(2), 2010, pp. 282-303
NBmalloc
: Allocating memory in a lock-free manner
Anders Gidenstam
,
Marina Papatriantafilou
,
Philippas Tsigas
Algorithmica
58
(2), 2010, pp. 304-338
Space efficient algorithms for the Burrows-Wheeler backtransformation
Ulrich Lauther
,
Tamás Lukovszki
Algorithmica
58
(2), 2010, pp. 339-351
Guarding a terrain by two watchtowers
Pankaj K. Agarwal
,
Sergey Bereg
,
Ovidiu Daescu
,
Haim Kaplan
,
Simeon Ntafos
,
Micha Sharir
,
Binhai Zhu
Algorithmica
58
(2), 2010, pp. 352-390
Approximation algorithms for scheduling with reservations
Florian Diedrich
,
Klaus Jansen
,
Fanny Pascual
,
Enis Trystram
Algorithmica
58
(2), 2010, pp. 391-404
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Christophe Crespelle
,
Christophe Paul
Algorithmica
58
(2), 2010, pp. 405-432
A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
Seok-Hee Hong
,
Hiroshi Nagamochi
Algorithmica
58
(2), 2010, pp. 433-460
New results on web caching with request reordering
Susanne Albers
Algorithmica
58
(2), 2010, pp. 461-477
Approximation algorithms for minimizing edge crossings in radial drawings
Seok-Hee Hong
,
Hiroshi Nagamochi
Algorithmica
58
(2), 2010, pp. 478-497
Absolute and asymptotic bounds for online frequency allocation in cellular networks
Joseph Wun-Tat Chan
,
Francis Y.L. Chin
,
Deshi Ye
,
Yong Zhang
Algorithmica
58
(2), 2010, pp. 498-515
Seiten 1
2
3
4
5
>