On the number of degenerate simplex pivots.

Laura Sanità https://laurasanita.github.io/ http://lsanita.win.tue.nl/ http://www.math.uwaterloo.ca/~lsanita/ https://scholar.google.com/citations?user=odfHRTcAAAAJ https://orcid.org/0000-0002-6384-1857 Bocconi University, Milano, Italy Eindhoven University of Technology, The Netherlands University of Waterloo, Canada

Kirill Kukharenko Laura Sanità On the number of degenerate simplex pivots. 2026 March 757-791 216 Math. Program. 1 https://doi.org/10.1007/s10107-026-02349-x db/journals/mp/mp216.html#KukharenkoS26 streams/journals/mp

Kanstantsin Pashkovich Marta Pozzi Laura Sanità A simple Path-based LP Relaxation for Directed Steiner Tree. 2026 March abs/2603.02825 CoRR https://doi.org/10.48550/arXiv.2603.02825 db/journals/corr/corr2603.html#abs-2603-02825 streams/journals/corr

Steffen Borgwardt Weston Grewe Sean Kafer Jon Lee 0001 Laura Sanità On the hardness of short and sign-compatible circuit walks. 129-149 2025 367 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.02.009 db/journals/dam/dam367.html#BorgwardtGKLS25 streams/journals/dam

Alexander E. Black Jesús A. De Loera Sean Kafer Laura Sanità On the Simplex Method for 0/1-Polytopes. 1398-1420 2025 50 Math. Oper. Res. 2 https://doi.org/10.1287/moor.2021.0345 db/journals/mor/mor50.html#BlackLKS25 streams/journals/mor

Matthew Gerstbrein Laura Sanità Lucy Verberk Stabilization of capacitated matching games. 313-334 2025 March 210 Math. Program. 1 https://doi.org/10.1007/s10107-024-02169-x db/journals/mp/mp210.html#GerstbreinSV25 streams/journals/mp

Laura Sanità Lucy Verberk A note on the core of 2-matching games. 107299 2025 61 Oper. Res. Lett. https://doi.org/10.1016/j.orl.2025.107299 db/journals/orl/orl61.html#SanitaV25 streams/journals/orl

Laura Sanità Lucy Verberk Two-stage Stochastic Assignment Games. 2025 June abs/2506.01509 CoRR https://doi.org/10.48550/arXiv.2506.01509 db/journals/corr/corr2506.html#abs-2506-01509 streams/journals/corr

Afrouz Jabal Ameli Laura Sanità Moritz Venzin Learning-Augmented Online Covering Problems. 2025 July abs/2507.06032 CoRR https://doi.org/10.48550/arXiv.2507.06032 db/journals/corr/corr2507.html#abs-2507-06032 streams/journals/corr

Karen I. Aardal Laura Sanità Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022. 1-2 2024 July 206 Math. Program. 1 https://doi.org/10.1007/s10107-024-02115-x db/journals/mp/mp206.html#AardalS24 streams/journals/mp

Dylan Hyatt-Denesik Afrouz Jabal Ameli Laura Sanità Improved Approximations for Flexible Network Design. 74:1-74:14 2024 ESA https://doi.org/10.4230/LIPIcs.ESA.2024.74 conf/esa/2024 db/conf/esa/esa2024.html#Hyatt-DenesikAS24 Kirill Kukharenko Laura Sanità On the Number of Degenerate Simplex Pivots. 252-264 2024 IPCO https://doi.org/10.1007/978-3-031-59835-7_19 conf/ipco/2024 db/conf/ipco/ipco2024.html#KukharenkoS24

Dylan Hyatt-Denesik Afrouz Jabal Ameli Laura Sanità Improved Approximations for Flexible Network Design. 2024 abs/2404.08972 CoRR https://doi.org/10.48550/arXiv.2404.08972 db/journals/corr/corr2404.html#abs-2404-08972

Laura Sanità Lucy Verberk A Note on the Core of 2-Matching Games. 2024 abs/2411.19227 CoRR https://doi.org/10.48550/arXiv.2411.19227 db/journals/corr/corr2411.html#abs-2411-19227 streams/journals/corr

Haris Angelidakis Dylan Hyatt-Denesik Laura Sanità Node connectivity augmentation via iterative randomized rounding. 995-1031 2023 May 199 Math. Program. 1 https://doi.org/10.1007/s10107-022-01854-z https://www.wikidata.org/entity/Q114228485 db/journals/mp/mp199.html#AngelidakisHS23

