Ioan Todinca

Cited by

	All	Since 2018
Citations	1717	738
h-index	23	15
i10-index	47	21

160

120

20002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202315 5 10 21 23 61 98 50 68 76 57 62 61 54 80 64 67 82 103 103 124 132 148 126

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Ivan RapaportDiscrete Mathematics, Universidad de ChileVerified email at dim.uchile.cl
Pedro MontealegreUniversidad Adolfo IbáñezVerified email at uai.cl
Yngve VillangerUniversity of BergenVerified email at uib.no
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.fr
Mathieu LiedloffProfesseur des Universités, université d'OrléansVerified email at univ-orleans.fr
Nicolas NisseInria, FranceVerified email at inria.fr
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Dennis OlivettiGran Sasso Science InstituteVerified email at gssi.it
Eric RémilaProfesseur, Université de Lyon, Université J. Monnet St-EtienneVerified email at univ-st-etienne.fr
Martín MatamalaUniversidad de ChileVerified email at uchile.cl
Jacques VerstraeteUniversity of California, San DiegoVerified email at math.ucsd.edu
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerified email at thilikos.info
Guy EvenEE, Tel-Aviv UnivVerified email at eng.tau.ac.il
Moti MedinaEngineering Faculty at Bar-Ilan UniversityVerified email at biu.ac.il
Reut LeviThe Interdisciplinary Center, HerzliyaVerified email at idc.ac.il
Ville SaloUniversity of TurkuVerified email at utu.fi
Andrew D. KingD-WaveVerified email at dwavesys.com

Ioan Todinca

Univ. Orleans, France

Verified email at univ-orleans.fr - Homepage

graph algorithms tree decompositions


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Treewidth and minimum fill-in: Grouping the minimal separators V Bouchitté, I Todinca SIAM Journal on Computing 31 (1), 212-232, 2001	229	2001
Listing all potential maximal cliques of a graph V Bouchitté, I Todinca Theoretical Computer Science 276 (1-2), 17-32, 2002	137	2002
Exact algorithms for treewidth and minimum fill-in FV Fomin, D Kratsch, I Todinca, Y Villanger SIAM Journal on Computing 38 (3), 1058-1079, 2008	92	2008
Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015	86	2015
Exact (exponential) algorithms for treewidth and minimum fill-in FV Fomin, D Kratsch, I Todinca International Colloquium on Automata, Languages, and Programming, 568-580, 2004	86	2004
On treewidth approximations V Bouchitté, D Kratsch, H Müller, I Todinca Discrete Applied Mathematics 136 (2-3), 183-196, 2004	73	2004
Feedback vertex set on AT-free graphs D Kratsch, H Müller, I Todinca Discrete Applied Mathematics 156 (10), 1936-1947, 2008	53*	2008
Three notes on distributed property testing G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ... 31st International Symposium on Distributed Computing (DISC 2017), 2017	41	2017
Connected graph searching in outerplanar graphs FV Fomin, DM Thilikos, I Todinca Electronic Notes in Discrete Mathematics 22 (213-216), 7th, 2005	41	2005
Chordal embeddings of planar graphs V Bouchitté, F Mazoit, I Todinca Discrete Mathematics 273 (1-3), 85-102, 2003	41	2003
Adding a referee to an interconnection network: What can (not) be computed in one round F Becker, M Matamala, N Nisse, I Rapaport, K Suchan, I Todinca 2011 IEEE International Parallel & Distributed Processing Symposium, 508-514, 2011	38	2011
Pathwidth of circular-arc graphs K Suchan, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007	37	2007
The complexity of the bootstraping percolation and other problems E Goles, P Montealegre-Barba, I Todinca Theoretical Computer Science 504, 73-82, 2013	36	2013
Distributed testing of excluded subgraphs P Fraigniaud, I Rapaport, V Salo, I Todinca International Symposium on Distributed Computing, 342-356, 2016	32	2016
Minimal interval completions P Heggernes, K Suchan, I Todinca, Y Villanger Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005	31	2005
Compact distributed certification of planar graphs L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, É Rémila, I Todinca Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020	28	2020
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques FV Fomin, M Liedloff, P Montealegre, I Todinca Algorithmica 80, 1146-1169, 2018	26	2018
Computing branchwidth via efficient triangulations and blocks FV Fomin, F Mazoit, I Todinca Discrete applied mathematics 157 (12), 2726-2736, 2009	26*	2009
Minimal proper interval completions I Rapaport, K Suchan, I Todinca Information Processing Letters 106 (5), 195-202, 2008	26	2008
On powers of graphs of bounded NLC-width (clique-width) K Suchan, I Todinca Discrete Applied Mathematics 155 (14), 1885-1893, 2007	25	2007

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors