1: On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results
2: Optimal Embedding Into Star Metrics
3: Maximum Flow in Directed Planar Graphs with Vertex Capacities
4: Feedback Vertex Sets in Tournaments
5: Fully-Functional Static and Dynamic Succinct Trees