Faculty Profiles - ONO Hirotaka

Authorship：Last author Language：English Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers

<p>DAIHINMIN, which means Grand Pauper, is a popular playing-card game in Japan. TANHINMIN is a simplified variant of DAIHINMIN, which was proposed by Nishino in 2007 in order to investigate the mathematical properties of DAIHINMIN. In this paper, we consider a 2-player generalized TANHINMIN, where the deck size is arbitrary <i>n</i>. We present a linear-time algorithm that determines which player has a winning strategy after all cards are distributed to the players.</p>

DOI： 10.1587/transfun.2020dmp0026

Web of Science

Scopus

Graph Orientation with Edge Modifications Reviewed International coauthorship Open Access

Asahiro, Y., Jansson, J., Miyano, E., Ono, H., S, hya, T.P.

International Journal of Foundations of Computer Science Vol. 32 ( 02 ) page： 209 - 233 2021.2

Language：Japanese Publishing type：Research paper (scientific journal) Publisher：World Scientific Pub Co Pte Lt

The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph [Formula: see text] of an input undirected graph [Formula: see text] such that either: (Type I) the number of edges in [Formula: see text] is minimized or maximized and [Formula: see text] can be oriented to satisfy some specified constraints on the vertices’ resulting outdegrees; or: (Type II) among all subgraphs or supergraphs of [Formula: see text] that can be constructed by deleting or inserting a fixed number of edges, [Formula: see text] admits an orientation optimizing some objective involving the vertices’ outdegrees. This paper introduces eight new outdegree-constrained edge-modification problems related to load balancing called (Type I) MIN-DEL-MAX, MIN-INS-MIN, MAX-INS-MAX, and MAX-DEL-MIN and (Type II) [Formula: see text]-DEL-MAX, [Formula: see text]-INS-MIN, [Formula: see text]-INS-MAX, and [Formula: see text]-DEL-MIN. In each of the eight problems, the input is a graph and the goal is to delete or insert edges so that the resulting graph has an orientation in which the maximum outdegree (taken over all vertices) is small or the minimum outdegree is large. We first present a framework that provides algorithms for solving all eight problems in polynomial time on unweighted graphs. Next we investigate the inapproximability of the edge-weighted versions of the problems, and design polynomial-time algorithms for six of the problems on edge-weighted trees.

DOI： 10.1142/S012905412150012X

Web of Science

Scopus

Computing L(p, 1)-Labeling with Combined Parameters Reviewed

Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono

WALCOM: Algorithms and Computation Vol. 12635 LNCS page： 208 - 220 2021.2

Fairness norm through social networks: a simulation approach Open Access

Rifki, O., Ono, H.

Computational Social Networks Vol. 8 ( 1 ) 2021

　 PREV - NEXT 　

<ONO Hirotaka>

Papers - ONO Hirotaka