@article{Agarwal-Ezra-Sharir/12,
AUTHOR = {Agarwal, Pankaj K. and Ezra, Esther and Sharir, Micha},
TITLE = {Near-linear approximation algorithms for geometric hitting sets},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {1-25},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/c21l34u41h861210/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kosowski-Navarra/12,
AUTHOR = {Kosowski, Adrian and Navarra, Alfredo},
TITLE = {Graph decomposition for memoryless periodic exploration},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {26-38},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/63110737hlg67088/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yuster/12,
AUTHOR = {Yuster, Raphael},
TITLE = {Almost exact matchings},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {39-50},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/kw871665854u6h24/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Anshelevich-Hoefer/12,
AUTHOR = {Anshelevich, Elliot and Hoefer, Martin},
TITLE = {Contribution games in networks},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {51-90},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/42021187v9785135/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Magniez-Nayak-Richter-Santha/12,
AUTHOR = {Magniez, Fr{\'e}d{\'e}ric and Nayak, Ashwin and Richter, Peter C. and Santha, Miklos},
TITLE = {On the hitting times of quantum versus random walks},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {91-116},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/nn70032v1780321q/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Summers/12,
AUTHOR = {Summers, Scott M.},
TITLE = {Reducing tile complexity for the self-assembly of scaled shapes through temperature programming},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {117-136},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/u2t21qm622470744/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Calinescu-Fernandes-Kaul-Zelikovsky/12,
AUTHOR = {C{\v{a}}linescu, Gruia and Fernandes, Cristina G. and Kaul, Hemanshu and Zelikovsky, Alexander},
TITLE = {Maximum series-parallel subgraph},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {137-157},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/t972182413t77132/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Coudert-Huc-Mazauric/12,
AUTHOR = {Coudert, David and Huc, Florian and Mazauric, Dorian},
TITLE = {A distributed algorithm for computing the node search number in trees},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {158-190},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/n242543087727280/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Du-Lu-Xu/12,
AUTHOR = {Du, Donglei and Lu, Ruixing and Xu, Dachuan},
TITLE = {A primal-dual approximation algorithm for the facility location problem with submodular penalties},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {191-200},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/7l1561563pm1p541/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dillabaugh-He-Maheshwari/12,
AUTHOR = {Dillabaugh, Craig and He, Meng and Maheshwari, Anil},
TITLE = {Succinct and I/O efficient data structures for traversal in trees},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {201-223},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/t46727804431m218/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kavitha/12,
AUTHOR = {Kavitha, Telikepalli},
TITLE = {Faster algorithms for all-pairs small stretch distances in weighted graphs},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {224-245},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/w75j01h1h4577526/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Epstein-Levin/12,
AUTHOR = {Epstein, Leah and Levin, Asaf},
TITLE = {On equilibria for ADM minimization games},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {246-273},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/e81k314g6u21u340/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{DAngelo-Di_Stefano-Navarra/12,
AUTHOR = {D'Angelo, Gianlorenzo and Di Stefano, Gabriele and Navarra, Alfredo},
TITLE = {Minimize the maximum duty in multi-interface networks},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {274-295},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/p617n570881390g2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sharma-Busch/12,
AUTHOR = {Sharma, Gokarna and Busch, Costas},
TITLE = {A competitive analysis for balanced transactional memory workloads},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {296-322},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g5703552533371t3/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Binkele-Raible-Fernau/12,
AUTHOR = {Binkele-Raible, Daniel and Fernau, Henning},
TITLE = {An exact exponential time algorithm for {\sc Power Dominating Set}},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {323-346},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/7k36573236p44710/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Khuller-Kim-Malekian/12,
AUTHOR = {Khuller, Samir and Kim, Yoo-Ah and Malekian, Azarakhsh},
TITLE = {Improved approximation algorithms for data migration},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {347-362},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f19t63802201455x/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{von_zur_Gathen-Panario-Richmond/12,
AUTHOR = {von zur Gathen, Joachim and Panario, Daniel and Richmond, Bruce},
TITLE = {Interval partitions and polynomial factorization},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {363-397},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/80372r6v6k0707l2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nutov/12,
AUTHOR = {Nutov, Zeev},
TITLE = {Approximating node-connectivity augmentation problems},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {398-410},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/7173156904735545/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kesselman-Kogan-Segal/12,
AUTHOR = {Kesselman, Alex and Kogan, Kirill and Segal, Michael},
TITLE = {Improved competitive performance bounds for CIOQ switches},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {411-424},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/5k020028345m1t52/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Aazami-Cheriyan-Jampani/12,
AUTHOR = {Aazami, A. and Cheriyan, J. and Jampani, K.R.},
TITLE = {Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {425-456},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/5983516544110475/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arge-Brodal-Rao/12,
AUTHOR = {Arge, Lars and Brodal, Gerth St{\o}lting and Rao, S. Srinivasa},
TITLE = {External memory planar point location with logarithmic updates},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {457-475},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/d57r54jr1130151u/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Douieb-Dujmovic-Howat/12,
AUTHOR = {Bose, Prosenjit and Dou{\"{i}}eb, Karim and Dujmovi{\'c}, Vida and Howat, John},
TITLE = {Layered working-set trees},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {476-489},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/c70751720jg03v7m/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eggert-Kliemann-Munstermann-Srivastav/12,
AUTHOR = {Eggert, Sebastian and Kliemann, Lasse and Munstermann, Peter and Srivastav, Anand},
TITLE = {Bipartite matching in the semi-streaming model},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {490-508},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/5741416443275072/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bassino-David-Nicaud/12,
AUTHOR = {Bassino, Fr{\'e}d{\'e}rique and David, Julien and Nicaud, Cyril},
TITLE = {Average case analysis of Moore's state minimization algorithm},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {509-531},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/mj962635h4131802/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kratsch/12,
AUTHOR = {Kratsch, Stefan},
TITLE = {Polynomial kernelization for MIN F$^+\Pi_1$ and MAX NP},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {532-550},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/27r561v175027j04/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Catusse-Chepoi-Nouioua-Vaxes/12,
AUTHOR = {Catusse, N. and Chepoi, V. and Nouioua, K. and Vax{`e}s, Y.},
TITLE = {Minimum Manhattan network problem in normed planes with polygonal balls: A factor 2.5 approximation algorithm},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {1-2},
PAGES = {551-567},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/r10875858k565p70/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Geffert-Pighizzini/12,
AUTHOR = {Geffert, Viliam and Pighizzini, Giovanni},
TITLE = {Pairs of complementary unary languages with ``balanced'' nondeterministic automata},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {571-587},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/x4x1613740375v84/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ge-Stefankovic/12,
AUTHOR = {Ge, Qi and {\v{S}}tefankovi{\v{c}}, Daniel},
TITLE = {The complexity of counting Eulerian tours in 4-regular graphs},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {588-601},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/k2025p82572371wu/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dumitrescu-Jiang/12,
AUTHOR = {Dumitrescu, Adrian and Jiang, Minghui},
TITLE = {Minimum-perimeter intersecting polygons},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {602-615},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/h80267p8n23111r6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{van_Hoeij-Novocin/12,
AUTHOR = {van Hoeij, Mark and Novocin, Andrew},
TITLE = {Gradual sub-lattice reduction and a new complexity for factoring polynomials},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {616-633},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/8774jhp39t7q4192/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chung-Ligett-Pruhs-Roth/12,
AUTHOR = {Chung, Christine and Ligett, Katrina and Pruhs, Kirk and Roth, Aaron},
TITLE = {The power of fair pricing mechanisms},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {634-644},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/r50l5h1708307598/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bonsma-Breuer/12,
AUTHOR = {Bonsma, Paul and Breuer, Felix},
TITLE = {Counting hexagonal patches and independent sets in circle graphs},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {645-671},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/e7803l5642020701/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Duncan-Gansner-Hu-Kaufmann-Kobourov/12,
AUTHOR = {Duncan, C.A. and Gansner, E.R. and Hu, Y.F. and Kaufmann, M. and Kobourov, S.G.},
TITLE = {Optimal polygonal representation of planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {672-691},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/kk66u656g40j27q6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Grandoni-Lokshtanov-Saurabh/12,
AUTHOR = {Fomin, Fedor V. and Grandoni, Fabrizio and Lokshtanov, Daniel and Saurabh, Saket},
TITLE = {Sharp separation and applications to exact and parameterized algorithms},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {692-706},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g40w80421w47806h/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ferragina-Gagie-Manzini/12,
AUTHOR = {Ferragina, Paolo and Gagie, Travis and Manzini, Giovanni},
TITLE = {Lightweight data indexing and compression in external memory},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {3},
PAGES = {707-730},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/g2516m5u01537260/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bansal-Gupta-Li-Mestre-Nagarajan-Rudra/12,
AUTHOR = {Bansal, Nikhil and Gupta, Anupam and Li, Jian and Mestre, Juli{\'a}n and Nagarajan, Viswanath and Rudra, Atri},
TITLE = {When LP is the cure for your matching woes: Improved bounds for stochastic matchings},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {733-762},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/q20wh16t7x17u701/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bonifaci-Marchetti-Spaccamela/12,
AUTHOR = {Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto},
TITLE = {Feasibility analysis of sporadic real-time multiprocessor task systems},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {763-780},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/u34u5r486n218x16/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chrobak-Woeginger-Makino-Xu/12,
AUTHOR = {Chrobak, Marek and Woeginger, Gerhard J. and Makino, Kazuhisa and Xu, Haifeng},
TITLE = {Caching is hard --- Even in the fault model},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {781-794},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/b84275349657863m/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hajiaghayi-Khandekar-Kortsarz/12,
AUTHOR = {Hajiaghayi, M. and Khandekar, R. and Kortsarz, G.},
TITLE = {Local search algorithms for the red-blue median problem},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {795-814},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/h21155754137m7v2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brodal-Davoodi-Rao/12,
AUTHOR = {Brodal, Gerth St{\o}lting and Davoodi, Pooya and Rao, S. Srinivasa},
TITLE = {On space efficient two dimensional range minimum data structures},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {815-830},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/f44816189j320q32/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pountourakis-Vidali/12,
AUTHOR = {Pountourakis, Emmanouil and Vidali, Angelina},
TITLE = {A complete characterization of group-strategyproof mechanisms of cost-sharing},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {831-860},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/2761l14588567871/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chechik-Langberg-Peleg-Roditty/12,
AUTHOR = {Chechik, Shiri and Langberg, Michael and Peleg, David and Roditty, Liam},
TITLE = {$f$-sensitivity distance oracles and routing schemes},
JOURNAL = {Algorithmica},
VOLUME = {63},
NUMBER = {4},
PAGES = {861-882},
YEAR = {2012},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/content/x8800462705g8278/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}