Ioan Todinca - RankMe

119 papers A* 8A 12B 27C 1Misc 1Journal 67Unranked 1

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