Yuya Higashikawa

According to our database1, Yuya Higashikawa authored at least 43 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs.
Int. J. Comput. Math. Comput. Syst. Theory, January, 2023

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.
CoRR, 2023

The Two-Squirrel Problem and Its Relatives.
CoRR, 2023

Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges.
CoRR, 2023

On Computing a Center Persistence Diagram.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Sink Location Problems in Dynamic Flow Grid Networks.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Red-Black Spanners for Mixed-Charging Vehicular Networks.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

The Line-Constrained Maximum Coverage Facility Location Problem.
Proceedings of the Combinatorial Optimization and Applications, 2023

Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges.
Proceedings of the Combinatorial Optimization and Applications, 2023

2021
Almost linear time algorithms for minsum <i>k</i>-sink problems on dynamic flow path networks.
Theor. Comput. Sci., 2021

Minimum point-overlap labelling.
Optim. Methods Softw., 2021

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs.
Proceedings of the Computing and Combinatorics - 27th International Conference, 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

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.
Proceedings of the Combinatorial Optimization and Applications, 2020

2019
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".
Rev. Socionetwork Strateg., 2019

A Survey on Facility Location Problems in Dynamic Flow Networks.
Rev. Socionetwork Strateg., 2019

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

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

The mixed evacuation problem.
J. Comb. Optim., 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

Minimum Point-Overlap Labeling.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs.
Inf. Process. Lett., 2016

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

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities.
CoRR, 2016

2015
Optimally bracing grid frameworks with holes.
Theor. Comput. Sci., 2015

Multiple sink location problems in dynamic path networks.
Theor. Comput. Sci., 2015

Minimax regret 1-sink location problem in dynamic path networks.
Theor. Comput. Sci., 2015

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

Polynomial-time approximability of the k-Sink Location problem.
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

2014
An inductive construction of minimally rigid body-hinge simple graphs.
Theor. Comput. Sci., 2014

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity.
J. Graph Algorithms Appl., 2014

Online graph exploration algorithms for cycles and trees by multiple searchers.
J. Comb. Optim., 2014

Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks.
CoRR, 2014

2013
Online Vertex Exploration Problems in a Simple Polygon.
IEICE Trans. Inf. Syst., 2013

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Online Exploration of All Vertices in a Simple Polygon.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012


  Loading...