default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Cornaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j18]Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
:
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. Discret. Appl. Math. 256: 11-37 (2019)- [j17]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
The vertex k-cut problem. Discret. Optim. 31: 8-28 (2019) - [j16]Denis Cornaz, Roland Grappe, Mathieu Lacroix:
Trader multiflow and box-TDI systems in series-parallel graphs. Discret. Optim. 31: 103-114 (2019) - [j15]Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini:
A note on selective line-graphs and partition colorings. Oper. Res. Lett. 47(6): 565-568 (2019) - 2018
- [j14]Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub:
Minimal arc-sets spanning dicycles. Discret. Appl. Math. 240: 33-43 (2018) - [c5]Denis Cornaz, Youcef Magnouche:
The Minimum Rooted-Cycle Cover Problem. ISCO 2018: 115-120 - 2017
- [j13]Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving vertex coloring problems as maximum weight stable set problems. Discret. Appl. Math. 217: 151-162 (2017) - 2015
- [i1]Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW 2015: 36-39 - 2014
- [j12]Denis Cornaz, Philippe Meurdesoif:
Chromatic Gallai identities operating on Lovász number. Math. Program. 144(1-2): 347-368 (2014) - [c4]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT 2014: 176-181 - [c3]Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub:
On minimal two-edge-connected graphs. CoDIT 2014: 251-256 - 2013
- [j11]Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries:
Perfectness of clustered graphs. Discret. Optim. 10(4): 296-303 (2013) - [j10]Cédric Bentz, Denis Cornaz, Bernard Ries:
Packing and covering with linear programming: A survey. Eur. J. Oper. Res. 227(3): 409-422 (2013) - [j9]Denis Cornaz, V. H. Nguyen:
Kőnig's edge-colouring theorem for all graphs. Oper. Res. Lett. 41(6): 592-596 (2013) - [c2]Denis Cornaz, Lucie Galand, Olivier Spanjaard:
Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width. IJCAI 2013: 76-82 - 2012
- [c1]Denis Cornaz, Lucie Galand, Olivier Spanjaard:
Bounded Single-Peaked Width and Proportional Representation. ECAI 2012: 270-275 - 2011
- [j8]Denis Cornaz:
Max-multiflow/min-multicut for G+H series-parallel. Discret. Math. 311(17): 1957-1967 (2011) - 2010
- [j7]Denis Cornaz, Philippe Meurdesoif:
The sandwich line graph. Electron. Notes Discret. Math. 36: 955-960 (2010) - [j6]Denis Cornaz:
Clique-connecting forest and stable set polytopes. RAIRO Oper. Res. 44(1): 73-83 (2010)
2000 – 2009
- 2008
- [j5]Denis Cornaz, Vincent Jost:
A one-to-one correspondence between colorings and stable sets. Oper. Res. Lett. 36(6): 673-676 (2008) - 2007
- [j4]Denis Cornaz:
On co-bicliques. RAIRO Oper. Res. 41(3): 295-304 (2007) - [j3]Denis Cornaz, Ali Ridha Mahjoub:
The Maximum Induced Bipartite Subgraph Problem with Edge Weights. SIAM J. Discret. Math. 21(3): 662-675 (2007) - 2006
- [j2]Denis Cornaz, Jean Fonlupt:
Chromatic characterization of biclique covers. Discret. Math. 306(5): 495-507 (2006) - [j1]Denis Cornaz:
A linear programming formulation for the maximum complete multipartite subgraph problem. Math. Program. 105(2-3): 329-344 (2006)
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-24 22:54 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:
