MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ioan Todinca" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

8 documents found, showing 1 through 8.

ATOM

Pathwidth of circular-arc graphs
by Karol Suchan, Ioan Todinca — Proceedings of WG 2007, Lecture Notes in Computer Science 4769, 2007
…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
by Vincent Bouchitte, Ioan Todinca — 2003 — Disc. Appl. Math
…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
by Vincent Bouchitte, Ecole Normale, Sup Lyon, Ioan Todinca, Ioan Todinca — 1998
… 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
by Ivan Rapaport, Karol Suchan, Ioan Todinca — 2006 — In Proceedings of WG 2006 - 32nd International Workshop on Graph-Theoretic Concepts in Computer Science
…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
by Fedor V. Fomin, Frederic Mazoit, Ioan Todinca — 2005 — In 31st Workshop on Graph Theoretic Concepts in Computer Science (WG
… 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
by Fedor V. Fomin, Dieter Kratsch, Ioan Todinca — 2004 — In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004
… 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
by Vincent Bouchitte, Cole Normale Suprieure De Lyon, Ioan Todinca, Ioan Todinca — 1998
… 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
by Fedor V. Fomin, Ioan Todinca, Dieter Kratsch, Yngve Villanger — 2004 — In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Comput. Sci
… 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

Showing 1 through 8.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB