Ioan Todinca

Cited by

	All	Since 2018
Citations	1618	642
h-index	23	15
i10-index	45	20

160

120

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220237 17 5 10 22 23 61 98 50 68 75 57 61 55 56 77 58 74 83 104 100 124 137 156 20

Public access

View all

7 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
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
Yngve VillangerUniversity of BergenVerified email at uib.no
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Mathieu Liedloffmaître de conférences HdR, université d'OrléansVerified email at univ-orleans.fr
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.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	215	2001
Listing all potential maximal cliques of a graph V Bouchitté, I Todinca Theoretical Computer Science 276 (1-2), 17-32, 2002	129	2002
Exact (exponential) algorithms for treewidth and minimum fill-in FV Fomin, D Kratsch, I Todinca Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004	85	2004
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	84	2008
Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015	78	2015
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	48*	2008
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	40	2003
Pathwidth of circular-arc graphs K Suchan, I Todinca Graph-Theoretic Concepts in Computer Science: 33rd International Workshop …, 2007	37	2007
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	36	2017
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	36	2011
The complexity of the bootstraping percolation and other problems E Goles, P Montealegre-Barba, I Todinca Theoretical Computer Science 504, 73-82, 2013	34	2013
Distributed testing of excluded subgraphs P Fraigniaud, I Rapaport, V Salo, I Todinca Distributed Computing: 30th International Symposium, DISC 2016, Paris …, 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	29	2005
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	25	2008
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	24	2018
The simultaneous number-in-hand communication model for networks: Private coins, public coins and determinism F Becker, P Montealegre, I Rapaport, I Todinca Structural Information and Communication Complexity: 21st International …, 2014	24	2014
Allowing each node to communicate only once in a distributed system: shared whiteboard models F Becker, A Kosowski, N Nisse, I Rapaport, K Suchan Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012	24	2012

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