1: StruClus: Structural Clustering of Large-Scale Graph Databases
2: A tight analysis of Kierstead-Trotter algorithm for online unit interval coloring
3: A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
4: Lower Bounds for Protrusion Replacement by Counting Equivalence Classes
5: Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
6: Multi-dimensional signal approximation with sparse structured priors using split Bregman iterations
7: Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
8: ERA Revisited: Theoretical and Experimental Evaluation
9: Clustered Planarity with Pipes