default search action
Roland Grappe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Patrick Chervet, Roland Grappe:
A weak box-perfect graph theorem. J. Comb. Theory B 169: 367-372 (2024) - [i3]Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix:
Contractions in perfect graph. CoRR abs/2401.12793 (2024) - 2023
- [j17]Patrick Chervet, Roland Grappe, Mathieu Lacroix, Francesco Pisanu, Roberto Wolfler Calvo:
Hard problems on box-totally dual integral polyhedra. Discret. Optim. 50: 100810 (2023) - [j16]Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
Box-total dual integrality and edge-connectivity. Math. Program. 197(1): 307-336 (2023) - [c7]Roland Grappe, Mathieu Lacroix, Sébastien Martin:
The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. CoDIT 2023: 956-961 - 2022
- [j15]Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini, Roberto Wolfler Calvo:
The Schrijver system of the flow cone in series-parallel graphs. Discret. Appl. Math. 308: 162-167 (2022) - 2021
- [j14]Patrick Chervet, Roland Grappe, Louis-Hadrien Robert:
Box-total dual integrality, box-integrality, and equimodular matrices. Math. Program. 188(1): 319-349 (2021) - 2020
- [c6]Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. ISCO 2020: 27-41
2010 – 2019
- 2019
- [j13]Denis Cornaz, Roland Grappe, Mathieu Lacroix:
Trader multiflow and box-TDI systems in series-parallel graphs. Discret. Optim. 31: 103-114 (2019) - 2018
- [j12]Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira:
Lexicographical polytopes. Discret. Appl. Math. 240: 3-7 (2018) - [j11]J. David, Roland Grappe, Mathieu Lacroix, Emiliano Traversi:
Self-sufficient sets in smartgrids. Electron. Notes Discret. Math. 69: 301-308 (2018) - [j10]Roland Grappe, Mathieu Lacroix:
The st-bond polytope on series-parallel graphs. RAIRO Oper. Res. 52(3): 923-934 (2018) - [i2]Patrick Chervet, Roland Grappe, Louis-Hadrien Robert:
Principally Box-integer Polyhedra and Equimodular Matrices. CoRR abs/1804.08977 (2018) - 2017
- [j9]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SIAM J. Discret. Math. 31(1): 335-382 (2017) - 2016
- [j8]Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. Discret. Optim. 21: 25-41 (2016) - [c5]Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. ISCO 2016: 260-272 - 2015
- [j7]Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau:
Circuit and bond polytopes on series-parallel graphs. Discret. Optim. 17: 55-68 (2015) - [j6]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1): 75-94 (2015) - [j5]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29(1): 166-181 (2015) - 2013
- [j4]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. J. Graph Theory 72(3): 291-312 (2013) - [c4]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. IPCO 2013: 133-144 - 2012
- [c3]Sylvie Borne, Roland Grappe, Mathieu Lacroix:
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks. ISCO 2012: 105-116 - [c2]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO 2012: 129-140 - 2011
- [i1]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, non-negative factorizations and randomized communication protocols. CoRR abs/1105.4127 (2011) - 2010
- [j3]Laurent Beaudou, Antoine Gerbaud, Roland Grappe, Frédéric Palesi:
Drawing Disconnected Graphs on the Klein Bottle. Graphs Comb. 26(4): 471-481 (2010) - [c1]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SODA 2010: 1512-1520
2000 – 2009
- 2009
- [j2]Roland Grappe, Attila Bernáth, Zoltán Szigeti:
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. Electron. Notes Discret. Math. 34: 173-177 (2009) - 2008
- [j1]Roland Grappe, Zoltán Szigeti:
Covering symmetric semi-monotone functions. Discret. Appl. Math. 156(1): 138-144 (2008)
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-08-23 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint