引用次数
引用: 1,204
H-指数: 15
I10-指数 : 23
出版物: 79
Patent number EP2008/25640: fine protection solution for multi-layer networks
G Oriolo , R Sabella , L Sanita , P Iovanna
2008
The parameterized complexity of a new matching problem: the paired matching problem
R Verhaegh , BMP Jansen , L Sanita , A Ravagnani
Master’s thesis, Eindhoven University of Technology
1
2022
0/1 Polytopes with Quadratic Chvátal Rank
Thomas Rothvoß , Laura Sanitá
Integer Programming and Combinatorial Optimization 349 -361
12
2013
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
Jochen Konemann , Sina Sadeghian , Laura Sanita
2013 IEEE 54th Annual Symposium on Foundations of Computer Science 568 -577
12
2013
The Diameter of the Fractional Matching Polytope and Its Hardness Implications
Laura Sanita
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) 910 -921
5
2018
A $\frac {3}{2} $-Approximation Algorithm for Tree Augmentation via Chv\'atal-Gomory Cuts
Samuel Fiorini , Martin Groß , Jochen Könemann , Laura Sanita
arXiv preprint arXiv:1702.05567
12
2017
Opposite elements in clutters
Ahmad Abdi , Ricardo Fukasawa , Laura Sanita
Mathematics of Operations Research 43 ( 2) 428 -459
5
2018
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)
Jason Li , Debmalya Panigrahi , Laura Sanita , Thatchaphol Saranurak
Schloss Dagstuhl–Leibniz-Zentrum für Informatik
2024
The interval constrained 3-coloring problem
Jaroslaw Byrka , Andreas Karrenbauer , Laura Sanita ,
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings 9 591 -602
6
2010
Communication network
Laura Sanita , Gianpaolo Oriollo , Paola Iovanna , Roberto Sabella
3
2016
Node Connectivity Augmentation of Highly Connected Graphs
Waldo Galvez , Dylan Hyatt-Denesik , Afrouz Jabal Ameli , Laura Sanita
arXiv preprint arXiv:2311.17010
1
2023
Improved Approximations for Flexible Network Design
Dylan Hyatt-Denesik , Afrouz Jabal Ameli , Laura Sanita
arXiv preprint arXiv:2404.08972
2024
Set covering with ordered replacement
Laura Sanita
Local Restoration for Trees and Arborescences under the Spanning Tree Protocol
Gaia Nicosia , Gianpaolo Oriolo , Laura Sanita , Ezio Sperduto
The Virtual Private Network Design Tree Routing Conjecture for Outerplanar Networks
SAMUEL FIORINI , GIANPAOLO ORIOLO , LAURA SANITA , DIRK OLIVER THEIS
arXiv preprint arXiv:0711.2623
1
2007
Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems.
Laura Sanità , Guru Guruganesh , Chaitanya Swamy
arXiv: Data Structures and Algorithms
3
2014
Approximating weighted tree augmentation via chvátal-gomory cuts
Laura Sanità , Samuel Fiorini , Jochen Könemann , Martin Groß
symposium on discrete algorithms 817 -831
14
2018
Algorithms for inverse optimization problems
Sara Ahmadian , Laura Sanità , Umang Bhaskar , Chaitanya Swamy
european symposium on algorithms 14
3
2018
The School Bus Problem on Trees
Adrian Bock , Elyot Grant , Jochen Könemann , Laura Sanità
Algorithmica 67 ( 1) 49 -64
4
2013