According to our database1, Ichiro Suzuki authored at least 58 papers between 1981 and 2016.
Legend:Book In proceedings Article PhD thesis Other
An alternative proof for the equivalence of ∞-searcher and 2-searcher.
Theor. Comput. Sci., 2016
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings.
Discrete Applied Mathematics, 2016
The searchlight problem for road networks.
Theor. Comput. Sci., 2015
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid.
Computing and Informatics, 2012
Weak sense of direction labelings and graph embeddings.
Discrete Applied Mathematics, 2011
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Characterizing geometric patterns formable by oblivious anonymous mobile robots.
Theor. Comput. Sci., 2010
Vision-Based Pursuit-Evasion in a Grid.
SIAM J. Discrete Math., 2010
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
Forming a connected network in a grid by asynchronous and oblivious robots.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009
Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - .
Theor. Comput. Sci., 2008
A unified approach to finding good stable matchings in the hospitals/residents setting.
Theor. Comput. Sci., 2008
Capturing an Evader in a Building - Randomized and Deterministic Algorithms for Mobile Robots.
IEEE Robot. Automat. Mag., 2008
Vision-Based Pursuit-Evasion in a Grid.
Proceedings of the Algorithm Theory, 2008
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008
Hardness results on the man-exchange stable marriage problem with short preference lists.
Inf. Process. Lett., 2007
Offline variants of the "lion and man" problem.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007
Online polygon search by a seven-state boundary 1-searcher.
IEEE Trans. Robotics, 2006
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns.
SIAM J. Comput., 2006
Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration.
IEEE Trans. Robotics, 2004
Searching a polygonal region by a group of stationary k-searchers.
Inf. Process. Lett., 2004
Formations for Fast Locomotion of Metamorphic Robotic Systems.
I. J. Robotics Res., 2004
Delivery of medical multimedia contents through the TCP/IP network using RealSystem.
Computer Methods and Programs in Biomedicine, 2003
High Speed Formations of Reconfigurable Modular Robotic Systems.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002
Searching a Polygonal Region from the Boundary.
Int. J. Comput. Geometry Appl., 2001
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.
A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001
Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder.
Proceedings of the Distributed Autonomous Robotic Systems 4, 2000
Distributed memoryless point convergence algorithm for mobile robots with limited visibility.
IEEE Trans. Robotics and Automation, 1999
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns.
SIAM J. Comput., 1999
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.
Inf. Process. Lett., 1998
Learning-based automatic generation of collision avoidance algorithms for multiple autonomous mobile robots.
Proceedings of the Proceedings 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, 1998
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time.
Proceedings of the Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28, 1998
Time-optimal motion of two omnidirectional robots carrying a ladder under a velocity constraint.
IEEE Trans. Robotics and Automation, 1997
A Practical Algorithm for Integer Sorting on a Mesh-connected Computer.
Parallel Algorithms Appl., 1997
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
Distributed algorithms for formation of geometric patterns with many mobile robots.
J. Field Robotics, 1996
Designing multi-link robot arms in a convex polygon.
Int. J. Comput. Geometry Appl., 1996
Distributed Anonymous Mobile Robots.
Proceedings of the SIROCCO'96, 1996
Fusion of social laws and super rules for coordinating the motion of mobile robots.
Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS 1996, 1996
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots.
Proceedings of the Intelligent Robots: Sensing, 1996
Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem.
Int. J. Comput. Geometry Appl., 1995
A New Structural Induction Theorem for Rings of Temporal Petri Nets.
IEEE Trans. Software Eng., 1994
Fair Petri Nets and Structural Induction for Rings of Processes.
Theor. Comput. Sci., 1994
Proximity Problems and the Voronoi Diagram an a Rectilinear Plane with Rectangular Obstacles.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993
Searching for a Mobile Intruder in a Polygonal Region.
SIAM J. Comput., 1992
Clock Synchronization and the Power of Broadcasting.
Distributed Computing, 1991
Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets.
IEEE Trans. Software Eng., 1990
The Searchlight Scheduling Problem.
SIAM J. Comput., 1990
Temporal Petri Nets and Their Application to Modeling and Analysis of a Handshake Daisy Chain Arbiter.
IEEE Trans. Computers, 1989
Optimal Algorithms for a Pursuit-Evasion Problem in Grids.
SIAM J. Discrete Math., 1989
Proving Properties of a Ring of Finite-State Machines.
Inf. Process. Lett., 1988
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions.
Theor. Comput. Sci., 1986
A Distributed Mutual Exclusion Algorithm
ACM Trans. Comput. Syst., 1985
A Method for Stepwise Refinement and Abstraction of Petri Nets.
J. Comput. Syst. Sci., 1983
Three Measures for Synchronic Dependence in Petri Nets.
Acta Inf., 1983
Stepwise Refinements of Transitions and Places.
Proceedings of the Application and Theory of Petri Nets, 1981