Ioan Todinca

Cited by

	All	Since 2016
Citations	1402	548
h-index	21	13
i10-index	40	17

180

135

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020214 14 6 14 20 27 58 98 49 78 82 66 55 56 54 80 68 72 77 103 120 162 11

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
Yngve VillangerUniversity of BergenVerified email at uib.no
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Karol SuchanUniversidad Diego PortalesVerified email at mail.udp.cl
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 OlivettiUniversity of FreiburgVerified email at aalto.fi
Serge GaspersAssociate Professor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Jacques VerstraeteUniversity of California, San DiegoVerified email at math.ucsd.edu
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
Guy EvenEE, Tel-Aviv UnivVerified email at eng.tau.ac.il
Moti MedinaECE, Ben-Gurion University of the NegevVerified email at bgu.ac.il
Reut LeviWeizmann Institute of ScienceVerified email at weizmann.ac.il
Ville SaloUniversity of TurkuVerified email at utu.fi
Adrian KosowskiHead of Research at NavAlgoVerified email at navalgo.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	192	2001
Listing all potential maximal cliques of a graph V Bouchitté, I Todinca Theoretical Computer Science 276 (1-2), 17-32, 2002	118	2002
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	81	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	78	2008
On treewidth approximations V Bouchitté, D Kratsch, H Müller, I Todinca Discrete Applied Mathematics 136 (2-3), 183-196, 2004	71	2004
Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015	54	2015
Feedback vertex set on AT-free graphs D Kratsch, H Müller, I Todinca Discrete Applied Mathematics 156 (10), 1936-1947, 2008	39*	2008
Chordal embeddings of planar graphs V Bouchitté, F Mazoit, I Todinca Discrete Mathematics 273 (1-3), 85-102, 2003	38	2003
Pathwidth of circular-arc graphs K Suchan, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007	35	2007
Connected graph searching in outerplanar graphs FV Fomin, DM Thilikos, I Todinca Electronic Notes in Discrete Mathematics 22 (213-216), 7th, 2005	35	2005
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	30	2005
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	28	2017
Distributed testing of excluded subgraphs P Fraigniaud, I Rapaport, V Salo, I Todinca International Symposium on Distributed Computing, 342-356, 2016	25	2016
Computing branchwidth via efficient triangulations and blocks FV Fomin, F Mazoit, I Todinca Discrete applied mathematics 157 (12), 2726-2736, 2009	25*	2009
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
The complexity of the bootstraping percolation and other problems E Goles, P Montealegre-Barba, I Todinca Theoretical Computer Science 504, 73-82, 2013	23	2013
Minimal proper interval completions I Rapaport, K Suchan, I Todinca Information Processing Letters 106 (5), 195-202, 2008	23	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	22	2018
On powers of graphs of bounded NLC-width (clique-width) K Suchan, I Todinca Discrete Applied Mathematics 155 (14), 1885-1893, 2007	22	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

Upload PDF

Follow this author

Cited by

Co-authors