Ioan Todinca

Cited by

	All	Since 2017
Citations	1537	645
h-index	22	13
i10-index	44	20

140

105

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120224 14 5 10 23 24 56 97 50 71 82 58 60 54 53 78 65 68 85 98 104 126 140 90

Public access

View all

5 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
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
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 University Paris DiderotVerified email at liafa.univ-paris-diderot.fr
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Nicolas NisseInria, FranceVerified email at inria.fr
Martín MatamalaUniversidad de ChileVerified email at uchile.cl
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
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	209	2001
Listing all potential maximal cliques of a graph V Bouchitté, I Todinca Theoretical Computer Science 276 (1-2), 17-32, 2002	127	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	84	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	82	2004
On treewidth approximations V Bouchitté, D Kratsch, H Müller, I Todinca Discrete Applied Mathematics 136 (2-3), 183-196, 2004	70	2004
Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015	68	2015
Feedback vertex set on AT-free graphs D Kratsch, H Müller, I Todinca Discrete Applied Mathematics 156 (10), 1936-1947, 2008	46*	2008
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	39	2003
Pathwidth of circular-arc graphs K Suchan, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 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	33	2017
The complexity of the bootstraping percolation and other problems E Goles, P Montealegre-Barba, I Todinca Theoretical Computer Science 504, 73-82, 2013	32	2013
Distributed testing of excluded subgraphs P Fraigniaud, I Rapaport, V Salo, I Todinca International Symposium on Distributed Computing, 342-356, 2016	31	2016
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	31	2011
Minimal interval completions P Heggernes, K Suchan, I Todinca, Y Villanger European Symposium on Algorithms, 403-414, 2005	31	2005
Computing branchwidth via efficient triangulations and blocks FV Fomin, F Mazoit, I Todinca Discrete applied mathematics 157 (12), 2726-2736, 2009	27*	2009
Minimal proper interval completions I Rapaport, K Suchan, I Todinca Information Processing Letters 106 (5), 195-202, 2008	26	2008
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques FV Fomin, M Liedloff, P Montealegre, I Todinca Algorithmica 80 (4), 1146-1169, 2018	24	2018
Characterizing minimal interval completions P Heggernes, K Suchan, I Todinca, Y Villanger Annual Symposium on Theoretical Aspects of Computer Science, 236-247, 2007	24	2007
On powers of graphs of bounded NLC-width (clique-width) K Suchan, I Todinca Discrete Applied Mathematics 155 (14), 1885-1893, 2007	23	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 this author

Cited by

Co-authors