No. |
Title |
Author |
Year |
---|

1 |
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games |
Deligkas, Argyrios et al. |
2022 |

2 |
The Complexity of Periodic Energy Minimisation |
Adamson, Duncan et al. |
2022 |

3 |
Ranking Bracelets in Polynomial Time |
Adamson, Duncan et al. |
2021 |

4 |
Crystal Structure Prediction via Oblivious Local Search |
Antypov, Dmytro et al. |
2020 |

5 |
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle |
Deligkas, Argyrios et al. |
2020 |

6 |
Tree Polymatrix Games Are PPAD-Hard |
Deligkas, Argyrios et al. |
2020 |

7 |
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem |
Deligkas, Argyrios et al. |
2019 |

8 |
Directed Graph Minors and Serial-Parallel Width |
Deligkas, Argyrios et al. |
2018 |

9 |
Binary Search in Graphs Revisited |
Deligkas, Argyrios et al. |
2017 |