Ioan Todinca

发表

Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique

Pedro Montealegre-Barba, Ioan Todinca, 2016, PODC.

Pathwidth of Circular-Arc Graphs

Ioan Todinca, Karol Suchan, Karol Suchan, 2007, WG.

Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques

Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca, 2015, Algorithmica.

Approximating the Treewidth of AT-Free Graphs

Ioan Todinca, Vincent Bouchitté, 2000, WG.

On powers of graphs of bounded NLC-width (clique-width)

Ioan Todinca, Karol Suchan, I. Todinca, 2007, Discret. Appl. Math..

Treewidth and Pathwidth parameterized by the vertex cover number

Mathieu Liedloff, Yngve Villanger, Mathieu Chapelle, 2017, Discret. Appl. Math..

Three Notes on Distributed Property Testing

Moti Medina, Pierre Fraigniaud, Pedro Montealegre-Barba, 2017, DISC.

On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators

Pedro Montealegre-Barba, Ioan Todinca, 2016, WG.

Connected Graph Searching in Outerplanar Graphs

Dimitrios M. Thilikos, Fedor V. Fomin, Ioan Todinca, 2005, Electron. Notes Discret. Math..

Feedback vertex set on AT-free graphs

Dieter Kratsch, Haiko Müller, Ioan Todinca, 2008, Discret. Appl. Math..

Distributed Testing of Excluded Subgraphs

Ivan Rapaport, Ville Salo, Pierre Fraigniaud, 2016, DISC.

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

Ioan Todinca, 2006 .

An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem

Christophe Crespelle, Ioan Todinca, Ioan Todinca, 2010, TAMC.

On Dissemination Thresholds in Regular and Irregular Graph Classes

Ivan Rapaport, Jacques Verstraëte, Ioan Todinca, 2008, LATIN.

Minimal Proper Interval Completions

Ivan Rapaport, Ioan Todinca, Karol Suchan, 2006, WG.

On Dissemination Thresholds in Regular and Irregular Graph Classes

Ivan Rapaport, Jacques Verstraëte, Ioan Todinca, 2009, Algorithmica.

On treewidth approximations

Dieter Kratsch, Haiko Müller, Ioan Todinca, 2001, Electron. Notes Discret. Math..

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism

Ivan Rapaport, Pedro Montealegre-Barba, Florent Becker, 2014, SIROCCO.

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, 2004, ICALP.

Pathwidth is NP-Hard for Weighted Trees

Rodica Mihai, Ioan Todinca, Rodica Mihai, 2009, FAW.

Treewidth of planar graphs: connections with duality

Ioan Todinca, Vincent Bouchitté, Frédéric Mazoit, 2001, Electron. Notes Discret. Math..

Listing All Potential Maximal Cliques of a Graph

Ioan Todinca, Vincent Bouchitté, 2000, STACS.

Solving Capacitated Dominating Set by using covering by subsets and maximum matching

Mathieu Liedloff, Yngve Villanger, Ioan Todinca, 2014, Discret. Appl. Math..

Large Induced Subgraphs via Triangulations and CMSO

Fedor V. Fomin, Yngve Villanger, Ioan Todinca, 2013, SIAM J. Comput..

Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching

Mathieu Liedloff, Yngve Villanger, Ioan Todinca, 2010, WG.

The role of randomness in the broadcast congested clique model

Florent Becker, Ioan Todinca, Pedro Montealegre, 2020 .

Graph Reconstruction in the Congested Clique pdf

Pedro Montealegre-Barba, Ioan Todinca, Sebastian Perez-Salazar, 2020, J. Comput. Syst. Sci..

Minimal interval completion through graph exploration

Ioan Todinca, Karol Suchan, 2009, Theor. Comput. Sci..

Listing all potential maximal cliques of a graph

Ioan Todinca, Vincent Bouchitté, V. Bouchitté, 2000, Theor. Comput. Sci..

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

Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, 2014, Algorithmica.

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round

Nicolas Nisse, Martín Matamala, Ivan Rapaport, 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

A note on planar graphs with large width parameters and small grid-minors

Alexander Grigoriev, Ioan Todinca, Bert Marchal, 2012, Discret. Appl. Math..

Computing branchwidth via efficient triangulations and blocks

Fedor V. Fomin, Ioan Todinca, Frédéric Mazoit, 2005, Discret. Appl. Math..

Treewidth and Pathwidth parameterized by the vertex cover number

Mathieu Liedloff, Yngve Villanger, Mathieu Chapelle, 2013, Discret. Appl. Math..

On Distributed Merlin-Arthur Decision Protocols

Pierre Fraigniaud, Pedro Montealegre-Barba, Rotem Oshman, 2019, SIROCCO.

Minimal Triangulations for Graphs with "Few" Minimal Separators

Ioan Todinca, Vincent Bouchitté, 1998, ESA.

Minimal Interval Completions

Pinar Heggernes, Yngve Villanger, Ioan Todinca, 2005, ESA.

The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism

Ivan Rapaport, Florent Becker, Ioan Todinca, 2015 .

Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques

Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca, 2018, Algorithmica.

Chordal embeddings of planar graphs

Ioan Todinca, Vincent Bouchitté, Frédéric Mazoit, 2003, Discret. Math..

Allowing each node to communicate only once in a distributed system: shared whiteboard models

Nicolas Nisse, Martín Matamala, Ivan Rapaport, 2014, Distributed Computing.

