Ioan Todinca
Orcid: 0000-0002-3466-859X
According to our database1,
Ioan Todinca
authored at least 77 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
On the power of threshold-based algorithms for detecting cycles in the CONGEST model.
Theor. Comput. Sci., 2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
2023
CoRR, 2023
Proceedings of the 37th International Symposium on Distributed Computing, 2023
Proceedings of the Structural Information and Communication Complexity, 2023
2022
On constant-time quantum annealing and guaranteed approximations for graph optimization problems.
CoRR, 2022
Polynomial kernels for edge modification problems towards block and strictly chordal graphs.
CoRR, 2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
2021
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
2020
SIAM J. Discret. Math., 2020
Discret. Math. Theor. Comput. Sci., 2020
2019
Discret. Appl. Math., 2019
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.
Algorithmica, 2019
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
Discret. Appl. Math., 2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
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
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
Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Distributed Comput., 2015
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
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 <i>O</i>(<i>n</i><sup>2</sup>)O(n2)-time algorithm for the minimal interval completion problem.
Theor. Comput. Sci., 2013
Theor. Comput. Sci., 2013
2012
Discret. Appl. Math., 2012
2011
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
Proceedings of the Algorithms - ESA 2011, 2011
2010
An <i>O</i>(<i>n</i><sup>2</sup>){\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
Exponential time algorithms for the minimum dominating set problem on some graph classes.
ACM Trans. Algorithms, 2009
Discret. Appl. Math., 2009
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009
2008
2007
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007
2006
Décompositions arborescentes de graphes : calcul, approximations, heuristiques. (Tree decompositions of graphs: computation, approximations, heuristics).
, 2006
2005
Electron. Notes Discret. Math., 2005
2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
2002
2001
SIAM J. Comput., 2001
Electron. Notes Discret. Math., 2001
1999
Proceedings of the STACS 99, 1999
1998
Proceedings of the Algorithms, 1998