The following pages link to Ichiro Suzuki (Q266918):
Displaying 38 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- An alternative proof for the equivalence of searcher and 2-searcher (Q284588) (← links)
- Bridge decompositions with distances at least two (Q455019) (← links)
- Weak sense of direction labelings and graph embeddings (Q628312) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- Hardness results on the man-exchange stable marriage problem with short preference lists (Q845882) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- Characterizing geometric patterns formable by oblivious anonymous mobile robots (Q974737) (← links)
- A method for stepwise refinement and abstraction of Petri nets (Q1052100) (← links)
- Proving properties of a ring of finite-state machines (Q1115609) (← links)
- Clock synchronization and the power of broadcasting (Q1176072) (← links)
- Fair Petri nets and structural induction for rings of processes (Q1346633) (← links)
- Three measures for synchronic dependence in Petri nets (Q1836303) (← links)
- Monotonic self-stabilization and its application to robust and adaptive pattern formation (Q2089064) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537) (← links)
- (Q2788943) (← links)
- (Q2971306) (← links)
- Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (Q3012842) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- DESIGNING MULTI-LINK ROBOT ARMS IN A CONVEX POLYGON (Q3126157) (← links)
- Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns (Q3427746) (← links)
- The Searchlight Scheduling Problem (Q3495667) (← links)
- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight (Q3557011) (← links)
- (Q3602859) (← links)
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids (Q3833623) (← links)
- Searching for a Mobile Intruder in a Polygonal Region (Q4015972) (← links)
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns (Q4268714) (← links)
- (Q4331288) (← links)
- (Q4348608) (← links)
- (Q4610034) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)
- (Q4844860) (← links)
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM (Q4858653) (← links)
- (Q4937176) (← links)
- Vision-Based Pursuit-Evasion in a Grid (Q5892564) (← links)
- Vision-Based Pursuit-Evasion in a Grid (Q5900155) (← links)
