1: A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time
2: Reconstructing a Graph from Path Traces
3: How to Meet Asynchronously at Polynomial Cost
4: A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
5: A Dynamic Programming Solution to a Generalized LCS Problem
6: The Parity of Directed Hamiltonian Cycles
7: Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph
8: A Framework for the Verification of Certifying Computations
9: Efficient Algorithms for One-Dimensional k-Center Problems