Hirotaka Ono
Orcid: 0000-0003-0845-3947Affiliations:
- Nagoya University, Furocho, Chikusa-ku, Nagoya, Japan
- Kyushu University, Fukuoka, Japan (former)
According to our database1,
Hirotaka Ono
authored at least 143 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Algorithmica, March, 2024
Theor. Comput. Sci., 2024
Int. J. Netw. Comput., 2024
IEICE Trans. Inf. Syst., 2024
Polynomial-time equivalences and refined algorithms for longest common subsequence variants.
Discret. Appl. Math., 2024
Proceedings of the WALCOM: Algorithms and Computation, 2024
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Discret. Appl. Math., December, 2023
CoRR, 2023
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP<sup>*</sup>.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
Theor. Comput. Sci., 2022
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality.
Discret. Appl. Math., 2022
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022
2021
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021
2020
Theor. Comput. Sci., 2020
Theory Comput. Syst., 2020
Discret. Appl. Math., 2020
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
2019
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
Discret. Appl. Math., 2018
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity.
Algorithmica, 2018
2016
Theory Comput. Syst., 2016
Discret. Optim., 2016
Discret. Appl. Math., 2016
2015
Theor. Comput. Sci., 2015
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., 2015
IEEE ACM Trans. Comput. Biol. Bioinform., 2015
J. Inf. Process., 2015
J. Graph Algorithms Appl., 2015
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions.
CoRR, 2015
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015
Proceedings of the Operations Research Proceedings 2015, 2015
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions.
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Int. J. Netw. Comput., 2014
Approximating the path-distance-width for AT-free graphs and graphs in related classes.
Discret. Appl. Math., 2014
Proceedings of the Theory and Applications of Models of Computation, 2014
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
2013
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013
Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means.
Proceedings of the Operations Research Proceedings 2013, 2013
Proceedings of the First International Symposium on Computing and Networking, 2013
2012
ACM Trans. Comput. Log., 2012
On the approximability and hardness of minimum topic connected overlay and its special instances.
Theor. Comput. Sci., 2012
J. Discrete Algorithms, 2012
On space complexity of self-stabilizing leader election in mediated population protocol.
Distributed Comput., 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012
2011
Theor. Comput. Sci., 2011
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree.
J. Comb. Optim., 2011
Int. J. Found. Comput. Sci., 2011
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree.
Discret. Appl. Math., 2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
Proceedings of the Second International Conference on Networking and Computing, 2011
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011
2010
Theor. Comput. Sci., 2010
Int. J. Found. Comput. Sci., 2010
Discret. Math., 2010
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
2009
Theor. Comput. Sci., 2009
CoRR, 2009
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009
Proceedings of the Algorithms, 2009
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009
2008
Proceedings of the Algorithm Theory, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008
2007
Int. J. Found. Comput. Sci., 2007
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007
2006
Proceedings of the Parallel and Distributed Processing and Applications, 2006
Proceedings of the 1st International Conference on Scalable Information Systems, 2006
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006
2005
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005
Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.
Proceedings of the Discovery Science, 8th International Conference, 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004
2003
Discret. Appl. Math., 2003
2002
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002
2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001