Diane Castonguay

According to our database1, Diane Castonguay authored at least 20 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing a 3-role assignment is polynomial-time solvable on complementary prisms.
CoRR, 2024

2023
On total coloring the direct product of cycles and bipartite direct product of graphs.
Discret. Math., June, 2023

Computing role assignments of Cartesian product of graphs.
RAIRO Oper. Res., May, 2023

2022
Computing some role assignments of Cartesian product of graphs.
RAIRO Oper. Res., 2022

Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021
On the geodetic hull number for complementary prisms II.
RAIRO Oper. Res., 2021

Unit form recognition by mutations: Application of mutations in the search of positive roots.
Discret. Appl. Math., 2021

Most direct product of graphs are Type 1.
CoRR, 2021

On total coloring the direct product of complete graphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2019
On the geodetic number of complementary prisms.
Inf. Process. Lett., 2019

A note on the convexity number for complementary prisms.
Discret. Math. Theor. Comput. Sci., 2019

A polynomial recognition of unit forms using graph-based strategies.
Discret. Appl. Math., 2019

2018
On the convexity number for complementary prisms.
CoRR, 2018

2017
Results for the maximum weight planar subgraph problem.
CoRR, 2017

2016
A Polynomial Recognition of Unit Forms.
Electron. Notes Discret. Math., 2016

2015
Algorithms and Properties for Positive Symmetrizable Matrices.
CoRR, 2015

Polynomial recognition of cluster algebras of finite type.
CoRR, 2015

Polynomial enumeration of chordless cycles on cyclically orientable graphs.
CoRR, 2015

2014
Fast Parallel Algorithm for Enumerating All Chordless Cycles in Graphs.
CoRR, 2014

2013
Efficient Enumeration of All Chordless Cycles in Graphs.
CoRR, 2013


  Loading...