Dylan Hyatt-Denesik Afrouz Jabal Ameli Laura Sanità Finding Almost Tight Witness Trees. 79:1-79:16 2023 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2023.79 conf/icalp/2023 db/conf/icalp/icalp2023.html#Hyatt-DenesikAS23 Matthew Gerstbrein Laura Sanità Lucy Verberk Stabilization of Capacitated Matching Games. 157-171 2023 IPCO https://doi.org/10.1007/978-3-031-32726-1_12 conf/ipco/2023 db/conf/ipco/ipco2023.html#GerstbreinSV23

Laura Sanità Lucy Verberk Capacitated Network Bargaining Games: Stability and Structure. 2023 abs/2311.09904 CoRR https://doi.org/10.48550/arXiv.2311.09904 db/journals/corr/corr2311.html#abs-2311-09904

Waldo Gálvez Dylan Hyatt-Denesik Afrouz Jabal Ameli Laura Sanità Node Connectivity Augmentation of Highly Connected Graphs. 2023 abs/2311.17010 CoRR https://doi.org/10.48550/arXiv.2311.17010 db/journals/corr/corr2311.html#abs-2311-17010

Jason Li 0006 Debmalya Panigrahi Laura Sanità Thatchaphol Saranurak Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). 76-89 2023 13 Dagstuhl Reports 10 https://doi.org/10.4230/DagRep.13.10.76 db/journals/dagstuhl-reports/dagstuhl-reports13.html#0006PSS23

Jesús A. De Loera Sean Kafer Laura Sanità Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. 2156-2179 2022 September 32 SIAM J. Optim. 3 https://doi.org/10.1137/21m1419994 db/journals/siamjo/siamjo32.html#LoeraKS22

Karen I. Aardal Laura Sanità Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings IPCO Springer 2022 Lecture Notes in Computer Science 13265 978-3-031-06900-0 978-3-031-06901-7 https://doi.org/10.1007/978-3-031-06901-7 db/conf/ipco/ipco2022.html

Matthew Gerstbrein Laura Sanità Lucy Verberk Stabilization of Capacitated Matching Games. 2022 abs/2211.12179 CoRR https://doi.org/10.48550/arXiv.2211.12179 db/journals/corr/corr2211.html#abs-2211-12179

Dylan Hyatt-Denesik Afrouz Jabal Ameli Laura Sanità Choose your witnesses wisely. 2022 abs/2211.12431 CoRR https://doi.org/10.48550/arXiv.2211.12431 db/journals/corr/corr2211.html#abs-2211-12431

Mary Wootters Laura Sanità 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 Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 LIPIcs 207 978-3-95977-207-5 https://www.dagstuhl.de/dagpub/978-3-95977-207-5 db/conf/approx/approx2021.html

Haris Angelidakis Dylan Hyatt-Denesik Laura Sanità Node Connectivity Augmentation via Iterative Randomized Rounding. 2021 abs/2108.02041 CoRR https://arxiv.org/abs/2108.02041 db/journals/corr/corr2108.html#abs-2108-02041

Zhuan Khye Koh Laura Sanità Stabilizing Weighted Graphs. 1318-1341 2020 45 Math. Oper. Res. 4 https://doi.org/10.1287/moor.2019.1034 db/journals/mor/mor45.html#KohS20

Zhuan Khye Koh Laura Sanità An efficient characterization of submodular spanning tree games. 359-377 2020 183 Math. Program. 1 https://doi.org/10.1007/s10107-020-01499-w https://www.wikidata.org/entity/Q99629369 db/journals/mp/mp183.html#KohS20

Felix Bauckholt Laura Sanità On the diameter of the polytope of the stable marriage with ties. 2020 abs/2003.10277 CoRR https://arxiv.org/abs/2003.10277 db/journals/corr/corr2003.html#abs-2003-10277

Sean Kafer Kanstantsin Pashkovich Laura Sanità On the Circuit Diameter of Some Combinatorial Polytopes. 1-25 2019 33 SIAM J. Discret. Math. 1 https://doi.org/10.1137/17M1152115 db/journals/siamdm/siamdm33.html#KaferPS19

Zhuan Khye Koh Laura Sanità An Efficient Characterization of Submodular Spanning Tree Games. 275-287 2019 IPCO https://doi.org/10.1007/978-3-030-17953-3_21 conf/ipco/2019 db/conf/ipco/ipco2019.html#KohS19

