Tsunehiko Kameda

From MaRDI portal
Person:284587

Available identifiers

zbMath Open kameda.tsunehikoMaRDI QIDQ284587

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50910042022-07-21Paper
Optimal coteries for rings and related networks2020-11-30Paper
Linear-time fitting of a \(k\)-step function2020-05-18Paper
Minsum \(k\)-sink problem on path networks2020-01-16Paper
Minmax-regret evacuation planning for cycle networks2019-10-15Paper
Minsum \(k\)-sink problem on dynamic flow path networks2018-09-06Paper
Minimax regret 1-median problem in dynamic path networks2018-08-03Paper
Optimizing squares covering a set of points2018-05-17Paper
The $p$-Center Problem in Tree Networks Revisited2017-10-17Paper
Improved algorithms for computing \(k\)-sink on dynamic flow path networks2017-09-22Paper
Geometric p-Center Problems with Centers Constrained to Two Lines2017-02-01Paper
Minimax regret 1-median problem in dynamic path networks2016-09-29Paper
An alternative proof for the equivalence of searcher and 2-searcher2016-05-18Paper
Linear-Time Fitting of a k-Step Function2016-03-23Paper
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks2015-12-11Paper
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks2015-09-21Paper
Optimizing Squares Covering a Set of Points2015-09-11Paper
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network2015-09-11Paper
A linear time algorithm for computing minmax regret 1-median on a tree network2015-01-19Paper
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle2014-09-26Paper
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles2014-03-31Paper
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights2013-03-21Paper
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree2012-09-25Paper
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand2012-01-06Paper
FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE2010-05-28Paper
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight2010-04-27Paper
Generating asymptotically optimal broadcasting schedules to minimize average waiting time2009-12-15Paper
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable2008-05-27Paper
Generalized Fibonacci broadcasting: an efficient VOD scheme with user bandwidth limit2007-01-09Paper
Algorithms and Computation2006-11-14Paper
Bushiness and a tight worst-case upper bound on the search number of a simple polygon.2006-01-17Paper
ModelingK-coteries by well-covered graphs2002-01-27Paper
Deadlock-Free Systems for a Bounded Number of Processes1982-01-01Paper
On Minimal Test Sets for Locating Single Link Failures in Networks1981-01-01Paper
A diagnosing algorithm for networks1975-01-01Paper
An Approach to the Diagnosability Analysis of a System1975-01-01Paper
On the State Minimization of Nondeterministic Finite Automata1970-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tsunehiko Kameda