The following pages link to Tsunehiko Kameda (Q284587):
Displayed 36 items.
- An alternative proof for the equivalence of searcher and 2-searcher (Q284588) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- Generalized Fibonacci broadcasting: an efficient VOD scheme with user bandwidth limit (Q860403) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- Generating asymptotically optimal broadcasting schedules to minimize average waiting time (Q1045062) (← links)
- Minsum \(k\)-sink problem on dynamic flow path networks (Q1670987) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
- Minmax-regret evacuation planning for cycle networks (Q2327455) (← links)
- Improved algorithms for computing \(k\)-sink on dynamic flow path networks (Q2405281) (← links)
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537) (← links)
- ModelingK-coteries by well-covered graphs (Q2766106) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306) (← links)
- Back-Up 2-Center on a Path/Tree/Cycle/Unicycle (Q2920478) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network (Q2942389) (← links)
- Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Q3502674) (← links)
- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight (Q3557011) (← links)
- FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← links)
- On Minimal Test Sets for Locating Single Link Failures in Networks (Q3904541) (← links)
- Deadlock-Free Systems for a Bounded Number of Processes (Q3938474) (← links)
- A diagnosing algorithm for networks (Q4070755) (← links)
- An Approach to the Diagnosability Analysis of a System (Q4087077) (← links)
- Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights (Q4909575) (← links)
- (Q5091004) (← links)
- Optimal coteries for rings and related networks (Q5136994) (← links)
- The $p$-Center Problem in Tree Networks Revisited (Q5369508) (← links)
- Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles (Q5405052) (← links)
- On the State Minimization of Nondeterministic Finite Automata (Q5590818) (← links)
- Algorithms and Computation (Q5897845) (← links)