Matamala, Martín
- Adding a referee to an interconnection network: What can(not) be computed in one round
2010/09/22 by Florent Becker, Becker, Florent, Martı́n Matamala +11 · 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) #cs.CC #cs.DC
- Boundedness for proper conflict-free and odd colorings
2023/07/31 by Andrea Jiménez, Jiménez, Andrea, Kolja Knauer +19 · 3 citations
Computer Science · Mathematics · #05C15 #05C62 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #cs.DM #math.CO #msc:05C15 #msc:05C62
- Graphs with no induced house nor induced hole have the de\n Bruijn-Erd Hos property
2020/05/19 by P Aboulker, Aboulker, Pierre, Laurent Beaudou +5 · 2 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory