Searching for authors named "Ioan Todinca" – sorted by Relevance.
-
Pathwidth of circular-arc graphs
- Pathwidth of circular-arc graphs Karol Suchan 12 and Ioan Todinca 1 1 LIFO, Université d
- Cited by 1 (0 self) – Add To MetaCart
-
Approximating the treewidth of AT-free graphs
- Approximating the treewidth of AT-free graphs Vincent Bouchitt and Ioan Todinca LIP-cole Normale
- Cited by 2 (0 self) – Add To MetaCart
-
Minimal Triangulations for Graphs with "Few" Minimal Separators
- Vincent Bouchitt'e Ioan Todinca May 1998 Research Report N o 98-24 Ecole Normale Sup erieure de Lyon
- Cited by 7 (4 self) – Add To MetaCart
-
Minimal proper interval completions
- Minimal proper interval completions ⋆ Ivan Rapaport 1 , Karol Suchan 23 , and Ioan Todinca 2 1
- Cited by 6 (0 self) – Add To MetaCart
-
Computing branchwidth via efficient triangulation and blocks
- and blocks Fedor V. Fomin, Frederic Mazoit, and Ioan Todinca REPORT NO 297 May 2005 Department of Informatics
- Cited by 2 (0 self) – Add To MetaCart
-
Exact (exponential) algorithms for treewidth and minimum fill-in
- 2 , and Ioan Todinca 3 1 Department of Informatics, University of Bergen, N-5020 Bergen, Norway
- Cited by 21 (5 self) – Add To MetaCart
-
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs
- Bouchitt# Ioan Todinca September 1998 Research Report N o 98-40 cole Normale Suprieure de Lyon 46 Alle
- Cited by 3 (0 self) – Add To MetaCart
-
Exact algorithms for treewidth and minimum fill-in
- University of Bergen 5020 Bergen, Norway fomin@(email omitted); Ioan Todinca LIFO, Université d’Orléans 45067
- Cited by 18 (9 self) – Add To MetaCart

