| On the size and the approximability of minimum temporally connected subgraphs K Axiotis, D Fotakis arXiv preprint arXiv:1602.06411, 2016 | 34 | 2016 |
| Circulation control for faster minimum cost flow in unit-capacity graphs K Axiotis, A Mądry, A Vladu 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 29 | 2020 |
| Capacitated dynamic programming: Faster knapsack and graph algorithms K Axiotis, C Tzamos arXiv preprint arXiv:1802.06440, 2018 | 24 | 2018 |
| Fast modular subset sum using linear sketching K Axiotis, A Backurs, C Jin, C Tzamos, H Wu Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 16 | 2019 |
| Faster sparse minimum cost flow by electrical flow localization K Axiotis, A Mądry, A Vladu 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Decomposable submodular function minimization via maximum flow K Axiotis, A Karczmarz, A Mukherjee, P Sankowski, A Vladu International Conference on Machine Learning, 446-456, 2021 | 8 | 2021 |
| Sparse convex optimization via adaptively regularized hard thresholding K Axiotis, M Sviridenko The Journal of Machine Learning Research 22 (1), 5421-5467, 2021 | 8 | 2021 |
| Fast and Simple Modular Subset Sum∗ K Axiotis, A Backurs, K Bringmann, C Jin, V Nakos, C Tzamos, H Wu Symposium on Simplicity in Algorithms (SOSA), 57-67, 2021 | 7 | 2021 |
| Test Set Embedding into Low-Power BIST Sequences Using Maximum Bipartite Matching I Voyiatzis, K Axiotis, N Papaspyrou, H Antonopoulou, C Efstathiou 2012 16th Panhellenic Conference on Informatics, 74-79, 2012 | 4 | 2012 |
| Local Search Algorithms for Rank-Constrained Convex Optimization K Axiotis, M Sviridenko arXiv preprint arXiv:2101.06262, 2021 | 3 | 2021 |
| Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime K Axiotis, M Sviridenko International Conference on Machine Learning, 1175-1197, 2022 | 2 | 2022 |
| Algorithms for Subset Sum using linear sketching K Axiotis Massachusetts Institute of Technology, 2019 | | 2019 |
| Συνεκτικότητα σε χρονικά μεταβαλλόμενα δίκτυα Κ Αξιώτης | | 2017 |
