| Generalizations of 2-dimensional diagonal quantum channels with constant Frobenius norm I Sergeev Reports on Mathematical Physics 83 (3), 349-372, 2019 | 7 | 2019 |
| Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid R Santiago, I Sergeev, R Zenklusen Mathematical Programming, 1-32, 2025 | 2 | 2025 |
| Simple random order contention resolution for graphic matroids with almost no prior information R Santiago, I Sergeev, R Zenklusen Symposium on Simplicity in Algorithms (SOSA), 84-95, 2023 | 2 | 2023 |
| Equivalence of the catalytic entropy conjecture and the transitivity conjecture is plausible I Sergeev ETH Zurich, 2019 | 1 | 2019 |
| On contention resolution for the hypergraph matching, knapsack, and -column sparse packing problems I Sergeev arXiv preprint arXiv:2404.00041, 2024 | | 2024 |
| Constant-Competitive Online Selection Algorithms with Almost no Prior Information I Sergeev ETH Zurich, 2023 | | 2023 |
| Improved approximation algorithms for two Euclidean k-Center variants H Angelidakis, I Sergeev, P Westermark arXiv preprint arXiv:2112.05083, 2021 | | 2021 |
Rico ZenklusenETH ZurichVerified email at math.ethz.ch