|
|
Ioan Todinca |
|
Curriculum Vitae (in French) Research group : Graphs and algorithms PhD advisor : Vincent Bouchitté. How to contact me :
E-mail : Ioan DOT Todinca @ univ-orleans.fr |
![]() |
Many NP-hard problems become tractable in "reasonable" time when restricted to graphs with bounded treewidth. The time complexity is actually exponential in the treewidth, but linear in the number of vertices of the input graph. Our work focuses on computing and approximating the treewidth for particular graph classes. We explore the exact and approximate computation of treewidth, and more recently we develop tools for computing good path decompositions of graphs.
For more details, see the publications page.