×

zbMATH — the first resource for mathematics

Todinca, Ioan

Compute Distance To:
Author ID: todinca.ioan Recent zbMATH articles by "Todinca, Ioan"
Published as: Todinca, Ioan; Todinca, I.
Documents Indexed: 66 Publications since 1998, including 1 Book

Publications by Year

Citations contained in zbMATH Open

52 Publications have been cited 337 times in 207 Documents Cited by Year
Treewidth and minimum fill-in: Grouping the minimal separators. Zbl 0987.05085
Bouchitté, Vincent; Todinca, Ioan
54
2001
Listing all potential maximal cliques of a graph. Zbl 1002.68104
Bouchitté, Vincent; Todinca, Ioan
31
2002
Exact algorithms for treewidth and minimum fill-in. Zbl 1163.05320
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve
28
2008
Large induced subgraphs via triangulations and CMSO. Zbl 1357.05144
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
20
2015
Exact (exponential) algorithms for treewidth and minimum fill-in. Zbl 1099.68076
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan
13
2004
On treewidth approximations. Zbl 1035.05087
Bouchitté, V.; Kratsch, D.; Müller, H.; Todinca, I.
11
2004
Pathwidth of circular-arc graphs. Zbl 1141.68549
Suchan, Karol; Todinca, Ioan
10
2007
Chordal embeddings of planar graphs. Zbl 1029.05038
Bouchitté, V.; Mazoit, F.; Todinca, I.
9
2003
Pathwidth is NP-hard for weighted trees. Zbl 1248.68385
Mihai, Rodica; Todinca, Ioan
9
2009
Feedback vertex set on AT-free graphs. Zbl 1152.68044
Kratsch, Dieter; Müller, Haiko; Todinca, Ioan
9
2008
The complexity of the bootstraping percolation and other problems. Zbl 1297.68092
Goles, Eric; Montealegre-Barba, Pedro; Todinca, Ioan
8
2013
Exponential time algorithms for the minimum dominating set problem on some graph classes. Zbl 1300.05300
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Todinca, Ioan
7
2009
Coloring powers of graphs of bounded clique-width. Zbl 1255.05084
Todinca, Ioan
7
2003
Characterizing minimal interval completions. Towards better understanding of profile and pathwidth. (Extended abstract). Zbl 1171.68620
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2007
Minimal interval completions. Zbl 1162.68494
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
6
2005
Exact algorithm for the maximum induced planar subgraph problem. Zbl 1346.05283
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
6
2011
Feedback vertex set and longest induced path on AT-free graphs. Zbl 1255.05188
Kratsch, Dieter; Müller, Haiko; Todinca, Ioan
5
2003
The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. Zbl 1416.68017
Becker, Florent; Montealegre, Pedro; Rapaport, Ivan; Todinca, Ioan
5
2014
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Zbl 1386.68068
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
5
2014
Connected graph searching in outerplanar graphs. Zbl 1200.68170
Fomin, Fedor V.; Thilikos, Dimitrios M.; Todinca, Ioan
5
2005
On powers of graphs of bounded NLC-width (clique-width). Zbl 1129.68051
Suchan, Karol; Todinca, Ioan
5
2007
Minimal proper interval completions. Zbl 1185.05107
Rapaport, Ivan; Suchan, Karol; Todinca, Ioan
5
2008
(Circular) backbone colouring: forest backbones in planar graphs. Zbl 1288.05059
Havet, Frédéric; King, Andrew D.; Liedloff, Mathieu; Todinca, Ioan
5
2014
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem. Zbl 1295.05227
Crespelle, Christophe; Todinca, Ioan
4
2013
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Zbl 1390.68344
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
4
2018
Minimal proper interval completions. Zbl 1167.05326
Rapaport, Ivan; Suchan, Karol; Todinca, Ioan
4
2006
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Zbl 1331.68029
Becker, Florent; Kosowski, Adrian; Matamala, Martin; Nisse, Nicolas; Rapaport, Ivan; Suchan, Karol; Todinca, Ioan
3
2015
On distance-\(d\) Independent Set and other problems in graphs with “few” minimal separators. Zbl 1417.05227
Montealegre, Pedro; Todinca, Ioan
3
2016
Solving capacitated dominating set by using covering by subsets and maximum matching. Zbl 1310.05162
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2010
On dissemination thresholds in regular and irregular graph classes. Zbl 1213.68468
Rapaport, I.; Suchan, K.; Todinca, I.; Verstraete, J.
3
2011
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1305.68100
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2013
An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem. Zbl 1284.05278
Crespelle, Christophe; Todinca, Ioan
3
2010
Minimal interval completion through graph exploration. Zbl 1135.68526
Suchan, Karol; Todinca, Ioan
3
2006
Minimal triangulations for graphs with “few” minimal separators. Zbl 0929.68095
Bouchitté, Vincent; Todinca, Ioan
3
1998
Computing branchwidth via efficient triangulations and blocks. Zbl 1211.05163
Fomin, Fedor V.; Mazoit, Frédéric; Todinca, Ioan
3
2009
Distributed testing of excluded subgraphs. Zbl 1393.68133
Fraigniaud, Pierre; Rapaport, Ivan; Salo, Ville; Todinca, Ioan
3
2016
On distributed Merlin-Arthur decision protocols. Zbl 07176660
Fraigniaud, Pierre; Montealegre, Pedro; Oshman, Rotem; Rapaport, Ivan; Todinca, Ioan
3
2019
Brief announcement: Deterministic graph connectivity in the broadcast congested clique. Zbl 1375.68202
Montealegre, Pedro; Todinca, Ioan
2
2016
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem. Zbl 1417.05202
Crespelle, Christophe; Perez, Anthony; Todinca, Ioan
2
2016
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. Zbl 1417.05222
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
2
2016
Computing branchwidth via efficient triangulations and blocks. Zbl 1171.05426
Fomin, Fedor; Mazoit, Frédéric; Todinca, Ioan
2
2005
Treewidth of planar graphs: connections with duality. Zbl 1171.05319
Bouchitté, Vincent; Mazoit, Frédéric; Todinca, Ioan
2
2001
Listing all potential maximal cliques of a graph. Zbl 0962.68132
Bouchitté, Vincent; Todinca, Ioan
2
2000
Treewidth and minimum fill-in of weakly triangulated graphs. Zbl 0924.05062
Bouchitté, Vincent; Todinca, Ioan
2
1999
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Zbl 1285.05142
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2014
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1350.68136
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2017
Constructing brambles. Zbl 1250.68213
Chapelle, Mathieu; Mazoit, Frédéric; Todinca, Ioan
1
2009
Minimal interval completion through graph exploration. Zbl 1161.05052
Suchan, Karol; Todinca, Ioan
1
2009
Approximating the treewidth of AT-free graphs. Zbl 0988.68124
Bouchitté, Vincent; Todinca, Ioan
1
2000
Compact distributed certification of planar graphs. Zbl 07323205
Feuilloley, Laurent; Fraigniaud, Pierre; Montealegre, Pedro; Rapaport, Ivan; Rémila, Éric; Todinca, Ioan
1
2020
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. Zbl 1418.05120
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
1
2019
On the heapability of finite partial orders. Zbl 07290409
Balogh, János; Bonchiş, Cosmin; Diniş, Diana; Istrate, Gabriel; Todinca, Ioan
1
2020
Compact distributed certification of planar graphs. Zbl 07323205
Feuilloley, Laurent; Fraigniaud, Pierre; Montealegre, Pedro; Rapaport, Ivan; Rémila, Éric; Todinca, Ioan
1
2020
On the heapability of finite partial orders. Zbl 07290409
Balogh, János; Bonchiş, Cosmin; Diniş, Diana; Istrate, Gabriel; Todinca, Ioan
1
2020
On distributed Merlin-Arthur decision protocols. Zbl 07176660
Fraigniaud, Pierre; Montealegre, Pedro; Oshman, Rotem; Rapaport, Ivan; Todinca, Ioan
3
2019
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. Zbl 1418.05120
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
1
2019
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Zbl 1390.68344
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
4
2018
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1350.68136
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2017
On distance-\(d\) Independent Set and other problems in graphs with “few” minimal separators. Zbl 1417.05227
Montealegre, Pedro; Todinca, Ioan
3
2016
Distributed testing of excluded subgraphs. Zbl 1393.68133
Fraigniaud, Pierre; Rapaport, Ivan; Salo, Ville; Todinca, Ioan
3
2016
Brief announcement: Deterministic graph connectivity in the broadcast congested clique. Zbl 1375.68202
Montealegre, Pedro; Todinca, Ioan
2
2016
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem. Zbl 1417.05202
Crespelle, Christophe; Perez, Anthony; Todinca, Ioan
2
2016
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. Zbl 1417.05222
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
2
2016
Large induced subgraphs via triangulations and CMSO. Zbl 1357.05144
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
20
2015
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Zbl 1331.68029
Becker, Florent; Kosowski, Adrian; Matamala, Martin; Nisse, Nicolas; Rapaport, Ivan; Suchan, Karol; Todinca, Ioan
3
2015
The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. Zbl 1416.68017
Becker, Florent; Montealegre, Pedro; Rapaport, Ivan; Todinca, Ioan
5
2014
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Zbl 1386.68068
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
5
2014
(Circular) backbone colouring: forest backbones in planar graphs. Zbl 1288.05059
Havet, Frédéric; King, Andrew D.; Liedloff, Mathieu; Todinca, Ioan
5
2014
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Zbl 1285.05142
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2014
The complexity of the bootstraping percolation and other problems. Zbl 1297.68092
Goles, Eric; Montealegre-Barba, Pedro; Todinca, Ioan
8
2013
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem. Zbl 1295.05227
Crespelle, Christophe; Todinca, Ioan
4
2013
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1305.68100
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2013
Exact algorithm for the maximum induced planar subgraph problem. Zbl 1346.05283
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
6
2011
On dissemination thresholds in regular and irregular graph classes. Zbl 1213.68468
Rapaport, I.; Suchan, K.; Todinca, I.; Verstraete, J.
3
2011
Solving capacitated dominating set by using covering by subsets and maximum matching. Zbl 1310.05162
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2010
An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem. Zbl 1284.05278
Crespelle, Christophe; Todinca, Ioan
3
2010
Pathwidth is NP-hard for weighted trees. Zbl 1248.68385
Mihai, Rodica; Todinca, Ioan
9
2009
Exponential time algorithms for the minimum dominating set problem on some graph classes. Zbl 1300.05300
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Todinca, Ioan
7
2009
Computing branchwidth via efficient triangulations and blocks. Zbl 1211.05163
Fomin, Fedor V.; Mazoit, Frédéric; Todinca, Ioan
3
2009
Constructing brambles. Zbl 1250.68213
Chapelle, Mathieu; Mazoit, Frédéric; Todinca, Ioan
1
2009
Minimal interval completion through graph exploration. Zbl 1161.05052
Suchan, Karol; Todinca, Ioan
1
2009
Exact algorithms for treewidth and minimum fill-in. Zbl 1163.05320
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve
28
2008
Feedback vertex set on AT-free graphs. Zbl 1152.68044
Kratsch, Dieter; Müller, Haiko; Todinca, Ioan
9
2008
Minimal proper interval completions. Zbl 1185.05107
Rapaport, Ivan; Suchan, Karol; Todinca, Ioan
5
2008
Pathwidth of circular-arc graphs. Zbl 1141.68549
Suchan, Karol; Todinca, Ioan
10
2007
Characterizing minimal interval completions. Towards better understanding of profile and pathwidth. (Extended abstract). Zbl 1171.68620
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2007
On powers of graphs of bounded NLC-width (clique-width). Zbl 1129.68051
Suchan, Karol; Todinca, Ioan
5
2007
Minimal proper interval completions. Zbl 1167.05326
Rapaport, Ivan; Suchan, Karol; Todinca, Ioan
4
2006
Minimal interval completion through graph exploration. Zbl 1135.68526
Suchan, Karol; Todinca, Ioan
3
2006
Minimal interval completions. Zbl 1162.68494
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
6
2005
Connected graph searching in outerplanar graphs. Zbl 1200.68170
Fomin, Fedor V.; Thilikos, Dimitrios M.; Todinca, Ioan
5
2005
Computing branchwidth via efficient triangulations and blocks. Zbl 1171.05426
Fomin, Fedor; Mazoit, Frédéric; Todinca, Ioan
2
2005
Exact (exponential) algorithms for treewidth and minimum fill-in. Zbl 1099.68076
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan
13
2004
On treewidth approximations. Zbl 1035.05087
Bouchitté, V.; Kratsch, D.; Müller, H.; Todinca, I.
11
2004
Chordal embeddings of planar graphs. Zbl 1029.05038
Bouchitté, V.; Mazoit, F.; Todinca, I.
9
2003
Coloring powers of graphs of bounded clique-width. Zbl 1255.05084
Todinca, Ioan
7
2003
Feedback vertex set and longest induced path on AT-free graphs. Zbl 1255.05188
Kratsch, Dieter; Müller, Haiko; Todinca, Ioan
5
2003
Listing all potential maximal cliques of a graph. Zbl 1002.68104
Bouchitté, Vincent; Todinca, Ioan
31
2002
Treewidth and minimum fill-in: Grouping the minimal separators. Zbl 0987.05085
Bouchitté, Vincent; Todinca, Ioan
54
2001
Treewidth of planar graphs: connections with duality. Zbl 1171.05319
Bouchitté, Vincent; Mazoit, Frédéric; Todinca, Ioan
2
2001
Listing all potential maximal cliques of a graph. Zbl 0962.68132
Bouchitté, Vincent; Todinca, Ioan
2
2000
Approximating the treewidth of AT-free graphs. Zbl 0988.68124
Bouchitté, Vincent; Todinca, Ioan
1
2000
Treewidth and minimum fill-in of weakly triangulated graphs. Zbl 0924.05062
Bouchitté, Vincent; Todinca, Ioan
2
1999
Minimal triangulations for graphs with “few” minimal separators. Zbl 0929.68095
Bouchitté, Vincent; Todinca, Ioan
3
1998
all top 5

