1: Using Compressed Suffix-Arrays for a Compact Representation of Temporal-Graphs
2: A Compact Representation for Trips over Networks built on self-indexes
3: A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring
4: Inference under Information Constraints I: Lower Bounds from Chi-Square Contraction
5: Spectral methods for testing cluster structure of graphs
6: Joint Overlap Analysis of Multiple Genomic Interval Sets
7: Tighter bounds for online bipartite matching