| 2024 | ESA | Improved Approximations for Flexible Network Design. | Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanit |
| 2024 | IPCO | On the Number of Degenerate Simplex Pivots. | Kirill Kukharenko, Laura Sanit |
| 2023 | ICALP | Finding Almost Tight Witness Trees. | Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanit |
| 2023 | IPCO | Stabilization of Capacitated Matching Games. | Matthew Gerstbrein, Laura Sanit, Lucy Verberk |
| 2019 | IPCO | An Efficient Characterization of Submodular Spanning Tree Games. | Zhuan Khye Koh, Laura Sanit |
| 2018 | ESA | Algorithms for Inverse Optimization Problems. | Sara Ahmadian, Umang Bhaskar, Laura Sanit, Chaitanya Swamy |
| 2018 | FOCS | The Diameter of the Fractional Matching Polytope and Its Hardness Implications. | Laura Sanit |
| 2018 | ICALP | Stabilizing Weighted Graphs. | Zhuan Khye Koh, Laura Sanit |
| 2018 | SODA | Approximating Weighted Tree Augmentation via Chvtal-Gomory Cuts. | Samuel Fiorini, Martin Gro, Jochen Knemann, Laura Sanit |
| 2017 | ESA | Single-Sink Fractionally Subadditive Network Design. | Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanit |
| 2016 | IPCO | Stabilizing Network Bargaining Games by Blocking Players. | Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanit |
| 2016 | ISAAC | Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. | Andreas Emil Feldmann, Jochen Knemann, Kanstantsin Pashkovich, Laura Sanit |
| 2015 | ESA | Approximate Deadline-Scheduling with Precedence Constraints. | Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Knemann, Hamid Mahini, David L. Malec, Laura Sanit |
| 2015 | SODA | Improved Region-Growing and Combinatorial Algorithms for | Guru Guruganesh, Laura Sanit, Chaitanya Swamy |
| 2014 | IPCO | Finding Small Stabilizers for Unstable Graphs. | Adrian Bock, Karthekeyan Chandrasekaran, Jochen Knemann, Britta Peis, Laura Sanit |
| 2013 | ESA | Better Approximation Algorithms for Technology Diffusion. | Jochen Knemann, Sina Sadeghian Sadeghabad, Laura Sanit |
| 2013 | FOCS | An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. | Jochen Knemann, Sina Sadeghian Sadeghabad, Laura Sanit |
| 2013 | IPCO | 0/1 Polytopes with Quadratic Chvtal Rank. | Thomas Rothvo, Laura Sanit |
| 2011 | INOC | An Exact Algorithm for Robust Network Design. | Christoph Buchheim, Frauke Liers, Laura Sanit |
| 2011 | IPCO | Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. | Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvo, Laura Sanit |
| 2011 | ISAAC | The School Bus Problem on Trees. | Adrian Bock, Elyot Grant, Jochen Knemann, Laura Sanit |
| 2010 | LATIN | The Interval Constrained 3-Coloring Problem. | Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit |
| 2010 | STOC | An improved LP-based approximation for steiner tree. | Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanit |