default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémie Dusart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Jérémie Dusart, Michel Habib
, Derek G. Corneil:
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications. Order 41(1): 99-133 (2024)- 2023
- [i6]Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton:
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches. CoRR abs/2302.06867 (2023) - 2022
- [i5]Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton:
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits. CoRR abs/2202.05938 (2022) - 2021
- [j6]Jérémie Dusart, Derek G. Corneil, Michel Habib:
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 50(3): 1148-1153 (2021)
2010 – 2019
- 2019
- [c2]Iovka Boneva, Jérémie Dusart, Daniel Fernández-Álvarez, José Emilio Labra Gayo:
Shape Designer for ShEx and SHACL constraints. ISWC (Satellites) 2019: 269-272 - [i4]Iovka Boneva, Jérémie Dusart, Daniel Fernández-Álvarez, José Emilio Labra Gayo:
Semi Automatic Construction of ShEx and SHACL Schemas. CoRR abs/1907.10603 (2019) - 2018
- [j5]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
The Induced Separation Dimension of a Graph. Algorithmica 80(10): 2834-2848 (2018) - [j4]Eric Bach, Jérémie Dusart, Lisa Hellerstein, Devorah Kletenik:
Submodular goal value of Boolean functions. Discret. Appl. Math. 238: 1-13 (2018) - 2017
- [j3]Jérémie Dusart, Michel Habib:
A new LBFS-based algorithm for cocomparability graph recognition. Discret. Appl. Math. 216: 149-161 (2017) - [i3]Eric Bach, Jérémie Dusart, Lisa Hellerstein, Devorah Kletenik:
Submodular Goal Value of Boolean Functions. CoRR abs/1702.04067 (2017) - 2016
- [j2]Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
A tie-break model for graph search. Discret. Appl. Math. 199: 89-100 (2016) - [j1]Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler:
On the Power of Graph Searching for Cocomparability Graphs. SIAM J. Discret. Math. 30(1): 569-591 (2016) - [c1]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
Induced Separation Dimension. WG 2016: 121-132 - [i2]Jérémie Dusart, Michel Habib, Derek G. Corneil:
Maximal cliques structure for cocomparability graphs and applications. CoRR abs/1611.02002 (2016) - 2015
- [i1]Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier:
A tie-break model for graph search. CoRR abs/1501.06148 (2015) - 2014
- [b1]Jérémie Dusart:
Graph Searches with Applications to Cocomparability Graphs. (Parcours de graphes et applications aux graphes de cocomparabilité). Paris Diderot University, France, 2014
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-05 21:18 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:
