Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Todinca, Ioan - Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans
Minimal proper interval completions Ivan Rapaport1
Pathwidth of circular-arc graphs Karol Suchan12 and Ioan Todinca1
Minimal Interval Completion Through Graph Exploration
Constructing brambles Mathieu Chapelle
) algorithm for the minimal interval completion problem
Laboratoire de l'Informatique du Parallelisme Ecole Normale Sup'erieure de Lyon
Universit d'Orlans Habilitation diriger des recherches
Approximating the treewidth of AT-free graphs Vincent Bouchitt and Ioan Todinca
On treewidth approximations
On powers of graphs of bounded NLCwidth (cliquewidth) # Karol Suchan, Ioan Todinca
Laboratoire de l'Informatique du Paralllisme #cole Normale Sup#rieure de Lyon
Treewidth: using the potential maximal cliques Vincent Bouchitt e and Ioan Todinca
Laboratoire de l'Informatique du Paral cole Normale Suprieure de Lyon
Characterizing minimal interval completions: Towards better understanding of profile and pathwidth #
Treewidth of planar graphs: connections with duality Vincent Bouchitt 1 , Frdric Mazoit 1 , and Ioan Todinca 2
Computing branchwidth via efficient triangulations and Fedor Fomin # Frederic Mazoit + Ioan Todinca #
Exact (exponential) algorithms for treewidth and minimum fillin
On treewidth approximations Vincent Bouchitt a Dieter Kratsch b Haiko Mller c
Coloring powers of graphs of bounded clique-width
N d'ordre : 105 N attribu par la bibliothque : 99ENSL0105
Minimal interval completions
Feedback vertex set and longest induced path on ATfree graphs
Connected Graph Searching in Outerplanar Fedor V. Fomin # Dimitrios M. Thilikos + Ioan Todinca #
Laboratoire de l'Informatique du Par cole Normale Suprieure de Lyon
Laboratoire de l'Informatique du Paral cole Normale Suprieure de Lyon