Zhuan Khye Koh Laura Sanità An Efficient Characterization of Submodular Spanning Tree Games. 2019 abs/1906.02642 CoRR http://arxiv.org/abs/1906.02642 db/journals/corr/corr1906.html#abs-1906-02642

Jesús A. De Loera Sean Kafer Laura Sanità Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. 2019 abs/1909.12863 CoRR http://arxiv.org/abs/1909.12863 db/journals/corr/corr1909.html#abs-1909-12863

Ahmad Abdi Ricardo Fukasawa Laura Sanità Opposite Elements in Clutters. 428-459 2018 43 Math. Oper. Res. 2 https://doi.org/10.1287/moor.2017.0864 db/journals/mor/mor43.html#AbdiFS18

Sara Ahmadian Hamideh Hosseinzadeh Laura Sanità Stabilizing network bargaining games by blocking players. 249-275 2018 172 Math. Program. 1-2 https://doi.org/10.1007/s10107-017-1177-9 db/journals/mp/mp172.html#AhmadianHS18

Laura Sanità Martin Skutella WAOA 2015 Special Issue on TOCS. 247-248 2018 62 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-018-9850-9 db/journals/mst/mst62.html#SanitaS18

Sara Ahmadian Umang Bhaskar Laura Sanità Chaitanya Swamy Algorithms for Inverse Optimization Problems. 1:1-1:14 2018 ESA https://doi.org/10.4230/LIPIcs.ESA.2018.1 conf/esa/2018 db/conf/esa/esa2018.html#AhmadianBSS18 Laura Sanità The Diameter of the Fractional Matching Polytope and Its Hardness Implications. 910-921 2018 FOCS https://doi.org/10.1109/FOCS.2018.00090 https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00090 conf/focs/2018 db/conf/focs/focs2018.html#Sanita18 Zhuan Khye Koh Laura Sanità Stabilizing Weighted Graphs. 83:1-83:13 2018 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2018.83 conf/icalp/2018 db/conf/icalp/icalp2018.html#KohS18 Samuel Fiorini Martin Groß 0001 Jochen Könemann Laura Sanità Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. 817-831 2018 SODA https://doi.org/10.1137/1.9781611975031.53 conf/soda/2018 db/conf/soda/soda2018.html#Fiorini0KS18

Felix Bauckholt Kanstantsin Pashkovich Laura Sanità On the approximability of the stable marriage problem with one-sided ties. 2018 abs/1805.05391 CoRR http://arxiv.org/abs/1805.05391 db/journals/corr/corr1805.html#abs-1805-05391

Thomas Rothvoß Laura Sanità 0/1 Polytopes with Quadratic Chvátal Rank. 212-220 2017 65 Oper. Res. 1 https://doi.org/10.1287/opre.2016.1549 db/journals/ior/ior65.html#RothvossS17

Guru Guruganesh Jennifer Iglesias R. Ravi 0001 Laura Sanità Single-Sink Fractionally Subadditive Network Design. 46:1-46:13 2017 ESA https://doi.org/10.4230/LIPIcs.ESA.2017.46 conf/esa/2017 db/conf/esa/esa2017.html#GuruganeshI0S17

Samuel Fiorini Martin Groß 0001 Jochen Könemann Laura Sanità A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. 2017 abs/1702.05567 CoRR http://arxiv.org/abs/1702.05567 db/journals/corr/corr1702.html#FioriniGKS17

Guru Guruganesh Jennifer Iglesias R. Ravi 0001 Laura Sanità Single-sink Fractionally Subadditive Network Design. 2017 abs/1707.01487 CoRR http://arxiv.org/abs/1707.01487 db/journals/corr/corr1707.html#GuruganeshI0S17

Zhuan Khye Koh Laura Sanità Stabilizing Weighted Graphs. 2017 abs/1709.01982 CoRR http://arxiv.org/abs/1709.01982 db/journals/corr/corr1709.html#abs-1709-01982

Andreas Emil Feldmann Jochen Könemann Neil Olver Laura Sanità On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. 379-406 2016 160 Math. Program. 1-2 https://doi.org/10.1007/s10107-016-0987-5 db/journals/mp/mp160.html#FeldmannKOS16

Ahmad Abdi Andreas Emil Feldmann Bertrand Guenin Jochen Könemann Laura Sanità Lehman's Theorem and the Directed Steiner Tree Problem. 141-153 2016 30 SIAM J. Discret. Math. 1 https://doi.org/10.1137/15M1007185 db/journals/siamdm/siamdm30.html#AbdiFGKS16

