Abstract is missing.
- Item Pricing for Combinatorial Public ProjectsEvangelos Markakis, Orestis Telelis. 1-13 [doi]
- Norm-Based Locality Measures of Two-Dimensional Hilbert CurvesH. K. Dai, H. C. Su. 14-25 [doi]
- On the Complexity of Clustering with Relaxed Size ConstraintsMassimiliano Goldwurm, Jianyi Lin, Francesco Saccà. 26-38 [doi]
- Superstring Graph: A New Approach for Genome AssemblyBastien Cazaux, Gustavo Sacomoto, Eric Rivals. 39-52 [doi]
- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesJulien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca. 53-64 [doi]
- A Very Fast String Matching Algorithm Based on Condensed AlphabetsSimone Faro. 65-76 [doi]
- Minimum-Density Identifying Codes in Square GridsMarwane Bouznif, Frédéric Havet, Myriam Preissmann. 77-88 [doi]
- Separating Codes and Traffic MonitoringThomas Bellitto. 89-100 [doi]
- Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract)Konstantinos Georgiou, George Karakostas, Evangelos Kranakis, Danny Krizanc. 101-112 [doi]
- Algorithmic Aspects of Upper Domination: A Parameterised PerspectiveCristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos. 113-124 [doi]
- On Network Formation Games with Heterogeneous Players and Basic Network Creation GamesChristos Kaklamanis, Panagiotis Kanellopoulos, Sophia Tsokana. 125-136 [doi]
- Parameterized Complexity of Team Formation in Social NetworksRobert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch. 137-149 [doi]
- Reconstructing Cactus Graphs from Shortest Path Information - (Extended Abstract)Evangelos Kranakis, Danny Krizanc, Yun Lu. 150-161 [doi]
- Near-Optimal Dominating Sets via Random SamplingMartin Nehéz. 162-172 [doi]
- A Multivariate Approach for Checking Resiliency in Access ControlJason Crampton, Gregory Gutin, Rémi Watrigant. 173-184 [doi]
- Efficient Algorithms for the Order Preserving Pattern Matching ProblemSimone Faro, M. Oguzhan Külekci. 185-196 [doi]
- Computing the Line-Constrained k-center in the Plane for Small kAlbert Jhih-Heng Huang, Hung-Lung Wang, Kun-Mao Chao. 197-208 [doi]
- Online k-max Search Algorithms with Applications to the Secretary ProblemSizhe Wang, Yinfeng Xu. 209-221 [doi]