Gianpaolo Oriolo
Orcid: 0000-0003-2028-7005Affiliations:
- University of Rome Tor Vergata, Department of Computer Science, Systems and Production
According to our database1,
Gianpaolo Oriolo
authored at least 45 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
1
2
2
1
1
2
1
1
1
3
2
1
5
3
1
1
2
3
2
1
2
2
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2022
Horizontal collaboration in forestry: game theory models and algorithms for trading demands.
CoRR, 2022
Ann. Oper. Res., 2022
2021
Separation routine and extended formulations for the stable set problem in claw-free graphs.
Math. Program., 2021
2020
2019
Oper. Res. Lett., 2019
2017
J. Rail Transp. Plan. Manag., 2017
Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017
2014
J. ACM, 2014
2013
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem.
Theor. Comput. Sci., 2011
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).
Oper. Res. Lett., 2011
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)
CoRR, 2011
An algorithmic decomposition of claw-free graphs leading to an O(n<sup>3</sup>)-algorithm for the weighted stable set problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
2009
2008
Opt. Switch. Netw., 2008
Oper. Res. Lett., 2008
Math. Program., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
Proceedings of the Traffic Management and Traffic Engineering for the Future Internet, 2008
2007
2006
2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Network Based on the GMPLS Paradigm.
Photonic Netw. Commun., 2004
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.
Math. Methods Oper. Res., 2004
2003
Theor. Comput. Sci., 2003
Networks, 2003
Discret. Appl. Math., 2003
2001