Local Restoration for Trees and Arborescences. - Paola Iovanna; Gaia Nicosia; Gianpaolo Oriolo; Laura Sanità; Ezio Sperduto (FITraMEn, 2008)

Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm. - Roberto Sabella; Paola Iovanna; Gianpaolo Oriolo; Laura Sanità (Opt. Switch. Netw., 2008)

On the Complexity of the Asymmetric VPN Problem. - Thomas Rothvoß; Laura Sanità (APPROX-RANDOM, 2009)

An improved LP-based approximation for steiner tree. - Jaroslaw Byrka; Fabrizio Grandoni 001; Thomas Rothvoß; Laura Sanità (STOC, 2010)

On Finding Another Room-Partitioning of the Vertices. - Jack Edmonds 001; Laura Sanità (Electron. Notes Discret. Math., 2010)

Stable routing under the Spanning Tree Protocol. - Fabrizio Grandoni 001; Gaia Nicosia; Gianpaolo Oriolo; Laura Sanità (Oper. Res. Lett., 2010)

The VPN Problem with Concave Costs. - Samuel Fiorini; Gianpaolo Oriolo; Laura Sanità; Dirk Oliver Theis (SIAM J. Discret. Math., 2010)

An Exact Algorithm for Robust Network Design. - Christoph Buchheim; Frauke Liers; Laura Sanità (INOC, 2011)

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. - Friedrich Eisenbrand; Naonori Kakimura; Thomas Rothvoß; Laura Sanità (IPCO, 2011)

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. - Fabrizio Grandoni 001; Thomas Rothvoß; Laura Sanità (Math. Oper. Res., 2011)

Better Approximation Algorithms for Technology Diffusion. - Jochen Könemann; Sina Sadeghian Sadeghabad; Laura Sanità (ESA, 2013)

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. - Jochen Könemann; Sina Sadeghian Sadeghabad; Laura Sanità (FOCS, 2013)

The School Bus Problem on Trees. - Adrian Bock; Elyot Grant; Jochen Könemann; Laura Sanità (Algorithmica, 2013)

On the approximability of two capacitated vehicle routing problems. - Adrian Bock; Laura Sanità (Electron. Notes Discret. Math., 2013)

Steiner Tree Approximation via Iterative Randomized Rounding. - Jaroslaw Byrka; Fabrizio Grandoni 001; Thomas Rothvoß; Laura Sanità (J. ACM, 2013)

Network design with a discrete set of traffic matrices. - Gianpaolo Oriolo; Laura Sanità; Rico Zenklusen (Oper. Res. Lett., 2013)

Stable Routing and Unique-Max Coloring on Trees. - Nicolai Hähnle; Laura Sanità; Rico Zenklusen (SIAM J. Discret. Math., 2013)

Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems. - Guru Guruganesh; Laura Sanità; Chaitanya Swamy (CoRR, 2014)

Exponentiality of the exchange algorithm for finding another room-partitioning. - Jack Edmonds 001; Laura Sanità (Discret. Appl. Math., 2014)

Approximate Deadline-Scheduling with Precedence Constraints. - Hossein Efsandiari; Mohammad Taghi Hajiaghayi; Jochen Könemann; Hamid Mahini; David L. Malec; Laura Sanità (ESA, 2015)

Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract). - Guru Guruganesh; Laura Sanità; Chaitanya Swamy (SODA, 2015)

The Capacitated Orienteering Problem. - Adrian Bock; Laura Sanità (Discret. Appl. Math., 2015)

Finding the closest ultrametric. - Marco Di Summa; David Pritchard 001; Laura Sanità (Discret. Appl. Math., 2015)

Finding small stabilizers for unstable graphs. - Adrian Bock; Karthekeyan Chandrasekaran; Jochen Könemann; Britta Peis; Laura Sanità (Math. Program., 2015)

On the existence of compact ε-approximated formulations for knapsack in the original space. - Yuri Faenza; Laura Sanità (Oper. Res. Lett., 2015)

The interval constrained 3-coloring problem. - Jaroslaw Byrka; Andreas Karrenbauer; Laura Sanità (Theor. Comput. Sci., 2015)

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. - Andreas Emil Feldmann; Jochen Könemann; Kanstantsin Pashkovich; Laura Sanità (ISAAC, 2016)

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. - Andreas Emil Feldmann; Jochen Könemann; Neil Olver; Laura Sanità (Math. Program., 2016)