Cited by 293 Authors

25 Todinca, Ioan
18 Fomin, Fedor V.
14 Montealegre, Pedro
13 Bodlaender, Hans L.
12 Heggernes, Pinar
9 Goles Chacc, Eric
9 Pilipczuk, Michał
8 Lokshtanov, Daniel
8 Villanger, Yngve
7 Mancini, Federico
7 Papadopoulos, Charis
7 Pilipczuk, Marcin
7 Rapaport, Ivan
7 Thilikos, Dimitrios M.
6 Fraigniaud, Pierre
6 Golovach, Petr A.
6 Gurski, Frank
6 Kratsch, Dieter
6 Mazoit, Frédéric
6 Nisse, Nicolas
6 Saurabh, Saket
5 Crespelle, Christophe
5 Dereniowski, Dariusz
5 Liedloff, Mathieu
5 Ono, Hirotaka
5 Otachi, Yota
4 Bouchitté, Vincent
4 Cygan, Marek
4 Hanaka, Tesshu
4 Milanič, Martin
4 Telle, Jan Arne
4 Wanke, Egon
3 Ducoffe, Guillaume
3 Jaffke, Lars
3 Kanté, Mamadou Moustapha
3 Kobayashi, Yasuaki
3 Koster, Arie M. C. A.
3 Kwon, Ojoung
3 Mihai, Rodica
3 Müller, Haiko
3 Paul, Christophe
3 Suchan, Karol
3 Tamaki, Hisao
3 Thomassé, Stéphan
3 van Rooij, Johan M. M.
2 Araújo, Júlio César Silva
2 Becker, Florent
2 Blin, Lélia
2 Bliznets, Ivan A.
2 Bykova, Valentina Vladimirovna
2 Cao, Yixin
2 Cezar, A. A.
2 Chang, Maw-Shang
2 Chapelle, Mathieu
2 Coudert, David
2 Demaine, Erik D.
2 Dorn, Frederic
2 Feuilloley, Laurent
2 Fischer, Orr
2 Flocchini, Paola
2 Gavril, Fanica
2 Goldberg, Leslie Ann
2 Gysel, Rob
2 Hajiaghayi, Mohammad Taghi
2 Havet, Frédéric
2 Kao, Mong-Jen
2 Ke, Yuping
2 Kijima, Shuji
2 Kloks, Ton
2 Krithika, R.
2 Kuszner, Łukasz
2 Lapinskas, John
2 Lee, Youngkoo
2 Mazauric, Dorian
2 Meister, Daniel
2 Okamoto, Yoshio
2 Oshman, Rotem
2 Perez, Anthony
2 Perrot, Kévin
2 Rai, Ashutosh
2 Rasel, Mostofa Kamal
2 Raymond, Jean-Florent
2 Rémila, Eric
2 Rzążewski, Paweł
2 Santoro, Nicola
2 Sau, Ignasi
2 Sritharan, R.
2 Tale, Prafullkumar
2 Theyssier, Guillaume
2 Tzimas, Spyridon
2 van der Zanden, Tom C.
2 Wojtaszczyk, Jakub Onufry
2 Yamazaki, Koichi
2 You, Jie
2 Zwick, Uri
1 Abboud, Amir
1 Adcock, Aaron B.
1 Adiga, Abhijin
1 Adler, Isolde
1 Alber, Jochen
...and 193 more Authors

Citations by Year