An improved LP-based approximation for Steiner tree J Byrka, F Grandoni, T Rothvoß, L Sanità Proceedings of the forty-second ACM symposium on Theory of computing, 583-592, 2010 | 309 | 2010 |

Steiner tree approximation via iterative randomized rounding J Byrka, F Grandoni, T Rothvoß, L Sanità Journal of the ACM (JACM) 60 (1), 1-33, 2013 | 180 | 2013 |

An LMP O (log n)-approximation algorithm for node weighted prize collecting Steiner tree J Könemann, S Sadeghian, L Sanità 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 568-577, 2013 | 23 | 2013 |

Finding small stabilizers for unstable graphs A Bock, K Chandrasekaran, J Könemann, B Peis, L Sanità Mathematical Programming 154 (1-2), 173-196, 2015 | 19 | 2015 |

0/1 polytopes with quadratic Chvátal rank T Rothvoß, L Sanita International Conference on Integer Programming and Combinatorial …, 2013 | 18 | 2013 |

Environmental margin and island evolution in M iddle E astern populations of the E gyptian fruit bat P Hulva, T Marešová, H Dundarova, R Bilgin, P Benda, T Bartonička, ... Molecular Ecology 21 (24), 6104-6116, 2012 | 16 | 2012 |

An exact algorithm for robust network design C Buchheim, F Liers, L Sanità International Conference on Network Optimization, 7-17, 2011 | 16 | 2011 |

From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk F Grandoni, T Rothvoß, L Sanita Mathematics of Operations Research 36 (2), 185-204, 2011 | 16 | 2011 |

From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk F Grandoni, T Rothvoß, L Sanita Mathematics of Operations Research 36 (2), 185-204, 2011 | 16 | 2011 |

Approximating weighted tree augmentation via chvátal-gomory cuts S Fiorini, M Groß, J Könemann, L Sanità Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 15 | 2018 |

Robust network design L Sanità Università Sapienza di Roma, 2009 | 14 | 2009 |

Robust network design L Sanità Università Sapienza di Roma, 2009 | 14 | 2009 |

On finding another room-partitioning of the vertices J Edmonds, L Sanità Electronic Notes in Discrete Mathematics 36, 1257-1264, 2010 | 12 | 2010 |

The VPN problem with concave costs S Fiorini, G Oriolo, L Sanità, DO Theis SIAM Journal on Discrete Mathematics 24 (3), 1080-1090, 2010 | 12 | 2010 |

The VPN problem with concave costs S Fiorini, G Oriolo, L Sanità, DO Theis SIAM Journal on Discrete Mathematics 24 (3), 1080-1090, 2010 | 12 | 2010 |

On the complexity of the asymmetric VPN problem T Rothvoß, L Sanita Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 12 | 2009 |

Stabilizing network bargaining games by blocking players S Ahmadian, H Hosseinzadeh, L Sanità Mathematical Programming 172 (1-2), 249-275, 2018 | 11 | 2018 |

A 3 2-approximation algorithm for tree augmentation via chvátal-gomory cuts S Fiorini, M Groß, J Könemann, L Sanitá 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 77, 2017 | 11 | 2017 |

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree AE Feldmann, J Könemann, N Olver, L Sanità Mathematical programming 160 (1-2), 379-406, 2016 | 11 | 2016 |

The school bus problem on trees A Bock, E Grant, J Könemann, L Sanità Algorithmica 67 (1), 49-64, 2013 | 11 | 2013 |