Lehman's Theorem and the Directed Steiner Tree Problem. - Ahmad Abdi; Andreas Emil Feldmann; Bertrand Guenin; Jochen Könemann; Laura Sanità (SIAM J. Discret. Math., 2016)

Single-Sink Fractionally Subadditive Network Design. - Guru Guruganesh; Jennifer Iglesias; R. Ravi 001; Laura Sanità (ESA, 2017)

A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. - Samuel Fiorini; Martin Groß 001; Jochen Könemann; Laura Sanità (CoRR, 2017)

0/1 Polytopes with Quadratic Chvátal Rank. - Thomas Rothvoß; Laura Sanità (Oper. Res., 2017)

Algorithms for Inverse Optimization Problems. - Sara Ahmadian; Umang Bhaskar; Laura Sanità; Chaitanya Swamy (ESA, 2018)

The Diameter of the Fractional Matching Polytope and Its Hardness Implications. - Laura Sanità (FOCS, 2018)

Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. - Samuel Fiorini; Martin Groß 001; Jochen Könemann; Laura Sanità (SODA, 2018)

On the approximability of the stable marriage problem with one-sided ties. - Felix Bauckholt; Kanstantsin Pashkovich; Laura Sanità (CoRR, 2018)

Opposite Elements in Clutters. - Ahmad Abdi; Ricardo Fukasawa; Laura Sanità (Math. Oper. Res., 2018)

Stabilizing network bargaining games by blocking players. - Sara Ahmadian; Hamideh Hosseinzadeh; Laura Sanità (Math. Program., 2018)

WAOA 2015 Special Issue on TOCS. - Laura Sanità; Martin Skutella (Theory Comput. Syst., 2018)

On the Circuit Diameter of Some Combinatorial Polytopes. - Sean Kafer; Kanstantsin Pashkovich; Laura Sanità (SIAM J. Discret. Math., 2019)

On the diameter of the polytope of the stable marriage with ties. - Felix Bauckholt; Laura Sanità (CoRR, 2020)

Stabilizing Weighted Graphs. - Zhuan Khye Koh; Laura Sanità (Math. Oper. Res., 2020)

An efficient characterization of submodular spanning tree games. - Zhuan Khye Koh; Laura Sanità (Math. Program., 2020)

Choose your witnesses wisely. - Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (CoRR, 2022)

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. - Jesús A. De Loera; Sean Kafer; Laura Sanità (SIAM J. Optim., 2022)

Finding Almost Tight Witness Trees. - Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (ICALP, 2023)

Capacitated Network Bargaining Games: Stability and Structure. - Laura Sanità; Lucy Verberk (CoRR, 2023)

Node Connectivity Augmentation of Highly Connected Graphs. - Waldo Gálvez; Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (CoRR, 2023)

Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). - Jason Li 006; Debmalya Panigrahi; Laura Sanità; Thatchaphol Saranurak (Dagstuhl Reports, 2023)

Node connectivity augmentation via iterative randomized rounding. - Haris Angelidakis; Dylan Hyatt-Denesik; Laura Sanità (Math. Program., 2023)

Improved Approximations for Flexible Network Design. - Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (ESA, 2024)

On the Number of Degenerate Simplex Pivots. - Kirill Kukharenko; Laura Sanità (IPCO, 2024)

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022. - Karen I. Aardal; Laura Sanità (Math. Program., 2024)

On the hardness of short and sign-compatible circuit walks. - Steffen Borgwardt; Weston Grewe; Sean Kafer; Jon Lee 001; Laura Sanità (Discret. Appl. Math., 2025)

On the Simplex Method for 0/1-Polytopes. - Alexander E. Black; Jesús A. De Loera; Sean Kafer; Laura Sanità (Math. Oper. Res., 2025)

A note on the core of 2-matching games. - Laura Sanità; Lucy Verberk (Oper. Res. Lett., 2025)

Stabilization of capacitated matching games. - Matthew Gerstbrein; Laura Sanità; Lucy Verberk (Math. Program., 2025)

Two-stage Stochastic Assignment Games. - Laura Sanità; Lucy Verberk (CoRR, 2025)

Learning-Augmented Online Covering Problems. - Afrouz Jabal Ameli; Laura Sanità; Moritz Venzin (CoRR, 2025)