| On the size and the approximability of minimum temporally connected subgraphs K Axiotis, D Fotakis arXiv preprint arXiv:1602.06411, 2016 | 44 | 2016 |
| Capacitated dynamic programming: Faster knapsack and graph algorithms K Axiotis, C Tzamos arXiv preprint arXiv:1802.06440, 2018 | 43 | 2018 |
| 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 | 42 | 2020 |
| 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 | 29 | 2022 |
| 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 | 18 | 2019 |
| Sparse convex optimization via adaptively regularized hard thresholding K Axiotis, M Sviridenko Journal of Machine Learning Research 22 (122), 1-47, 2021 | 13 | 2021 |
| 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 | 12 | 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 | 11 | 2021 |
| Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime K Axiotis, M Sviridenko International Conference on Machine Learning, 1175-1197, 2022 | 7 | 2022 |
| Local Search Algorithms for Rank-Constrained Convex Optimization K Axiotis, M Sviridenko arXiv preprint arXiv:2101.06262, 2021 | 6 | 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 |
| SubMix: Learning to Mix Graph Sampling Heuristics S Abu-El-Haija, JV Dillon, B Fatemi, K Axiotis, N Bulut, J Gasteiger, ... Uncertainty in Artificial Intelligence, 1-10, 2023 | 3 | 2023 |
| Performance of Regularization for Sparse Convex Optimization K Axiotis, T Yasuda arXiv preprint arXiv:2307.07405, 2023 | 2 | 2023 |
| Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond K Axiotis, V Cohen-Addad, M Henzinger, S Jerome, V Mirrokni, D Saulpic, ... arXiv preprint arXiv:2402.17327, 2024 | | 2024 |
| SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization T Yasuda, K Axiotis, G Fu, MH Bateni, V Mirrokni arXiv preprint arXiv:2402.17902, 2024 | | 2024 |
| Greedy PIG: Adaptive Integrated Gradients K Axiotis, S Abu-al-haija, L Chen, M Fahrbach, G Fu arXiv preprint arXiv:2311.06192, 2023 | | 2023 |
| Gradient descent converges linearly for logistic regression on separable data K Axiotis, M Sviridenko International Conference on Machine Learning, 1302-1319, 2023 | | 2023 |
| Algorithms for Subset Sum using linear sketching K Axiotis Massachusetts Institute of Technology, 2019 | | 2019 |
| Συνεκτικότητα σε χρονικά μεταβαλλόμενα δίκτυα Κ Αξιώτης | | 2017 |
