Hirotaka Ono - RankMe

233 papers A* 2A 6B 49C 18Misc 8Journal 125Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Faster winner determination algorithms for (Colored) Arc Kayles. J. Comput. Syst. Sci. Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
2026	B	`conf`	Finding a HIST: Chordality, Structural Parameters, and Diameter. SOFSEM Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
2026	B	`conf`	Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. WALCOM Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff
2026	J	`jnl`	Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs. CoRR Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono
2026	J	`jnl`	On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees. CoRR Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono
2026	J	`jnl`	Sequentially swapping tokens: Further on graph classes. J. Comput. Syst. Sci. Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
2025	J	`jnl`	An improved spectral lower bound of treewidth. Inf. Process. Lett. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2025	C	`conf`	Approximability of Longest Run Subsequence and Complementary Minimization Problems. WABI Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka
2025	J	`jnl`	Battle Sheep is PSPACE-complete. CoRR Kyle Burke, Hirotaka Ono
2025	B	`conf`	Colored Node Kayles: Algorithms and Computational Complexity. PRIMA Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari
2025	J	`jnl`	Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. Algorithms Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono
2025	—	`conf`	Enumeration of Ordered Trees with Leaf Restrictions. From Strings to Graphs, and Back Again Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono, Toshiki Saitoh, Yushi Uno
2025	J	`jnl`	Fair Ride Allocation on a Line. ACM Trans. Economics and Comput. Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
2025	J	`jnl`	Finding a HIST: Chordality, Structural Parameters, and Diameter. CoRR Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
2025	J	`jnl`	Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. CoRR Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff
2025	J	`jnl`	Hardness Results on Generalized Puyo Puyo. J. Inf. Process. Hiroshi Eto, Hironori Kiya, Hirotaka Ono
2025	J	`jnl`	Hedonic seat arrangement problems. Auton. Agents Multi Agent Syst. Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2025	J	`jnl`	Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs. J. Comb. Optim. Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
2025	B	`conf`	On the Complexity of Minimising the Moving Distance for Dispersing Objects. WADS Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2025	J	`jnl`	On the Complexity of Minimising the Moving Distance for Dispersing Objects. CoRR Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2025	J	`jnl`	Reallocation Problems with Minimum Completion Time. Algorithmica Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
2025	—	`conf`	Shortest Longest-Path Graph Orientations for Trees. SOFSEM (1) Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov
2025	B	`conf`	Structural Parameters for Steiner Orientation. ISAAC Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025	J	`jnl`	Structural Parameters for Steiner Orientation. CoRR Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025	J	`jnl`	Structural parameterizations of vertex integrity. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2024	—	`conf`	Algorithms for Optimally Shifting Intervals Under Intersection Graph Models. IJTCS-FAW Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2024	J	`jnl`	An improved spectral lower bound of treewidth. CoRR Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2024	J	`jnl`	Collecting Balls on a Line by Robots with Limited Energy. IEICE Trans. Inf. Syst. Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi
2024	J	`jnl`	Computational complexity of Turning Tiles. Int. J. Game Theory Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Koki Suetsugu, Kanae Yoshiwatari
2024	C	`conf`	Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
2024	B	`conf`	Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
2024	J	`jnl`	Grouped domination parameterized by vertex cover, twin cover, and beyond. Theor. Comput. Sci. Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2024	J	`jnl`	On a Spectral Lower Bound of Treewidth. IEICE Trans. Inf. Syst. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2024	B	`conf`	On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
2024	J	`jnl`	On the complexity of finding a spanning even tree in a graph. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto
2024	J	`jnl`	Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2024	J	`jnl`	Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo
2024	J	`jnl`	Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. Int. J. Netw. Comput. Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2024	B	`conf`	Structural Parameterizations of Vertex Integrity. WALCOM Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2024	A*	`conf`	Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
2024	J	`jnl`	Winner Determination Algorithms for Graph Games with Matching Structures. Algorithmica Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
2023	J	`jnl`	Algorithms for Optimally Shifting Intervals under Intersection Graph Models. CoRR Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2023	J	`jnl`	An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. Discret. Appl. Math. Hirotaka Ono, Hisato Yamanaka
2023	B	`conf`	Approximation Algorithms for the Longest Run Subsequence Problem. CPM Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
2023	J	`jnl`	Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
2023	C	`conf`	Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2023	J	`jnl`	Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2023	—	`conf`	Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. COCOA (1) Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
2023	J	`jnl`	Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs. CoRR Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
2023	J	`jnl`	On the Computational Complexity of Generalized Common Shape Puzzles. CoRR Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
2023	J	`jnl`	Reconfiguration of cliques in a graph. Discret. Appl. Math. Takehiro Ito, Hirotaka Ono, Yota Otachi
2023	B	`conf`	Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
2023	B	`conf`	Shortest Beer Path Queries Based on Graph Decomposition. ISAAC Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
2023	J	`jnl`	Shortest Beer Path Queries based on Graph Decomposition. CoRR Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
2023	—	`conf`	Shortest Longest-Path Graph Orientations. COCOON (1) Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
2023	—	`conf`	Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP IPDPS Workshops Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2023	J	`jnl`	Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. CoRR Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2023	J	`jnl`	Structural Parameterizations of Vertex Integrity. CoRR Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2023	J	`jnl`	Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
2023	J	`jnl`	Turning Tiles is PSPACE-complete. CoRR Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono
2022	A	`conf`	Capacitated Network Design Games on a Generalized Fair Allocation Model. AAMAS Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
2022	J	`jnl`	Computing L(p, 1)-Labeling with Combined Parameters. J. Graph Algorithms Appl. Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
2022	B	`conf`	Fair Ride Allocation on a Line. SAGT Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
2022	J	`jnl`	Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2022	B	`conf`	Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2022	Misc	`conf`	Reallocation Problems with Minimum Completion Time. COCOON Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
2022	J	`jnl`	Sequentially Swapping Tokens: Further on Graph Classes. CoRR Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
2022	J	`jnl`	The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. Discret. Appl. Math. Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
2022	J	`jnl`	Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2022	C	`conf`	Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
2022	J	`jnl`	Winner Determination Algorithms for Graph Games with Matching Structures. CoRR Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
2021	J	`jnl`	Capacitated Network Design Games on a Generalized Fair Allocation Model. CoRR Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
2021	B	`conf`	Computing L(p, 1)-Labeling with Combined Parameters. WALCOM Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
2021	J	`jnl`	Computing the Winner of 2-Player TANHINMIN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hironori Kiya, Katsuki Ohto, Hirotaka Ono
2021	J	`jnl`	Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2021	J	`jnl`	Reallocation Problems with Minimum Completion Time. CoRR Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
2020	J	`jnl`	Computing L(p, 1)-Labeling with Combined Parameters. CoRR Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
2020	J	`jnl`	Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2020	J	`jnl`	Fair Ride Allocation on a Line. CoRR Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
2020	J	`jnl`	Graph orientation with splits. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
2020	A	`conf`	Hedonic Seat Arrangement Problems. AAMAS Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020	J	`jnl`	Hedonic Seat Arrangement Problems. CoRR Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020	J	`jnl`	Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	C	`conf`	Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2020	J	`jnl`	Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
2020	B	`conf`	Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. SOFSEM Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
2019	B	`conf`	A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. SOFSEM Hirotaka Ono, Hisato Yamanaka
2019	B	`conf`	Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
2019	J	`jnl`	Computational Complexity of Hedonic Games on Sparse Graphs. CoRR Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
2019	C	`conf`	Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2019	Misc	`conf`	Graph Orientation with Edge Modifications. FAW Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
2019	B	`conf`	Independent Set Reconfiguration Parameterized by Modular-Width. WG Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Independent Set Reconfiguration Parameterized by Modular-Width. CoRR Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	On directed covering and domination problems. Discret. Appl. Math. Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
2019	J	`jnl`	On the maximum weight minimal separator. Theor. Comput. Sci. Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2019	B	`conf`	Optimal Partition of a Tree with Social Distance. WALCOM Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
2019	C	`conf`	Parameterized Complexity of Safe Set. CIAC Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Parameterized Complexity of Safe Set. CoRR Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Settlement fund circulation problem. Discret. Appl. Math. Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2018	J	`jnl`	A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2018	J	`jnl`	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2018	C	`conf`	Graph Orientation with Splits. ISCO Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
2018	J	`jnl`	Optimal Partition of a Tree with Social Distance. CoRR Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
2018	J	`jnl`	Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2018	A	`conf`	Space-Efficient Algorithms for Longest Increasing Subsequence. STACS Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
2017	B	`conf`	On Directed Covering and Domination Problems. ISAAC Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
2017	C	`conf`	On the Maximum Weight Minimal Separator. TAMC Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2017	B	`conf`	Settlement Fund Circulation Problem. ISAAC Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2017	J	`jnl`	Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
2016	J	`jnl`	(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2016	B	`conf`	A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2016	J	`jnl`	Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2016	B	`conf`	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2016	J	`jnl`	Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2016	J	`jnl`	The complexity of dominating set reconfiguration. Theor. Comput. Sci. Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2015	—	`conf`	A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) Tesshu Hanaka, Hirotaka Ono
2015	—	`conf`	A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection. OR Omar Rifki, Hirotaka Ono
2015	J	`jnl`	Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2015	J	`jnl`	Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2015	J	`jnl`	Finding All Longest Common Segments in Protein Structures Efficiently. IEEE ACM Trans. Comput. Biol. Bioinform. Yen Kaow Ng, Linzhi Yin, Hirotaka Ono, Shuai Cheng Li
2015	J	`jnl`	Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2015	J	`jnl`	How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. J. Inf. Process. Kazuya Haraguchi, Hirotaka Ono
2015	J	`jnl`	Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2015	J	`jnl`	Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2015	C	`conf`	Reconfiguration of Cliques in a Graph. TAMC Takehiro Ito, Hirotaka Ono, Yota Otachi
2015	J	`jnl`	Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
2015	B	`conf`	Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
2015	B	`conf`	The Complexity of Dominating Set Reconfiguration. WADS Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2015	J	`jnl`	The complexity of dominating set reconfiguration. CoRR Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2015	J	`jnl`	The searchlight problem for road networks. Theor. Comput. Sci. Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski
2014	B	`conf`	(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2014	J	`jnl`	Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2014	Misc	`conf`	Approximability of Latin Square Completion-Type Puzzles. FUN Kazuya Haraguchi, Hirotaka Ono
2014	J	`jnl`	Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2014	J	`jnl`	Base-object location problems for base-monotone regions. Theor. Comput. Sci. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2014	B	`conf`	Depth-First Search Using O(n) Bits. ISAAC Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
2014	B	`conf`	Fixed-Parameter Tractability of Token Jumping on Planar Graphs. ISAAC Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono
2014	J	`jnl`	Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR Takehiro Ito, Marcin Kaminski, Hirotaka Ono
2014	J	`jnl`	Foreword. IEICE Trans. Inf. Syst. Hirotaka Ono
2014	C	`conf`	On the Parameterized Complexity for Token Jumping on Graphs. TAMC Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2014	B	`conf`	Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014	J	`jnl`	Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014	J	`jnl`	Reconfiguration of Cliques in a Graph. CoRR Takehiro Ito, Hirotaka Ono, Yota Otachi
2014	J	`jnl`	Reconfiguration of list L(2,1)-labelings in a graph. Theor. Comput. Sci. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2014	C	`conf`	Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2013	J	`jnl`	(Total) Vector Domination for Graphs with Bounded Branchwidth. CoRR Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2013	J	`jnl`	A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2013	J	`jnl`	BLOCKSUM is NP-Complete. IEICE Trans. Inf. Syst. Kazuya Haraguchi, Hirotaka Ono
2013	B	`conf`	Base Location Problems for Base-Monotone Regions. WALCOM Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2013	J	`jnl`	Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2013	B	`conf`	Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2013	J	`jnl`	Optimal approximability of bookmark assignments. Discret. Appl. Math. Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
2013	—	`conf`	Recent Advances on Distance Constrained Labeling Problems. CANDAR Hirotaka Ono
2013	—	`conf`	Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means. OR Omar Rifki, Hirotaka Ono
2013	J	`jnl`	Route-Enabling Graph Orientation Problems. Algorithmica Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2012	J	`jnl`	A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2012	—	`conf`	An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita
2012	J	`jnl`	Coalescing random walks and voting on graphs CoRR Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012	A*	`conf`	Coalescing random walks and voting on graphs. PODC Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012	J	`jnl`	Deductive inference for the interiors and exteriors of horn theories. ACM Trans. Comput. Log. Kazuhisa Makino, Hirotaka Ono
2012	B	`conf`	Finding Longest Common Segments in Protein Structures in Nearly Linear Time. CPM Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li
2012	C	`conf`	Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2012	C	`conf`	Minimum Certificate Dispersal with Tree Structures. TAMC Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2012	J	`jnl`	On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Comput. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2012	J	`jnl`	On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2012	B	`conf`	Reconfiguration of List L(2, 1)-Labelings in a Graph. ISAAC Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2012	J	`jnl`	The (p, q)-total labeling problem for trees. Discret. Math. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2012	—	`conf`	Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2011	B	`conf`	Approximability of the Path-Distance-Width for AT-free Graphs. WG Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2011	J	`jnl`	Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2011	J	`jnl`	Broadcastings and digit tilings on three-dimensional torus networks. Theor. Comput. Sci. Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita
2011	Misc	`conf`	Fast Random Walks on Finite Graphs and Graph Topological Information. ICNC Hirotaka Ono
2011	J	`jnl`	Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2011	J	`jnl`	Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
2011	—	`conf`	How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2011	—	`conf`	Maximum Domination Problem. CATS Eiji Miyano, Hirotaka Ono
2011	J	`jnl`	Minimum Certificate Dispersal with Tree Structures CoRR Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2011	J	`jnl`	On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances CoRR Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011	B	`conf`	On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2010	J	`jnl`	Approximability and inapproximability of the minimum certificate dispersal problem. Theor. Comput. Sci. Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
2010	J	`jnl`	Local move connectedness of domino tilings with diagonal impurities. Discret. Math. Fuminiko Nakano, Hirotaka Ono, Taizo Sadahiro
2010	B	`conf`	Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2010	—	`conf`	The ( ISAAC (2) Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2010	C	`conf`	The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2010	J	`jnl`	The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2010	J	`jnl`	The hitting and cover times of Metropolis walks. Theor. Comput. Sci. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2010	B	`conf`	Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. OPODIS Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2009	—	`conf`	A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA Ei Ando, Hirotaka Ono, Masafumi Yamashita
2009	A	`conf`	A Linear Time Algorithm for ESA Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2009	J	`jnl`	A tight upper bound on the (2,1)-total labeling number of outerplanar graphs CoRR Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2009	J	`jnl`	An O(n Theor. Comput. Sci. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2009	C	`conf`	Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	J	`jnl`	Deductive Inference for the Interiors and Exteriors of Horn Theories CoRR Kazuhisa Makino, Hirotaka Ono
2009	J	`jnl`	Drawing Borders Efficiently. Theory Comput. Syst. Kazuo Iwama, Eiji Miyano, Hirotaka Ono
2009	A	`conf`	Graph orientation to maximize the minimum weighted outdegree. IPDPS Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2009	—	`conf`	How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	Misc	`conf`	Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
2009	B	`conf`	Route-Enabling Graph Orientation Problems. ISAAC Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2008	J	`jnl`	A linear time algorithm for L(2,1)-labeling of trees CoRR Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2008	—	`conf`	An Algorithm for L(2, 1)-Labeling of Trees. SWAT Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2008	B	`conf`	Deductive Inference for the Interiors and Exteriors of Horn Theories. ISAAC Kazuhisa Makino, Hirotaka Ono
2008	—	`conf`	Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
2008	B	`conf`	Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	B	`conf`	The Balanced Edge Cover Problem. ISAAC Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	A	`conf`	The space complexity of the leader election in anonymous networks. IPDPS Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	C	`conf`	Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2007	Misc	`conf`	Drawing Borders Efficiently. FUN Kazuo Iwama, Eiji Miyano, Hirotaka Ono
2007	B	`conf`	Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	J	`jnl`	Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2007	B	`conf`	On Approximation of Bookmark Assignments. MFCS Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
2007	J	`jnl`	Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. Inf. Media Technol. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	B	`conf`	A Probabilistic Model of the DNA Conformational Change. DNA Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	—	`conf`	A generic search strategy for large-scale real-world networks. Infoscale Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	B	`conf`	DNA Sequence Design by Dynamic Neighborhood Searches. DNA Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	C	`conf`	Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	—	`conf`	Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2006	J	`jnl`	How to collect balls moving in the Euclidean plane. Discret. Appl. Math. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
2005	B	`conf`	A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2005	Misc	`conf`	Best Fitting Fixed-Length Substring Patterns for a Set of Strings. COCOON Hirotaka Ono, Yen Kaow Ng
2005	—	`conf`	Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
2005	B	`conf`	Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. Discovery Science Yen Kaow Ng, Hirotaka Ono, Takeshi Shinohara
2004	J	`jnl`	A decomposability index in logical analysis of data. Discret. Appl. Math. Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
2004	—	`conf`	How to Collect Balls Moving in the Euclidean Plane. CATS Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
2004	—	`conf`	Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2003	B	`ed.`	Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings ISAAC Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
2003	J	`jnl`	Interior and exterior functions of positive Boolean functions. Discret. Appl. Math. Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
2002	—	`conf`	Integrating Local Search and Network Flow to Solve the Inventory Routing Problem. AAAI/IAAI Hoong Chuin Lau, Qi Zhang Liu, Hirotaka Ono
2002	J	`jnl`	Logical analysis of data with decomposable structures. Theor. Comput. Sci. Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
2001	B	`conf`	An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
2000	Misc	`conf`	Logical Analysis of Data with Decomposable Structures. COCOON Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki