Volume 52,
Number 1,
September 2008
- Xiaotie Deng, Yinyu Ye:
Preface.
1-2
- Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta:
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
3-18
- Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
19-43
- Ning Chen, Atri Rudra:
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.
44-64
- Fang Wu, Li Zhang, Bernardo A. Huberman:
Truth-Telling Reservations.
65-79
- W.-Y. Ng, D. M. Chiu, W. K. Lin:
Club Formation by Rational Sharing: Content, Viability and Community Structure.
80-94
- Mikolaj Morzy:
New Algorithms for Mining the Reputation of Participants of Online Auctions.
95-112
Volume 52,
Number 2,
October 2008
Parameterized and Exact Algorithms
- Jianer Chen, Iyad A. Kanj:
Foreword from the Guest Editors.
113
- Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection.
114-132
- Gregory Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems.
133-152
- Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Solving Connected Dominating Set Faster than 2 n .
153-166
- Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
167-176
- Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs.
177-202
- Venkatesh Raman, Saket Saurabh:
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.
203-225
- Andreas Björklund, Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
226-249
- Minzhu Xie, Jianxin Wang:
An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs.
250-266
- Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing.
267-292
- Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon:
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
293-307
Volume 52,
Number 3,
November 2008
- Irene Finocchi, Giuseppe F. Italiano:
Sorting and Searching in Faulty Memories.
309-332
- Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
333-349
- Dong Kyue Kim, Minhwan Kim, Heejin Park:
Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays.
350-377
- Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan:
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets.
378-402
- Morten Skaarup Jensen, Rasmus Pagh:
Optimality in External Memory Hashing.
403-411
Volume 52,
Number 4,
December 2008
Copyright © Sat Nov 21 00:59:45 2009
by Michael Ley (ley@uni-trier.de)
