論文一覧
中野,西関,斎藤:
"グラフのf彩色",
電子情報通信学会論文誌(A), J70-A, 2, pp.164-174 (1987).
中野,西関,斎藤:
"グラフのfg辺彩色数の上界",
電子情報通信学会論文誌(A), J70-A, 10, pp.1463-1471 (1987).
S.Nakano, T.Nishizeki and N.Saito:
"On the f-coloring of Multigraphs",
IEEE Trans. Circuit and Syst., CAS-35, 3, pp.345-353 (1988).
S.Nakano, T.Nishizeki and N.Saito:
"On the fg-coloring of graphs",
Combinatorica, 10(1), pp.67-80 (1990).
中野,西関:
"グラフをfg辺彩色する近似アルゴリズム",
応用数理学会論文誌, Vol.1, No.3, pp.195-211 (1991).
S.Nakano and T.Nishizeki:
"Scheduling file transfers under port and channel constraints",
International J. of Foundations of Computer Science, Vol.4, No.2, pp.101-115 (1993).
中野,西関,斎藤:
"グラフの辺をf彩色する近似アルゴリズム",
応用数理学会論文誌, Vol.3, No.4, pp.279-307 (1993).
中野,小熊,西関:
"グラフをc三角化する線形時間アルゴリズム",
信学論(A), J77-A, 3, pp.543-546 (1994).
中野,鈴木,西関:
"グラフの均等辺彩色アルゴリズム",
信学論(D), J78-D-I, 5, pp.437-444 (1995).
X.Zhou,S.Nakano and T.Nishizeki:
"Edge-coloring partial k-trees",
J. of Algorithms, 21, pp.598-617 (1996).
Shin-ichi Nakano, Md. Saidur Rahman and Takao Nishizeki,
"A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs",
Information Processing Letters, Vol. 62, no. 6, pp. 315-322 (1997).
服部伯洋,中野眞一,西関隆夫,
"単純多角形のサーチライトスケジューリング",
日本応用数理学会論文誌, Vol.7, No.3, pp.265-279 (1997).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki,
"Rectangular Grid Drawings of Plane Graphs",
Computational Geometry: Theory and Applications, Vol. 10, pp.203-220 (1998).
Marek Chrobak and Shin-ichi Nakano:
"Minimum-width grid drawings of plane graphs",
Computational Geometry: Theory and Applications, Vol. 11, pp.29-54 (1998).
K. Miura, D. Takahashi, S.Nakano, and T. Nishizeki
"A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs"
International Journal of Foundations of Computer Science, Vol.10, No.2, pp.195-210 (1999).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
"A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs"
Journal of Graph Algorithms and Applications, Vol.3, No.4, pp.31-62 (1999).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
"Box-rectangular Drawings of Plane Graphs"
Journal of Algorithms, Vol.37, No.2, pp.363-398 (2000).
Sayaka Nagai and Shin-ichi Nakano
"A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs"
電子情報通信学会英文論文誌A, 離散数学とその応用小特集号
IEICE TRANS. FUNDAMENTALS, Vol.E84-A, no. 5, pp. 1102-1109 (2001).
K. Miura, S.Nakano, and T. Nishizeki
"Grid Drawings of Four-connected Plane Graphs"
Discrete & Computational Geometry, Vol.26, pp.73-87 (2001).
Sayaka Nagai and Shin-ichi Nakano
"A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs"
電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS, Vol. E84-A, no. 9, pp. 2330-2337 (2001).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
"Rectangular Drawings of Plane Graphs without Designated Corners"
Computational Geometry Theory and Applications, Vol. 21(3), pp.121-138 (2002).
Shin-ichi Nakano
"Enumerating Floorplans with n Rooms"
電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS, Vol.E85-A, no. 7, pp. 1746-1750 (2002).
金子雄一,中野眞一
"2連結内部極大平面グラフの数え上げ"
電子情報通信学会論文誌A, Vol.J85-A, no. 7, pp.811-813 (2002).
金子雄一,中野眞一
"平面グラフのランダム生成とその応用"
電子情報通信学会論文誌A, Vol.J85-A, no. 9, pp.976-983 (2002).
Shin-ichi Nakano
"Efficient Generation of Plane Trees"
Information Processing Letters,
Vol.84, no. 3, pp.167-172 (2002).
26 link
Shin-ichi Nakano
"Enumerating Floorplans with some properties",
Interdisciplinary Information Sciences, Vol. 8, No. 2, pp.199-206 (2002).
Atsushi Koike, Shin-ichi Nakano, Takao Nishizeki, Takeshi Tokuyama and Shuhei Watanabe
"Labeling Points with Rectangles of Various Shapes"
International Journal of Computational Geometry \& Applications
Vol. 12, No. 6, pp.511-528 (2002).
28
Hiroyuki Tanaka, Zhangjian Li and Shin-ichi Nakano
"Efficient Generation of Plane Triangulations with a Degree Constraint",
電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS, Vol.E86-A, no. 4, pp. 829-834 (2003).
Zhangjian Li and Shin-ichi Nakano
"Generating Biconnected Plane Quadrangulations"
電子情報通信学会論文誌英文誌,IEICE TRANS. INF.& SYST., Vol.E86-D, no. 4, pp. 698-703 (2003).
高木正博, 中野眞一
"いくつかの特徴をもつ方形描画の列挙"
電子情報通信学会論文誌DI, Vol.J86-D-I, no. 4, pp.208-216 (2003).
Also in (英訳)
"Listing All Rectangular Drawings with Certain Properties"
SYSTEMS and COMPUTERS in JAPAN, Volume 35, number 4(April), p 1-8 (2004).
https://onlinelibrary.wiley.com/doi/epdf/10.1002/scj.10563?src=getftr
Zhangjian Li and Shin-ichi Nakano
"Listing All Connected Plane Triangulations"
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS, Vol.E86-A, no. 7, pp. 1807-1812 (2003).
Shin-ichi Nakano
"Efficient Generation of Triconnected Plane Triangulations "
Computational Geometry Theory and Applications, Vol. 27(2), pp.109-122 (2004).
高木正博, 中野眞一
"L字形描画の列挙"
電子情報通信学会論文誌DI, Vol.J87-D-I, no. 1, pp.1-11 (2004).
H. Tanaka and S. Nakano
"Efficient Generation of Plane Triangulations with Specified Maximum Degree"
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E87-D, no. 2, pp. 330-336 (2004).
XuZhen Xie, Takao Ono, Shin-ichi Nakano, Tomio Hirata
"An Improved Algorithm for the Nearly Equitable Edge-coloring Problem"
電子情報通信学会英文論文誌, 離散数学とその応用小特集号
IEICE TRANS. FUNDAMENTALS, Vol.E87-A, no. 5, pp. 1029-1033 (2004).
佐藤広幸, 金子雄一, 中野眞一
多面体の数え上げ
電子情報通信学会論文誌A, Vol.J87-A, no. 11, pp.1419-1424 (2004).
山中克久, 中野眞一
リアライザの列挙
電子情報通信学会論文誌DI, Vol.J87-DI, No.12, pp.1043-1050 (2004).
Shin-ichiro Kawano and Shin-ichi Nakano
Constant Time Generation of Set Partitions
IEICE TRANS. FUNDAMENTALS, Vol.E88-A, no. 4, pp. 930-934 (2005).
Shin-ichiro Kawano and Shin-ichi Nakano
Generating All Series-parallel Graphs
電子情報通信学会英文論文誌, 離散数学とその応用小特集号
IEICE TRANS. FUNDAMENTALS, Vol.E88-A, no. 5, pp.1129-1135 (2005).
吉井訓史, 中野眞一
方形描画の数え上げ
電子情報通信学会論文誌A, Vol.J88-A, no. 8, pp.945-952 (2005).
Katsuhisa Yamanaka and Shin-ichi Nakano,
Coding Floorplans with Fewer Bits,
電子情報通信学会英文論文誌, 離散数学とその応用小特集号
IEICE TRANS. FUNDAMENTALS, Vol.E89-A, no. 5, pp.1181-1185 (2006).
Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka and Shin-ichi Nakano,
Constant Time Generation of Rectangular Drawings with Exactly n Faces,
電子情報通信学会論文誌A,
IEICE TRANSACTIONS on Fundamentals, Vol.E89-A, no.9, pp.2445-2450 (2006).
Kazuyuki Miura, Shin-ichi Nakano and Takao Nishizeki
Convex Grid Drawings of Four-connected Plane Graphs,
International Journal of Foundations of Computer Science, Vol. 17, No. 5, pp.1031-1060, (2006)
千明大介, 中野眞一
窓なし部屋の個数が高々kの方形描画の高速列挙アルゴリズム
電子情報通信学会論文誌A, Vol.J90-A, no. 2, pp.122-130 (2007).
Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi and Shin-ichi Nakano
"Constant Time Generation of Integer Partitions"
電子情報通信学会英文論文誌, 離散数学とその応用小特集号
IEICE TRANS. FUNDAMENTALS, Vol.E90-A, no. 5, pp.888-895 (2007).
高埜博典, 中野眞一
4連結極大平面グラフの列挙
日本応用数理学会論文誌, Vol.17, no. 4, pp. 363-397 (2007).
村松丘親, 中野眞一
葉の個数を指定した順序木の一様ランダム生成
電子情報通信学会論文誌A, Vol.J90-A, no.12, pp.940-947 (2007).
関根航人, 山中克久, 中野眞一
順列の列挙
電子情報通信学会論文誌A, Vol.J91-A, No.5, pp.543-549 (2008).
佐藤圭介,中野眞一
指定された次数列をもつグラフの列挙
電子情報通信学会論文誌A, Vol.J91-A, no.7, pp.716-725 (2008).
Katsuhisa Yamanaka and Shin-ichi Nakano,
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
離散数学とその応用特集号, 電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS, Vol.E91-A, No.9, pp.2284-2291 (2008).
Katsuhisa Yamanaka and Shin-Ichi Nakano,
"Listing All Plane Graphs",
JGAA Journal of Graph Algorithms and Applications, Vol.13, No. 1, pp.5-18 (2009).
Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno,
A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs,
Journal of Computer Science and Technology, Vol. 24(3), pp. 517-533, 2009.
Naoki Shimotsuma, Shin-ichi Nakano,
A Simple Canonical Code for Fullerene Graphs,
電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS, Vol.E92-A, no.12, pp. 3398-2400 (2009).
金子昌弘, 中野眞一
2連結平面グラフのst-numberingの列挙
日本応用数理学会論文誌, Vol.20, no.1, pp. 33-44 (2010).
Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada,
Efficient Enumeration of All Ladder Lotteries and Its Application
Theoretical Computer Science, Vol.411, pp.1714-1722, (2010).
Katsuhisa Yamanaka, and Shin-ichi Nakano
"A Compact Encoding of Plane Triangulations with Efficient Query Support",
Information Processing Letters, Vol.110, pp.803-809, (2010).
Mohammad Tanvir Parvez, Md. Saidur Rahman and Shin-Ichi Nakano,
"Generating All Triangulations of Plane Graphs",
Journal of Graph Algorithms and Applications, JGAA, Vol.15. no.3, pp.457-476 (2011).
Andry Setiawan and Shin-ichi Nakano
Listing All st-Orientations
電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS, Vol.E94-A, no.10, pp. 1965-1970 (2011).
須田亮平，中野眞一，山中克久
格子方形描画のコンパクトな符号
電子情報通信学会論文誌D, Vol.J94-D, no.12, pp.2031-2036 (2011).
M. Ishikawa, K. Yamanaka, Y. Otachi and S. Nakano
Enumerating All Rooted Trees including k Leaves
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E95-D, no. 3, pp. 763-768 (2012).
Katsuhisa Yamanaka, Yota Otachi and Shin-Ichi Nakano,
"Efficient Enumeration of Ordered Trees with k leaves",
Theoretical Computer Science, Vol.442, pp.22-27 (2012).
Shin-Ichi Nakano and Katsuhisa Yamanaka
A Compact Encoding of Rectangular Drawings with Edge Lengths
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS, Special Section, Discrete Mathematics and Its Applications,
Vol.E96-A, no.6, pp. 1032-1035 (2013).
Takeaki Uno, Ryuhei Uehara and Shin-ichi Nakano
Bounding the Number of Reduced Trees, Cographs,
and Series-Parallel Graphs by Compression,
Discrete Mathematics, Algorithms and Applications (DMAA),
Vol.05, No. 2, 1360001 (14 pages) (2013).
Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno
Efficient algorithms for a simple network design problem
Networks
Vol. 62, No.2, pp.95-104 (2013).
Masashi Saito and Shin-ichi Nakano
Two Compact Codes for Rectangular Drawings with Degree Four Vertices
Journal of Information Processing, Vol.21, No.4, pp.660-664 (2013).
斎藤雅士, 中野眞一
格子L字描画のコンパクトな符号
電子情報通信学会論文誌D, Vol.J96-D, no.9, pp.2041-2046 (2013).
石川雅信, 中野眞一
指定した次数列をもつ順序なし木の高速列挙
電子情報通信学会論文誌D, Vol.J96-D, no.11, pp.2710-2715 (2013).
金井祐一、中野眞一
指定した次数列をもつ連結外平面グラフの列挙
電子情報通信学会論文誌A, Vol.J96-A, no.9, pp.643-649 (2013).
Katsuhisa Yamanaka and Shin-Ichi Nakano
Efficient Enumeration of All Ladder Lotteries with k Bars
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E97-A, no.6, pp. 1163-1170 (2014).
DOI:10.1587/transfun.E97.A.1163
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
A 4.31-approximation for the geometric unique coverage problem on unit disks
Theoretical Computer Science, Vol.544, pp.14-31 (2014).
Katsuhisa Yamanaka and Shin-Ichi Nakano
Another Optimal Binary Representation of Mosaic Floorplans
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E98-A, no.6, pp. 1223-1224 (2015).
Kazuyuki Amano, Shin'ichi Nakano and Koichi Yamazaki
Anti-Slide
Journal of Information Processing, Vol.23, No.3, pp.252-257 (2015).
Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno,
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Computational Geometry: Theory and Applications, Vol 51, pp.25-39 (2016).
Katsuhisa Yamanaka and Shin-Ichi Nakano
Uniformly Random Generation of Floorplans
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E99-D, no.3, pp. 624-629 (2016).
Toshihiro Akagi, Ryota Arai and Shin-Ichi Nakano
Faster min-max r-gatherings
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E99-A, no.6, pp.1149-1151 (2016).
Toshihiro Akagi and Shin-Ichi Nakano
On r-gatherings on the line
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E100-D, no.3, pp. 428-433 (2017).
Katsuhisa Yamanaka and Shin-Ichi Nakano
Enumeration, Counting, and Random Generation of Ladder Lotteries
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E100-D, no.3, pp. 444-451 (2017).
Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-Ichi Nakano
Enumerating Floorplans with Columns
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E101-A, no.9, pp.1392-1397 (2018).
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno,
Sequentially Swapping Colored Tokens on Graphs
JGAA, Vol. 23, no. 1, pp. 3-27, 2019.
Shin-Ichi Nakano,
A Simple Algorithm for r-gatherings on the Line,
JGAA, Vol. 23, no. 5, pp. 837-845, 2019.
JGAA,
DOI: 10.7155/jgaa.00514
Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano
Enumerating Highly-Edge-Connected Spanning Subgraphs
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E102-A, no.9, pp.1002-1006 (2019).
https://doi.org/10.1587/transfun.E102.A.1002
四家祐志, 佐藤寛斗, 宮田洋行, 中野眞一,
円周上のmax-min 4-dinspersion問題,
電子情報通信学会論文誌D, Vol.J102-D, No.10,pp.670-673 (2019).
Kazuyuki AMANO and Shin-ichi NAKANO
An Approximation Algorithm for the 2-dispersion Problem
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E103-D, no.3, pp. 506-508 (2020).
https://doi.org/10.1587/transinf.2019FCP0005
Tetsuya Araki and Shin-ichi Nakano,
Max-Min Dispersion on a Line,
Journal of Combinatorial Optimization. Springer, Volume 44, pages 1824–1830 (2022)
DOI: 10.1007/s10878-020-00549-5
Toshihiro Akagi, Tetsuya Araki and Shin-ichi Nakano
Efficient Algorithms for the Partial Sum Dispersion Problem
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E103-A, no.10, pp.1206-1210 (2020).
角田倫久, 宮田洋行, 中野眞一
円周上のmax-min 5-dispersion問題,
情報処理学会論文誌, Vol.62, No.3, pp.931-935 (2021)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa
Max-Min 3-dispersion Problems
電子情報通信学会英文論文誌, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
(Special Section on Discrete Mathematics and Its Applications)
Vol.E104-A, no.9, pp.1101-1107 (2021)
田中優輝, 宮田洋行, 中野眞一
平行な 2 直線上の dispersion 問題
電子情報通信学会論文誌A, Vol.J105-A, No.1, pp.1-5(2022).
Shareef Ahmed, Shin-ichi Nakano and Md Saidur Rahman
r-Gatherings on a Star and Uncertain r-Gatherings on a Line
Discrete Mathematics, Algorithms and Applications (DMAA)
Volume No. 14, Issue No. 05, Article No. 2150160, (2022)
Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka,
An O(n^2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Convex Polygon,
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,
Special issue on Foundations of Computer Science. Vol.E105-D, no.3, pp. 503-507 (2022).
Tetsuya Araki, Hiroyuki Miyata and Shin-ichi Nakano,
Dispersion on Intervals,
電子情報通信学会英文論文誌, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
(Special Section on Discrete Mathematics and Its Applications)
Vol.E105-A, no.9, pp.1181 - 1186 (2022).
92 proof
Shin-ichi Nakano,
The Coverage problem by Aligned Disks,
International Journal of Computational Geometry and Applications,
Volume No. 33, Issue No. 01n02, pp. 13 - 23, (2023)
https:///dx.doi.org/10.1142/S0218195922410023
畑野航琉, 中野眞一
近接条件付きmin-sum r-gathering 問題
電子情報通信学会論文誌A, Vol.J106-A, No.1, pp.1-4(2023).
94p
Shin-ichi Nakano,
Family Trees for Enumeration,
International Journal of Foundations of Computer Science
No. 34, Issue No. 07, pp. 715 - 736 ( 2023)
Katsuhisa Yamanaka and Shin-ichi Nakano
Enumerating Floorplans with Walls
Discrete Applied Mathematics,
Vol. 342, pp1-11 (2024)
知久侑生, 宮田洋行, 中野眞一
重み付き min-max r-gathering
電子情報通信学会論文誌A, Vol.J107-A, No.1, pp.1-5(2024).
林 登生, 宮田洋行, 中野眞一
2つの型の壁が指定されたフロアプランの列挙
電子情報通信学会論文誌A, Vol.J107-A, No.3, pp.56-63(2024). (奇数月発行なので５月発行の３号）
Shin-ichi Nakano
Assigning proximity facilities for gatherings
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST., Vol.E107-D, no.3, pp. 383-385 (2024).
Tetsuya Araki and Shin-ichi Nakano,
Dispersion in a Polygon,
電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS,
Special Section on Discrete Mathematics and Its Applications
Vol.E107-A, no.9, pp.?-? (2024).
採録 2024.2.22
https://www.jstage.jst.go.jp/article/transfun/advpub/0/advpub_2023DMP0010/_article
100
Shin-ichi Nakano
Enumerating floorplans with Aligned Columns
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST., Vol.E108-D, no.3, pp.?-? (2025).
Accepted 2024.5.22
101
Kento KIMURA, Tomohiro HARAMIISHI, Kazuyuki AMANO and Shin-ichi NAKANO
Escape from the Room
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST., Vol.E108-D, no.3, pp.?-? (2025).
Accepted 2024.6.20