1: Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows
2: Greedy Graph Colouring is a Misleading Heuristic
3: A Constructive Quantum Lov'asz Local Lemma for Commuting Projectors
4: A Complete Parameterized Complexity Analysis of Bounded Planning
5: Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
6: A New Push-Relabel Algorithm for Sparse Networks
7: Moving in temporal graphs with very sparse random availability of edges
8: Replacement Paths via Row Minima of Concise Matrices
9: Tree Nash Equilibria in the Network Creation Game
10: A Labeling Approach to Incremental Cycle Detection
11: Dynamic connectivity algorithms for Monte Carlo simulations of the random-cluster model