Izumi, Taisuke
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
2011/11/07 by Taisuke Izumi, Samia Souissi, Izumi, Taisuke +11 · 2 citations
Computer Science · Engineering · #Optimization and Search Problems #Modular Robots and Swarm Intelligence #Mobile Agent-Based Network Management
- On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
2011/07/13 by Hosoda, Jun, Hromkovic, Juraj, Izumi, Taisuke +3 · 1 citation
#Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Social and Information Networks (cs.SI) #and Cluster Computing (cs.DC)
- Low-Congestion Shortcut and Graph Parameters
2019/08/26 by Kitamura, Naoki, Kitagawa, Hirotaka, Otachi, Yota +1 · 1 citation
#68W15 #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
- Message Reduction in the Local Model is a Free Lunch
2019/09/18 by Bitton, Shimon, Emek, Yuval, Izumi, Taisuke +1 · 1 citation
#Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
- Deterministic Fault-Tolerant Connectivity Labeling Scheme
2022/08/24 by Taisuke Izumi, Yuval Emek, Izumi, Taisuke +5 · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Parallel #and Cluster Computing (cs.DC)
- A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
2023/11/07 by Izumi, Taisuke, Kitamura, Naoki, Yamaguchi, Yutaro · 2 citations
Computer Science · #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC)