Jakub Tarnawski
Jakub Tarnawski
Researcher, Microsoft Research
Verified email at microsoft.com - Homepage
Title
Cited by
Cited by
Year
Fast generation of random spanning trees and the effective resistance metric
A Mądry, D Straszak, J Tarnawski
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015
562015
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
O Svensson, J Tarnawski, LA Végh
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
522018
Beyond 1/2-approximation for submodular maximization on massive data streams
A Norouzi-Fard, J Tarnawski, S Mitrovic, A Zandieh, A Mousavifar, ...
International Conference on Machine Learning, 3829-3838, 2018
502018
The matching problem in general graphs is in quasi-NC
O Svensson, J Tarnawski
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
442017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
S Mitrović, I Bogunovic, A Norouzi-Fard, J Tarnawski, V Cevher
Advances in Neural Information Processing Systems, 4558-4567, 2017
342017
Active Learning and Proofreading for Delineation of Curvilinear Structures
A Mosinska, J Tarnawski, P Fua
International Conference on Medical Image Computing and Computer-Assisted …, 2017
192017
Efficient algorithms for device placement of dnn graph operators
JM Tarnawski, A Phanishayee, N Devanur, D Mahajan, ...
Advances in Neural Information Processing Systems 33, 2020
132020
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
C Kalaitzis, O Svensson, J Tarnawski
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
82017
Scheduling with communication delays via LP hierarchies and clustering
S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
72020
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines
S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
62021
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
J Kulkarni, S Li, J Tarnawski, M Ye
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
62020
Correlation Clustering in Constant Many Parallel Rounds
V Cohen-Addad, S Lattanzi, S Mitrović, A Norouzi-Fard, N Parotsidis, ...
arXiv preprint arXiv:2106.08448, 2021
22021
Constant factor approximation for ATSP with two edge weights
O Svensson, J Tarnawski, LA Végh
Mathematical Programming 172 (1-2), 371-397, 2018
22018
Fully Dynamic Algorithm for Constrained Submodular Optimization
S Lattanzi, S Mitrović, A Norouzi-Fard, J Tarnawski, M Zadimoghaddam
arXiv preprint arXiv:2006.04704, 2020
12020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
M El Halabi, S Mitrović, A Norouzi-Fard, J Tardos, JM Tarnawski
Advances in Neural Information Processing Systems 33, 2020
12020
New Graph Algorithms via Polyhedral Techniques
J Tarnawski
EPFL, 2019
12019
On the Hardness of Scheduling With Non-Uniform Communication Delays
S Davies, J Kulkarni, T Rothvoss, S Sandeep, J Tarnawski, Y Zhang
arXiv preprint arXiv:2105.00111, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–17