| 2026 | ICALP | Online Steiner Forest with Recourse. | Yaowei Long, Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski |
| 2026 | SODA | Sublinear Metric Steiner Forest via Maximal Independent Set. | Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian |
| 2025 | ICALP | A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. | Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski |
| 2024 | AISTATS | Fairness in Submodular Maximization over a Matroid Constraint. | Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong |
| 2024 | ICLR | Efficiently Computing Similarities to Private Datasets. | Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski |
| 2024 | ICML | DjVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving. | Foteini Strati, Sara McAllister, Amar Phanishayee, Jakub Tarnawski, Ana Klimovic |
| 2024 | ICML | Integrated Hardware Architecture and Device Placement Search. | Irene Wang, Jakub Tarnawski, Amar Phanishayee, Divya Mahajan |
| 2023 | ICML | Fairness in Streaming Submodular Maximization over a Matroid Constraint. | Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski |
| 2022 | SODA | On the Hardness of Scheduling With Non-Uniform Communication Delays. | Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang |
| 2022 | STOC | Online edge coloring via tree recurrences and correlation decay. | Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski |
| 2021 | ICML | Correlation Clustering in Constant Many Parallel Rounds. | Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski |
| 2021 | SODA | Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. | Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang |
| 2020 | FOCS | Scheduling with Communication Delays via LP Hierarchies and Clustering. | Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang |
| 2020 | SODA | Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. | Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye |
| 2018 | ICML | Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. | Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson |
| 2018 | STOC | A constant-factor approximation algorithm for the asymmetric traveling salesman problem. | Ola Svensson, Jakub Tarnawski, Lszl A. Vgh |
| 2017 | FOCS | The Matching Problem in General Graphs Is in Quasi-NC. | Ola Svensson, Jakub Tarnawski |
| 2017 | MICCAI | Active Learning and Proofreading for Delineation of Curvilinear Structures. | Agata Mosinska, Jakub Tarnawski, Pascal Fua |
| 2017 | SODA | Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. | Christos Kalaitzis, Ola Svensson, Jakub Tarnawski |
| 2016 | IPCO | Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). | Ola Svensson, Jakub Tarnawski, Lszl A. Vgh |
| 2015 | SODA | Fast Generation of Random Spanning Trees and the Effective Resistance Metric. | Aleksander Madry, Damian Straszak, Jakub Tarnawski |