An efficient architecture for the AES mix columns operation. - Hua Li; Zachary Friggstad (ISCAS (5), 2005)

Explicit upper bounds for f(n)=Πpω(n) p/p-1. - Amir Akbary; Zachary Friggstad; Robert Juricevic (Contributions Discret. Math., 2007)

Design of Reconfigurable DFA Architecture. - Hua Li; Zachary Friggstad; Fang M. Wang (PDPTA, 2008)

Superabundant Numbers and the Riemann Hypothesis. - Amir Akbary; Zachary Friggstad (Am. Math. Mon., 2009)

Approximability of Packing Disjoint Cycles. - Zachary Friggstad; Mohammad R. Salavatipour (Algorithmica, 2011)

Minimizing movement in mobile facility location problems. - Zachary Friggstad; Mohammad R. Salavatipour (ACM Trans. Algorithms, 2011)

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods - Eden Chlamtác; Zac Friggstad; Konstantinos Georgiou (CoRR, 2012)

Multiple Traveling Salesmen in Asymmetric Metrics. - Zachary Friggstad (APPROX-RANDOM, 2013)

Local-Search based Approximation Algorithms for Mobile Facility Location Problems. - Sara Ahmadian; Zachary Friggstad; Chaitanya Swamy (SODA, 2013)

Asymmetric Traveling Salesman Path and Directed Latency Problems. - Zachary Friggstad; Mohammad R. Salavatipour; Zoya Svitkina (SIAM J. Comput., 2013)

Approximation Algorithms for Minimum-Load k-Facility Location. - Sara Ahmadian; Babak Behsaz; Zachary Friggstad; Amin Jorati; Mohammad R. Salavatipour; Chaitanya Swamy (APPROX-RANDOM, 2014)

Linear Programming Hierarchies Suffice for Directed Steiner Tree. - Zachary Friggstad; Jochen Könemann; Young Kun-Ko; Anand Louis; Mohammad Shadravan; Madhur Tulsiani (IPCO, 2014)

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. - Zachary Friggstad; Chaitanya Swamy (STOC, 2014)

A logarithmic approximation for unsplittable flow on line graphs. - Nikhil Bansal 001; Zachary Friggstad; Rohit Khandekar; Mohammad R. Salavatipour (ACM Trans. Algorithms, 2014)

Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line. - Robert Benkoczi; Zachary Friggstad; Daya Ram Gaur; Mark Thom (ALGOSENSORS, 2015)

On Linear Programming Relaxations for Unsplittable Flow in Trees. - Zachary Friggstad; Zhihan Gao 002 (APPROX-RANDOM, 2015)

Approximating Minimum-Cost Connected T-Joins. - Joseph Cheriyan; Zachary Friggstad; Zhihan Gao 002 (Algorithmica, 2015)

Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median. - Zachary Friggstad; Yifeng Zhang 006 (ICALP, 2016)

A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs . - Zachary Friggstad; Jochen Könemann; Mohammad Shadravan (SWAT, 2016)

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. - Zachary Friggstad; Mohsen Rezapour; Mohammad R. Salavatipour (SWAT, 2016)

Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median. - Zachary Friggstad; Yifeng Zhang 006 (CoRR, 2016)

An Improved Integrality Gap for Asymmetric TSP Paths. - Zachary Friggstad; Anupam Gupta 001; Mohit Singh (Math. Oper. Res., 2016)

Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. - Sara Ahmadian; Zachary Friggstad (ICALP, 2017)

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. - Zachary Friggstad; Chaitanya Swamy (IPCO, 2017)

Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup). - Zach Goldthorpe; Jason Cannon; Jesse Farebrother; Zachary Friggstad; Mario A. Nascimento (SIGSPATIAL/GIS, 2018)

Orienteering Algorithms for Generating Travel Itineraries. - Zachary Friggstad; Sreenivas Gollapudi; Kostas Kollias; Tamás Sarlós; Chaitanya Swamy; Andrew Tomkins (WSDM, 2018)

Lift-and-Project Methods for Set Cover and Knapsack. - Eden Chlamtác; Zachary Friggstad; Konstantinos Georgiou (Algorithmica, 2018)

Approximation Algorithms for Minimum-Load k-Facility Location. - Sara Ahmadian; Babak Behsaz; Zachary Friggstad; Amin Jorati; Mohammad R. Salavatipour; Chaitanya Swamy (ACM Trans. Algorithms, 2018)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. - Zachary Friggstad; Kamyar Khodamoradi; Mohammad R. Salavatipour (SODA, 2019)

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. - Babak Behsaz; Zachary Friggstad; Mohammad R. Salavatipour; Rohit Sivakumar (Algorithmica, 2019)

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. - Zachary Friggstad; Mohsen Rezapour; Mohammad R. Salavatipour; José A. Soto (Algorithmica, 2019)

Scheduling problems over a network of machines. - Zachary Friggstad; Arnoosh Golestanian; Kamyar Khodamoradi; Christopher S. Martin; Mirmahdi Rahgoshay; Mohsen Rezapour; Mohammad R. Salavatipour; Yifeng Zhang 006 (J. Sched., 2019)

Local Search Yields a PTAS for k-Means in Doubling Metrics. - Zachary Friggstad; Mohsen Rezapour; Mohammad R. Salavatipour (SIAM J. Comput., 2019)

Approximation Schemes for Clustering with Outliers. - Zachary Friggstad; Kamyar Khodamoradi; Mohsen Rezapour; Mohammad R. Salavatipour (ACM Trans. Algorithms, 2019)

Preface. - Zachary Friggstad; Jörg-Rüdiger Sack; Mohammad R. Salavatipour (Comput. Geom., 2020)

Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. - Zachary Friggstad; Chaitanya Swamy (ICALP, 2021)

Graph Pricing with Limited Supply. - Zachary Friggstad; Maryam Mahboub (WADS, 2021)

Fair Correlation Clustering with Global and Local Guarantees. - Zachary Friggstad; Ramin Mousavi (WADS, 2021)

Special Issue on Algorithms and Data Structures (WADS 2019). - Zachary Friggstad; Jörg-Rüdiger Sack; Mohammad R. Salavatipour (Algorithmica, 2021)

Automatic Embedding of Stories Into Collections of Independent Media. - Dylan R. Ashley; Vincent Herrmann; Zachary Friggstad; Kory W. Mathewson; Jürgen Schmidhuber (CoRR, 2021)

Improved Approximations for CVRP with Unsplittable Demands. - Zachary Friggstad; Ramin Mousavi; Mirmahdi Rahgoshay; Mohammad R. Salavatipour (CoRR, 2021)

Parameterized Approximation Algorithms for K-center Clustering and Variants. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (AAAI, 2022)

Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. - Zachary Friggstad; Mahya Jamshidian (ESA, 2022)

Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. - Sina Dezfuli; Zachary Friggstad; Ian Post; Chaitanya Swamy (IPCO, 2022)

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. - Zachary Friggstad; Ramin Mousavi; Mirmahdi Rahgoshay; Mohammad R. Salavatipour (IPCO, 2022)

Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. - Zachary Friggstad; Ramin Mousavi (ISAAC, 2022)

Preface. - Jean-Lou De Carufel; Zachary Friggstad (Comput. Geom., 2022)

On Narrative Information and the Distillation of Stories. - Dylan R. Ashley; Vincent Herrmann; Zachary Friggstad; Jürgen Schmidhuber (CoRR, 2022)

A constant-factor approximation for directed latency in quasi-polynomial time. - Zachary Friggstad; Chaitanya Swamy (J. Comput. Syst. Sci., 2022)

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. - Zachary Friggstad; Ramin Mousavi (APPROX/RANDOM, 2023)

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. - Zachary Friggstad; Ramin Mousavi (ICALP, 2023)

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (WADS, 2023)

Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. - Ian DeHaan; Zachary Friggstad (WADS, 2023)

Approximating Minimum Sum Coloring with Bundles. - Seyed Parsa Darbouy; Zachary Friggstad (SWAT, 2024)

A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree. - Zachary Friggstad; Hao Sun (SWAT, 2024)

A QPTAS for Facility Location on Unit Disk graphs. - Zachary Friggstad; Mohsen Rezapour; Mohammad R. Salavatipour; Hao Sun (CoRR, 2024)

Approximating TSP Variants Using a Bridge Lemma. - Martin Böhm 001; Zachary Friggstad; Tobias Mömke; Joachim Spoerhase (CoRR, 2024)

Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. - Ian DeHaan; Zachary Friggstad (CoRR, 2024)

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii. - Zachary Friggstad; Mahya Jamshidian (CoRR, 2024)

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (Algorithmica, 2024)

A Constant-Factor Approximation for Pairwise Fair k-Center Clustering. - Sayan Bandyapadhyay; Tianzhi Chen; Zachary Friggstad; Mahya Jamshidian (IPCO, 2025)

Approximating Traveling Salesman Problems Using a Bridge Lemma. - Martin Böhm 001; Zachary Friggstad; Tobias Mömke; Joachim Spoerhase (SODA, 2025)

On the Distillation of Stories for Transferring Narrative Arcs in Collections of Independent Media. - Dylan R. Ashley; Vincent Herrmann; Zachary Friggstad; Jürgen Schmidhuber (IEEE Trans. Pattern Anal. Mach. Intell., 2025)