| 2026 | IPCO | Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding. | Zachary Friggstad, Tobias Mmke |
| 2026 | SODA | Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle Routing. | Zachary Friggstad, Fabrizio Grandoni, Ramin Mousavi |
| 2025 | IPCO | A Constant-Factor Approximation for Pairwise Fair k-Center Clustering. | Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad, Mahya Jamshidian |
| 2025 | SODA | Approximating Traveling Salesman Problems Using a Bridge Lemma. | Martin Bhm, Zachary Friggstad, Tobias Mmke, Joachim Spoerhase |
| 2025 | WADS | A QPTAS for Facility Location on Unit Disk Graphs. | Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun |
| 2025 | WADS | Approximation Algorithms for the Generalized Point-To-Point Problem. | Zachary Friggstad, Mohammad R. Salavatipour, Hao Sun |
| 2023 | ICALP | An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. | Zachary Friggstad, Ramin Mousavi |
| 2023 | WADS | A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. | Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi |
| 2023 | WADS | Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. | Ian DeHaan, Zachary Friggstad |
| 2022 | AAAI | Parameterized Approximation Algorithms for K-center Clustering and Variants. | Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi |
| 2022 | ESA | Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. | Zachary Friggstad, Mahya Jamshidian |
| 2022 | IPCO | Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. | Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy |
| 2022 | IPCO | Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. | Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
| 2022 | ISAAC | Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. | Zachary Friggstad, Ramin Mousavi |
| 2021 | ICALP | Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. | Zachary Friggstad, Chaitanya Swamy |
| 2021 | WADS | Graph Pricing with Limited Supply. | Zachary Friggstad, Maryam Mahboub |
| 2021 | WADS | Fair Correlation Clustering with Global and Local Guarantees. | Zachary Friggstad, Ramin Mousavi |
| 2020 | ESA | A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. | Zachary Friggstad, Chaitanya Swamy |
| 2019 | SODA | Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. | Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour |
| 2018 | SODA | Approximation Schemes for Clustering with Outliers. | Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour |
| 2018 | WSDM | Orienteering Algorithms for Generating Travel Itineraries. | Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tams Sarls, Chaitanya Swamy, Andrew Tomkins |
| 2017 | ICALP | Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. | Sara Ahmadian, Zachary Friggstad |
| 2017 | IPCO | Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. | Zachary Friggstad, Chaitanya Swamy |
| 2016 | FOCS | Local Search Yields a PTAS for k-Means in Doubling Metrics. | Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour |
| 2016 | ICALP | Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median. | Zachary Friggstad, Yifeng Zhang |
| 2015 | Algosensors | Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line. | Robert Benkoczi, Zachary Friggstad, Daya Ram Gaur, Mark Thom |
| 2015 | ICALP | Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. | Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar |
| 2015 | WADS | LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. | Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Jos A. Soto |
| 2014 | IPCO | Linear Programming Hierarchies Suffice for Directed Steiner Tree. | Zachary Friggstad, Jochen Knemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani |
| 2014 | STOC | Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. | Zachary Friggstad, Chaitanya Swamy |
| 2013 | IPCO | An Improved Integrality Gap for Asymmetric TSP Paths. | Zachary Friggstad, Anupam Gupta, Mohit Singh |
| 2013 | SODA | Local-Search based Approximation Algorithms for Mobile Facility Location Problems. | Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy |
| 2013 | WADS | Lift-and-Project Methods for Set Cover and Knapsack. | Eden Chlamtc, Zachary Friggstad, Konstantinos Georgiou |
| 2010 | SODA | Asymmetric Traveling Salesman Path and Directed Latency Problems. | Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina |
| 2009 | SODA | A logarithmic approximation for unsplittable flow on line graphs. | Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour |
| 2008 | FOCS | Minimizing Movement in Mobile Facility Location Problems. | Zachary Friggstad, Mohammad R. Salavatipour |
| 2008 | PDPTA | Design of Reconfigurable DFA Architecture. | Hua Li, Zachary Friggstad, Fang M. Wang |
| 2007 | ISAAC | Approximability of Packing Disjoint Cycles. | Zachary Friggstad, Mohammad R. Salavatipour |
| 2005 | ISCAS | An efficient architecture for the AES mix columns operation. | Hua Li, Zachary Friggstad |