Laura Sanità

87 papers A* 7A 5B 12C 1Journal 58Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
A simple Path-based LP Relaxation for Directed Steiner Tree.
CoRR
Kanstantsin Pashkovich, Marta Pozzi, Laura Sanità
2025 J jnl
A note on the core of 2-matching games.
Oper. Res. Lett.
Laura Sanità, Lucy Verberk
2025 J jnl
Learning-Augmented Online Covering Problems.
CoRR
Afrouz Jabal Ameli, Laura Sanità, Moritz Venzin
2025 J jnl
On the Simplex Method for 0/1-Polytopes.
Math. Oper. Res.
Alexander E. Black, Jesús A. De Loera, Sean Kafer, Laura Sanità
2025 J jnl
On the hardness of short and sign-compatible circuit walks.
Discret. Appl. Math.
Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità
2025 J jnl
Stabilization of capacitated matching games.
Math. Program.
Matthew Gerstbrein, Laura Sanità, Lucy Verberk
2025 J jnl
Two-stage Stochastic Assignment Games.
CoRR
Laura Sanità, Lucy Verberk
2024 J jnl
A Note on the Core of 2-Matching Games.
CoRR
Laura Sanità, Lucy Verberk
2024 A conf
Improved Approximations for Flexible Network Design.
ESA
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità
2024 J jnl
Improved Approximations for Flexible Network Design.
CoRR
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità
2024 B conf
On the Number of Degenerate Simplex Pivots.
IPCO
Kirill Kukharenko, Laura Sanità
2024 J jnl
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022.
Math. Program.
Karen I. Aardal, Laura Sanità
2023 J jnl
Capacitated Network Bargaining Games: Stability and Structure.
CoRR
Laura Sanità, Lucy Verberk
2023 A* conf
Finding Almost Tight Witness Trees.
ICALP
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità
2023 J jnl
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422).
Dagstuhl Reports
Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak
2023 J jnl
Node Connectivity Augmentation of Highly Connected Graphs.
CoRR
Waldo Gálvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità
2023 J jnl
Node connectivity augmentation via iterative randomized rounding.
Math. Program.
Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità
2023 B conf
Stabilization of Capacitated Matching Games.
IPCO
Matthew Gerstbrein, Laura Sanità, Lucy Verberk
2022 J jnl
Choose your witnesses wisely.
CoRR
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità
2022 B ed.
Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings
IPCO
Karen I. Aardal, Laura Sanità
2022 J jnl
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization.
SIAM J. Optim.
Jesús A. De Loera, Sean Kafer, Laura Sanità
2022 J jnl
Stabilization of Capacitated Matching Games.
CoRR
Matthew Gerstbrein, Laura Sanità, Lucy Verberk
2021 — ed.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, University of Washington, Seattle, Washington, USA (Virtual Conference), August 16-18, 2021
APPROX-RANDOM
Mary Wootters, Laura Sanità
2021 J jnl
Node Connectivity Augmentation via Iterative Randomized Rounding.
CoRR
Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità
2020 J jnl
An efficient characterization of submodular spanning tree games.
Math. Program.
Zhuan Khye Koh, Laura Sanità
2020 J jnl
On the diameter of the polytope of the stable marriage with ties.
CoRR
Felix Bauckholt, Laura Sanità
2020 J jnl
Stabilizing Weighted Graphs.
Math. Oper. Res.
Zhuan Khye Koh, Laura Sanità
2019 B conf
An Efficient Characterization of Submodular Spanning Tree Games.
IPCO
Zhuan Khye Koh, Laura Sanità
2019 J jnl
An Efficient Characterization of Submodular Spanning Tree Games.
CoRR
Zhuan Khye Koh, Laura Sanità
2019 J jnl
On the Circuit Diameter of Some Combinatorial Polytopes.
SIAM J. Discret. Math.
Sean Kafer, Kanstantsin Pashkovich, Laura Sanità
2019 J jnl
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization.
CoRR
Jesús A. De Loera, Sean Kafer, Laura Sanità
2018 A conf
Algorithms for Inverse Optimization Problems.
ESA
Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy
2018 A* conf
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts.
SODA
Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità
2018 J jnl
On the approximability of the stable marriage problem with one-sided ties.
CoRR
Felix Bauckholt, Kanstantsin Pashkovich, Laura Sanità
2018 J jnl
Opposite Elements in Clutters.
Math. Oper. Res.
Ahmad Abdi, Ricardo Fukasawa, Laura Sanità
2018 A* conf
Stabilizing Weighted Graphs.
ICALP
Zhuan Khye Koh, Laura Sanità
2018 J jnl
Stabilizing network bargaining games by blocking players.
Math. Program.
Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità
2018 A* conf
The Diameter of the Fractional Matching Polytope and Its Hardness Implications.
FOCS
Laura Sanità
2018 J jnl
WAOA 2015 Special Issue on TOCS.
Theory Comput. Syst.
Laura Sanità, Martin Skutella
2017 J jnl
0/1 Polytopes with Quadratic Chvátal Rank.
Oper. Res.
Thomas Rothvoß, Laura Sanità
2017 J jnl
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts.
CoRR
Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità
2017 A conf
Single-Sink Fractionally Subadditive Network Design.
ESA
Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità
2017 J jnl
Single-sink Fractionally Subadditive Network Design.
CoRR
Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità
2017 J jnl
Stabilizing Weighted Graphs.
CoRR
Zhuan Khye Koh, Laura Sanità
2016 B conf
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.
ISAAC
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
2016 J jnl
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.
CoRR
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
2016 J jnl
Lehman's Theorem and the Directed Steiner Tree Problem.
SIAM J. Discret. Math.
Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità
2016 J jnl
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.
Math. Program.
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
2016 B conf
Stabilizing Network Bargaining Games by Blocking Players.
IPCO
Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità
2015 A conf
Approximate Deadline-Scheduling with Precedence Constraints.
ESA
Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità
2015 J jnl
Approximate Deadline-Scheduling with Precedence Constraints.
CoRR
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità
2015 B ed.
Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
WAOA
Laura Sanità, Martin Skutella
2015 J jnl
Finding small stabilizers for unstable graphs.
Math. Program.
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
2015 J jnl
Finding the closest ultrametric.
Discret. Appl. Math.
Marco Di Summa, David Pritchard, Laura Sanità
2015 A* conf
Improved Region-Growing and Combinatorial Algorithms for
SODA
Guru Guruganesh, Laura Sanità, Chaitanya Swamy
2015 J jnl
On the existence of compact ε-approximated formulations for knapsack in the original space.
CoRR
Yuri Faenza, Laura Sanità
2015 J jnl
On the existence of compact ε-approximated formulations for knapsack in the original space.
Oper. Res. Lett.
Yuri Faenza, Laura Sanità
2015 J jnl
The Capacitated Orienteering Problem.
Discret. Appl. Math.
Adrian Bock, Laura Sanità
2015 J jnl
The interval constrained 3-coloring problem.
Theor. Comput. Sci.
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità
2014 J jnl
Exponentiality of the exchange algorithm for finding another room-partitioning.
Discret. Appl. Math.
Jack Edmonds, Laura Sanità
2014 B conf
Finding Small Stabilizers for Unstable Graphs.
IPCO
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
2014 J jnl
Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems.
CoRR
Guru Guruganesh, Laura Sanità, Chaitanya Swamy
2014 — conf
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree.
APPROX-RANDOM
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
2013 B conf
0/1 Polytopes with Quadratic Chvátal Rank.
IPCO
Thomas Rothvoß, Laura Sanità
2013 J jnl
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
CoRR
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
2013 A* conf
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree.
FOCS
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
2013 A conf
Better Approximation Algorithms for Technology Diffusion.
ESA
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
2013 J jnl
Network design with a discrete set of traffic matrices.
Oper. Res. Lett.
Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen
2013 J jnl
On the approximability of two capacitated vehicle routing problems.
Electron. Notes Discret. Math.
Adrian Bock, Laura Sanità
2013 J jnl
Stable Routing and Unique-Max Coloring on Trees.
SIAM J. Discret. Math.
Nicolai Hähnle, Laura Sanità, Rico Zenklusen
2013 J jnl
Steiner Tree Approximation via Iterative Randomized Rounding.
J. ACM
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità
2013 J jnl
The School Bus Problem on Trees.
Algorithmica
Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
2012 J jnl
0/1 Polytopes with Quadratic Chvatal Rank
CoRR
Thomas Rothvoß, Laura Sanità
2011 C conf
An Exact Algorithm for Robust Network Design.
INOC
Christoph Buchheim, Frauke Liers, Laura Sanità
2011 J jnl
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk.
Math. Oper. Res.
Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità
2011 B conf
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps.
IPCO
Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
2011 B conf
The School Bus Problem on Trees.
ISAAC
Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
2010 A* conf
An improved LP-based approximation for steiner tree.
STOC
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità
2010 J jnl
On Finding Another Room-Partitioning of the Vertices.
Electron. Notes Discret. Math.
Jack Edmonds, Laura Sanità
2010 J jnl
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps
CoRR
Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
2010 J jnl
Stable routing under the Spanning Tree Protocol.
Oper. Res. Lett.
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità
2010 B conf
The Interval Constrained 3-Coloring Problem.
LATIN
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità
2010 J jnl
The VPN Problem with Concave Costs.
SIAM J. Discret. Math.
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis
2009 — conf
On the Complexity of the Asymmetric VPN Problem.
APPROX-RANDOM
Thomas Rothvoß, Laura Sanità
2009 J jnl
The interval constrained 3-coloring problem
CoRR
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità
2008 J jnl
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm.
Opt. Switch. Netw.
Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, Laura Sanità
2008 — conf
Local Restoration for Trees and Arborescences.
FITraMEn
Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto