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=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Inapproximability results for combinatorial auctions with submodular utility functions
Subhash Khot
,
Richard Lipton
,
Evangelos Markakis
,
Aranyak Mehta
Algorithmica
52
(1), 2008, pp. 3-18
Cost sharing mechanisms for fair pricing of resource usage
Marios Mavronicolas
,
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Algorithmica
52
(1), 2008, pp. 19-43
Walrasian equilibrium: Hardness, approximations and tractable instances
Ning Chen
,
Atri Rudra
Algorithmica
52
(1), 2008, pp. 44-64
Truth-telling reservations
Fang Wu
,
Li Zhang
,
Bernardo Huberman
Algorithmica
52
(1), 2008, pp. 65-79
Club formation by rational sharing: Content, viability and community structure
W.-Y. Ng
,
D.M. Chiu
,
W.k. Lin
Algorithmica
52
(1), 2008, pp. 80-94
New algorithms for mining the reputation of participants of online auctions
Mikoƚaj Morzy
Algorithmica
52
(1), 2008, pp. 95-112
Algorithm engineering for color-coding with applications to signaling pathway detection
Falk Hüffner
,
Sebastian Wernicke
,
Thomas Zichner
Algorithmica
52
(2), 2008, pp. 114-132
Fixed-parameter complexity of minimum profile problems
Gregory Gutin
,
Stefan Szeider
,
Anders Yeo
Algorithmica
52
(2), 2008, pp. 133-152
Solving connected dominating set faster than
2^n
Fedor V. Fomin
,
Fabrizio Grandoni
,
Dieter Kratsch
Algorithmica
52
(2), 2008, pp. 153-166
Faster fixed-parameter tractable algorithms formatching and packing problems
M.R. Fellows
,
C. Knauer
,
N. Nishimura
,
P. Ragde
,
F. Rosamond
,
U. Stege
,
D.M. Thilikos
,
S. Whitesides
Algorithmica
52
(2), 2008, pp. 167-176
Improved algorithms and complexity results for power domination in graphs
Jiong Guo
,
Rolf Niedermeier
,
Daniel Raible
Algorithmica
52
(2), 2008, pp. 177-202
Short cycles make
W
-hard problems hard: FPT algorithms for
W
-hard problems in graphs with no short cycles
Venkatesh Raman
,
Saket Saurabh
Algorithmica
52
(2), 2008, pp. 203-225
Exact algorithms for exact satisfiability and number of perfect matchings
Andreas Björklund
,
Thore Husfeldt
Algorithmica
52
(2), 2008, pp. 226-249
An improved (and practical) parameterized algorithm for the Individual Haplotyping problem MFR with mate-pairs
Minzhu Xie
,
Jianxin Wang
Algorithmica
52
(2), 2008, pp. 250-266
On the parameterized complexity of layered graph drawing
Vida Dujmović
,
Michael R. Fellows
,
Matthew Kitching
,
Giuseppe Liotta
,
Catherine McCartin
,
Naomi Nishimura
,
Prabhakar Ragde
,
Frances Rosamond
,
Sue Whitesides
,
David R. Wood
Algorithmica
52
(2), 2008, pp. 267-292
On the minimum feedback vertex set problem: Exact and enumeration algorithms
Fedor V. Fomin
,
Serge Gaspers
,
Artem V. Pyatkin
,
Igor Razgon
Algorithmica
52
(2), 2008, pp. 293-307
Sorting and searching in faulty memories
Irene Finocchi
,
Giuseppe F. Italiano
Algorithmica
52
(3), 2008, pp. 309-332
An
{\~O}(m^2n)
algorithm for minimum cycle basis of graphs
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
,
Katarzyna E. Paluch
Algorithmica
52
(3), 2008, pp. 333-349
Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees andsuffix arrays
Dong Kyue Kim
,
Minhwan Kim
,
Heejin Park
Algorithmica
52
(3), 2008, pp. 350-377
Practical methods for shape fitting and kinetic data structures using coresets
Hai Yu
,
Pankaj K. Agarwal
,
Raghunath Poreddy
,
Kasturi R. Varadarajan
Algorithmica
52
(3), 2008, pp. 378-402
Optimality in external memory hashing
Morten Skaarup Jensen
,
Rasmus Pagh
Algorithmica
52
(3), 2008, pp. 403-411
Scheduling techniques for media-on-demand
Amotz Bar-Noy
,
Richard E. Ladner
,
Tami Tamir
Algorithmica
52
(4), 2008, pp. 413-439
Maximum induced matchings for chordal graphs in linear time
Andreas Brandstädt
,
Chính Hoàng
Algorithmica
52
(4), 2008, pp. 440-447
Testing planarity of geometric automorphisms in linear time
Christoph Buchheim
,
Seok-Hee Hong
Algorithmica
52
(4), 2008, pp. 448-465
Path hitting in acyclic graphs
Ojas Parekh
,
Danny Segev
Algorithmica
52
(4), 2008, pp. 466-486
Seiten 1
2
3
>