Todinca, Ioan
- On graphs coverable by k shortest paths
2022/06/30 by Dumas, Maël, Foucaud, Florent, Perez, Anthony +1 · 4 citations
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Large induced subgraphs via triangulations and CMSO
2013/09/06 by Fedor V. Fomin, Ioan Todinca, Fomin, Fedor +3 · 2 citations
Computer Science · #Advanced Graph Theory Research #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Topological and Geometric Data Analysis
- Compact Distributed Certification of Planar Graphs
2020/05/12 by Feuilloley, Laurent, Fraigniaud, Pierre, Rapaport, Ivan +3 · 2 citations
#Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
- Local Certification of Graphs with Bounded Genus
2020/07/16 by Laurent Feuilloley, Pierre Fraigniaud, Feuilloley, Laurent +9 · 2 citations
Computer Science · Social Sciences · #Cryptography and Data Security #Distributed systems and fault tolerance #Access Control and Trust
- Deterministic graph connectivity in the broadcast congested clique
2016/02/12 by Pedro Montealegre, Montealegre, Pedro, Ioan Todinca +1 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Interconnection Networks and Systems #Parallel #and Cluster Computing (cs.DC)
- Adding a referee to an interconnection network: What can(not) be\n computed in one round
2010/09/22 by Florent Becker, Becker, Florent, Martı́n Matamala +9 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #Cooperative Communication and Network Coding #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Interconnection Networks and Systems #Parallel #and Cluster Computing (cs.DC)
- Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
2023/11/21 by Arthur Braida, Simon Martiel, Braida, Arthur +3 · 2 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Cloud Computing and Resource Management
- Even-Cycle Detection in the Randomized and Quantum CONGEST Model
2024/02/19 by Fraigniaud, Pierre, Luce, Mael, Magniez, Frederic +1 · 2 citations
#Distributed #FOS: Computer and information sciences #FOS: Physical sciences #Parallel #Quantum Physics (quant-ph) #and Cluster Computing (cs.DC)
- Distributed Model Checking on Graphs of Bounded Treedepth
2024/05/06 by Fomin, Fedor V., Fraigniaud, Pierre, Montealegre, Pedro +2 · 2 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- A Meta-Theorem for Distributed Certification
2021/12/06 by Pierre Fraigniaud, Pedro Montealegre, Fraigniaud, Pierre +5 · 1 citation
Computer Science · Social Sciences · #Access Control and Trust #Cryptography and Data Security #Distributed #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Parallel #and Cluster Computing (cs.DC)
- On constant-time quantum annealing and guaranteed approximations for graph optimization problems
2022/02/03 by Arthur Braida, Simon Martiel, Braida, Arthur +3 · 1 citation
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Complexity and Algorithms in Graphs
- Distributed Certification for Classes of Dense Graphs
2023/07/26 by Fraigniaud, Pierre, Mazoit, Frédéric, Montealegre, Pedro +2 · 1 citation
#Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
- Distributed Model Checking in Graphs Classes of Bounded Expansion
2024/11/22 by Blin, Lélia, Fomin, Fedor V., Fraigniaud, Pierre +5 · 1 citation
#Data Structures and Algorithms (cs.DS) #F.2 #FOS: Computer and information sciences