Sara Ahmadian Hamideh Hosseinzadeh Laura Sanità Stabilizing Network Bargaining Games by Blocking Players. 164-177 2016 IPCO https://doi.org/10.1007/978-3-319-33461-5_14 conf/ipco/2016 db/conf/ipco/ipco2016.html#AhmadianHS16 Andreas Emil Feldmann Jochen Könemann Kanstantsin Pashkovich Laura Sanità Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. 33:1-33:12 2016 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2016.33 conf/isaac/2016 db/conf/isaac/isaac2016.html#FeldmannKPS16

Andreas Emil Feldmann Jochen Könemann Kanstantsin Pashkovich Laura Sanità Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. 2016 abs/1604.07049 CoRR http://arxiv.org/abs/1604.07049 db/journals/corr/corr1604.html#FeldmannKPS16

Marco Di Summa David Pritchard 0001 Laura Sanità Finding the closest ultrametric. 70-80 2015 180 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2014.07.023 db/journals/dam/dam180.html#SummaPS15

Adrian Bock Laura Sanità The Capacitated Orienteering Problem. 31-42 2015 195 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2014.10.001 db/journals/dam/dam195.html#BockS15

Adrian Bock Karthekeyan Chandrasekaran Jochen Könemann Britta Peis Laura Sanità Finding small stabilizers for unstable graphs. 173-196 2015 154 Math. Program. 1-2 https://doi.org/10.1007/s10107-014-0854-1 db/journals/mp/mp154.html#BockCKPS15

Yuri Faenza Laura Sanità On the existence of compact ε-approximated formulations for knapsack in the original space. 339-342 2015 43 Oper. Res. Lett. 3 https://doi.org/10.1016/j.orl.2015.04.004 db/journals/orl/orl43.html#FaenzaS15

Jaroslaw Byrka Andreas Karrenbauer Laura Sanità The interval constrained 3-coloring problem. 42-50 2015 593 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.04.037 db/journals/tcs/tcs593.html#ByrkaKS15

Hossein Efsandiari Mohammad Taghi Hajiaghayi Jochen Könemann Hamid Mahini David L. Malec Laura Sanità Approximate Deadline-Scheduling with Precedence Constraints. 483-495 2015 ESA https://doi.org/10.1007/978-3-662-48350-3_41 conf/esa/2015 db/conf/esa/esa2015.html#EfsandiariHKMMS15 Guru Guruganesh Laura Sanità Chaitanya Swamy Improved Region-Growing and Combinatorial Algorithms for <i>k</i>-Route Cut Problems (Extended Abstract). 676-695 2015 SODA https://doi.org/10.1137/1.9781611973730.46 conf/soda/2015 db/conf/soda/soda2015.html#GuruganeshSS15 Laura Sanità Martin Skutella Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers WAOA Springer 2015 Lecture Notes in Computer Science 9499 978-3-319-28683-9 https://doi.org/10.1007/978-3-319-28684-6 db/conf/waoa/waoa2015.html

Yuri Faenza Laura Sanità On the existence of compact ε-approximated formulations for knapsack in the original space. 2015 abs/1503.04717 CoRR http://arxiv.org/abs/1503.04717 db/journals/corr/corr1503.html#FaenzaS15

Hossein Esfandiari Mohammad Taghi Hajiaghayi Jochen Könemann Hamid Mahini David L. Malec Laura Sanità Approximate Deadline-Scheduling with Precedence Constraints. 2015 abs/1507.00748 CoRR http://arxiv.org/abs/1507.00748 db/journals/corr/corr1507.html#EfsandiariHKMMS15

Jack Edmonds 0001 Laura Sanità Exponentiality of the exchange algorithm for finding another room-partitioning. 86-91 2014 164 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2012.03.012 db/journals/dam/dam164.html#EdmondsS14

Andreas Emil Feldmann Jochen Könemann Neil Olver Laura Sanità On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. 176-191 2014 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.176 conf/approx/2014 db/conf/approx/approx2014.html#FeldmannKOS14 Adrian Bock Karthekeyan Chandrasekaran Jochen Könemann Britta Peis Laura Sanità Finding Small Stabilizers for Unstable Graphs. 150-161 2014 IPCO https://doi.org/10.1007/978-3-319-07557-0_13 conf/ipco/2014 db/conf/ipco/ipco2014.html#BockCKPS14