On the heapability of finite partial orders

Cosmin Bonchis, Gabriel Istrate, Ioan Todinca, 2020, Discret. Math. Theor. Comput. Sci..

Guest Editorial: Selected Papers from WG 2014

Dieter Kratsch, Ioan Todinca, 2016, Algorithmica.

Coloring Powers of Graphs of Bounded Clique-Width

Ioan Todinca, 2003, WG.

Exact algorithms for treewidth and minimum fill-in ∗ †

Fedor V. Fomin, Dieter Kratsch, Yngve Villanger, 2006 .

Computing branchwidth via efficient triangulations and blocks

Fedor V. Fomin, Ioan Todinca, Frédéric Mazoit, 2009, Discret. Appl. Math..

Local Certification of Graphs with Bounded Genus pdf

Pierre Fraigniaud, Pedro Montealegre-Barba, Eric Rémila, 2020, Discret. Appl. Math..

Large induced subgraphs via triangulations and CMSO

Fedor V. Fomin, Yngve Villanger, Ioan Todinca, 2014, SODA.

Graph-theoretic concepts in computer science : 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014, revised selected papers

Dieter Kratsch, Ioan Todinca, 2014 .

The Impact of Locality in the Broadcast Congested Clique Model

Pedro Montealegre-Barba, Florent Becker, Ioan Todinca, 2020, SIAM J. Discret. Math..

Exponential time algorithms for the minimum dominating set problem on some graph classes

Dieter Kratsch, Mathieu Liedloff, Serge Gaspers, 2006, TALG.

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs

Dieter Kratsch, Haiko Müller, Ioan Todinca, 2003, WG.

Minimal proper interval completions

Ivan Rapaport, Ioan Todinca, Karol Suchan, 2006, Inf. Process. Lett..

Compact Distributed Certification of Planar Graphs

Pierre Fraigniaud, Pedro Montealegre-Barba, Eric Rémila, 2020, Algorithmica.

Exact Algorithm for the Maximum Induced Planar Subgraph Problem

Fedor V. Fomin, Yngve Villanger, Ioan Todinca, 2011, ESA.

The complexity of the bootstraping percolation and other problems

Eric Goles Ch., Pedro Montealegre-Barba, Ioan Todinca, 2013, Theor. Comput. Sci..

Approximating the treewidth of AT-free graphs

Ioan Todinca, Vincent Bouchitté, 2003, Discret. Appl. Math..

Minimal interval completion through graph exploration

Ioan Todinca, Karol Suchan, Karol Suchan, 2006, Theor. Comput. Sci..

TREEWIDTH and PATHWIDTH parameterized by vertex cover pdf

Mathieu Liedloff, Yngve Villanger, Mathieu Chapelle, 2013, ArXiv.

Characterizing Minimal Interval Completions

Pinar Heggernes, Yngve Villanger, Ioan Todinca, 2007, STACS.

Treewidth and Minimum Fill-in of Weakly Triangulated Graphs

Ioan Todinca, Vincent Bouchitté, 1999, STACS.

Constructing Brambles

Mathieu Chapelle, Ioan Todinca, Frédéric Mazoit, 2009, MFCS.

Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques

Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, 2014, SWAT.

Distributed Subgraph Detection pdf

Pierre Fraigniaud, Pedro Montealegre-Barba, Dennis Olivetti, 2017, ArXiv.

An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem

Anthony Perez, Christophe Crespelle, Ioan Todinca, 2015, WG.

An O(n2)O(n2)-time algorithm for the minimal interval completion problem

Christophe Crespelle, Ioan Todinca, Ioan Todinca, 2013, Theor. Comput. Sci..

Exact Algorithms for Treewidth

Ioan Todinca, 2016, Encyclopedia of Algorithms.

An O(n2) time algorithm for the minimal permutation completion problem

Anthony Perez, Christophe Crespelle, Ioan Todinca, 2019, Discret. Appl. Math..

Injective Colorings with Arithmetic Constraints

Martín Matamala, Mathieu Chapelle, Ioan Todinca, 2015, Graphs and Combinatorics.

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

Ioan Todinca, Vincent Bouchitté, V. Bouchitté, 2001, SIAM J. Comput..

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model

Ivan Rapaport, Pedro Montealegre-Barba, Ioan Todinca, 2018, SIROCCO.

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model

Pedro Montealegre-Barba, Florent Becker, Ioan Todinca, 2018, LATIN.

On treewidth approximations

Dieter Kratsch, Haiko Müller, Ioan Todinca, 2004, Discret. Appl. Math..

(Circular) backbone colouring: Forest backbones in planar graphs

Mathieu Liedloff, Frédéric Havet, Andrew D. King, 2014, Discret. Appl. Math..

Compact Distributed Certification of Planar Graphs

Ivan Rapaport, Pierre Fraigniaud, Eric Rémila, 2021, Algorithmica.

A Cubic Vertex-Kernel for Trivially Perfect Editing

Anthony Perez, Ioan Todinca, Mael Dumas, 2021, Algorithmica.

Polynomial Kernels for Strictly Chordal Edge Modification Problems

Anthony Perez, Ioan Todinca, Maël Dumas, 2021, IPEC.

A Meta-Theorem for Distributed Certification pdf

Ivan Rapaport, Pierre Fraigniaud, Ioan Todinca, 2021, SIROCCO.