@article{Khot-Lipton-Markakis-Mehta/08,
AUTHOR = {Khot, Subhash and Lipton, Richard and Markakis, Evangelos and Mehta, Aranyak},
TITLE = {Inapproximability results for combinatorial auctions with submodular utility functions},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {1},
PAGES = {3-18},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9105-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mavronicolas-Panagopoulou-Spirakis/08,
AUTHOR = {Mavronicolas, Marios and Panagopoulou, Panagiota N. and Spirakis, Paul G.},
TITLE = {Cost sharing mechanisms for fair pricing of resource usage},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {1},
PAGES = {19-43},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9108-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Rudra/08,
AUTHOR = {Chen, Ning and Rudra, Atri},
TITLE = {Walrasian equilibrium: Hardness, approximations and tractable instances},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {1},
PAGES = {44-64},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9103-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wu-Zhang-Huberman/08,
AUTHOR = {Wu, Fang and Zhang, Li and Huberman, Bernardo},
TITLE = {Truth-telling reservations},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {1},
PAGES = {65-79},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9107-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ng-Chiu-Lin/08,
AUTHOR = {Ng, W.-Y. and Chiu, D.M. and Lin, W.k.},
TITLE = {Club formation by rational sharing: Content, viability and community structure},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {1},
PAGES = {80-94},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9110-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Morzy/08,
AUTHOR = {Morzy, Miko{\l}aj},
TITLE = {New algorithms for mining the reputation of participants of online auctions},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {1},
PAGES = {95-112},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9106-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Huffner-Wernicke-Zichner/08,
AUTHOR = {H{\"u}ffner, Falk and Wernicke, Sebastian and Zichner, Thomas},
TITLE = {Algorithm engineering for color-coding with applications to signaling pathway detection},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {114-132},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9008-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gutin-Szeider-Yeo/08,
AUTHOR = {Gutin, Gregory and Szeider, Stefan and Yeo, Anders},
TITLE = {Fixed-parameter complexity of minimum profile problems},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {133-152},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9144-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Grandoni-Kratsch/08,
AUTHOR = {Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter},
TITLE = {Solving connected dominating set faster than $2^n$},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {153-166},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9145-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fellows-Knauer-Nishimura-Ragde-Rosamond-Stege-Thilikos-Whitesides/08,
AUTHOR = {Fellows, M.R. and Knauer, C. and Nishimura, N. and Ragde, P. and Rosamond, F. and Stege, U. and Thilikos, D.M. and Whitesides, S.},
TITLE = {Faster fixed-parameter tractable algorithms formatching and packing problems},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {167-176},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9146-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guo-Niedermeier-Raible/08,
AUTHOR = {Guo, Jiong and Niedermeier, Rolf and Raible, Daniel},
TITLE = {Improved algorithms and complexity results for power domination in graphs},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {177-202},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9147-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Raman-Saurabh/08,
AUTHOR = {Raman, Venkatesh and Saurabh, Saket},
TITLE = {Short cycles make $W$-hard problems hard: FPT algorithms for $W$-hard problems in graphs with no short cycles},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {203-225},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9148-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bjorklund-Husfeldt/08,
AUTHOR = {Bj{\"o}rklund, Andreas and Husfeldt, Thore},
TITLE = {Exact algorithms for exact satisfiability and number of perfect matchings},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {226-249},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9149-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Xie-Wang/08,
AUTHOR = {Xie, Minzhu and Wang, Jianxin},
TITLE = {An improved (and practical) parameterized algorithm for the Individual Haplotyping problem MFR with mate-pairs},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {250-266},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9150-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dujmovic-Fellows-Kitching-Liotta-McCartin-Nishimura-Ragde-Rosamond-Whitesides-Wood/08,
AUTHOR = {Dujmovi{\'c}, Vida and Fellows, Michael R. and Kitching, Matthew and Liotta, Giuseppe and McCartin, Catherine and Nishimura, Naomi and Ragde, Prabhakar and Rosamond, Frances and Whitesides, Sue and Wood, David R.},
TITLE = {On the parameterized complexity of layered graph drawing},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {267-292},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9151-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Gaspers-Pyatkin-Razgon/08,
AUTHOR = {Fomin, Fedor V. and Gaspers, Serge and Pyatkin, Artem V. and Razgon, Igor},
TITLE = {On the minimum feedback vertex set problem: Exact and enumeration algorithms},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {2},
PAGES = {293-307},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9152-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Finocchi-Italiano/08,
AUTHOR = {Finocchi, Irene and Italiano, Giuseppe F.},
TITLE = {Sorting and searching in faulty memories},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {3},
PAGES = {309-332},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9088-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kavitha-Mehlhorn-Michail-Paluch/08,
AUTHOR = {Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna E.},
TITLE = {An ${\~O}(m^2n)$ algorithm for minimum cycle basis of graphs},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {3},
PAGES = {333-349},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9064-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kim-Kim-Park/08,
AUTHOR = {Kim, Dong Kyue and Kim, Minhwan and Park, Heejin},
TITLE = {Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees andsuffix arrays},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {3},
PAGES = {350-377},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9061-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yu-Agarwal-Poreddy-Varadarajan/08,
AUTHOR = {Yu, Hai and Agarwal, Pankaj K. and Poreddy, Raghunath and Varadarajan, Kasturi R.},
TITLE = {Practical methods for shape fitting and kinetic data structures using coresets},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {3},
PAGES = {378-402},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9067-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jensen-Pagh/08,
AUTHOR = {Jensen, Morten Skaarup and Pagh, Rasmus},
TITLE = {Optimality in external memory hashing},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {3},
PAGES = {403-411},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9155-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bar-Noy-Ladner-Tamir/08,
AUTHOR = {Bar-Noy, Amotz and Ladner, Richard E. and Tamir, Tami},
TITLE = {Scheduling techniques for media-on-demand},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {4},
PAGES = {413-439},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9052-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brandstadt-Hoang/08,
AUTHOR = {Brandst{\"a}dt, Andreas and Ho{\`a}ng, Ch{\'{i}}nh},
TITLE = {Maximum induced matchings for chordal graphs in linear time},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {4},
PAGES = {440-447},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9045-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Buchheim-Hong/08,
AUTHOR = {Buchheim, Christoph and Hong, Seok-Hee},
TITLE = {Testing planarity of geometric automorphisms in linear time},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {4},
PAGES = {448-465},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9050-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Parekh-Segev/08,
AUTHOR = {Parekh, Ojas and Segev, Danny},
TITLE = {Path hitting in acyclic graphs},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {4},
PAGES = {466-486},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9087-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kothari-Suri-Zhou/08,
AUTHOR = {Kothari, Anshul and Suri, Subhash and Zhou, Yunhong},
TITLE = {Bandwidth-constrained allocation in grid computing},
JOURNAL = {Algorithmica},
VOLUME = {52},
NUMBER = {4},
PAGES = {487-501},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9085-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}