Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
S Schjolberg
Hao Mao
Peter Malec
Zuguang Huang
Giovanni Venturelli
Chen Ma
Manas Pathak
Radu Timofte
Kuanrui Yin
Home
/
Author
/
JAKUB TARNAWSKI
Author Info
Open Visualization
Name
Affiliation
Papers
JAKUB TARNAWSKI
Microsoft Res, Redmond, WA 98052 USA
18
Collaborators
Citations
PageRank
33
16
6.34
Referers
Referees
References
47
212
111
Search Limit
100
212
Publications (18 rows)
Collaborators (33 rows)
Referers (47 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
On the Hardness of Scheduling With Non-Uniform Communication Delays
0
0.34
2022
Correlation Clustering In Constantly Many Parallel Rounds
0
0.34
2021
New Graph Algorithms Via Polyhedral Techniques
0
0.34
2021
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines
0
0.34
2021
Scheduling with Communication Delays via LP Hierarchies and Clustering
0
0.34
2020
Efficient Algorithms for Device Placement of DNN Graph Operators
0
0.34
2020
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints.
0
0.34
2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
0
0.34
2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
0
0.34
2020
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
0
0.34
2020
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.
0
0.34
2018
Constant Factor Approximation for ATSP with Two Edge Weights.
0
0.34
2018
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
1
0.36
2018
The Matching Problem in General Graphs Is in Quasi-NC
5
0.44
2017
Active Learning and Proofreading for Delineation of Curvilinear Structures.
3
0.38
2017
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios.
0
0.34
2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
0
0.34
2017
Fast generation of random spanning trees and the effective resistance metric
7
0.44
2015
1