1: Extracting Conflict-free Information from Multi-labeled Trees
2: Reputation Games for Undirected Graphs
3: Lyndon Words and Short Superstrings
4: Minimizing Movement: Fixed-Parameter Tractability
5: Tighter Worst-Case Bounds on Algebraic Gossip