Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Sanità
Person information
- affiliation: Bocconi University, Milano, Italy
- affiliation (former): Eindhoven University of Technology, The Netherlands
- affiliation (former): University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j27]Haris Angelidakis, Dylan Hyatt-Denesik
, Laura Sanità:
Node connectivity augmentation via iterative randomized rounding. Math. Program. 199(1): 995-1031 (2023)- 2022
- [j26]Jesús A. De Loera, Sean Kafer, Laura Sanità:
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. SIAM J. Optim. 32(3): 2156-2179 (2022) - 2020
- [j25]Zhuan Khye Koh, Laura Sanità:
Stabilizing Weighted Graphs. Math. Oper. Res. 45(4): 1318-1341 (2020) - [j24]Zhuan Khye Koh, Laura Sanità:
An efficient characterization of submodular spanning tree games. Math. Program. 183(1): 359-377 (2020) - 2019
- [j23]Sean Kafer, Kanstantsin Pashkovich, Laura Sanità:
On the Circuit Diameter of Some Combinatorial Polytopes. SIAM J. Discret. Math. 33(1): 1-25 (2019) - 2018
- [j22]Ahmad Abdi, Ricardo Fukasawa, Laura Sanità:
Opposite Elements in Clutters. Math. Oper. Res. 43(2): 428-459 (2018) - [j21]Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità:
Stabilizing network bargaining games by blocking players. Math. Program. 172(1-2): 249-275 (2018) - [j20]Laura Sanità, Martin Skutella:
WAOA 2015 Special Issue on TOCS. Theory Comput. Syst. 62(2): 247-248 (2018) - 2017
- [j19]Thomas Rothvoß, Laura Sanità:
0/1 Polytopes with Quadratic Chvátal Rank. Oper. Res. 65(1): 212-220 (2017) - 2016
- [j18]Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160(1-2): 379-406 (2016) - [j17]Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità:
Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. 30(1): 141-153 (2016) - 2015
- [j16]Marco Di Summa, David Pritchard, Laura Sanità:
Finding the closest ultrametric. Discret. Appl. Math. 180: 70-80 (2015) - [j15]Adrian Bock, Laura Sanità:
The Capacitated Orienteering Problem. Discret. Appl. Math. 195: 31-42 (2015) - [j14]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding small stabilizers for unstable graphs. Math. Program. 154(1-2): 173-196 (2015) - [j13]Yuri Faenza, Laura Sanità:
On the existence of compact ε-approximated formulations for knapsack in the original space. Oper. Res. Lett. 43(3): 339-342 (2015) - [j12]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The interval constrained 3-coloring problem. Theor. Comput. Sci. 593: 42-50 (2015) - 2014
- [j11]Jack Edmonds, Laura Sanità:
Exponentiality of the exchange algorithm for finding another room-partitioning. Discret. Appl. Math. 164: 86-91 (2014) - 2013
- [j10]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. Algorithmica 67(1): 49-64 (2013) - [j9]Adrian Bock, Laura Sanità:
On the approximability of two capacitated vehicle routing problems. Electron. Notes Discret. Math. 41: 519-526 (2013) - [j8]Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
Steiner Tree Approximation via Iterative Randomized Rounding. J. ACM 60(1): 6:1-6:33 (2013) - [j7]Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen:
Network design with a discrete set of traffic matrices. Oper. Res. Lett. 41(4): 390-396 (2013) - [j6]Nicolai Hähnle, Laura Sanità, Rico Zenklusen:
Stable Routing and Unique-Max Coloring on Trees. SIAM J. Discret. Math. 27(1): 109-125 (2013) - 2011
- [j5]Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. Math. Oper. Res. 36(2): 185-204 (2011) - 2010
- [j4]Jack Edmonds, Laura Sanità:
On Finding Another Room-Partitioning of the Vertices. Electron. Notes Discret. Math. 36: 1257-1264 (2010) - [j3]Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità:
Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. 38(5): 399-404 (2010) - [j2]Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis:
The VPN Problem with Concave Costs. SIAM J. Discret. Math. 24(3): 1080-1090 (2010) - 2008
- [j1]Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, Laura Sanità:
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm. Opt. Switch. Netw. 5(2-3): 159-169 (2008)
Conference and Workshop Papers
- 2023
- [c24]Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Finding Almost Tight Witness Trees. ICALP 2023: 79:1-79:16 - [c23]Matthew Gerstbrein, Laura Sanità, Lucy Verberk:
Stabilization of Capacitated Matching Games. IPCO 2023: 157-171 - 2019
- [c22]Zhuan Khye Koh, Laura Sanità:
An Efficient Characterization of Submodular Spanning Tree Games. IPCO 2019: 275-287 - 2018
- [c21]Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. ESA 2018: 1:1-1:14 - [c20]Laura Sanità:
The Diameter of the Fractional Matching Polytope and Its Hardness Implications. FOCS 2018: 910-921 - [c19]Zhuan Khye Koh, Laura Sanità:
Stabilizing Weighted Graphs. ICALP 2018: 83:1-83:13 - [c18]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA 2018: 817-831 - 2017
- [c17]Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità:
Single-Sink Fractionally Subadditive Network Design. ESA 2017: 46:1-46:13 - 2016
- [c16]Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità:
Stabilizing Network Bargaining Games by Blocking Players. IPCO 2016: 164-177 - [c15]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC 2016: 33:1-33:12 - 2015
- [c14]Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. ESA 2015: 483-495 - [c13]Guru Guruganesh, Laura Sanità, Chaitanya Swamy:
Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract). SODA 2015: 676-695 - 2014
- [c12]Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM 2014: 176-191 - [c11]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding Small Stabilizers for Unstable Graphs. IPCO 2014: 150-161 - 2013
- [c10]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
Better Approximation Algorithms for Technology Diffusion. ESA 2013: 637-646 - [c9]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. FOCS 2013: 568-577 - [c8]Thomas Rothvoß, Laura Sanità:
0/1 Polytopes with Quadratic Chvátal Rank. IPCO 2013: 349-361 - 2011
- [c7]Christoph Buchheim, Frauke Liers, Laura Sanità:
An Exact Algorithm for Robust Network Design. INOC 2011: 7-17 - [c6]Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO 2011: 170-182 - [c5]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. ISAAC 2011: 10-19 - 2010
- [c4]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The Interval Constrained 3-Coloring Problem. LATIN 2010: 591-602 - [c3]Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
An improved LP-based approximation for steiner tree. STOC 2010: 583-592 - 2009
- [c2]Thomas Rothvoß, Laura Sanità:
On the Complexity of the Asymmetric VPN Problem. APPROX-RANDOM 2009: 326-338 - 2008
- [c1]Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto:
Local Restoration for Trees and Arborescences. FITraMEn 2008: 130-140
Editorship
- 2022
- [e3]Karen I. Aardal, Laura Sanità:
Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Lecture Notes in Computer Science 13265, Springer 2022, ISBN 978-3-031-06900-0 [contents] - 2021
- [e2]Mary Wootters, Laura Sanità:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). LIPIcs 207, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-207-5 [contents] - 2015
- [e1]Laura Sanità, Martin Skutella:
Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers. Lecture Notes in Computer Science 9499, Springer 2015, ISBN 978-3-319-28683-9 [contents]
Informal and Other Publications
- 2023
- [i21]Laura Sanità, Lucy Verberk:
Capacitated Network Bargaining Games: Stability and Structure. CoRR abs/2311.09904 (2023) - [i20]Waldo Gálvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Node Connectivity Augmentation of Highly Connected Graphs. CoRR abs/2311.17010 (2023) - [i19]Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak:
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports 13(10): 76-89 (2023) - 2022
- [i18]Matthew Gerstbrein, Laura Sanità, Lucy Verberk:
Stabilization of Capacitated Matching Games. CoRR abs/2211.12179 (2022) - [i17]Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Choose your witnesses wisely. CoRR abs/2211.12431 (2022) - 2021
- [i16]Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità:
Node Connectivity Augmentation via Iterative Randomized Rounding. CoRR abs/2108.02041 (2021) - 2020
- [i15]Felix Bauckholt, Laura Sanità:
On the diameter of the polytope of the stable marriage with ties. CoRR abs/2003.10277 (2020) - 2019
- [i14]Zhuan Khye Koh, Laura Sanità:
An Efficient Characterization of Submodular Spanning Tree Games. CoRR abs/1906.02642 (2019) - [i13]Jesús A. De Loera, Sean Kafer, Laura Sanità:
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. CoRR abs/1909.12863 (2019) - 2018
- [i12]Felix Bauckholt, Kanstantsin Pashkovich, Laura Sanità:
On the approximability of the stable marriage problem with one-sided ties. CoRR abs/1805.05391 (2018) - 2017
- [i11]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. CoRR abs/1702.05567 (2017) - [i10]Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità:
Single-sink Fractionally Subadditive Network Design. CoRR abs/1707.01487 (2017) - [i9]Zhuan Khye Koh, Laura Sanità:
Stabilizing Weighted Graphs. CoRR abs/1709.01982 (2017) - 2016
- [i8]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR abs/1604.07049 (2016) - 2015
- [i7]Yuri Faenza, Laura Sanità:
On the existence of compact ε-approximated formulations for knapsack in the original space. CoRR abs/1503.04717 (2015) - [i6]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. CoRR abs/1507.00748 (2015) - 2014
- [i5]Guru Guruganesh, Laura Sanità, Chaitanya Swamy:
Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems. CoRR abs/1410.5105 (2014) - 2013
- [i4]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. CoRR abs/1302.2127 (2013) - 2012
- [i3]Thomas Rothvoß, Laura Sanità:
0/1 Polytopes with Quadratic Chvatal Rank. CoRR abs/1204.4753 (2012) - 2010
- [i2]Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps. CoRR abs/1012.3295 (2010) - 2009
- [i1]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The interval constrained 3-coloring problem. CoRR abs/0907.3563 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
