Folgen
Ioan Todinca
Ioan Todinca
Bestätigte E-Mail-Adresse bei univ-orleans.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Treewidth and minimum fill-in: Grouping the minimal separators
V Bouchitté, I Todinca
SIAM Journal on Computing 31 (1), 212-232, 2001
2092001
Listing all potential maximal cliques of a graph
V Bouchitté, I Todinca
Theoretical Computer Science 276 (1-2), 17-32, 2002
1272002
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
842008
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
822004
On treewidth approximations
V Bouchitté, D Kratsch, H Müller, I Todinca
Discrete Applied Mathematics 136 (2-3), 183-196, 2004
702004
Large induced subgraphs via triangulations and CMSO
FV Fomin, I Todinca, Y Villanger
SIAM Journal on Computing 44 (1), 54-87, 2015
682015
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
432005
Chordal embeddings of planar graphs
V Bouchitté, F Mazoit, I Todinca
Discrete Mathematics 273 (1-3), 85-102, 2003
392003
Pathwidth of circular-arc graphs
K Suchan, I Todinca
International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007
372007
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
332017
The complexity of the bootstraping percolation and other problems
E Goles, P Montealegre-Barba, I Todinca
Theoretical Computer Science 504, 73-82, 2013
322013
Distributed testing of excluded subgraphs
P Fraigniaud, I Rapaport, V Salo, I Todinca
International Symposium on Distributed Computing, 342-356, 2016
312016
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
312011
Minimal interval completions
P Heggernes, K Suchan, I Todinca, Y Villanger
European Symposium on Algorithms, 403-414, 2005
312005
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
262008
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
242018
Characterizing minimal interval completions
P Heggernes, K Suchan, I Todinca, Y Villanger
Annual Symposium on Theoretical Aspects of Computer Science, 236-247, 2007
242007
On powers of graphs of bounded NLC-width (clique-width)
K Suchan, I Todinca
Discrete Applied Mathematics 155 (14), 1885-1893, 2007
232007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20