1: Dynamic Shortest Path Algorithms for Hypergraphs
2: Multiple-Source Shortest Paths in Embedded Graphs
3: Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components
4: A note on probe cographs
5: A Constructive Proof of the Cycle Double Cover Conjecture
6: Low-distortion Inference of Latent Similarities from a Multiplex Social Network
7: Packing interval graphs with vertex-disjoint triangles
8: The covert set-cover problem with application to Network Discovery
9: Thresholds for Extreme Orientability
10: A limit process for partial match queries in random quadtrees and $2$-d trees
11: On a functional contraction method