Guru Guruganesh Laura Sanità Chaitanya Swamy Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems. 2014 abs/1410.5105 CoRR http://arxiv.org/abs/1410.5105 db/journals/corr/corr1410.html#GuruganeshSS14

Adrian Bock Elyot Grant Jochen Könemann Laura Sanità The School Bus Problem on Trees. 49-64 2013 67 Algorithmica 1 https://doi.org/10.1007/s00453-012-9711-x db/journals/algorithmica/algorithmica67.html#BockGKS13

Adrian Bock Laura Sanità On the approximability of two capacitated vehicle routing problems. 519-526 2013 41 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2013.05.133 db/journals/endm/endm41.html#BockS13

Jaroslaw Byrka Fabrizio Grandoni 0001 Thomas Rothvoß Laura Sanità Steiner Tree Approximation via Iterative Randomized Rounding. 6:1-6:33 2013 60 J. ACM 1 https://doi.org/10.1145/2432622.2432628 db/journals/jacm/jacm60.html#ByrkaGRS13

Gianpaolo Oriolo Laura Sanità Rico Zenklusen Network design with a discrete set of traffic matrices. 390-396 2013 41 Oper. Res. Lett. 4 https://doi.org/10.1016/j.orl.2013.04.011 db/journals/orl/orl41.html#OrioloSZ13

Nicolai Hähnle Laura Sanità Rico Zenklusen Stable Routing and Unique-Max Coloring on Trees. 109-125 2013 27 SIAM J. Discret. Math. 1 https://doi.org/10.1137/100817565 db/journals/siamdm/siamdm27.html#HahnleSZ13

Jochen Könemann Sina Sadeghian Sadeghabad Laura Sanità Better Approximation Algorithms for Technology Diffusion. 637-646 2013 ESA https://doi.org/10.1007/978-3-642-40450-4_54 conf/esa/2013 db/conf/esa/esa2013.html#KonemannSS13 Jochen Könemann Sina Sadeghian Sadeghabad Laura Sanità An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. 568-577 2013 FOCS https://doi.org/10.1109/FOCS.2013.67 https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.67 conf/focs/2013 db/conf/focs/focs2013.html#KonemannSS13 Thomas Rothvoß Laura Sanità 0/1 Polytopes with Quadratic Chvátal Rank. 349-361 2013 IPCO https://doi.org/10.1007/978-3-642-36694-9_30 conf/ipco/2013 db/conf/ipco/ipco2013.html#RothvossS13

Jochen Könemann Sina Sadeghian Sadeghabad Laura Sanità An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree http://arxiv.org/abs/1302.2127 2013 CoRR abs/1302.2127 db/journals/corr/corr1302.html#abs-1302-2127

Thomas Rothvoß Laura Sanità 0/1 Polytopes with Quadratic Chvatal Rank http://arxiv.org/abs/1204.4753 2012 CoRR abs/1204.4753 db/journals/corr/corr1204.html#abs-1204-4753

Fabrizio Grandoni 0001 Thomas Rothvoß Laura Sanità From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. 185-204 2011 36 Math. Oper. Res. 2 https://doi.org/10.1287/moor.1110.0490 db/journals/mor/mor36.html#GrandoniRS11

Christoph Buchheim Frauke Liers Laura Sanità An Exact Algorithm for Robust Network Design. 7-17 2011 INOC https://doi.org/10.1007/978-3-642-21527-8_2 conf/inoc/2011 db/conf/inoc/inoc2011.html#BuchheimLS11 Friedrich Eisenbrand Naonori Kakimura Thomas Rothvoß Laura Sanità Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. 170-182 2011 IPCO https://doi.org/10.1007/978-3-642-20807-2_14 conf/ipco/2011 db/conf/ipco/ipco2011.html#EisenbrandKRS11 Adrian Bock Elyot Grant Jochen Könemann Laura Sanità The School Bus Problem on Trees. 10-19 2011 ISAAC https://doi.org/10.1007/978-3-642-25591-5_3 conf/isaac/2011 db/conf/isaac/isaac2011.html#BockGKS11

Jack Edmonds 0001 Laura Sanità On Finding Another Room-Partitioning of the Vertices. 1257-1264 2010 36 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2010.05.159 db/journals/endm/endm36.html#EdmondsS10

Fabrizio Grandoni 0001 Gaia Nicosia Gianpaolo Oriolo Laura Sanità Stable routing under the Spanning Tree Protocol. 399-404 2010 38 Oper. Res. Lett. 5 https://doi.org/10.1016/j.orl.2010.05.001 db/journals/orl/orl38.html#GrandoniNOS10

Samuel Fiorini Gianpaolo Oriolo Laura Sanità Dirk Oliver Theis The VPN Problem with Concave Costs. 1080-1090 2010 24 SIAM J. Discret. Math. 3 https://doi.org/10.1137/090749700 db/journals/siamdm/siamdm24.html#FioriniOST10

Jaroslaw Byrka Andreas Karrenbauer Laura Sanità The Interval Constrained 3-Coloring Problem. 591-602 2010 LATIN https://doi.org/10.1007/978-3-642-12200-2_51 conf/latin/2010 db/conf/latin/latin2010.html#ByrkaKS10 Jaroslaw Byrka Fabrizio Grandoni 0001 Thomas Rothvoß Laura Sanità An improved LP-based approximation for steiner tree. 583-592 2010 STOC https://doi.org/10.1145/1806689.1806769 https://www.wikidata.org/entity/Q56288513 conf/stoc/2010 db/conf/stoc/stoc2010.html#ByrkaGRS10

Friedrich Eisenbrand Naonori Kakimura Thomas Rothvoß Laura Sanità Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps http://arxiv.org/abs/1012.3295 2010 CoRR abs/1012.3295 db/journals/corr/corr1012.html#abs-1012-3295

Thomas Rothvoß Laura Sanità On the Complexity of the Asymmetric VPN Problem. 326-338 2009 APPROX-RANDOM https://doi.org/10.1007/978-3-642-03685-9_25 conf/approx/2009 db/conf/approx/approx2009.html#RothvossS09

Jaroslaw Byrka Andreas Karrenbauer Laura Sanità The interval constrained 3-coloring problem http://arxiv.org/abs/0907.3563 2009 CoRR abs/0907.3563 db/journals/corr/corr0907.html#abs-0907-3563

Roberto Sabella Paola Iovanna Gianpaolo Oriolo Laura Sanità Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm. 159-169 2008 5 Opt. Switch. Netw. 2-3 https://doi.org/10.1016/j.osn.2008.02.004 db/journals/osn/osn5.html#SabellaIOS08

Paola Iovanna Gaia Nicosia Gianpaolo Oriolo Laura Sanità Ezio Sperduto Local Restoration for Trees and Arborescences. 130-140 2008 FITraMEn https://doi.org/10.1007/978-3-642-04576-9_9 conf/fitramen/2008 db/conf/fitramen/fitramen2008.html#IovannaNOSS08 Karen I. Aardal Ahmad Abdi Sara Ahmadian Afrouz Jabal Ameli Haris Angelidakis Felix Bauckholt Umang Bhaskar Alexander E. Black Adrian Bock Steffen Borgwardt Christoph Buchheim Jaroslaw Byrka Karthekeyan Chandrasekaran Jack Edmonds 0001 Friedrich Eisenbrand Hossein EsfandiariHossein Efsandiari Yuri Faenza Andreas Emil Feldmann Samuel Fiorini Ricardo Fukasawa Waldo Gálvez Matthew Gerstbrein Fabrizio Grandoni 0001 Elyot Grant Weston Grewe Martin Groß 0001 Bertrand Guenin Guru Guruganesh Nicolai Hähnle Mohammad HajiaghayiMohammad Taghi Hajiaghayi Hamideh Hosseinzadeh Dylan Hyatt-Denesik Jennifer Iglesias Paola Iovanna Sean Kafer Naonori Kakimura Andreas Karrenbauer Zhuan Khye Koh Jochen Könemann Kirill Kukharenko Jon Lee 0001 Jason Li 0006 Frauke Liers Jesús A. De Loera Hamid Mahini David L. Malec Gaia Nicosia Neil Olver Gianpaolo Oriolo Debmalya Panigrahi Kanstantsin Pashkovich Britta Peis Marta Pozzi David Pritchard 0001 R. Ravi 0001 Thomas Rothvoß Roberto Sabella Sina Sadeghian Sadeghabad Thatchaphol Saranurak Martin Skutella Ezio Sperduto Marco Di Summa Chaitanya Swamy Dirk Oliver Theis Moritz Venzin Lucy Verberk Mary Wootters Rico Zenklusen