Jérémie Dusart

Orcid: 0000-0001-6654-2038

According to our database1, Jérémie Dusart authored at least 15 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications.
Order, April, 2024

2023
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches.
CoRR, 2023

2022
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits.
CoRR, 2022

2021
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs.
SIAM J. Comput., 2021

2019
Semi Automatic Construction of ShEx and SHACL Schemas.
CoRR, 2019

Shape Designer for ShEx and SHACL constraints.
Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, 2019

2018
Submodular goal value of Boolean functions.
Discret. Appl. Math., 2018

The Induced Separation Dimension of a Graph.
Algorithmica, 2018

2017
A new LBFS-based algorithm for cocomparability graph recognition.
Discret. Appl. Math., 2017

2016
On the Power of Graph Searching for Cocomparability Graphs.
SIAM J. Discret. Math., 2016

A tie-break model for graph search.
Discret. Appl. Math., 2016

Maximal cliques structure for cocomparability graphs and applications.
CoRR, 2016

Induced Separation Dimension.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015
A tie-break model for graph search.
CoRR, 2015

2014
Graph Searches with Applications to Cocomparability Graphs. (Parcours de graphes et applications aux graphes de cocomparabilité).
PhD thesis, 2014


  Loading...