1: Linear-Time Recognition of Probe Interval Graphs
2: Random Rates for 0-Extension and Low-Diameter Decompositions
3: Solving Traveling Salesman Problem by Marker Method
4: Dimension Reduction via Colour Refinement
5: Optimal Hierarchical Layouts for Cache-Oblivious Search Trees
6: A Near-Optimal Dynamic Learning Algorithm for Online Matching Problems with Concave Returns
7: Generalized Wong sequences and their applications to Edmonds’ problems
8: AliBI: An Alignment-Based Index for Genomic Datasets
9: On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
10: Minimum d-dimensional arrangement with fixed points
11: Applied Similarity Problems Using Frechet Distance
12: Optimal Top-k Document Retrieval
13: A strongly polynomial algorithm for generalized flow maximization
14: An approximation algorithm for the Bandpass-2 problem
15: The predecessor-existence problem for k-reversible processes
16: Network Decontamination with a Single Agent
17: On active and passive testing