Yuya Higashikawa

From MaRDI portal
Person:300210

Available identifiers

zbMath Open higashikawa.yuyaMaRDI QIDQ300210

List of research outcomes





PublicationDate of PublicationType
Constructing red-black spanners for mixed-charging vehicular networks2024-12-12Paper
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges2024-12-03Paper
Sink location problems in dynamic flow grid networks2024-11-06Paper
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights2024-10-21Paper
A note on the 2-colored rectilinear crossing number of random point sets in the unit square2024-09-19Paper
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges2024-09-16Paper
The line-constrained maximum coverage facility location problem2024-09-16Paper
Sink location problems in dynamic flow grid networks2024-08-22Paper
Red-black spanners for mixed-charging vehicular networks2024-08-22Paper
Locating evacuation centers optimally in path and cycle networks2024-08-13Paper
On computing a center persistence diagram2024-05-29Paper
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square2023-12-04Paper
Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs2023-03-30Paper
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks2023-03-21Paper
https://portal.mardi4nfdi.de/entity/Q50910042022-07-21Paper
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights2021-10-04Paper
Minimum point-overlap labelling*2021-07-06Paper
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks2021-06-22Paper
Minsum \(k\)-sink problem on path networks2020-01-16Paper
Minmax-regret evacuation planning for cycle networks2019-10-15Paper
The mixed evacuation problem2018-12-06Paper
Minsum \(k\)-sink problem on dynamic flow path networks2018-09-06Paper
Minimax regret 1-median problem in dynamic path networks2018-08-03Paper
Improved algorithms for computing \(k\)-sink on dynamic flow path networks2017-09-22Paper
Minimum Point-Overlap Labeling2017-07-21Paper
The Mixed Evacuation Problem2017-02-01Paper
Geometric p-Center Problems with Centers Constrained to Two Lines2017-02-01Paper
Minimax regret 1-median problem in dynamic path networks2016-09-29Paper
An inductive construction of minimally rigid body-hinge simple graphs2016-06-27Paper
Optimally bracing grid frameworks with holes2015-12-11Paper
Multiple sink location problems in dynamic path networks2015-12-08Paper
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs2015-12-01Paper
Optimally Bracing Grid Frameworks with Holes2015-09-11Paper
Minimax regret 1-sink location problem in dynamic path networks2015-06-11Paper
Multiple Sink Location Problems in Dynamic Path Networks2015-05-20Paper
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity2015-01-15Paper
Online graph exploration algorithms for cycles and trees by multiple searchers2014-07-11Paper
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity2014-02-18Paper
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs2013-12-10Paper
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks2013-05-28Paper
Online Exploration of All Vertices in a Simple Polygon2012-07-16Paper

Research outcomes over time

This page was built for person: Yuya Higashikawa