Content available in repository
Content available in repository
Personal profile
Research profile
Academic background
Laura Sanità is an Associate Professor in the Department of Mathematics and Computer Science of TU/e. Before, she was an Associate Professor in the Department of Combinatorics and Optimization, University of Waterloo (Canada). She received her PhD in Operations Research in 2009 from the University of Rome Sapienza (Italy), and was subsequently a postdoctoral fellow at EPFL in Lausanne (Switzerland).
Laura Sanità is internationally renowned for her significant contributions to Combinatorial Optimization and Approximation Algorithms. She is an associate editor of the journals "Mathematical Programming", "Discrete Optimization", and "Operations Research Letters", and she has been a program committee member of many theoretical computer science conferences.
External positions
Adjunct Professor, University of Waterloo
Fingerprint
Dive into the research topics where Laura Sanità is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Finding Almost Tight Witness Trees
Jabal Ameli, A., Hyatt-Denesik, D. & Sanità, L., 2023, (Accepted/In press) ICALP.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
-
An efficient characterization of submodular spanning tree games
Koh, Z. K. & Sanità, L., 1 Sept 2020, In: Mathematical Programming. 183, 1-2, p. 359-377 19 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access2 Citations (Scopus) -
Stabilizing weighted graphs
Koh, Z. K. & Sanità, L., 1 Nov 2020, In: Mathematics of Operations Research. 45, 4, p. 1318-1341 24 p.Research output: Contribution to journal › Article › Academic › peer-review
-
An Efficient Characterization of Submodular Spanning Tree Games
Koh, Z. K. & Sanità, L., 2019, Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings. Lodi, A. & Nagarajan, V. (eds.). Springer, p. 275-287 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11480 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
2 Citations (Scopus) -
On the circuit diameter of some combinatorial polytopes
Kafer, S., Pashkovich, K. & Sanita, L., 2019, In: SIAM Journal on Discrete Mathematics. 33, 1, p. 1-25 25 p.Research output: Contribution to journal › Article › Academic › peer-review
6 Citations (Scopus)
Prizes
-
Efficient algorithms for discrete optimization problems
Sanità, Laura (Recipient), 2019
Prize: NWO › Vidi › Scientific