StringologyTimes

Data Structures and Algorithms: 2017/7/29-31

1: Independent Feedback Vertex Sets for Graphs of Bounded Diameter
2: Independent Feedback Vertex Set for $P_5$-free Graphs
3: Balanced Stable Marriage: How Close is Close Enough?
4: Coded Load Balancing in Cache Networks
5: Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
6: Dimensionality reduction of SDPs through sketching
7: Temporal Hierarchical Clustering