Ioan Todinca

According to our database1, Ioan Todinca authored at least 56 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
An O(n2) time algorithm for the minimal permutation completion problem.
Discret. Appl. Math., 2019

Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.
Algorithmica, 2019

On Distributed Merlin-Arthur Decision Protocols.
Proceedings of the Structural Information and Communication Complexity, 2019

2018
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.
Algorithmica, 2018

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.
Proceedings of the Structural Information and Communication Complexity, 2018

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Treewidth and Pathwidth parameterized by the vertex cover number.
Discret. Appl. Math., 2017

Graph Reconstruction in the Congested Clique.
CoRR, 2017

Distributed Subgraph Detection.
CoRR, 2017

Three Notes on Distributed Property Testing.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016
Exact Algorithms for Treewidth.
Encyclopedia of Algorithms, 2016

Deterministic graph connectivity in the broadcast congested clique.
CoRR, 2016

Guest Editorial: Selected Papers from WG 2014.
Algorithmica, 2016

On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Distributed Testing of Excluded Subgraphs.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Large Induced Subgraphs via Triangulations and CMSO.
SIAM J. Comput., 2015

Injective Colorings with Arithmetic Constraints.
Graphs and Combinatorics, 2015

Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Distributed Computing, 2015

An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
Solving Capacitated Dominating Set by using covering by subsets and maximum matching.
Discret. Appl. Math., 2014

(Circular) backbone colouring: Forest backbones in planar graphs.
Discret. Appl. Math., 2014

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism.
Proceedings of the Structural Information and Communication Complexity, 2014

2013
An O(n2)O(n2)-time algorithm for the minimal interval completion problem.
Theor. Comput. Sci., 2013

The complexity of the bootstraping percolation and other problems.
Theor. Comput. Sci., 2013

TREEWIDTH and PATHWIDTH parameterized by vertex cover
CoRR, 2013

2012
A note on planar graphs with large width parameters and small grid-minors.
Discret. Appl. Math., 2012

2011
On Dissemination Thresholds in Regular and Irregular Graph Classes.
Algorithmica, 2011

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Exact Algorithm for the Maximum Induced Planar Subgraph Problem.
Proceedings of the Algorithms - ESA 2011, 2011

2010
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009
Minimal interval completion through graph exploration.
Theor. Comput. Sci., 2009

Exponential time algorithms for the minimum dominating set problem on some graph classes.
ACM Trans. Algorithms, 2009

Computing branchwidth via efficient triangulations and blocks.
Discret. Appl. Math., 2009

Constructing Brambles.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Pathwidth is NP-Hard for Weighted Trees.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008
Exact Algorithms for Treewidth and Minimum Fill-In.
SIAM J. Comput., 2008

Minimal proper interval completions.
Inf. Process. Lett., 2008

Feedback vertex set on AT-free graphs.
Discret. Appl. Math., 2008

2007
On powers of graphs of bounded NLC-width (clique-width).
Discret. Appl. Math., 2007

Pathwidth of Circular-Arc Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Characterizing Minimal Interval Completions.
Proceedings of the STACS 2007, 2007

2006
Décompositions arborescentes de graphes : calcul, approximations, heuristiques. (Tree decompositions of graphs: computation, approximations, heuristics).
, 2006

2005
Connected Graph Searching in Outerplanar Graphs.
Electron. Notes Discret. Math., 2005

Minimal Interval Completions.
Proceedings of the Algorithms, 2005

2004
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Chordal embeddings of planar graphs.
Discrete Mathematics, 2003

Approximating the treewidth of AT-free graphs.
Discret. Appl. Math., 2003

Coloring Powers of Graphs of Bounded Clique-Width.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002
Listing all potential maximal cliques of a graph.
Theor. Comput. Sci., 2002

2001
Treewidth and Minimum Fill-in: Grouping the Minimal Separators.
SIAM J. Comput., 2001

Treewidth of planar graphs: connections with duality.
Electron. Notes Discret. Math., 2001

On treewidth approximations.
Electron. Notes Discret. Math., 2001

1999
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs.
Proceedings of the STACS 99, 1999

1998
Minimal Triangulations for Graphs with "Few" Minimal Separators.
Proceedings of the Algorithms, 1998


  Loading...