1: Combinatorial invariants for graph isomorphism problem
2: An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering
3: Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
4: Time Dependent Contraction Hierarchies – Basic Algorithmic Ideas
5: Energy and Time Efficient Scheduling of Tasks with Dependencies on Asymmetric Multiprocessors
6: Sketching and Streaming Entropy via Approximation Theory