Reoptimization of the Shortest Common Superstring Problem Davide BilòHans-Joachim BöckenhauerAnna Zych OriginalPaper 15 June 2010 Pages: 227 - 251
Branch and Recharge: Exact Algorithms for Generalized Domination Fedor V. FominPetr A. GolovachMathieu Liedloff OriginalPaper 04 June 2010 Pages: 252 - 273
Graphical Congestion Games Vittorio BilòAngelo FanelliLuca Moscardelli OriginalPaper 03 June 2010 Pages: 274 - 297
Energy-Efficient Paths in Radio Networks Rene BeierStefan FunkePeter Sanders OriginalPaper 27 May 2010 Pages: 298 - 319
The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki IoannidouGeorge B. MertziosStavros D. Nikolopoulos OriginalPaper 12 May 2010 Pages: 320 - 341
Approximation Algorithms for the Interval Constrained Coloring Problem Ernst AlthausStefan CanzarJulián Mestre OriginalPaper 15 April 2010 Pages: 342 - 361
Quadratic Kernelization for Convex Recoloring of Trees Hans L. BodlaenderMichael R. FellowsMark Weyer OriginalPaper Open access 27 March 2010 Pages: 362 - 388
On Dynamic Shortest Paths Problems Liam RodittyUri Zwick OriginalPaper 03 March 2010 Pages: 389 - 401
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs Kuo-Hua KaoJou-Ming ChangJustie Su-Tzu Juan OriginalPaper 05 March 2010 Pages: 402 - 418
Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks Thomas MoscibrodaStefan SchmidRoger Wattenhofer OriginalPaper 04 March 2010 Pages: 419 - 446
On Incentive Compatible Competitive Selection Protocols Xi ChenXiaotie DengBecky Jie Liu OriginalPaper 02 March 2010 Pages: 447 - 462
The Cost of Cache-Oblivious Searching Michael A. BenderGerth Stølting BrodalAlejandro López-Ortiz OriginalPaper 09 March 2010 Pages: 463 - 505
