Ioan Todinca

	2009
30		Rodica Mihai, Ioan Todinca: Pathwidth is NP-Hard for Weighted Trees. FAW 2009: 181-195
29		Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca: Constructing Brambles. MFCS 2009: 223-234
28		Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics 157(12): 2726-2736 (2009)
27		Karol Suchan, Ioan Todinca: Minimal interval completion through graph exploration. Theor. Comput. Sci. 410(1): 35-43 (2009)
	2008
26		Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte: On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN 2008: 24-35
25		Dieter Kratsch, Haiko Müller, Ioan Todinca: Feedback vertex set on AT-free graphs. Discrete Applied Mathematics 156(10): 1936-1947 (2008)
24		Ivan Rapaport, Karol Suchan, Ioan Todinca: Minimal proper interval completions. Inf. Process. Lett. 106(5): 195-202 (2008)
23		Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger: Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008)
	2007
22		Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Characterizing Minimal Interval Completions. STACS 2007: 236-247
21		Karol Suchan, Ioan Todinca: Pathwidth of Circular-Arc Graphs. WG 2007: 258-269
20		Karol Suchan, Ioan Todinca: On powers of graphs of bounded NLC-width (clique-width). Discrete Applied Mathematics 155(14): 1885-1893 (2007)
	2006
19		Karol Suchan, Ioan Todinca: Minimal Interval Completion Through Graph Exploration. ISAAC 2006: 517-526
18		Ivan Rapaport, Karol Suchan, Ioan Todinca: Minimal Proper Interval Completions. WG 2006: 217-228
	2005
17		Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Minimal Interval Completions. ESA 2005: 403-414
16		Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384
15		Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca: Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics 22: 213-216 (2005)
	2004
14		Fedor V. Fomin, Dieter Kratsch, Ioan Todinca: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580
13		Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Discrete Applied Mathematics 136(2-3): 183-196 (2004)
	2003
12		Dieter Kratsch, Haiko Müller, Ioan Todinca: Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321
11		Ioan Todinca: Coloring Powers of Graphs of Bounded Clique-Width. WG 2003: 370-382
10		Vincent Bouchitté, Ioan Todinca: Approximating the treewidth of AT-free graphs. Discrete Applied Mathematics 131(1): 11-37 (2003)
9		Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca: Chordal embeddings of planar graphs. Discrete Mathematics 273(1-3): 85-102 (2003)
	2002
8		Vincent Bouchitté, Ioan Todinca: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1-2): 17-32 (2002)
	2001
7		Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca: Treewidth of planar graphs: connections with duality. Electronic Notes in Discrete Mathematics 10: 34-38 (2001)
6		Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Electronic Notes in Discrete Mathematics 8: 98-101 (2001)
5		Vincent Bouchitté, Ioan Todinca: Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput. 31(1): 212-232 (2001)
	2000
4		Vincent Bouchitté, Ioan Todinca: Listing All Potential Maximal Cliques of a Graph. STACS 2000: 503-515
3		Vincent Bouchitté, Ioan Todinca: Approximating the Treewidth of AT-Free Graphs. WG 2000: 59-70
	1999
2		Vincent Bouchitté, Ioan Todinca: Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. STACS 1999: 197-206
	1998
1		Vincent Bouchitté, Ioan Todinca: Minimal Triangulations for Graphs with "Few" Minimal Separators. ESA 1998: 344-355

Coauthor Index

1	Vincent Bouchitté	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [13]
2	Mathieu Chapelle	[29]
3	Fedor V. Fomin	[14] [15] [16] [23] [28]
4	Pinar Heggernes	[17] [22]
5	Dieter Kratsch	[6] [12] [13] [14] [23] [25]
6	Frédéric Mazoit	[7] [9] [16] [28] [29]
7	Rodica Mihai	[30]
8	Haiko Müller	[6] [12] [13] [25]
9	Ivan Rapaport	[18] [24] [26]
10	Karol Suchan	[17] [18] [19] [20] [21] [22] [24] [26] [27]
11	Dimitrios M. Thilikos	[15]
12	Jacques Verstraëte	[26]
13	Yngve Villanger	[17] [22] [23]