@article{Biro-McDermid/10,
AUTHOR = {Bir{\'o}, P{\'e}ter and McDermid, Eric},
TITLE = {Three-sided stable matchings with cyclic preferences},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {5-18},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/p124461628518266/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cechlarova-Fleiner/10,
AUTHOR = {Cechl{\'a}rov{\'a}, Katar{\'{i}}na and Fleiner, Tam{\'a}s},
TITLE = {Housing markets through graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {19-33},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/x02u79p18r671350/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cheng/10,
AUTHOR = {Cheng, Christine T.},
TITLE = {Understanding the generalized median stable matchings},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {34-51},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/214120126j812238/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dabney-Dean/10,
AUTHOR = {Dabney, John and Dean, Brian C.},
TITLE = {An efficient algorithm for batch stability testing},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {52-58},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/84up6577607t1035/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dean-Munshi/10,
AUTHOR = {Dean, Brian C. and Munshi, Siddharth},
TITLE = {Faster algorithms for stable allocation problems},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {59-81},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/m522297l328545p2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fleiner/10,
AUTHOR = {Fleiner, Tam{\'a}s},
TITLE = {The stable roommates problem with choice functions},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {82-101},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/n0418rvm6jl5t014/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Floreen-Kaski-Polishchuk-Suomela/10,
AUTHOR = {Flor{\'e}en, Patrik and Kaski, Petteri and Polishchuk, Valentin and Suomela, Jukka},
TITLE = {Almost stable matchings by truncating the Gale-Shapley algorithm},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {102-118},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/4241580658150007/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Garg-Kavitha-Kumar-Mehlhorn-Mestre/10,
AUTHOR = {Garg, Naveen and Kavitha, Telikepalli and Kumar, Amit and Mehlhorn, Kurt and Mestre, Juli{\'a}n},
TITLE = {Assigning papers to referees},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {119-136},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/0881397v227266xn/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Huang/10,
AUTHOR = {Huang, Chien-Chung},
TITLE = {Circular stable matching and 3-way kidney transplant},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {137-150},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/v034718324ln72l8/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kobayashi-Matsui/10,
AUTHOR = {Kobayashi, Hirotatsu and Matsui, Tomomi},
TITLE = {Cheating strategies for the Gale-Shapley algorithm with complete preference lists},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {151-169},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/a462760h1556w486/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Marx-Schlotter/10,
AUTHOR = {Marx, D{\'a}niel and Schlotter, Ildik{\'o}},
TITLE = {Parameterized complexity and local search approaches for the Stable Marriage problem with ties},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {170-187},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/l185645052r8r422/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wako/10,
AUTHOR = {Wako, Jun},
TITLE = {A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {1},
PAGES = {188-220},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/r53g6w38774qv5m4/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Douieb-Langerman/10,
AUTHOR = {Dou{\"{i}}eb, Karim and Langerman, Stefan},
TITLE = {Near-entropy hotlink assignments},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {221-244},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/p6236p4g2k76t51k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hassin-Monnot-Segev/10,
AUTHOR = {Hassin, Refael and Monnot, J{\'e}r{\^o}me and Segev, Danny},
TITLE = {The complexity of bottleneck labeled graph problems},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {245-262},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/87133640r5230060/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chan-Lam-Sung-Tam-Wong/10,
AUTHOR = {Chan, Ho-Leung and Lam, Tak-Wah and Sung, Wing-Kin and Tam, Siu-Lung and Wong, Swee-Seong},
TITLE = {Compressed indexes for approximate string matching},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {263-281},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g2l2476441261717/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bonizzoni-Della_Vedova-Dondi-Mauri/10,
AUTHOR = {Bonizzoni, Paola and Della Vedova, Gianluca and Dondi, Ricardo and Mauri, Giancarlo},
TITLE = {Fingerprint clustering with bounded number of missing values},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {282-303},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/2j4073x406p0365x/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gidenstam-Papatriantafilou-Tsigas/10,
AUTHOR = {Gidenstam, Anders and Papatriantafilou, Marina and Tsigas, Philippas},
TITLE = {{\sc NBmalloc}: Allocating memory in a lock-free manner},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {304-338},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/h712716072268q7k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lauther-Lukovszki/10,
AUTHOR = {Lauther, Ulrich and Lukovszki, Tam{\'a}s},
TITLE = {Space efficient algorithms for the Burrows-Wheeler backtransformation},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {339-351},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/e2l14q2n74r66x56/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Bereg-Daescu-Kaplan-Ntafos-Sharir-Zhu/10,
AUTHOR = {Agarwal, Pankaj K. and Bereg, Sergey and Daescu, Ovidiu and Kaplan, Haim and Ntafos, Simeon and Sharir, Micha and Zhu, Binhai},
TITLE = {Guarding a terrain by two watchtowers},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {352-390},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/nht17r1t8202178p/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Diedrich-Jansen-Pascual-Trystram/10,
AUTHOR = {Diedrich, Florian and Jansen, Klaus and Pascual, Fanny and Trystram, Enis},
TITLE = {Approximation algorithms for scheduling with reservations},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {391-404},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f048843775474n6w/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Crespelle-Paul/10,
AUTHOR = {Crespelle, Christophe and Paul, Christophe},
TITLE = {Fully dynamic algorithm for recognition and modular decomposition of permutation graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {405-432},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/u6x0054g3h348810/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hong-Nagamochi/10,
AUTHOR = {Hong, Seok-Hee and Nagamochi, Hiroshi},
TITLE = {A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {433-460},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/a4m6u8212133m027/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Albers/10,
AUTHOR = {Albers, Susanne},
TITLE = {New results on web caching with request reordering},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {461-477},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/70874v11544343x5/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hong-Nagamochi/10a,
AUTHOR = {Hong, Seok-Hee and Nagamochi, Hiroshi},
TITLE = {Approximation algorithms for minimizing edge crossings in radial drawings},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {478-497},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/93165w48676314lj/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chan-Chin-Ye-Zhang/10,
AUTHOR = {Chan, Joseph Wun-Tat and Chin, Francis Y.L. and Ye, Deshi and Zhang, Yong},
TITLE = {Absolute and asymptotic bounds for online frequency allocation in cellular networks},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {498-515},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/m67v503368163724/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Caragiannis-Ferreira-Kaklamanis-Perennes-Rivano/10,
AUTHOR = {Caragiannis, I. and Ferreira, A. and Kaklamanis, C. and P{\'e}rennes, S. and Rivano, H.},
TITLE = {Fractional path coloring in bounded degree trees with applications},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {2},
PAGES = {516-540},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/31217x18q4600003/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cabello-Haverkort-van_Kreveld-Speckmann/10,
AUTHOR = {Cabello, Sergio and Haverkort, Herman and van Kreveld, Marc and Speckmann, Bettina},
TITLE = {Algorithmic aspects of proportional symbol maps},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {543-565},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/x24h7011q682r058/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Grigorieva-Herings-Muller-Vermeulen/10,
AUTHOR = {Grigorieva, Elena and Herings, P. Jean-Jacques and M{\"u}ller, Rudolf and Vermeulen, Dries},
TITLE = {On the fastest Vickrey algorithm},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {566-590},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/2716749170431688/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Salmela-Tarhio-Kalsi/10,
AUTHOR = {Salmela, Leena and Tarhio, Jorma and Kalsi, Petri},
TITLE = {Approximate Boyer-Moore string matching for small alphabets},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {591-609},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/r65v8716t5x8003k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goraly-Hassin/10,
AUTHOR = {Goraly, Gilad and Hassin, Refael},
TITLE = {Multi-color pebble motion on graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {610-636},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/9052769666826586/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ibarra/10,
AUTHOR = {Ibarra, Louis},
TITLE = {A fully dynamic graph algorithm for recognizing interval graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {637-678},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/84v2t32857088n21/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Asdre-Nikolopoulos/10,
AUTHOR = {Asdre, Katerina and Nikolopoulos, Stavros D.},
TITLE = {The 1-fixed-endpoint path cover problem is polynomial on interval graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {679-710},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/7301255277nt6233/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Carmi-Farshi-Maheshwari-Smid/10,
AUTHOR = {Bose, Prosenjit and Carmi, Paz and Farshi, Mohammad and Maheshwari, Anil and Smid, Michiel},
TITLE = {Computing the greedy spanner in near-quadratic time},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {711-729},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/q03607t768066685/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fill-Nakama/10,
AUTHOR = {Fill, James Allen and Nakama, Tak{\'e}hiko},
TITLE = {Analysis of the expected number of bit comparisons required by Quickselect},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {730-769},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f100m6l02j218v75/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kowalik/10,
AUTHOR = {Kowalik, Lukasz},
TITLE = {Fast 3-coloring triangle-free planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {770-789},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/j84160277282np84/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dorn-Penninkx-Bodlaender-Fomin/10,
AUTHOR = {Dorn, Frederic and Penninkx, Eelko and Bodlaender, Hans L. and Fomin, Fedor V.},
TITLE = {Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {3},
PAGES = {790-810},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/9m8178n72663m733/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gonen-Ron/10,
AUTHOR = {Gonen, Mira and Ron, Dana},
TITLE = {On the benefits of adaptivity in property testing of dense graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {811-830},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/a33l81457q63127k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Barkol-Ishai-Weinreb/10,
AUTHOR = {Barkol, Omer and Ishai, Yuval and Weinreb, Enav},
TITLE = {On locally decodable codes, self-correctable codes, and $t$-private PIR},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {831-859},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/l215152635751020/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bayati-Kim-Saberi/10,
AUTHOR = {Bayati, Mohsen and Kim, Jeong Han and Saberi, Amin},
TITLE = {A sequential algorithm for generating random graphs},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {860-910},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/j63k05551wj67k5t/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Greenberg-Randall/10,
AUTHOR = {Greenberg, Sam and Randall, Dana},
TITLE = {Slow mixing of Markov chains using fault lines and fat contours},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {911-927},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/1268nh5407562m83/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Deng-Graham/10,
AUTHOR = {Deng, Xiaotie and Graham, Fan Chung},
TITLE = {Introduction to the special section on Internet and Network Economics},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {928-929},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/x33665v1r121759n/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Dimitrov-Sami-Reeves-Pennock-Hanson-Fortnow-Gonen/10,
AUTHOR = {Chen, Yiling and Dimitrov, Stanko and Sami, Rahul and Reeves, Daniel M. and Pennock, David M. and Hanson, Robin D. and Fortnow, Lance and Gonen, Rica},
TITLE = {Gaming prediction markets: Equilibrium strategies with a market maker},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {930-969},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/0w7111ug15735767/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bu-Liang-Qi/10,
AUTHOR = {Bu, Tian-Ming and Liang, Li and Qi, Qi},
TITLE = {On robustness of forward-looking in sponsored search auction},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {970-989},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/351263wn031gpw64/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Langford-Li-Vorobeychik-Wortman/10,
AUTHOR = {Langford, John and Li, Lihong and Vorobeychik, Yevgeniy and Wortman, Jennifer},
TITLE = {Maintaining equilibria during exploration in sponsored search auctions},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {990-1021},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/05858h6815009587/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Muthukrishnan-Pal-Svitkina/10,
AUTHOR = {Muthukrishnan, S. and P{\'a}l, Martin and Svitkina, Zoya},
TITLE = {Stochastic models for budget optimization in search-based advertising},
JOURNAL = {Algorithmica},
VOLUME = {58},
NUMBER = {4},
PAGES = {1022-1044},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/42k0021140937438/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Blunck-Vahrenhold/10,
AUTHOR = {Blunck, Henrik and Vahrenhold, Jan},
TITLE = {In-place algorithms for computing (layers of) maxima},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {1-21},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/136u88835728063l/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dragan-Yan/10,
AUTHOR = {Dragan, Feodor F. and Yan, Chenyu},
TITLE = {Collective tree spanners in graphs with bounded parameters},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {22-43},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/745204p67p41l344/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Attiya-Eppstein-Shachnai-Tamir/10,
AUTHOR = {Attiya, Hagit and Eppstein, Leah and Shachnai, Hadas and Tamir, Tami},
TITLE = {Transactional contention management as a non-clairvoyant scheduling problem},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {44-61},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/77216g344065q001/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pandurangan-Szpankowski/10,
AUTHOR = {Pandurangan, Gopal and Szpankowski, Wojciech},
TITLE = {A universal online caching algorithm based on pattern matching},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {62-73},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f67286v228118484/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hoang-Kaminski-Lozin-Sawada-Shu/10,
AUTHOR = {Ho{\`a}ng, Ch{\'{i}}nh T. and Kami{\'n}ski, Marcin and Lozin, Vadim and Sawada, Joe and Shu, Xiao},
TITLE = {Deciding $k$-colorability of $P_5$-free graphs in polynomial time},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {74-81},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/a27473768r2q0747/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Li-Mahdian-Mirrokni/10,
AUTHOR = {Li, Li (Erran) and Mahdian, Mohammad and Mirrokni, Vahab S.},
TITLE = {Secure overlay network design},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {82-96},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/n440222x47557802/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fernau/10,
AUTHOR = {Fernau, Henning},
TITLE = {A top-down approach to search-trees: Improved algorithmics for 3-HITTING SET},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {97-118},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/gr5p4301560v8213/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Auger-Teytaud/10,
AUTHOR = {Auger, Anne and Teytaud, Olivier},
TITLE = {Continuous lunches are free plus the design of optimal optimization algorithms},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {121-146},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/68277702711w1126/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Theile-Jansen/10,
AUTHOR = {Theile, Madeleine and Jansen, Thomas},
TITLE = {Stability in the self-organized evolution of networks},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {147-169},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/40864158n427j24j/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jansen-Weyland/10,
AUTHOR = {Jansen, Thomas and Weyland, Dennis},
TITLE = {Analysis of evolutionary algorithms for the longest common subsequence problem},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {170-186},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/j7px0061r6115082/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reichel-Skutella/10,
AUTHOR = {Reichel, Joachim and Skutella, Martin},
TITLE = {Evolutionary algorithms and matroid optimization problems},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {1},
PAGES = {187-206},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/q763r82706620367/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Balakrishnan-Bresar-Changat-Klavzar-Kovse-Subhamathi/10,
AUTHOR = {Balakrishnan, Kannan and Bre{\v{s}}ar, Bo{\v{s}}tjan and Changat, Manoj and Klav{\v{z}}ar, Sandi and Kov{\v{s}}e, Matja{\v{z}} and Subhamathi, Ajitha R.},
TITLE = {Computing median and antimedian sets in median graphs},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {207-216},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/p0158uu08331737j/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hung-Ting/10,
AUTHOR = {Hung, Regant Y.S. and Ting, Hing-Fung},
TITLE = {Design and analysis of online batching systems},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {217-231},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/y412200723m750g1/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lin-Yang-Xu/10,
AUTHOR = {Lin, Mingen and Yang, Yang and Xu, Jinhui},
TITLE = {Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {232-251},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/j548567611m83832/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Puerto-Rodriguez-Chia-Tamir/10,
AUTHOR = {Puerto, J. and Rodr{\'{i}}guez-Ch{\'{i}}a, A.M. and Tamir, A.},
TITLE = {On the planar piecewise quadratic 1-center problem},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {252-283},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/w8q355142084875r/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ailon/10,
AUTHOR = {Ailon, Nir},
TITLE = {Aggregation of partial rankings, $p$-ratings and top-$m$ lists},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {284-300},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/e107kx46508742v1/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fanelli-Flammini-Moscardelli/10,
AUTHOR = {Fanelli, Angelo and Flammini, Michele and Moscardelli, Luca},
TITLE = {On the convergence of multicast games in directed networks},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {301-324},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/d116rv42mw750813/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Akutsu-Fukagawa-Takasu/10,
AUTHOR = {Akutsu, Tatsuya and Fukagawa, Daiji and Takasu, Atsuhiro},
TITLE = {Approximating tree edit distance through string edit distance},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {325-348},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/n7w5101576057428/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Anderson-Hall-Hartline-Hobbes-Karlin-Saia-Swaminathan-Wilkes/10,
AUTHOR = {Anderson, E. and Hall, J. and Hartline, J. and Hobbes, M. and Karlin, A. and Saia, J. and Swaminathan, R. and Wilkes, J.},
TITLE = {Algorithms for data migration},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {349-380},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/4103328163215678/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhang/10,
AUTHOR = {Zhang, Huaming},
TITLE = {Planar polyline drawings via graph transformations},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {381-397},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/b717p39303n640v3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cai-Huang/10,
AUTHOR = {Cai, Liming and Huang, Xiuzhen},
TITLE = {Fixed-parameter approximation: Conceptual framework and approximability results},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {398-412},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/37685n235g445000/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kovacs/10,
AUTHOR = {Kov{\'a}cs, Annam{\'a}ria},
TITLE = {New approximation bounds for LPT scheduling},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {2},
PAGES = {413-433},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/c24l83x06x8l6373/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bekos-Kaufmann-Nollenburg-Symvonis/10,
AUTHOR = {Bekos, Michael A. and Kaufmann, Michael and N{\"o}llenburg, Martin and Symvonis, Antonios},
TITLE = {Boundary labeling with octilinear leaders},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {436-461},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/h251ux33570k787j/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Demaine-Langerman-Price/10,
AUTHOR = {Demaine, Erik D. and Langerman, Stefan and Price, Eric},
TITLE = {Confluently persistent tries for efficient version control},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {462-483},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/l7863675409m6135/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gibson-Kanade-Krohn-Pirwani-Varadarajan/10,
AUTHOR = {Gibson, Matt and Kanade, Gaurav and Krohn, Erik and Pirwani, Imran A. and Varadarajan, Kasturi},
TITLE = {On metric clustering to minimize the sum of radii},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {484-498},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/q10584218162k1l3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Christ-Hoffmann-Okamoto-Uno/10,
AUTHOR = {Christ, Tobias and Hoffmann, Michael and Okamoto, Yoshio and Uno, Takeaki},
TITLE = {Improved bounds for wireless localization},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {499-516},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/h5u20n61343286v6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Azar-Feige-Glasner/10,
AUTHOR = {Azar, Yossi and Feige, Uriel and Glasner, Daniel},
TITLE = {A preemptive algorithm for maximizing disjoint paths on trees},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {517-537},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/9v76571054611315/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bereg-Dumitrescu-Jiang/10,
AUTHOR = {Bereg, Sergey and Dumitrescu, Adrian and Jiang, Minghui},
TITLE = {On covering problems of Rado},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {538-561},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/7715880230g15161/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Degener-Gehweiler-Lammersen/10,
AUTHOR = {Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane},
TITLE = {Kinetic facility location},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {3},
PAGES = {562-584},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/341q657424x70uq2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Navarro-Paredes/10,
AUTHOR = {Navarro, Gonzalo and Paredes, Rodrigo},
TITLE = {On sorting, heaps, and minimum spanning trees},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {585-620},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/20220n883l830807/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Damaschke/10,
AUTHOR = {Damaschke, Peter},
TITLE = {Homogeneous string segmentation using trees and weighted independent sets},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {621-640},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/26885n612562227k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Korman-Peleg-Rodeh/10,
AUTHOR = {Korman, Amos and Peleg, David and Rodeh, Yoav},
TITLE = {Constructing labeling schemes through universal matrices},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {641-652},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/r534436772wp3080/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kontogiannis-Spirakis/10,
AUTHOR = {Kontogiannis, Spyros C. and Spirakis, Paul G.},
TITLE = {Well supported approximate equilibria in bimatrix games},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {653-667},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/e303042j8n5q2637/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Derungs-Jacob-Widmayer/10,
AUTHOR = {Derungs, J{\"o}rg and Jacob, Riko and Widmayer, Peter},
TITLE = {Approximate shortest paths guided by a small index},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {668-688},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g406771u5412474p/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Benoit-Robert/10,
AUTHOR = {Benoit, Anne and Robert, Yves},
TITLE = {Complexity results for throughput and latency optimization of replicated and data-parallel workflows},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {689-724},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/4261m87v06641365/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Albers-Jacobs/10,
AUTHOR = {Albers, Susanne and Jacobs, Tobias},
TITLE = {An experimental study of new and known online packet buffering algorithms},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {725-746},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/w7778tj522465069/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Marx/10,
AUTHOR = {Marx, D{\'a}niel},
TITLE = {Chordal deletion is fixed-parameter tractable},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {747-768},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/j208148mu11722r9/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kellerer-Strusevich/10,
AUTHOR = {Kellerer, Hans and Strusevich, Vitaly A.},
TITLE = {Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {769-795},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/t8wh60721213g678/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Di_Giacomo-Liotta-Trotta/10,
AUTHOR = {Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco},
TITLE = {Drawing colored graphs with constrained vertex positions and few bends per edge},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {796-818},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/85k8641573836vhj/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Boyar-Favrholdt/10,
AUTHOR = {Boyar, Joan and Favrholdt, Lene M.},
TITLE = {Scheduling jobs on grid processors},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {819-847},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/v70272410t217142/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Khuller-Kim-Wan/10,
AUTHOR = {Khuller, Samir and Kim, Yoo-Ah and Wan, Yung-Chun Justin},
TITLE = {Broadcasting on networks of workstations},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {848-868},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/am8k66n7w674x775/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Innami-Kim-Mashiko-Shiohama/10,
AUTHOR = {Innami, N. and Kim, B.H. and Mashiko, Y. and Shiohama, K.},
TITLE = {The Steiner ratio conjecture of Gilbert-Pollak may still be open},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {869-872},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/xgk728231g1r8273/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cho-Goel/10,
AUTHOR = {Cho, Sung-woo and Goel, Ashish},
TITLE = {Pricing for fairness: Distributed resource allocation for multiple objectives},
JOURNAL = {Algorithmica},
VOLUME = {57},
NUMBER = {4},
PAGES = {873-892},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/w373t5285n345327/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Uno/10,
AUTHOR = {Uno, Takeaki},
TITLE = {An efficient algorithm for solving pseudo clique enumeration problem},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {1},
PAGES = {3-16},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/r8042374752h9619/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nagamochi/10,
AUTHOR = {Nagamochi, Hiroshi},
TITLE = {Minimum degree orderings},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {1},
PAGES = {17-34},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/th4751538p15p856/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Urbanska/10,
AUTHOR = {Urba{\'n}ska, Anna},
TITLE = {Faster combinatorial algorithms for determinant and Pfaffian},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {1},
PAGES = {35-50},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/3271w821kg876048/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sauerwald/10,
AUTHOR = {Sauerwald, Thomas},
TITLE = {On mixing and edge expansion properties in randomized broadcasting},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {1},
PAGES = {51-88},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/m52650253874k328/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chin-Ting-Zhang/10,
AUTHOR = {Chin, F.Y.L. and Ting, H.F. and Zhang, Y.},
TITLE = {A constant-competitive algorithm for online OVSF code assignment},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {1},
PAGES = {89-104},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/53u85793q4652u07/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rahman-Munro/10,
AUTHOR = {Rahman, M. Ziaur and Munro, J. Ian},
TITLE = {Integer representation and counting in the bit probe model},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {1},
PAGES = {105-127},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/y3x225w513w47131/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chandran-Francis-Sivadasan/10,
AUTHOR = {Chandran, L. Sunil and Francis, Mathew C. and Sivadasan, Naveen},
TITLE = {Geometric representation of graphs in low dimension using axis parallel boxes},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {129-140},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/xg6530687kq08w36/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Broutin-Devroye-McLeish/10,
AUTHOR = {Broutin, Nicolas and Devroye, Luc and McLeish, Erin},
TITLE = {Note on the structure of Kruskal's algorithm},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {141-159},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f4t1m2j2v32rn701/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Garcia-Hurtado-Noy-Tejel/10,
AUTHOR = {Garc{\'{i}}a, A. and Hurtado, F. and Noy, M. and Tejel, J.},
TITLE = {Augmenting the connectivity of outerplanar graphs},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {160-179},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/pg567082888m2384/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sankowski-Mucha/10,
AUTHOR = {Sankowski, Piotr and Mucha, Marcin},
TITLE = {Fast dynamic transitive closure with lookahead},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {180-197},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/1q86442762411268/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nagarajan-Ravi/10,
AUTHOR = {Nagarajan, Viswanath and Ravi, R.},
TITLE = {Approximation algorithms for requirement cut on graphs},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {198-213},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/u1lt51w30643k33x/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amir-Chencinski/10,
AUTHOR = {Amir, Amihood and Chencinski, Eran},
TITLE = {Faster two dimensional scaled matching},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {214-234},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/b18480573h3m11h3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Loffler-van_Kreveld/10,
AUTHOR = {L{\"o}ffler, Maarten and van Kreveld, M.},
TITLE = {Largest and smallest convex hulls for imprecise points},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {235-269},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/3164353m7t2w3444/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bansal-Lewenstein-Ma-Zhang/10,
AUTHOR = {Bansal, Nikhil and Lewenstein, Moshe and Ma, Bin and Zhang, Kaizhong},
TITLE = {On the longest common rigid subsequence problem},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {2},
PAGES = {270-280},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/k8u3288317379655/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hu-Wang/10,
AUTHOR = {Hu, Xiaodong and Wang, Jie},
TITLE = {Recent advances in computation and combinatorial optimization},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {281-282},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/a33403411383x116/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wang-Xie-Chen/10,
AUTHOR = {Wang, Jianxin and Xie, Minzhu and Chen, Jianer},
TITLE = {A practical exact algorithm for the individual haplotyping problem MEC/GI},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {283-296},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/a41m576775130788/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yeh-Wang-Su/10,
AUTHOR = {Yeh, Li-Pu and Wang, Biing-Feng and Su, Hsin-Hao},
TITLE = {Efficient algorithms for the problems of enumerating cuts by non-decreasing weights},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {297-312},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/91560l8812505456/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fritzilas-Milanic-Rahmann-Rios-Solis/10,
AUTHOR = {Fritzilas, Epameinondas and Milani{\v{c}}, Martin and Rahmann, S. and Rios-Solis, Yasmin A.},
TITLE = {Structural identifiability in low-rank matrix factorization},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {313-332},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g8n812106108h884/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Li-Zou-Huang-Kim-Wu/10,
AUTHOR = {Li, Xianyue and Zou, Feng and Huang, Yaochun and Kim, Donghyun and Wu, Weili},
TITLE = {A better constant-factor approximation for selected-internal Steiner minimum tree},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {333-341},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g282302143390450/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hertrampf-Minnameier/10,
AUTHOR = {Hertrampf, Ulrich and Minnameier, Christoph},
TITLE = {Resource bounded frequency computations with three errors},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {342-363},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/uw536h0650861663/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Sun-Teng/10,
AUTHOR = {Chen, Xi and Sun, Xiamoming and Teng, Shang-Hua},
TITLE = {Quantum separation of local search and fixed point computation},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {3},
PAGES = {364-382},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/ku315w913813v024/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brandstadt-Klembt-Lozin-Mosca/10,
AUTHOR = {Brandst{\"a}dt, Andreas and Klembt, Tilo and Lozin, Vadim V. and Mosca, Raffaele},
TITLE = {On independent vertex sets in subclasses of apple-free graphs},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {383-393},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/9482r8674214lw06/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kolmogorov/10,
AUTHOR = {Kolmogorov, Vladimir},
TITLE = {A faster algorithm for computing the principal sequence of partitions of a graph},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {394-412},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/c664107324287w15/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ishii-Akiyama-Nagamochi/10,
AUTHOR = {Ishii, Toshimasa and Akiyama, Yoko and Nagamochi, Hiroshi},
TITLE = {Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {413-436},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/4qw4537483377025/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Iwata-Kobayashi/10,
AUTHOR = {Iwata, Satoru and Kobayashi, Yusuke},
TITLE = {An algorithm for minimum cost arc-connectivity orientations},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {437-447},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/v24771vqv4m30u38/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amir/10,
AUTHOR = {Amir, Eyal},
TITLE = {Approximation algorithms for treewidth},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {448-479},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/e7727mm27753uq7p/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sahu-Reif/10,
AUTHOR = {Sahu, Sudheer and Reif, John H.},
TITLE = {Capabilities and limits of compact error resilience methods for algorithmic self-assembly},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {480-504},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/gv702u1267jp4216/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Epstein/10,
AUTHOR = {Epstein, Leah},
TITLE = {Bin packing with rejection revisited},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {505-528},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/m13141030045447r/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Segev-Segev/10,
AUTHOR = {Segev, Danny and Segev, Gil},
TITLE = {Approximate $k$-Steiner forests via the Lagrangian relaxation technique with internal preprocessing},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {529-549},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/8r55k1u372671224/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fernandez-Jimenez-Raynal-Tredan/10,
AUTHOR = {Fern{\'a}ndez, Antonio and Jim{\'e}nez, Ernesto and Raynal, Michel and Tr{\'e}dan, Gilles},
TITLE = {A timing assumption and two $t$-resilient protocols for implementing an eventual leader service in asynchronous shared memory systems},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {550-576},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f73v061242r812n3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Charikar-Hajiaghayi-Karloff-Rao/10,
AUTHOR = {Charikar, Moses and Hajiaghayi, Mohammad Taghi and Karloff, Howard and Rao, Satish},
TITLE = {$\l_2^2$ spreading metrics for vertex ordering problems},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {577-604},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/n57m564633546777/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Studholme-Blake/10,
AUTHOR = {Studholme, Chris and Blake, Ian F.},
TITLE = {Random matrices and codes for the erasure channel},
JOURNAL = {Algorithmica},
VOLUME = {56},
NUMBER = {4},
PAGES = {605-620},
YEAR = {2010},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/9m7k735740152772/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}