default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianpaolo Oriolo
Person information
- affiliation: University of Rome Tor Vergata, Department of Computer Science, Systems and Production
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j33]Gianpaolo Oriolo
, Gautier Stauffer:
On the facets of stable set polytopes of circular interval graphs. Ann. Oper. Res. 312(2): 1007-1029 (2022)- [i5]Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer:
Horizontal collaboration in forestry: game theory models and algorithms for trading demands. CoRR abs/2211.04105 (2022) - 2021
- [j32]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
Minimum weighted clique cover on claw-free perfect graphs. J. Graph Theory 96(2): 231-268 (2021) - [j31]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separation routine and extended formulations for the stable set problem in claw-free graphs. Math. Program. 188(1): 53-84 (2021) - 2020
- [j30]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting Flows when Links Fail. SIAM J. Discret. Math. 34(4): 2082-2107 (2020)
2010 – 2019
- 2019
- [j29]Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura:
Single courier single restaurant meal delivery (without routing). Oper. Res. Lett. 47(6): 537-541 (2019) - 2017
- [j28]Francesca Fedeli, Roberto Mancini, Carlo Mannino, Paolo Ofria, Gianpaolo Oriolo, Andrea Pacifici, Veronica Piccialli:
Optimal design of a regional railway service in Italy. J. Rail Transp. Plan. Manag. 7(4): 308-319 (2017) - [j27]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. Oper. Res. Lett. 45(1): 53-59 (2017) - [c12]Bastián Bahamondes, José Correa, Jannik Matuschke, Gianpaolo Oriolo:
Adaptivity in Network Interdiction. GameSec 2017: 40-52 - [c11]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting Flows When Links Fail. ICALP 2017: 89:1-89:13 - [i4]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting flows when links fail. CoRR abs/1704.07067 (2017) - 2016
- [i3]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. CoRR abs/1601.03603 (2016) - 2014
- [j26]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. J. ACM 61(4): 20:1-20:41 (2014) - 2013
- [j25]Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen:
Network design with a discrete set of traffic matrices. Oper. Res. Lett. 41(4): 390-396 (2013) - [c10]David Adjiashvili, Gianpaolo Oriolo, Marco Senatore:
The Online Replacement Path Problem. ESA 2013: 1-12 - [c9]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer:
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. IPCO 2013: 86-97 - 2012
- [j24]Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
On the recognition of fuzzy circular interval graphs. Discret. Math. 312(8): 1426-1435 (2012) - [j23]Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. Discret. Math. 312(12-13): 2027-2039 (2012) - [c8]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA 2012: 1298-1308 - [c7]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. WG 2012: 22-33 - 2011
- [j22]Yuri Faenza, Gianpaolo Oriolo, Claudia Snels:
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants). Oper. Res. Lett. 39(3): 213-217 (2011) - [j21]Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo:
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45): 6261-6268 (2011) - [c6]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. CTW 2011: 80-83 - [c5]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem. SODA 2011: 630-646 - [i2]Yuri Faenza, Gianpaolo Oriolo, Claudia Snels:
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants). CoRR abs/1103.2601 (2011) - [i1]Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
On the Recognition of Fuzzy Circular Interval Graphs. CoRR abs/1104.2251 (2011) - 2010
- [j20]Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità:
Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. 38(5): 399-404 (2010) - [j19]Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis:
The VPN Problem with Concave Costs. SIAM J. Discret. Math. 24(3): 1080-1090 (2010)
2000 – 2009
- 2009
- [j18]Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. Electron. Notes Discret. Math. 35: 215-220 (2009) - 2008
- [j17]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
The stable set polytope of quasi-line graphs. Comb. 28(1): 45-67 (2008) - [j16]Gianpaolo Oriolo:
Domination Between Traffic Matrices. Math. Oper. Res. 33(1): 91-96 (2008) - [j15]Gianpaolo Oriolo, Gautier Stauffer:
Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Math. Program. 115(2): 291-317 (2008) - [j14]Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella:
A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. 36(3): 361-365 (2008) - [j13]Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, Laura Sanità:
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm. Opt. Switch. Netw. 5(2-3): 159-169 (2008) - [c4]Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto:
Local Restoration for Trees and Arborescences. FITraMEn 2008: 130-140 - [c3]Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. IPCO 2008: 77-96 - 2007
- [j12]Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà:
Hardness of robust network design. Networks 50(1): 50-54 (2007) - [j11]Carlo Mannino, Gianpaolo Oriolo, Federico Ricci-Tersenghi, L. Sunil Chandran:
The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1): 1-9 (2007) - [j10]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) - 2006
- [j9]Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo:
Design of trees in the hose model: The balanced case. Oper. Res. Lett. 34(6): 601-606 (2006) - 2005
- [j8]L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo:
On the cubicity of certain graphs. Inf. Process. Lett. 94(3): 113-118 (2005) - [c2]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 - [c1]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO 2005: 291-305 - 2004
- [j7]Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer:
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Math. Methods Oper. Res. 59(1): 25-35 (2004) - [j6]Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, P. D'Aprile:
Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Network Based on the GMPLS Paradigm. Photonic Netw. Commun. 7(2): 131-144 (2004) - 2003
- [j5]Gianpaolo Oriolo:
Clique family inequalities for the stable set polytope of quasi-line graphs. Discret. Appl. Math. 132(1-3): 185-201 (2003) - [j4]Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41(2): 87-96 (2003) - [j3]Gaia Nicosia, Gianpaolo Oriolo:
An approximate A* algorithm and its application to the SCS problem. Theor. Comput. Sci. 290(3): 2021-2029 (2003) - 2001
- [j2]Gianpaolo Oriolo:
Clique Covers in Claw-Free Berge Graphs. Electron. Notes Discret. Math. 8: 68-71 (2001) - [j1]Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving Resilient Capacity in a Network. SIAM J. Discret. Math. 14(4): 524-539 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
