Laura Sanità

View Scopus Profile

Laura Sanità

dr.

  • 653
    Citations - based on content available in repository [source: Scopus]
20092023

Content available in repository

Search results

  • 2023

    Capacitated Network Bargaining Games: Stability and Structure

    Sanità, L. & Verberk, L., 16 Nov 2023.

    Research output: Working paper › Preprint › Professional

    File
    38 Downloads (Pure)

  • 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

  • Stabilization of Capacitated Matching Games

    Verberk, L. P. A., Sanità, L. & Gerstbrein, M., 22 May 2023, Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings. Del Pia, A. & Kaibel, V. (eds.). p. 157-171 15 p. (Lecture Notes in Computer Science; vol. 13904).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
  • 2022

    Stabilization of Capacitated Matching Games

    Gerstbrein, M., Sanità, L. & Verberk, L., 22 Nov 2022.

    Research output: Working paper › Preprint › Academic

    File
    34 Downloads (Pure)
  • 2020

    An efficient characterization of submodular spanning tree games

    Koh, Z. K. (Corresponding author) & 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 Access
    3 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

    2 Citations (Scopus)
  • 2019

    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

    10 Citations (Scopus)
  • 2018

    Algorithms for inverse optimization problems

    Ahmadian, S., Bhaskar, U., Sanità, L. & Swamy, C., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    2 Citations (Scopus)

  • Approximating weighted tree augmentation via Chvátal-Gomory cuts

    Fiorini, S., Groß, M., Könemann, J. & Sanità, L., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, Inc, p. 817-831 15 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    36 Citations (Scopus)

  • Opposite elements in clutters

    Abdi, A., Fukasawa, R. & Sanità, L., May 2018, In: Mathematics of Operations Research. 43, 2, p. 428-459 32 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    3 Citations (Scopus)

  • Stabilizing network bargaining games by blocking players

    Ahmadian, S., Hosseinzadeh, H. & Sanità, L., 1 Nov 2018, In: Mathematical Programming. 172, 1-2, p. 249-275 27 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    4 Citations (Scopus)

  • Stabilizing weighted graphs

    Koh, Z. K. & Sanità, L., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 83. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • The diameter of the fractional matching polytope and its hardness implications

    Sanità, L., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 910-921 12 p. 8555168

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    7 Citations (Scopus)
  • 2017

    0/1 polytopes with quadratic Chvátal rank

    Rothvoß, T. & Sanità, L., 1 Jan 2017, In: Operations Research. 65, 1, p. 212-220 9 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    4 Citations (Scopus)

  • Single-sink fractionally subadditive network design

    Guruganesh, G., Iglesias, J., Ravi, R. & Sanità, L., 1 Sept 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    1 Citation (Scopus)
  • 2016

    Fast approximation algorithms for the generalized survivable network design problem

    Feldmann, A. E., Könemann, J., Pashkovich, K. & Sanità, L., 1 Dec 2016, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Hong, S.-H. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 33.1-33.12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 64).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    3 Citations (Scopus)

  • On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree

    Feldmann, A. E., Könemann, J., Olver, N. & Sanità, L., 1 Nov 2016, In: Mathematical Programming. 160, 1-2, p. 379-406 28 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    11 Citations (Scopus)

  • Stabilizing network bargaining games by blocking players

    Ahmadian, S., Hosseinzadeh, H. & Sanità, L., 2016, Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Proceedings. Skutella, M. & Louveaux, Q. (eds.). Springer, p. 164-177 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9682).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    8 Citations (Scopus)
  • 2015

    Approximate Deadline-Scheduling with precedence constraints

    Efsandiari, H., Hajiaghyi, M. T., Könemann, J., Mahini, H., Malec, D. & Sanit À, L., 2015, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Bansal, N. & Finocchi, I. (eds.). Springer, p. 483-495 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9294).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    2 Citations (Scopus)

  • Finding small stabilizers for unstable graphs

    Bock, A., Chandrasekaran, K., Könemann, J., Peis, B. & Sanità, L., 1 Dec 2015, In: Mathematical Programming. 154, 1-2, p. 173-196 24 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    18 Citations (Scopus)

  • Finding the closest ultrametric

    Di Summa, M., Pritchard, D. & Sanità, L., 10 Jan 2015, In: Discrete Applied Mathematics. 180, p. 70-80 11 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    Open Access
    6 Citations (Scopus)

  • Improved region-growing and combinatorial algorithms for κ-route cut problems

    Guruganesh, G., Sanita, L. & Swamy, C., 2015, ACM-SIAM Symposium on Discrete Algorithms SODA 2015. p. 676-695 20 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    5 Citations (Scopus)

  • On the existence of compact ε-approximated formulations for knapsack in the original space

    Faenza, Y. & Sanità, L., 30 May 2015, In: Operations Research Letters. 43, 3, p. 339-342 4 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    3 Citations (Scopus)

  • The Capacitated Orienteering Problem

    Bock, A. & Sanità, L., 20 Nov 2015, In: Discrete Applied Mathematics. 195, p. 31-42 12 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    Open Access
    7 Citations (Scopus)

  • The interval constrained 3-coloring problem

    Byrka, J., Karrenbauer, A. & Sanità, L., 16 Aug 2015, In: Theoretical Computer Science. 593, p. 42-50 9 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    Open Access
  • 2014

    Exponentiality of the exchange algorithm for finding another room-partitioning

    Edmonds, J. & Sanità, L., 1 Jan 2014, In: Discrete Applied Mathematics. 164, PART 1, p. 86-91 6 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    Open Access
    1 Citation (Scopus)

  • Finding small stabilizers for unstable graphs

    Bock, A., Chandrasekaran, K., Könemann, J., Peis, B. & Sanità, L., 2014, Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Proceedings. Springer, p. 150-161 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8494 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    1 Citation (Scopus)

  • On the equivalence of the bidirected and hypergraphic relaxations for steiner tree

    Feldmann, A. E., Könemann, J., Olver, N. & Sanità, L., 1 Sept 2014, Leibniz International Proceedings in Informatics, LIPIcs. Jansen, K., Moore, C., Devanur, N. R. & Rolim, J. D. P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 176-191 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • 2013

    0/1 Polytopes with quadratic Chvátal rank

    Rothvoß, T. & Sanitá, L., 2013, Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Proceedings. p. 349-361 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7801 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    17 Citations (Scopus)

  • An LMP O(log n)-approximation algorithm for nodeweighted prize collecting steiner tree

    Könemann, J., Sadeghian, S. & Sanità, L., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 568-577 10 p. 6686193

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    23 Citations (Scopus)

  • Better approximation algorithms for technology diffusion

    Könemann, J., Sadeghian, S. & Sanità, L., 2013, Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. p. 637-646 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8125 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    2 Citations (Scopus)

  • Network design with a discrete set of traffic matrices

    Oriolo, G., Sanità, L. & Zenklusen, R., 2013, In: Operations Research Letters. 41, 4, p. 390-396 7 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    3 Citations (Scopus)

  • On the approximability of two capacitated vehicle routing problems

    Bock, A. & Sanità, L., 2013, In: Electronic Notes in Discrete Mathematics. 41, p. 519-526 8 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    1 Citation (Scopus)

  • Stable routing and unique-max coloring on trees

    Hähnle, N., Sanità, L. & Zenklusen, R., 2013, In: SIAM Journal on Discrete Mathematics. 27, 1, p. 109-125 17 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    1 Citation (Scopus)

  • Steiner tree approximation via iterative randomized rounding

    Byrka, J., Grandoni, F., Rothvoss, T. & Sanità, L., 1 Jan 2013, In: Journal of the ACM. 60, 1, 2432628.

    Research output: Contribution to journal › Article › Academic › peer-review

    196 Citations (Scopus)

  • The school bus problem on trees

    Bock, A., Grant, E., Könemann, J. & Sanità, L., 1 Jan 2013, In: Algorithmica. 67, 1, p. 49-64 16 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    8 Citations (Scopus)
  • 2011

    An exact algorithm for robust network design

    Buchheim, C., Liers, F. & Sanità, L., 2011, Network Optimization - 5th International Conference, INOC 2011, Proceedings. p. 7-17 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6701 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    10 Citations (Scopus)

  • From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk

    Grandoni, F., Rothvoß, T. & Sanità, L., May 2011, In: Mathematics of Operations Research. 36, 2, p. 185-204 20 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    12 Citations (Scopus)

  • Set covering with ordered replacement: Additive and multiplicative gaps

    Eisenbrand, F., Kakimura, N., Rothvoß, T. & Sanità, L., 2011, Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, Proceedings. p. 170-182 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6655 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    2 Citations (Scopus)

  • The school bus problem on trees

    Bock, A., Grant, E., Könemann, J. & Sanità, L., 2011, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 10-19 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    8 Citations (Scopus)
  • 2010

    An improved LP-based approximation for steiner tree

    Byrka, J., Grandoni, F., Rothvoß, T. & Sanità, L., 2010, STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. p. 583-592 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    203 Citations (Scopus)

  • On finding another room-partitioning of the vertices

    Edmonds, J. & Sanità, L., Aug 2010, In: Electronic Notes in Discrete Mathematics. 36, C, p. 1257-1264 8 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    3 Citations (Scopus)

  • Stable routing under the Spanning Tree Protocol

    Grandoni, F., Nicosia, G., Oriolo, G. & Sanità, L., Sept 2010, In: Operations Research Letters. 38, 5, p. 399-404 6 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    4 Citations (Scopus)

  • The interval constrained 3-coloring problem

    Byrka, J., Karrenbauer, A. & Sanità, L., 2010, LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. p. 591-602 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6034 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    4 Citations (Scopus)

  • The VPN problem with concave costs

    Fiorini, S., Oriolo, G., Sanità, L. & Theis, D. O., 2010, In: SIAM Journal on Discrete Mathematics. 24, 3, p. 1080-1090 11 p.

    Research output: Contribution to journal › Article › Academic › peer-review

    8 Citations (Scopus)
  • 2009

    On the complexity of the asymmetric VPN problem

    Rothvoß, T. & Sanità, L., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 326-338 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    9 Citations (Scopus)