Ioan Todinca

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 53

Top Venues

Publications

Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. CoRR (2024)
Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. PODC (2024)
Pierre Fraigniaud, Maël Luce, Ioan Todinca
On the power of threshold-based algorithms for detecting cycles in the CONGEST model. Theor. Comput. Sci. 996 (2024)
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC (2024)
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR (2024)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. Algorithmica 86 (2) (2024)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. CoRR (2023)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Local certification of graphs with bounded genus. Discret. Appl. Math. 325 (2023)
Maël Dumas, Anthony Perez, Ioan Todinca
A Cubic Vertex-Kernel for Trivially Perfect Editing. Algorithmica 85 (4) (2023)
Pierre Fraigniaud, Maël Luce, Ioan Todinca
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. SIROCCO (2023)
Arthur Braida, Simon Martiel, Ioan Todinca
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing. CoRR (2023)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. DISC (2023)
Pierre Fraigniaud, Maël Luce, Ioan Todinca
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. CoRR (2023)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR (2023)
Arthur Braida, Simon Martiel, Ioan Todinca
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing. CoRR (2023)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO (2023)
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On graphs coverable by k shortest paths. CoRR (2022)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Computing Power of Hybrid Models in Synchronous Networks. CoRR (2022)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. DISC (2022)
Arthur Braida, Simon Martiel, Ioan Todinca
On constant-time quantum annealing and guaranteed approximations for graph optimization problems. CoRR (2022)
Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca
Polynomial kernels for edge modification problems towards block and strictly chordal graphs. CoRR (2022)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Computing Power of Hybrid Models in Synchronous Networks. OPODIS (2022)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. SIROCCO (2022)
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On Graphs Coverable by k Shortest Paths. ISAAC (2022)
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
The role of randomness in the broadcast congested clique model. Inf. Comput. 281 (2021)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. CoRR (2021)
Maël Dumas, Anthony Perez, Ioan Todinca
A cubic vertex-kernel for Trivially Perfect Editing. CoRR (2021)
Maël Dumas, Anthony Perez, Ioan Todinca
A Cubic Vertex-Kernel for Trivially Perfect Editing. MFCS (2021)
Maël Dumas, Anthony Perez, Ioan Todinca
Polynomial Kernels for Strictly Chordal Edge Modification Problems. IPEC (2021)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Compact Distributed Certification of Planar Graphs. Algorithmica 83 (7) (2021)
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
Compact Distributed Certification of Planar Graphs. CoRR (2020)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Compact Distributed Certification of Planar Graphs. PODC (2020)
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
Graph reconstruction in the congested clique. J. Comput. Syst. Sci. 113 (2020)
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
The Impact of Locality in the Broadcast Congested Clique Model. SIAM J. Discret. Math. 34 (1) (2020)
János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca
On the heapability of finite partial orders. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca
Local Certification of Graphs with Bounded Genus. CoRR (2020)
Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca
On Distributed Merlin-Arthur Decision Protocols. SIROCCO (2019)
Christophe Crespelle, Anthony Perez, Ioan Todinca
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254 (2019)
Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica 81 (3) (2019)
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Algorithmica 80 (4) (2018)
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. LATIN (2018)
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. SIROCCO (2018)
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Treewidth and Pathwidth parameterized by the vertex cover number. Discret. Appl. Math. 216 (2017)
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
Three Notes on Distributed Property Testing. DISC (2017)
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca
Distributed Subgraph Detection. CoRR (2017)
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
Graph Reconstruction in the Congested Clique. CoRR (2017)
Pedro Montealegre, Ioan Todinca
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. WG (2016)
Pedro Montealegre, Ioan Todinca
On Distance-d Independent Set and other problems in graphs with few minimal separators. CoRR (2016)
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. DISC (2016)
Pedro Montealegre, Ioan Todinca
Deterministic graph connectivity in the broadcast congested clique. CoRR (2016)
Pedro Montealegre, Ioan Todinca
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. PODC (2016)
Dieter Kratsch, Ioan Todinca
Guest Editorial: Selected Papers from WG 2014. Algorithmica 75 (1) (2016)
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. CoRR (2016)
Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora
Injective Colorings with Arithmetic Constraints. Graphs Comb. 31 (6) (2015)
Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. WG (2015)
Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28 (3) (2015)
Christophe Crespelle, Anthony Perez, Ioan Todinca
(n^2) Time Algorithm for the Minimal Permutation Completion Problem. WG (2015)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Large Induced Subgraphs via Triangulations and CMSO. SIAM J. Comput. 44 (1) (2015)
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. SWAT (2014)
Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca
(Circular) backbone colouring: Forest backbones in planar graphs. Discret. Appl. Math. 169 (2014)
Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Discret. Appl. Math. 168 (2014)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Large induced subgraphs via triangulations and CMSO. SODA (2014)
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. SIROCCO (2014)
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. CoRR (2014)
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
TREEWIDTH and PATHWIDTH parameterized by vertex cover CoRR (2013)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Large induced subgraphs via triangulations and CMSO. CoRR (2013)
Christophe Crespelle, Ioan Todinca
)O(n2)-time algorithm for the minimal interval completion problem. Theor. Comput. Sci. 494 (2013)
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. WADS (2013)
Eric Goles Ch., Pedro Montealegre-Barba, Ioan Todinca
The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci. 504 (2013)
Alexander Grigoriev, Bert Marchal, Natalya Usotskaya, Ioan Todinca
A note on planar graphs with large width parameters and small grid-minors. Discret. Appl. Math. 160 (7-8) (2012)
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59 (1) (2011)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS (2011)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA (2011)
Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG (2010)
Christophe Crespelle, Ioan Todinca
){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. TAMC (2010)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round CoRR (2010)
Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. 157 (12) (2009)
Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca
Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms 6 (1) (2009)
Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca
Constructing Brambles. MFCS (2009)
Rodica Mihai, Ioan Todinca
Pathwidth is NP-Hard for Weighted Trees. FAW (2009)
Karol Suchan, Ioan Todinca
Minimal interval completion through graph exploration. Theor. Comput. Sci. 410 (1) (2009)
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN (2008)
Dieter Kratsch, Haiko Müller, Ioan Todinca
Feedback vertex set on AT-free graphs. Discret. Appl. Math. 156 (10) (2008)
Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal proper interval completions. Inf. Process. Lett. 106 (5) (2008)
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38 (3) (2008)
Karol Suchan, Ioan Todinca
Pathwidth of Circular-Arc Graphs. WG (2007)
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Characterizing Minimal Interval Completions. STACS (2007)
Karol Suchan, Ioan Todinca
On powers of graphs of bounded NLC-width (clique-width). Discret. Appl. Math. 155 (14) (2007)
Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal Proper Interval Completions. WG (2006)
Karol Suchan, Ioan Todinca
Minimal Interval Completion Through Graph Exploration. ISAAC (2006)
Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca
Connected Graph Searching in Outerplanar Graphs. Electron. Notes Discret. Math. 22 (2005)
Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
Computing Branchwidth Via Efficient Triangulations and Blocks. WG (2005)
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Minimal Interval Completions. ESA (2005)
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP (2004)
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
On treewidth approximations. Discret. Appl. Math. 136 (2-3) (2004)
Vincent Bouchitté, Ioan Todinca
Approximating the treewidth of AT-free graphs. Discret. Appl. Math. 131 (1) (2003)
Ioan Todinca
Coloring Powers of Graphs of Bounded Clique-Width. WG (2003)
Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca
Chordal embeddings of planar graphs. Discret. Math. 273 (1-3) (2003)
Dieter Kratsch, Haiko Müller, Ioan Todinca
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG (2003)
Vincent Bouchitté, Ioan Todinca
Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276 (1-2) (2002)

Ioan Todinca.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ioan Todinca