@article{Bhattacharya-Kameda-Song/14,
AUTHOR = {Bhattacharya, Binay and Kameda, Tsunehiko and Song, Zhao},
TITLE = {A linear time algorithm for computing minmax regret 1-median on a tree network},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {2-21},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9851-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jaiswal-Kumar-Sen/14,
AUTHOR = {Jaiswal, Ragesh and Kumar, Amit and Sen, Sandeep},
TITLE = {A simple $D^2$-sampling based PTAS for $k$-means and other clustering problems},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {22-46},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9833-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Kabanets-Kinne/14,
AUTHOR = {Chen, Ruiwen and Kabanets, Valentine and Kinne, Jeff},
TITLE = {Lower bounds against weakly-uniform threshold circuits},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {47-75},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9823-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Han-Kawase-Makino/14,
AUTHOR = {Han, Xin and Kawase, Yasushi and Makino, Kazuhisa},
TITLE = {Online unweighted knapsack problem with removal cost},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {76-91},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9822-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bianchi-Bockenhauer-Hromkovic-Keller/14,
AUTHOR = {Bianchi, Maria Paola and B{\"o}ckenhauer, Hans-Joachim and Hromkovi{\v{c}}, Juraj and Keller, Lucia},
TITLE = {Online coloring of bipartite graphs with and without advice},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {92-111},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9819-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Aichholzer-Korman-Pilz-Vogtenhuber/14,
AUTHOR = {Aichholzer, Oswin and Korman, Matias and Pilz, Alexander and Vogtenhuber, Birgit},
TITLE = {Geodesic order types},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {112-128},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9818-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{van_Bevern/14,
AUTHOR = {van Bevern, Ren{\'e}},
TITLE = {Towards optimal and expressive kernelization for $d$-hitting set},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {1},
PAGES = {129-147},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9774-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ahn-Bae-Cheong-Gudmundsson-Tokuyama-Vigneron/14,
AUTHOR = {Ahn, Hee-Kap and Bae, Sang Won and Cheong, Otfried and Gudmundsson, Joachim and Tokuyama, Takeshi and Vigneron, Antoine},
TITLE = {A generalization of the convex Kakeya problem},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {152-170},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9831-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Castaneda-Herlihy-Rajsbaum/14,
AUTHOR = {Casta{\~n}eda, Armando and Herlihy, Maurice and Rajsbaum, Sergio},
TITLE = {An equivariance theorem with applications to renaming},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {171-194},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9855-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cygan-Pilipczuk-Pilipczuk-Wojtaszczyk/14a,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin and Pilipczuk, Micha{\l} and Wojtaszczyk, Jakub Onufry},
TITLE = {Solving the 2-disjoint connected subgraphs problem faster than $2^n$},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {195-207},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9796-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dadusch/14,
AUTHOR = {Dadusch, Daniel},
TITLE = {A randomized sieving algorithm for approximate integer programming},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {208-244},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9834-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Habib-Mamcarz-de_Montgolfier/14,
AUTHOR = {Habib, Michel and Mamcarz, Antoine and de Montgolfier, Fabien},
TITLE = {Computing $H$-joins with application to 2-modular decomposition},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {245-266},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9820-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Helmi-Martinez-Panholzer/14,
AUTHOR = {Helmi, Ahmed and Mart{\'{i}}nez, Conrado and Panholzer, Alois},
TITLE = {Analysis of the strategy ``Hiring Above the TeX-th Best Candidate''},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {267-300},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9895-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mans-Shparlinski/14,
AUTHOR = {Mans, Bernard and Shparlinski, Igor},
TITLE = {Random walks, bisections and gossiping in circulant graphs},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {301-325},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9810-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mastrolilli/14,
AUTHOR = {Mastrolilli, Monaldo},
TITLE = {The Feedback Arc Set problem with triangle inequality is a vertex cover problem},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {326-339},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9811-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nutov/14,
AUTHOR = {Nutov, Zeev},
TITLE = {Degree constrained node-connectivity problems},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {2},
PAGES = {340-364},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9849-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chang-Gabow-Khuller/14,
AUTHOR = {Chang, Jessica and Gabow, Harold N. and Khuller, Samir},
TITLE = {A model for minimizing active processor time},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {368-405},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9807-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Boissonnat-Maria/14,
AUTHOR = {Boissonnat, Jean-Daniel and Maria, Cl{\'e}ment},
TITLE = {The simplex tree: An efficient data structure for general simplicial complexes},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {406-427},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9887-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Aumuller-Dietzfelbinger-Woelfel/14,
AUTHOR = {Aum{\"u}ller, Martin and Dietzfelbinger, Martin and Woelfel, Philipp},
TITLE = {Explicit and efficient hash families suffice for cuckoo hashing with a stash},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {428-456},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9840-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chatterjee-Henzinger-Krinninger-Nanongkai/14,
AUTHOR = {Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon},
TITLE = {Polynomial-time algorithms for energy games with special weight structures},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {457-492},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9843-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Harks-Peis/14,
AUTHOR = {Harks, Tobias and Peis, Britta},
TITLE = {Resource buying games},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {493-512},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9876-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hermelin-Mnich-van_Leeuwen/14,
AUTHOR = {Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan},
TITLE = {Parameterized complexity of induced graph matching on claw-free graphs},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {513-560},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9877-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Laekhanukit-Vetta-Wilfong/14,
AUTHOR = {Laekhanukit, Bundit and Vetta, Adrian and Wilfong, Gordon},
TITLE = {Routing regardless of network stability},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {3},
PAGES = {561-593},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9908-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berman-DasGupta-Kaligounder-Karpinski/14,
AUTHOR = {Berman, Piotr and DasGupta, Bhaskar and Kaligounder, Lakshmi and Karpinski, Marek},
TITLE = {On the computational complexity of measuring global stability of banking networks},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {595-647},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9769-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Koufogiannakis-Young/14,
AUTHOR = {Koufogiannakis, Christos and Young, Neal E.},
TITLE = {A nearly linear-time PTAS for explicit fractional packing and covering linear programs},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {648-674},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9771-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Christodoulou-Ligett-Pyrga/14,
AUTHOR = {Christodoulou, George and Ligett, Katrina and Pyrga, Evangelia},
TITLE = {Contention resolution under selfishness},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {675-693},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9773-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chao-Hsu-Lee/14,
AUTHOR = {Chao, Kun-Mao and Hsu, Tsan-Sheng and Lee, D.T.},
TITLE = {Preface algorithms and computation (ISAAC 2012)},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {694-695},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9933-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{He-Munro-Zhou/14,
AUTHOR = {He, Meng and Munro, J. Ian and Zhou, Gelin},
TITLE = {A framework for succinct labeled ordinal trees over large alphabets},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {696-717},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9894-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Assadi-Emamjomeh-Zadeh-Norouzi-Fard-Yazdanbod-Zarrabi-Zadeh/14,
AUTHOR = {Assadi, Sepehr and Emamjomeh-Zadeh, Ehsan and Norouzi-Fard, Ashkan and Yazdanbod, Sadra and Zarrabi-Zadeh, Hamid},
TITLE = {The minimum vulnerability problem},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {718-731},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9927-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cheilaris-Gargano-Rescigno-Smorodinsky/14,
AUTHOR = {Cheilaris, Panagiotis and Gargano, Luisa and Rescigno, Adele A. and Smorodinsky, Shakhar},
TITLE = {Strong conflict-free coloring for intervals},
JOURNAL = {Algorithmica},
VOLUME = {70},
NUMBER = {4},
PAGES = {732-749},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-014-9929-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}