6 citations · 17 across the 13 of their papers we have counts for
15 papers
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square
Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy +5
Let be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of with a straight line segment. Color these edges red if the…
Sink Location Problems in Dynamic Flow Grid Networks
Yuya Higashikawa, Ayano Nishii, Junichi Teruyama +1
A dynamic flow network consists of a directed graph, where nodes called sources represent locations of evacuees, and nodes called sinks represent locations of evacuation facilities…
Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama +1
In this paper, we propose new algorithms for evacuation problems defined on dynamic flow networks. A dynamic flow network is a directed graph in which source nodes are given suppli…
The Two-Squirrel Problem and Its Relatives
Sergey Bereg, Yuya Higashikawa, Naoki Katoh +3
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set of points in the plane, and two sites and , comp…
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh +2
This paper addresses the minmax regret 1-sink location problem on dynamic flow path networks with parametric weights. We are given a dynamic flow network consisting of an undirecte…
Almost Linear Time Algorithms for Minsum -Sink Problems on Dynamic Flow Path Networks
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama +1
We address the facility location problems on dynamic flow path networks. A dynamic flow path network consists of an undirected path with positive edge lengths, positive edge capaci…
On Computing a Center Persistence Diagram
Yuya Higashikawa, Naoki Katoh, Guohui Lin +4
Throughout this paper, a persistence diagram is composed of a set of planar points (each corresponding to a topological feature) above the line , as well as the…
Minsum -Sink Problem on Path Networks
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa +2
We consider the problem of locating a set of sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first prese…
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda +1
Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregat…
Improved Algorithms for Computing -Sink on Dynamic Path Networks
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa +2
We present a novel approach to finding the -sink on dynamic path networks with general edge capacities. Our first algorithm runs in time, where …
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin +3
A Dynamic Graph Network is a graph in which each edge has an associated travel time and a capacity (width) that limits the number of items that can travel in parallel along that ed…
Geometric k-Center Problems with Centers Constrained to Two Lines
Binay Bhattacharya, Sandip Das, Yuya Higashikawa +2
We consider the -center problem in which the centers are constrained to lie on two lines. Given a set of weighted points in the plane, we want to locate up to centers on…
Minimax Regret 1-Median Problem in Dynamic Path Networks
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda +2
This paper considers the minimax regret 1-median problem in dynamic path networks. In our model, we are given a dynamic path network consisting of an undirected path with positive…
Polynomial-time approximability of the k-Sink Location problem
Rémy Belmonte, Yuya Higashikawa, Naoki Katoh +1
A dynamic network where is a graph, integers and represent, for each edge , the time required to traverse edge and its no…
Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks
Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform e…