Ling-Ju Hung and Ton Kloks. Kruskalian Graphs k-Cographs
Hans Hüttel, Jakob Svane Knudsen, Peter Finderup and Johannes Garm Nielsen. Linear Uniform Receptiveness in a Pi-Calculus with Location Failures
Gabor Erdelyi and Jörg Rothe. Control Complexity in Fallback Voting
Liang Xu and Zhou Xu. Approximation Algorithms for Min-max Capacitated Path Covers
Faisal Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura and Ulrike Stege. A Fixed-Parameter Algorithm for String-to-String Correction
Maw-Shang Chang, Ling-Ju Hung and Peter Rossmanith. Probe Distance-Hereditary Graphs
Vida Dujmovic, Joachim Gudmundsson, Pat Morin and Thomas Wolle. Notes on Large Angle Crossing Graphs
Kazuyuki Amano. On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Functions
Sze-Hang Chan, Tak-Wah Lam, Lap-Kei Lee, Hing-Fung Ting and Peng Zhang. Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors
Michael Johnson and Stefano Kasangian. A Relational Model of Incomplete Data without NULLs
Simone Dantas, Luerbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira and Fábio Protti. Advances on the List Stubborn Problem
Simon Doherty and Lindsay Groves. Simpler Backward Simulation Proofs
