| Publication | Date of Publication | Type |
|---|
| The parameterized complexity of welfare guarantees in Schelling segregation | 2024-10-07 | Paper |
| Approximate and randomized algorithms for computing a second Hamiltonian cycle | 2024-10-07 | Paper |
| The complexity of periodic energy minimisation | 2024-08-06 | Paper |
| Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source | 2024-06-21 | Paper |
| A polynomial-time algorithm for 1/2-well-supported Nash equilibria in bimatrix games | 2024-05-14 | Paper |
| Constant inapproximability for PPA | 2023-12-08 | Paper |
| Learning approximately optimal contracts | 2023-11-17 | Paper |
| A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games | 2023-10-23 | Paper |
| A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games | 2023-09-29 | Paper |
| The k-centre problem for classes of cyclic words | 2023-08-14 | Paper |
| Learning approximately optimal contracts | 2023-07-28 | Paper |
| Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem | 2023-07-03 | Paper |
| Heterogeneous facility location with limited resources | 2023-06-23 | Paper |
| Ranking Bracelets in Polynomial Time. | 2023-06-14 | Paper |
| Crystal structure prediction via oblivious local search | 2023-02-07 | Paper |
| Two's company, three's a crowd: consensus-halving for a constant number of agents | 2022-11-08 | Paper |
| Computing exact solutions of consensus halving and the Borsuk-Ulam theorem | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089192 | 2022-07-18 | Paper |
| Optimizing reachability sets in temporal graphs by delaying | 2022-06-08 | Paper |
| On the hardness of energy minimisation for crystal structure prediction | 2022-03-09 | Paper |
| Approximating the existential theory of the reals | 2022-01-31 | Paper |
| Connected subgraph defense games | 2021-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005146 | 2021-08-04 | Paper |
| Combinatorial Algorithms for Multidimensional Necklaces | 2021-08-04 | Paper |
| Computing exact solutions of consensus halving and the Borsuk-Ulam theorem | 2021-02-02 | Paper |
| Lipschitz continuity and approximate equilibria | 2020-10-12 | Paper |
| On the hardness of energy minimisation for crystal structure prediction | 2020-07-20 | Paper |
| Approximating the existential theory of the reals | 2020-06-18 | Paper |
| Binary search in graphs revisited | 2020-05-26 | Paper |
| Connected subgraph defense games | 2020-02-04 | Paper |
| Binary search in graphs revisited | 2019-05-07 | Paper |
| Distributed methods for computing approximate equilibria | 2019-03-11 | Paper |
| Inapproximability results for constrained approximate Nash equilibria | 2018-09-27 | Paper |
| Computing constrained approximate equilibria in polymatrix games | 2018-02-13 | Paper |
| Directed Graph Minors and Serial-Parallel Width | 2017-11-06 | Paper |
| Computing approximate Nash equilibria in polymatrix games | 2017-03-03 | Paper |
| Inapproximability results for approximate Nash equilibria | 2017-02-10 | Paper |
| Distributed Methods for Computing Approximate Equilibria | 2017-02-10 | Paper |
| Lipschitz continuity and approximate equilibria | 2016-09-29 | Paper |
| Computing approximate Nash equilibria in polymatrix games | 2015-01-07 | Paper |
