Tsunehiko Kameda

According to our database1, Tsunehiko Kameda authored at least 55 papers between 1970 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021
Locating Evacuation Centers Optimally in Path and Cycle Networks.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Minsum <i>k</i>-sink problem on path networks.
Theor. Comput. Sci., 2020

Linear-time fitting of a k-step function.
Discret. Appl. Math., 2020

2019
Minmax-Regret Evacuation Planning for Cycle Networks.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Optimizing squares covering a set of points.
Theor. Comput. Sci., 2018

Minimax Regret 1-Median Problem in Dynamic Path Networks.
Theory Comput. Syst., 2018

Minsum k-Sink Problem on Path Networks.
CoRR, 2018

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks.
CoRR, 2018

Minsum k-Sink Problem on Dynamic Flow Path Networks.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
An alternative proof for the equivalence of ∞-searcher and 2-searcher.
Theor. Comput. Sci., 2016

Exact and approximate Boolean matrix decomposition with column-use condition.
Int. J. Data Sci. Anal., 2016

Improved Algorithms for Computing k-Sink on Dynamic Path Networks.
CoRR, 2016

The p-Center Problem in Tree Networks Revisited.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks.
Theor. Comput. Sci., 2015

Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks.
Discret. Appl. Math., 2015

Geometric k-Center Problems with Centers Constrained to Two Lines.
CoRR, 2015

Geometric p-Center Problems with Centers Constrained to Two Lines.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Improved algorithms for exact and approximate boolean matrix decomposition.
Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics, 2015

2014
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network.
Algorithmica, 2014

Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network.
Proceedings of the Combinatorial Optimization and Applications, 2014

Optimizing Squares Covering a Set of Points.
Proceedings of the Combinatorial Optimization and Applications, 2014

2012
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010
Finding All Door Locations that Make a Room Searchable.
Int. J. Comput. Geom. Appl., 2010

Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
Generating asymptotically optimal broadcasting schedules to minimize average waiting time.
Discret. Math., 2009

Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing.
Proceedings of the 2009 IEEE International Conference on Robotics and Automation, 2009

2008
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable.
Proceedings of the Theory and Applications of Models of Computation, 2008

2006
Online polygon search by a seven-state boundary 1-searcher.
IEEE Trans. Robotics, 2006

Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit.
Discret. Appl. Math., 2006

Where to Build a Door.
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006

Characterization of Polygons Searchable by a Boundary 1-Searcher.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

An Optimal Solution to Room Search Problem.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling.
Proceedings of the Advances in Multimedia Information Systems, 11th International Workshop, 2005

An Optimization Problem Related to VoD Broadcasting.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2001
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.
Algorithmica, 2001

1999
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct.
IEEE Trans. Parallel Distributed Syst., 1999

Modeling K-coteries by well-covered graphs.
Networks, 1999

1998
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.
Inf. Process. Lett., 1998

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

1996
Computing on Anonymous Networks: Part II-Decision and Membership Problems.
IEEE Trans. Parallel Distributed Syst., 1996

Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases.
IEEE Trans. Parallel Distributed Syst., 1996

1995
Optimal Coteries for Rings and Related Networks.
Distributed Comput., 1995

1994
A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data.
Proceedings of the Protocols for High-Speed Networks IV, 1994

1982
Deadlock-Free Systems for a Bounded Number of Processes.
IEEE Trans. Computers, 1982

1981
On Minimal Test Sets for Locating Single Link Failures in Networks.
IEEE Trans. Computers, 1981

1970
On the State Minimization of Nondeterministic Finite Automata.
IEEE Trans. Computers, 1970

R70-39 On the Relational Homomorphisms of Automata.
IEEE Trans. Computers, 1970

R70-23 Multi-Tape and Multi-Head Pushdown Automata.
IEEE Trans. Computers, 1970


  Loading...