Ioan Todinca

Cited by

	All	Since 2019
Citations	1830	740
h-index	24	15
i10-index	48	18

140

105

200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 5 10 23 23 63 97 54 69 74 59 62 61 54 74 67 66 82 104 101 118 121 140 128 124

Public access

View all

12 articles

1 article

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
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.fr
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Yngve VillangerUniversity of BergenVerified email at uib.no
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.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
Rotem OshmanTel Aviv UniversityVerified email at tau.ac.il
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
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
Dimitrios M. ThilikosVerified email at thilikos.info
Ville SaloUniversity of TurkuVerified email at utu.fi

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	237	2001
Listing all potential maximal cliques of a graph V Bouchitté, I Todinca Theoretical Computer Science 276 (1-2), 17-32, 2002	143	2002
Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015	95	2015
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	91	2008
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	85	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	57*	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	48	2017
Connected graph searching in outerplanar graphs FV Fomin, DM Thilikos, I Todinca Electronic Notes in Discrete Mathematics 22 (213-216), 7th, 2005	43	2005
Chordal embeddings of planar graphs V Bouchitté, F Mazoit, I Todinca Discrete Mathematics 273 (1-3), 85-102, 2003	43	2003
Pathwidth of circular-arc graphs K Suchan, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007	40	2007
The complexity of the bootstraping percolation and other problems E Goles, P Montealegre-Barba, I Todinca Theoretical Computer Science 504, 73-82, 2013	39	2013
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	37	2011
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	34	2020
Minimal interval completions P Heggernes, K Suchan, I Todinca, Y Villanger Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005	34	2005
Distributed testing of excluded subgraphs P Fraigniaud, I Rapaport, V Salo, I Todinca International Symposium on Distributed Computing, 342-356, 2016	33	2016
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	31	2018
Minimal proper interval completions I Rapaport, K Suchan, I Todinca Information Processing Letters 106 (5), 195-202, 2008	29	2008
Computing branchwidth via efficient triangulations and blocks FV Fomin, F Mazoit, I Todinca Discrete applied mathematics 157 (12), 2726-2736, 2009	27*	2009
On powers of graphs of bounded NLC-width (clique-width) K Suchan, I Todinca Discrete Applied Mathematics 155 (14), 1885-1893, 2007	27	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