Abstract is missing.
- Faster Approximation Algorithms for Scheduling with Fixed JobsKlaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson. 3-10 [doi]
- Sparsest Cut on Quotients of the HypercubeAlexandra Kolla, James Lee. 11-22 [doi]
- Minimum Mosaic Inference of a Set of RecombinantsGuillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette. 23-30 [doi]
- Tight Analysis of Shortest Path Convergecast in Wireless Sensor NetworksJohn Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy. 31-40 [doi]
- Sequential Optimization of Binary Search Trees for Multiple Cost FunctionsMaram Alnafie, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov. 41-44 [doi]
- A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree AugmentationN. S. Narayanaswamy, N. Sadagopan. 45-54 [doi]
- Maximum Domination ProblemEiji Miyano, Hirotaka Ono. 55-62 [doi]
- How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on TreeYoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita. 63-68 [doi]
- Towards More Efficient Infection and Fire FightingPeter Floderus, Andrzej Lingas, Mia Persson. 69-74 [doi]
- A Process-Algebraic Semantics for Generalised NonblockingSimon Ware, Robi Malik. 75-84 [doi]
- On the Succinctness of RoCTL*John Christopher McCabe-Dansted. 85-94 [doi]
- Descriptional Complexity of Determinization and Complementation for Finite AutomataAniruddh Gandhi, Nan Rosemary Ke, Bakhadyr Khoussainov. 95-104 [doi]
- Energy-Efficient Threshold Circuits Computing Mod FunctionsAkira Suzuki, Kei Uchizawa, Xiao Zhou. 105-110 [doi]
- New Area-Time Lower Bounds for the Multidimensional DFTGianfranco Bilardi, Carlo Fantozzi. 111-120 [doi]
- Black-and-White Threshold GraphsLing-Ju Hung, Ton Kloks, Fernando Sanchez Villaamil. 121-130 [doi]
- Sharing Information in All Pairs Shortest Path AlgorithmsTadao Takaoka, Mashitoh Hashim. 131-136 [doi]
- Approximation Algorithms for Data Association Problem Arising from Multitarget TrackingNaoyuki Kamiyama, Tomomi Matsui. 137-144 [doi]
- Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar TreesMichael J. Dinneen, Masoud Khosravani. 145-150 [doi]
- Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created)James Harland. 151-160 [doi]
- Oblivious k-shot Broadcasting in Ad Hoc Radio NetworksParaschos Koutris, Aris Pagourtzis. 161-168 [doi]