@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},
}
@article{Seshadhri-Vondrak/14,
AUTHOR = {Seshadhri, C. and Vondr{\'a}k, Jan},
TITLE = {Is submodularity testable?},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {1-25},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9719-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Epstein-Levin/14,
AUTHOR = {Epstein, Leah and Levin, Asaf},
TITLE = {Robust algorithms for preemptive scheduling},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {26-57},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9718-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cook-Wenk/14,
AUTHOR = {Cook IV, Atlas F. and Wenk, Carola},
TITLE = {Shortest path problems on a polyhedral surface},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {58-77},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9723-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Diaz-Goldberg-Mertzios-Richerby-Serna-Spirakis/14,
AUTHOR = {D{\'{i}}az, Josep and Goldberg, Leslie Ann and Mertzios, George B. and Richerby, David and Serna, Maria and Spirakis, Paul G.},
TITLE = {Approximating fixation probabilities in the generalized Moran process},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {78-91},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9722-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Farzan-Kamali/14,
AUTHOR = {Farzan, Arash and Kamali, Shahin},
TITLE = {Compact navigation and distance oracles for graphs with small treewidth},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {92-116},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9712-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wild/14,
AUTHOR = {Wild, Marcel},
TITLE = {Counting or producing all fixed cardinality transversals},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {117-129},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9716-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ishii-Makino/14,
AUTHOR = {Ishii, Toshimasa and Makino, Kazuhisa},
TITLE = {Augmenting edge-connectivity between vertex subsets},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {130-147},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9724-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mount-Netanyahu-Piatko-Silverman-Wu/14,
AUTHOR = {Mount, David M. and Netanyahu, Nathan S. and Piatko, Christine D. and Silverman, Ruth and Wu, Angela Y.},
TITLE = {On the least trimmed squares estimator},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {148-183},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9721-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ackermann-Blomer-Kuntze-Sohler/14,
AUTHOR = {Ackermann, Marcel R. and Bl{\"o}mer, Johannes and Kuntze, Daniel and Sohler, Christian},
TITLE = {Analysis of agglomerative clustering},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {184-215},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9717-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Heggernes-Kratsch-Papadopoulos-Villanger/14,
AUTHOR = {Fomin, Fedor V. and Heggernes, Pinar and Kratsch, Dieter and Papadopoulos, Charis and Villanger, Yngve},
TITLE = {Enumerating minimal subset feedback vertex sets},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {216-231},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9731-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Barbay-Claude-Gagie-Navarro-Nekrich/14,
AUTHOR = {Barbay, J{\'e}r{\'e}my and Claude, Francisco and Gagie, Travis and Navarro, Gonzalo and Nekrich, Yakov},
TITLE = {Efficient fully-compressed sequence representations},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {1},
PAGES = {232-268},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9726-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Ma-Wang/14,
AUTHOR = {Chen, Zhi-Zhong and Ma, Wenji and Wang, Lusheng},
TITLE = {The parameterized complexity of the shared center problem},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {269-293},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9730-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bremner-Chan-Demaine-Erickson-Hurtado-Iacono-Langerman-Patrascu-Taslakian/14,
AUTHOR = {Bremner, David and Chan, Timothy M. and Demaine, Erik D. and Erickson, Jeff and Hurtado, Ferran and Iacono, John and Langerman, Stefan and P{\v{a}}tra{\c{s}}cu, Mihai and Taslakian, Perouz},
TITLE = {Necklaces, convolutions, and $X+Y$},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {294-314},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9734-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dumitrescu-Jiang-Pach/14,
AUTHOR = {Dumitrescu, Adrian and Jiang, Minghui and Pach, J{\'a}nos},
TITLE = {Opaque sets},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {315-334},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9735-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Allamigeon/14,
AUTHOR = {Allamigeon, Xavier},
TITLE = {On the complexity of strongly connected components in directed hypergraphs},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {335-369},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9729-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Wang/14,
AUTHOR = {Chen, Danny Z. and Wang, Haitao},
TITLE = {New algorithms for facility location problems on the real line},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {370-383},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9737-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bille-Gortz/14,
AUTHOR = {Bille, Philip and G{\o}rtz, Inge Li},
TITLE = {Substring range reporting},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {384-396},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9733-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Carmi-Damian-Flatland-Katz-Maheshwari/14,
AUTHOR = {Bose, Prosenjit and Carmi, Paz and Damian, Mirela and Flatland, Robin and Katz, Matthew J. and Maheshwari, Anil},
TITLE = {Switching to directional antennas with constant increase in radius and hop distance},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {397-409},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9739-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Wang/14a,
AUTHOR = {Chen, Danny Z. and Wang, Haitao},
TITLE = {Outlier respecting points approximation},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {410-430},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9738-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Yuster/14,
AUTHOR = {Cohen, Keren and Yuster, Raphael},
TITLE = {On minimum witnesses for Boolean matrix multiplication},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {431-442},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9742-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Khani-Salavatipour/14,
AUTHOR = {Khani, M. Reza and Salavatipour, Mohammad R.},
TITLE = {Improved approximation algorithms for the min-max tree cover and bounded tree cover problems},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {443-460},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9740-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jukna/14,
AUTHOR = {Jukna, Stasys},
TITLE = {Limitations of incremental dynamic programming},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {2},
PAGES = {461-492},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9747-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rizzi-Cariolaro/14,
AUTHOR = {Rizzi, Romeo and Cariolaro, David},
TITLE = {Polynomial time complexity of edge colouring graphs with bounded colour classes},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {494-500},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9746-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Belmonte-Golovach-Heggernes-van_t_Hof-Kaminski-Paulusma/14,
AUTHOR = {Belmonte, R{\'e}my and Golovach, Petr A. and Heggernes, Pinar and van 't Hof, Pim and Kami{\'n}ski, Marcin and Paulusma, Dani{\"e}l},
TITLE = {Detecting fixed patterns in chordal graphs in polynomial time},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {501-521},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9748-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Loh-Pagh/14,
AUTHOR = {Loh, Po-Shen and Pagh, Rasmus},
TITLE = {Thresholds for extreme orientability},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {522-539},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9749-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mertzios/14,
AUTHOR = {Mertzios, George B.},
TITLE = {An intersection model for multitolerance graphs: Efficient algorithms and hierarchy},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {540-581},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9743-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fujiwara-Jacobs/14,
AUTHOR = {Fujiwara, Hiroshi and Jacobs, Tobias},
TITLE = {On the Huffman and Alphabetic Tree Problem with general cost functions},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {582-604},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9755-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chan-Chang-Raman/14,
AUTHOR = {Chan, T.-H. Hubert and Chang, Kevin L. and Raman, Rajiv},
TITLE = {An SDP primal-dual algorithm for approximating the Lov{\'a}sz-Theta function},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {605-618},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9756-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Christodoulou-Mehlhorn-Pyrga/14,
AUTHOR = {Christodoulou, Giorgos and Mehlhorn, Kurt and Pyrga, Evangelia},
TITLE = {Improving the price of anarchy for selfish routing via coordination mechanisms},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {619-640},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9753-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Maheshwari-Sack-Shahbaz-Zarrabi-Zadeh/14,
AUTHOR = {Maheshwari, Anil and Sack, J{\"o}rg-R{\"u}diger and Shahbaz, Kaveh and Zarrabi-Zadeh, Hamid},
TITLE = {Improved algorithms for partial curve matching},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {641-657},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9758-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Busch-LaFortune-Tirthapura/14,
AUTHOR = {Busch, Costas and LaFortune, Ryan and Tirthapura, Srikanta},
TITLE = {Sparse covers for planar graphs and graphs that exclude a fixed minor},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {658-684},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9757-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nederlof-van_Rooij-van_Dijk/14,
AUTHOR = {Nederlof, Jesper and van Rooij, Johan M.M. and van Dijk, Thomas C.},
TITLE = {Inclusion/exclusion meets measure and conquer},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {685-740},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9759-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amossen-Campagna-Pagh/14,
AUTHOR = {Amossen, Rasmus Resen and Campagna, Andrea and Pagh, Rasmus},
TITLE = {Better size estimation for sparse matrix products},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {3},
PAGES = {741-757},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9692-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gioan-Paul-Tedder-Corneil/14,
AUTHOR = {Gioan, Emeric and Paul, Christophe and Tedder, Marc and Corneil, Derek},
TITLE = {Practical and efficient circle graph recognition},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {759-788},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9745-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gioan-Paul-Tedder-Corneil/14a,
AUTHOR = {Gioan, Emeric and Paul, Christophe and Tedder, Marc and Corneil, Derek},
TITLE = {Practical and efficient split decomposition via graph-labelled trees},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {789-843},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9752-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Khandekar-Kortsarz-Mirrokni/14,
AUTHOR = {Khandekar, Rohit and Kortsarz, Guy and Mirrokni, Vahab},
TITLE = {On the advantage of overlapping clusters for minimizing conductance},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {844-863},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9761-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pagh-Wei-Yi-Zhang/14,
AUTHOR = {Pagh, Rasmus and Wei, Zhewei and Yi, Ke and Zhang, Qin},
TITLE = {Cache-oblivious hashing},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {864-883},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9763-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dragan-Kohler/14,
AUTHOR = {Dragan, Feodor F. and K{\"o}hler, Ekkehard},
TITLE = {An approximation algorithm for the tree $t$-spanner problem on unweighted graphs via generalized chordal graphs},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {884-905},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9765-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Golynski-Orlandi-Raman-Rao/14,
AUTHOR = {Golynski, Alexander and Orlandi, Alessio and Raman, Rajeev and Rao, S. Srinivasa},
TITLE = {Optimal indexes for sparse bit vectors},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {906-924},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9767-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Benoit-Gallet-Gaujal-Robert/14,
AUTHOR = {Benoit, Anne and Gallet, Matthieu and Gaujal, Bruno and Robert, Yves},
TITLE = {Computing the throughput of probabilistic and replicated streaming applications},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {925-957},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9768-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Frias-Roura/14,
AUTHOR = {Frias, Leonor and Roura, Salvador},
TITLE = {Multikey quickselect},
JOURNAL = {Algorithmica},
VOLUME = {69},
NUMBER = {4},
PAGES = {958-973},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9775-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chin-Chrobak-Yan/14,
AUTHOR = {Chin, Francis and Chrobak, Marek and Yan, Li},
TITLE = {Algorithms for placing monitors in a flow network},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {1-15},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9665-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Farzan-Munro/14,
AUTHOR = {Farzan, Arash and Munro, J. Ian},
TITLE = {A uniform paradigm to succinctly encode various families of trees},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {16-40},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9664-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cygan-Marx-Pilipczuk-Pilipczuk-Schlotter/14,
AUTHOR = {Cygan, Marek and Marx, D{\'a}niel and Pilipczuk, Marcin and Pilipczuk, Micha{\l} and Schlotter, Ildik{\'o}},
TITLE = {Parameterized complexity of Eulerian deletion problems},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {41-61},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9667-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ebenlendr-Krcal-Sgall/14,
AUTHOR = {Ebenlendr, Tom{\'a}{\v{s}} and Kr{\v{c}}{\'a}l, Marek and Sgall, Ji{\v{r}}{\'{i}}},
TITLE = {Graph balancing: A special case of scheduling unrelated parallel machines},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {62-80},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9668-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Komusiewicz-Uhlmann/14,
AUTHOR = {Komusiewicz, Christian and Uhlmann, Johannes},
TITLE = {A cubic-vertex kernel for flip consensus tree},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {81-108},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9663-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Heggernes-van_t_Hof-Leveque-Lokshtanov-Paul/14,
AUTHOR = {Heggernes, Pinar and van 't Hof, Pim and L{\'e}v{\^e}que, Benjamin and Lokshtanov, Daniel and Paul, Christophe},
TITLE = {Contracting graphs to paths and trees},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {109-132},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9670-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Russell/14,
AUTHOR = {Chen, Sixia and Russell, Alexander},
TITLE = {Online metric tracking and smoothing},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {133-151},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9669-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Johannsen-Kurur-Lengler/14,
AUTHOR = {Johannsen, Daniel and Kurur, Piyush P. and Lengler, Johannes},
TITLE = {Evolutionary algorithms for quantum computers},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {152-189},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9784-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Englert-Roglin-Vocking/14,
AUTHOR = {Englert, Matthias and R{\"o}glin, Heiko and V{\"o}cking, Berthold},
TITLE = {Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {190-264},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9801-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bartschi-Suri/14,
AUTHOR = {B{\"a}rtschi, Andreas and Suri, Subhash},
TITLE = {Conflict-free chromatic art gallery coverage},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {265-283},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9732-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {see Erratum in Algorithmica, Vol. 68, 2014, 1, 284-285},
}
@article{Bartschi-Suri/14a,
AUTHOR = {B{\"a}rtschi, Andreas and Suri, Subhash},
TITLE = {Erratum to ``Conflict-free chromatic art gallery coverage''},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {1},
PAGES = {284-285},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-013-9852-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {Originally in Algorithmica, Vol. 68, 2014, 1, 265-283},
}
@article{Borradaile-Demaine-Tazari/14,
AUTHOR = {Borradaile, Glencora and Demaine, Erik D. and Tazari, Siamak},
TITLE = {Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {287-311},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9662-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kammer-Tholey/14,
AUTHOR = {Kammer, Frank and Tholey, Torsten},
TITLE = {Approximation algorithms for intersection graphs},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {312-336},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9671-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bilo-Guala-Proietti/14,
AUTHOR = {Bil{\`o}, Davide and Gual{\`a}, Luciano and Proietti, Guido},
TITLE = {Finding best swap edges minimizing the routing cost of a spanning tree},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {337-357},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9674-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karakostas-Markou/14,
AUTHOR = {Karakostas, George and Markou, Euripides},
TITLE = {Emergency connectivity in ad-hoc networks with selfish nodes},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {358-389},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9675-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bansal-Buchbinder-Gupta-Naor/14,
AUTHOR = {Bansal, Nikhil and Buchbinder, Niv and Gupta, Anupam and Naor, Joseph (Seffi)},
TITLE = {A randomized $O(\log^2k)$-competitive algorithm for metric bipartite matching},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {390-403},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9676-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Albers-Muller-Schmelzer/14,
AUTHOR = {Albers, Susanne and M{\"u}ller, Fabian and Schmelzer, Swen},
TITLE = {Speed scaling on parallel processors},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {404-425},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9678-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bienkowski/14,
AUTHOR = {Bienkowski, Marcin},
TITLE = {An optimal lower bound for buffer management in multi-queue switches},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {426-447},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9677-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ishaque-Toth/14,
AUTHOR = {Ishaque, Mashhood and T{\'o}th, Csaba D.},
TITLE = {Relative convex hulls in semi-dynamic arrangements},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {448-482},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9679-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{McGrae-Zito/14,
AUTHOR = {McGrae, Andrew R.A. and Zito, Michele},
TITLE = {The complexity of the empire colouring problem},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {483-503},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9680-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Misra-Philip-Raman-Saurabh/14,
AUTHOR = {Misra, Neeldhara and Philip, Geevarghese and Raman, Venkatesh and Saurabh, Saket},
TITLE = {The kernelization complexity of connected domination in graphs with (no) small cycles},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {504-530},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9681-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{He-Zhang/14,
AUTHOR = {He, Xin and Zhang, Huaming},
TITLE = {On succinct greedy drawings of plane triangulations and 3-connected plane graphs},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {2},
PAGES = {531-544},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9682-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{McDermid-Irving/14,
AUTHOR = {McDermid, Eric and Irving, Robert W.},
TITLE = {Sex-equal stable matchings: Complexity and exact algorithms},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {545-570},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9672-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Doerr-Winzen/14,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
TITLE = {Ranking-based black-box complexity},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {571-609},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9684-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Demaine-Landau-Weimann/14,
AUTHOR = {Demaine, Erik D. and Landau, Gad M. and Weimann, Oren},
TITLE = {On Cartesian trees and range minimum queries},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {610-625},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9683-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Furer/14,
AUTHOR = {F{\"u}rer, Martin},
TITLE = {Efficient computation of the characteristic polynomial of a tree and related tasks},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {626-642},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9688-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gehweiler-Lammersen-Sohler/14,
AUTHOR = {Gehweiler, Joachim and Lammersen, Christiane and Sohler, Christian},
TITLE = {A distributed O(1)-approximation algorithm for the uniform facility location problem},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {643-670},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9690-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Flammini-Monaco-Moscardelli-Shalom-Zaks/14,
AUTHOR = {Flammini, Michele and Monaco, Gianpiero and Moscardelli, Luca and Shalom, Mordechai and Zaks, Shmuel},
TITLE = {On the complexity of the regenerator cost problem in general networks with traffic grooming},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {671-691},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9693-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cygan-Pilipczuk-Pilipczuk-Wojtaszczyk/14,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin and Pilipczuk, Micha{\l} and Wojtaszczyk, Jakub Onufry},
TITLE = {Scheduling partially ordered jobs faster than $2^n$},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {692-714},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9694-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Betzler-Bodlaender-Bredereck-Niedermeier-Uhlmann/14,
AUTHOR = {Betzler, Nadja and Bodlaender, Hans L. and Bredereck, Robert and Niedermeier, Rolf and Uhlmann, Johannes},
TITLE = {On making a distinguished vertex of minimum degree by vertex deletion},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {715-738},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9695-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Crowston-Gutin-Jones-Raman-Saurabh-Yeo/14,
AUTHOR = {Crowston, Robert and Gutin, Gregory and Jones, Mark and Raman, Venkatesh and Saurabh, Saket and Yeo, Anders},
TITLE = {Fixed-parameter tractability of satisfying beyond the number of variables},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {739-757},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9697-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Iwama-Miyazaki-Yanagisawa/14,
AUTHOR = {Iwama, Kazuo and Miyazaki, Shuichi and Yanagisawa, Hiroki},
TITLE = {A 25/17-approximation algorithm for the stable marriage problem with one-sided ties},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {758-775},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9699-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Konemann-Parekh-Pritchard/14,
AUTHOR = {K{\"o}nemann, Jochen and Parekh, Ojas and Pritchard, David},
TITLE = {Multicommodity flow in trees: Packing via covering and iterated relaxation},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {3},
PAGES = {776-804},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9701-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Xu-Xu-Papadopoulou/14,
AUTHOR = {Xu, Jinhui and Xu, Lei and Papadopoulou, Evanthia},
TITLE = {Computing the map of geometric minimal cuts},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {805-834},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9704-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goodrich/14,
AUTHOR = {Goodrich, Michael T.},
TITLE = {Spin-the-bottle sort and annealing sort: Oblivious sorting via round-robin random comparisons},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {835-858},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9696-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Blasius-Krug-Rutter-Wagner/14,
AUTHOR = {Bl{\"a}sius, Thomas and Krug, Marcus and Rutter, Ignaz and Wagner, Dorothea},
TITLE = {Orthogonal graph drawing with flexibility constraints},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {859-885},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9705-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kelk-Scornavacca/14,
AUTHOR = {Kelk, Steven and Scornavacca, Celine},
TITLE = {Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {886-915},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9708-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Harris-Sullivan-Beichl/14,
AUTHOR = {Harris, David G. and Sullivan, Francis and Beichl, Isabel},
TITLE = {Fast sequential importance sampling to estimate the graph reliability polynomial},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {916-939},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9703-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cygan-Lokshtanov-Pilipczuk-Pilipczuk-Saurabh/14,
AUTHOR = {Cygan, Marek and Lokshtanov, Daniel and Pilipczuk, Marcin and Pilipczuk, Micha{\l} and Saurabh, Saket},
TITLE = {On cutwidth parameterized by vertex cover},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {940-953},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9707-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dib_Giacomo-Didimo-Eades-Liotta/14,
AUTHOR = {Dib Giacomo, Emilio and Didimo, Walter and Eades, Peter and Liotta, Giuseppe},
TITLE = {2-layer right angle crossing drawings},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {954-997},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9706-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brandstadt-Mosca/14,
AUTHOR = {Brandst{\"a}dt, Andreas and Mosca, Raffaele},
TITLE = {Dominating induced matchings for $P_7$-free graphs in linear time},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {998-1018},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9709-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fekete-Kamphans-Schweer/14,
AUTHOR = {Fekete, S{\'a}ndor P. and Kamphans, Tom and Schweer, Nils},
TITLE = {Online square packing with gravity},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {1019-1044},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9713-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cicalese-Jacobs-Laber-Molinaro/14,
AUTHOR = {Cicalese, Ferdinando and Jacobs, Tobias and Laber, Eduardo and Molinaro, Marco},
TITLE = {Improved approximation algorithms for the average-case tree searching problem},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {1045-1074},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9715-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Foschini-Hershberger-Suri/14,
AUTHOR = {Foschini, Luca and Hershberger, John and Suri, Subhash},
TITLE = {On the complexity of time-dependent shortest paths},
JOURNAL = {Algorithmica},
VOLUME = {68},
NUMBER = {4},
PAGES = {1075-1097},
YEAR = {2014},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-012-9714-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}