Spremljaj
Ioan Todinca
Ioan Todinca
Univ. Orleans, France
Preverjeni e-poštni naslov na univ-orleans.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
Treewidth and minimum fill-in: Grouping the minimal separators
V Bouchitté, I Todinca
SIAM Journal on Computing 31 (1), 212-232, 2001
2152001
Listing all potential maximal cliques of a graph
V Bouchitté, I Todinca
Theoretical Computer Science 276 (1-2), 17-32, 2002
1292002
Exact (exponential) algorithms for treewidth and minimum fill-in
FV Fomin, D Kratsch, I Todinca
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
852004
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
Large induced subgraphs via triangulations and CMSO
FV Fomin, I Todinca, Y Villanger
SIAM Journal on Computing 44 (1), 54-87, 2015
782015
On treewidth approximations
V Bouchitté, D Kratsch, H Müller, I Todinca
Discrete Applied Mathematics 136 (2-3), 183-196, 2004
732004
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
412005
Chordal embeddings of planar graphs
V Bouchitté, F Mazoit, I Todinca
Discrete Mathematics 273 (1-3), 85-102, 2003
402003
Pathwidth of circular-arc graphs
K Suchan, I Todinca
Graph-Theoretic Concepts in Computer Science: 33rd International Workshop …, 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
362017
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
362011
The complexity of the bootstraping percolation and other problems
E Goles, P Montealegre-Barba, I Todinca
Theoretical Computer Science 504, 73-82, 2013
342013
Distributed testing of excluded subgraphs
P Fraigniaud, I Rapaport, V Salo, I Todinca
Distributed Computing: 30th International Symposium, DISC 2016, Paris …, 2016
322016
Minimal interval completions
P Heggernes, K Suchan, I Todinca, Y Villanger
Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005
292005
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
252008
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
242018
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
242014
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
242012
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20