@article{Cohen-Fraigniaud-Ilcinkas-Korman-Peleg/09,
AUTHOR = {Cohen, Reuven and Fraigniaud, Pierre and Ilcinkas, David and Korman, Amos and Peleg, David},
TITLE = {Labeling schemes for tree representation},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {1-15},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9089-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berman-Jeong/09,
AUTHOR = {Berman, Piotr and Jeong, Jieun},
TITLE = {Consistent sets of secondary structures in proteins},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {16-34},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9068-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Soares-Stefanes/09,
AUTHOR = {Soares, Jos{\'e} and Stefanes, Marco A.},
TITLE = {Algorithms for maximum independent set in convex bipartite graphs},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {35-49},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9006-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arge-de_Berg-Haverkort/09,
AUTHOR = {Arge, Lars and de Berg, Mark and Haverkort, Herman},
TITLE = {Cache-oblivious R-trees},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {50-68},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9007-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Manthey-Ram/09,
AUTHOR = {Manthey, Bodo and Ram, L. Shankar},
TITLE = {Approximation algorithms for multi-criteria Traveling Salesman Problems},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {69-88},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9011-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hajiaghayi-Kortsarz-Salavatipour/09,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kortsarz, Guy and Salavatipour, Mohammad R.},
TITLE = {Approximating buy-at-bulk and shallow-light $k$-Steiner trees},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {89-103},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9013-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hoefer/09,
AUTHOR = {Hoefer, Martin},
TITLE = {Non-cooperative tree creation},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {104-131},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9014-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karakostas-Kolliopoulos/09,
AUTHOR = {Karakostas, George and Kolliopoulos, Stavros G.},
TITLE = {Stackelberg strategies for selfish routing in general multicommodity networks},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {1},
PAGES = {132-153},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9018-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bereg-Daescu-Jiang/09,
AUTHOR = {Bereg, Sergey and Daescu, Ovidiu and Jiang, Minghui},
TITLE = {A PTAS for cutting out polygons with lines},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {2},
PAGES = {157-171},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9182-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chan-Wong-Yung/09,
AUTHOR = {Chan, Joseph Wun-Tat and Wong, Prudence W.H. and Yung, Fencol C.C.},
TITLE = {On dynamic bin packing: An improved lower bound and resource augmentation analysis},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {2},
PAGES = {172-206},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9185-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nagamochi/09,
AUTHOR = {Nagamochi, Hiroshi},
TITLE = {A detachment algorithm for inferring a graph from path frequency},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {2},
PAGES = {207-224},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9184-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karakostas-Kolliopoulos/09a,
AUTHOR = {Karakostas, George and Kolliopoulos, Stavros G.},
TITLE = {Edge pricing of multicommodity networks for selfish users with elastic demands},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {2},
PAGES = {225-249},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9181-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Deng/09,
AUTHOR = {Chen, Xi and Deng, Xiaotie},
TITLE = {A simplicial approach for discrete fixed point theorems},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {2},
PAGES = {250-262},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9183-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Chen/09,
AUTHOR = {Chen, Xujin and Chen, Bo},
TITLE = {Approximation algorithms for soft-capacitated facility location in capacitated network design},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {263-297},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9032-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lee-Lin-Lu/09,
AUTHOR = {Lee, D.T. and Lin, Tien-Ching and Lu, Hsueh-I},
TITLE = {Fast algorithms for the density finding problem},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {298-313},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9023-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amir-Butman-Lewenstein-Porat/09,
AUTHOR = {Amir, Amihood and Butman, Ayelet and Lewenstein, Moshe and Porat, Ely},
TITLE = {Real two dimensional scaled matching},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {314-336},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9021-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arpe-Manthey/09,
AUTHOR = {Arpe, Jan and Manthey, Bodo},
TITLE = {Approximability of minimum AND-circuits},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {337-357},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9039-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Fraigniaud-Nisse/09,
AUTHOR = {Fomin, Fedor V. and Fraigniaud, Pierre and Nisse, Nicolas},
TITLE = {Nondeterministic graph searching: From pathwidth to treewidth},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {358-373},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9041-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Seiferas/09,
AUTHOR = {Seiferas, Joel},
TITLE = {Sorting networks of logarithmic depth, further simplified},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {374-384},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9025-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Epstein-Erlebach-Levin/09,
AUTHOR = {Epstein, Leah and Erlebach, Thomas and Levin, Asaf},
TITLE = {Variable sized online interval coloring with bandwidth},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {385-401},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9071-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rizzi/09,
AUTHOR = {Rizzi, Romeo},
TITLE = {Minimum weakly fundamental cycle bases are hard to find},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {402-424},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9112-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Liu-Kuo-Wang/09,
AUTHOR = {Liu, Pangfeng and Kuo, May-Chen and Wang, Da-Wei},
TITLE = {An approximation algorithm and dynamic programming for reduction in heterogeneous environments},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {3},
PAGES = {425-453},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9113-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Abam-de_Berg-Poon-Speckmann/09,
AUTHOR = {Abam, Mohammad Ali and de Berg, Mark and Poon, Sheung-Hung and Speckmann, Bettina},
TITLE = {Kinetic collision detection for convex fat objects},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {457-473},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9019-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Afshani-Chan/09,
AUTHOR = {Afshani, Peyman and Chan, Timothy M.},
TITLE = {Dynamic connectivity for axis-parallel rectangles},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {474-487},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9234-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ambuhl-Mastrolilli/09,
AUTHOR = {Amb{\"u}hl, Christoph and Mastrolilli, Monaldo},
TITLE = {Single machine precedence constrained scheduling is avertex cover problem},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {488-503},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9251-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ebenlendr-Jawor-Sgall/09,
AUTHOR = {Ebenlendr, Tom{\'a}{\v{s}} and Jawor, Wojciech and Sgall, Ji{\v{r}}{\'{i}}},
TITLE = {Preemptive online scheduling: Optimal algorithms forall speeds},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {504-522},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9235-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Englert-Westermann/09,
AUTHOR = {Englert, Matthias and Westermann, Matthias},
TITLE = {Lower and upper bounds on FIFO buffer management in QoS switches},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {523-548},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9236-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ganguly-Bhuvanagiri/09,
AUTHOR = {Ganguly, Sumit and Bhuvanagiri, Lakshminath},
TITLE = {Hierarchical sampling from sketches: Estimating functions over data streams},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {549-582},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9260-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eisenbrand-Karrenbauer-Skutella-Xu/09,
AUTHOR = {Eisenbrand, Friedrich and Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao},
TITLE = {Multiline addressing by network flow},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {583-596},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9252-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ferraro-Petrillo-Finocchi-Italiano/09,
AUTHOR = {Ferraro-Petrillo, Umberto and Finocchi, Irene and Italiano, Giuseppe F.},
TITLE = {The price of resiliency: A case study on sorting with memory faults},
JOURNAL = {Algorithmica},
VOLUME = {53},
NUMBER = {4},
PAGES = {597-620},
YEAR = {2009},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-008-9264-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}