1: New and simple algorithms for stable flow problems
2: Efficient Graph Algorithms for Network Analysis
3: Exploring Subexponential Parameterized Complexity of Completion Problems
4: Dynamic vs Oblivious Routing in Network Design
5: Routing Directions: Keeping it Fast and Simple
6: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
7: New Approximability Results for the Robust k-Median Problem
8: DNA origami and the complexity of Eulerian circuits with turning costs
9: SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
10: Approximation Theory and the Design of Fast Algorithms
11: Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches
12: A Near Optimal Approximation Algorithm for Vertex-Cover Problem
13: Approximation of smallest linear tree grammar
14: Distance Oracles for Time-Dependent Networks
15: Parameterized Enumeration with Ordering
16: A Comparison of Well-Quasi Orders on Trees
17: Augmenting graphs to minimize the diameter
18: New Algorithms for Solving Tropical Linear Systems
19: Linear kernels for k-tuple and liar’s domination in bounded genus graphs