東川 雄哉

Constructing red-black spanners for mixed-charging vehicular networks.

Theoretical Computer Science 1023 114932-114932 2025年  査読有り

Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges.

J. Comb. Optim. 48(3) 18-18 2024年10月  査読有り

Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights.

J. Comb. Optim. 48(2) 15-15 2024年9月  査読有り

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

Acta Mathematica Hungarica 2024年6月  査読有り

Sink location problems in dynamic flow grid networks.

Theor. Comput. Sci. 1019 114812-114812 2024年  査読有り

Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs.

IEICE Trans. Inf. Syst. 107(6) 732-740 2024年  査読有り

Red-Black Spanners for Mixed-Charging Vehicular Networks.

COCOON (1) 220-231 2023年12月9日  査読有り

Sink Location Problems in Dynamic Flow Grid Networks.

COCOON (1) 155-167 2023年12月9日  査読有り

The Line-Constrained Maximum Coverage Facility Location Problem.

COCOA (1) 406-418 2023年12月9日  査読有り

Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges.

COCOA (1) 29-42 2023年12月9日  査読有り

On Computing a Center Persistence Diagram.

FCT 262-275 2023年9月21日  査読有り

Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2, 2)-Tight Graphs

Proceedings of the 35th Canadian Conference on Computational Geometry (CCCG 2023) 107(6) 191-196 2023年8月  査読有り

Efficient Algorithms and Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs

International Journal of Computer Mathematics: Computer Systems Theory 8(1) 1-79 2023年3月2日  査読有り

Sink Location Problems in Dynamic Flow Grid Networks.

CoRR abs/2308.12651 2023年  

The Two-Squirrel Problem and Its Relatives.

CoRR abs/2302.05937 2023年  

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

CoRR abs/2301.06857 2023年  

Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs.

CCCG 191-196 2023年  

Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs.

Computing and Combinatorics - 27th International Conference(COCOON) 244-256 2021年  査読有り

Locating Evacuation Centers Optimally in Path and Cycle Networks.

21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS) 13-19 2021年  査読有り

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks.

Theoretical Computer Science 873 87-113 2021年  査読有り招待有り

Minimum point-overlap labelling.

Optimization Methods and Software 36(2-3) 316-325 2021年  査読有り

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.

Proceedings of The 15th International Conference and Workshop on Algorithms and Computation (WALCOM 2021) 52-64 2021年  査読有り

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.

Proceedings of the 14th International Conference on Combinatorial Optimization and Applications (COCOA 2020) 198-213 2020年  査読有り

Minsum k-sink problem on path networks.

Theor. Comput. Sci. 806 388-401 2020年  査読有り

Minmax-Regret Evacuation Planning for Cycle Networks.

Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings 42-58 2019年  査読有り

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".

Rev. Socionetwork Strateg. 13(2) 99-100 2019年  

A Survey on Facility Location Problems in Dynamic Flow Networks.

Rev. Socionetwork Strateg. 13(2) 163-208 2019年  査読有り

Minsum k-Sink Problem on Dynamic Flow Path Networks.

Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings 78-89 2018年  査読有り

Minimax Regret 1-Median Problem in Dynamic Path Networks.

Theory Comput. Syst. 62(6) 1392-1408 2018年  査読有り招待有り

The mixed evacuation problem.

J. Comb. Optim. 36(4) 1299-1314 2018年  査読有り招待有り

An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.

29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan 14-13 2018年  査読有り

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.

Proceedings of the 15th Algorithms and Data Structures Symposium (WADS 2017) 10389 133-144 2017年  査読有り

Minimum Point-Overlap Labeling.

Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC 2017) 334-344 2017年  査読有り

Geometric p-Center Problems with Centers Constrained to Two Lines

DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015 9943 24-36 2016年  査読有り

Minimax Regret 1-Median Problem in Dynamic Path Networks.

Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016) 9843 122-134 2016年  査読有り

The Mixed Evacuation Problem.

Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA 2016) 18-32 2016年  査読有り

Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs.

Inf. Process. Lett. 116(2) 175-178 2016年  査読有り

Optimally bracing grid frameworks with holes

THEORETICAL COMPUTER SCIENCE 607 337-350 2015年11月  査読有り招待有り

Multiple sink location problems in dynamic path networks

THEORETICAL COMPUTER SCIENCE 607 2-15 2015年11月  査読有り招待有り

Minimax regret 1-sink location problem in dynamic path networks

THEORETICAL COMPUTER SCIENCE 588 24-36 2015年7月  査読有り招待有り

An inductive construction of minimally rigid body-hinge simple graphs

THEORETICAL COMPUTER SCIENCE 556 2-12 2014年10月  査読有り招待有り

Online graph exploration algorithms for cycles and trees by multiple searchers

JOURNAL OF COMBINATORIAL OPTIMIZATION 28(2) 480-495 2014年8月  査読有り

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

ALGORITHMS AND COMPUTATION, WALCOM 2014 8344 125-137 2014年  査読有り

Optimally Bracing Grid Frameworks with Holes

COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014) 8881 474-489 2014年  査読有り

Multiple Sink Location Problems in Dynamic Path Networks

ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014 8546 149-161 2014年  査読有り

Minimax regret sink location problem in dynamic tree networks with uniform capacity

Journal of Graph Algorithms and Applications 18(4) 539-555 2014年  査読有り招待有り

Online Vertex Exploration Problems in a Simple Polygon

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E96D(3) 489-497 2013年3月  査読有り

Minimax regret 1-sink location problems in dynamic path networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7876 121-132 2013年  査読有り

An inductive construction of minimally rigid body-hinge simple graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8287 165-177 2013年  査読有り

Online exploration of all vertices in a simple polygon

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7285 315-326 2012年  査読有り