Fast Generation of Random Spanning Trees and the Effective Resistance Metric. - Aleksander Madry; Damian Straszak; Jakub Tarnawski (SODA, 2015)

Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). - Ola Svensson; Jakub Tarnawski; László A. Végh (IPCO, 2016)

Active Learning and Proofreading for Delineation of Curvilinear Structures. - Agata Mosinska; Jakub Tarnawski; Pascal Fua (MICCAI (2), 2017)

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. - Slobodan Mitrovic; Ilija Bogunovic; Ashkan Norouzi-Fard; Jakub Tarnawski; Volkan Cevher (NIPS, 2017)

Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. - Christos Kalaitzis; Ola Svensson; Jakub Tarnawski (SODA, 2017)

The Matching Problem in General Graphs is in Quasi-NC. - Ola Svensson; Jakub Tarnawski (Electron. Colloquium Comput. Complex., 2017)

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. - Ashkan Norouzi-Fard; Jakub Tarnawski; Slobodan Mitrovic; Amir Zandieh; Aidasadat Mousavifar; Ola Svensson (ICML, 2018)

Constant factor approximation for ATSP with two edge weights. - Ola Svensson; Jakub Tarnawski; László A. Végh (Math. Program., 2018)

New Graph Algorithms via Polyhedral Techniques. - Jakub Tarnawski (2019)

Neue Graphen-Algorithmen mittels polyedrischer Methoden. - Jakub Tarnawski (Ausgezeichnete Informatikdissertationen, 2019)

Scheduling with Communication Delays via LP Hierarchies and Clustering. - Sami Davies; Janardhan Kulkarni; Thomas Rothvoss; Jakub Tarnawski; Yihao Zhang (FOCS, 2020)

Fairness in Streaming Submodular Maximization: Algorithms and Hardness. - Marwa El Halabi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakab Tardos; Jakub Tarnawski (NeurIPS, 2020)

Fully Dynamic Algorithm for Constrained Submodular Optimization. - Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Jakub Tarnawski; Morteza Zadimoghaddam (NeurIPS, 2020)

Efficient Algorithms for Device Placement of DNN Graph Operators. - Jakub Tarnawski; Amar Phanishayee; Nikhil R. Devanur; Divya Mahajan 001; Fanny Nina Paravecino (NeurIPS, 2020)

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. - Janardhan Kulkarni; Shi Li 001; Jakub Tarnawski; Minwei Ye (SODA, 2020)

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. - Ola Svensson; Jakub Tarnawski; László A. Végh (J. ACM, 2020)

Correlation Clustering in Constant Many Parallel Rounds. - Vincent Cohen-Addad; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (ICML, 2021)

Piper: Multidimensional Planner for DNN Parallelization. - Jakub Tarnawski; Deepak Narayanan; Amar Phanishayee (NeurIPS, 2021)

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 (SODA, 2021)

New graph algorithms via polyhedral techniques. - Jakub Tarnawski (it Inf. Technol., 2021)

Near-Optimal Correlation Clustering with Privacy. - Vincent Cohen-Addad; Chenglin Fan; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (NeurIPS, 2022)

On the Hardness of Scheduling With Non-Uniform Communication Delays. - Sami Davies; Janardhan Kulkarni; Thomas Rothvoss; Sai Sandeep; Jakub Tarnawski; Yihao Zhang (SODA, 2022)

Harmony: Overcoming the hurdles of GPU memory capacity to train massive DNN models on commodity servers. - Youjie Li; Amar Phanishayee; Derek Murray; Jakub Tarnawski; Nam Sung Kim (Proc. VLDB Endow., 2022)

Fairness in Streaming Submodular Maximization over a Matroid Constraint. - Marwa El Halabi; Federico Fusco; Ashkan Norouzi-Fard; Jakab Tardos; Jakub Tarnawski (ICML, 2023)

Fairness in Submodular Maximization over a Matroid Constraint. - Marwa El Halabi; Jakub Tarnawski; Ashkan Norouzi-Fard; Thuy-Duong Vuong (AISTATS, 2024)

Efficiently Computing Similarities to Private Datasets. - Arturs Backurs; Zinan Lin 001; Sepideh Mahabadi; Sandeep Silwal; Jakub Tarnawski (ICLR, 2024)

DéjàVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving. - Foteini Strati; Sara McAllister; Amar Phanishayee; Jakub Tarnawski; Ana Klimovic (ICML, 2024)

Integrated Hardware Architecture and Device Placement Search. - Irene Wang; Jakub Tarnawski; Amar Phanishayee; Divya Mahajan 001 (ICML, 2024)

Online Edge Coloring via Tree Recurrences and Correlation Decay. - Janardhan Kulkarni; Yang P. Liu; Ashwin Sah; Mehtaab S. Sawhney; Jakub Tarnawski (SIAM J. Comput., 2024)

A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. - Sepideh Mahabadi; Mohammad Roghani; Jakub Tarnawski (ICALP, 2025)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. - Sepideh Mahabadi; Mohammad Roghani; Jakub Tarnawski; Ali Vakilian (ITCS, 2025)

A 0.51-Approximation of Maximum Matching in Sublinear n1.5 Time. - Sepideh Mahabadi; Mohammad Roghani; Jakub Tarnawski (CoRR, 2025)