経済工学部門

研究成果 1985 2019

フィルター
会議での発言
2019

Towards solving neural networks with optimization trajectory search

Parsenadze, L. T., Vargas, D. V. & Fujita, T., 7 13 2019, GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, p. 75-76 2 p. (GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion).

研究成果: 著書/レポートタイプへの貢献会議での発言

Trajectory Optimization
Trajectories
Subspace
Neural Networks
Trajectory
2017
6 引用 (Scopus)

A faster parameterized algorithm for pseudoforest deletion

Bodlaender, H. L., Ono, H. & Otachi, Y., 2 1 2017, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Guo, J. & Hermelin, D. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 63).

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials
3 引用 (Scopus)

Approximation algorithm for the distance-3 independent set problem on cubic graphs

Eto, H., Ito, T., Liu, Z. & Miyano, E., 1 1 2017, WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings. Rahman, M. S., Yen, H-C. & Poon, S-H. (版). Springer Verlag, p. 228-240 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10167 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Cubic Graph
Approximation algorithms
Independent Set
Approximation Algorithms
Computational complexity
2016

Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity

Bodlaender, H. L., Ono, H. & Otachi, Y., 12 1 2016, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Hong, S-H. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 64. p. 20.1-20.12

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials
Dynamic programming
Computational complexity
2015
13 引用 (Scopus)

Reconfiguration of cliques in a graph

Ito, T., Ono, H. & Otachi, Y., 1 1 2015, Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings. Jain, R., Jain, S. & Stephan, F. (版). Springer Verlag, p. 212-223 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9076).

研究成果: 著書/レポートタイプへの貢献会議での発言

Reconfiguration
Clique
Polynomials
Graph in graph theory
Cographs

Strength of relationship between multi-labeled data and labels

Kuzunishi, M. & Furukawa, T., 1 1 2015, Information and Communication Technology - 3rd IFIP TC 5/8 International Conference, ICT-EurAsia 2015 and 9th IFIP WG 8.9 Working Conference, CONFENIS 2015 Held as Part of WCC 2015, Proceedings. You, I., Xu, L. D., Neuhold, E., Tjoa, A. M. & Khalil, I. (版). Springer Verlag, p. 99-108 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9357).

研究成果: 著書/レポートタイプへの貢献会議での発言

Labels
Object
Relationships
Express
Target
2 引用 (Scopus)

Subgraph domatic problem and writing capacity of memory devices with restricted state transitions

Wadayama, T., Izumi, T. & Ono, H., 9 28 2015, Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., p. 1307-1311 5 p. 7282667. (IEEE International Symposium on Information Theory - Proceedings; 巻数 2015-June).

研究成果: 著書/レポートタイプへの貢献会議での発言

State Transition
Coloring
Subgraph
Color
Colouring
7 引用 (Scopus)

The complexity of dominating set reconfiguration

Haddadan, A., Ito, T., Mouawad, A. E., Nishimura, N., Ono, H., Suzuki, A. & Tebbal, Y., 1 1 2015, Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings. Dehne, F., Sack, J-R. & Stege, U. (版). Springer Verlag, p. 398-409 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9214).

研究成果: 著書/レポートタイプへの貢献会議での発言

Dominating Set
Reconfiguration
Bandwidth
Cardinality
Graph in graph theory
2014
2 引用 (Scopus)

(Total) vector domination for graphs with bounded branchwidth

Ishii, T., Ono, H. & Uno, Y., 1 1 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Verlag, p. 238-249 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8392 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Branch-width
Domination
Graph in graph theory
Dominating Set
Inapproximability
3 引用 (Scopus)

Approximability of Latin square completion-type puzzles

Haraguchi, K. & Ono, H., 1 1 2014, Fun with Algorithms - 7th International Conference, FUN 2014, Proceedings. Springer Verlag, p. 218-229 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8496 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Approximability
Magic square
Approximation algorithms
Fans
Completion
3 引用 (Scopus)

Degree-constrained graph orientation: Maximum satisfaction and minimum violation

Asahiro, Y., Jansson, J., Miyano, E. & Ono, H., 1 1 2014, Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Revised Selected Papers. Springer Verlag, p. 24-36 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8447 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Undirected Graph
Approximability
Directed graphs
Graph in graph theory
Directed Graph
10 引用 (Scopus)

Depth-first search using O(n) bits

Asano, T., Izumi, T., Kiyomi, M., Konagaya, M., Ono, H., Otachi, Y., Schweitzer, P., Tarui, J. & Uehara, R., 1 1 2014, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Ahn, H-K. & Shin, C-S. (版). Springer Verlag, p. 553-564 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8889).

研究成果: 著書/レポートタイプへの貢献会議での発言

Depth-first Search
Polynomial time
Polynomials
Directed Acyclic Graph
Undirected Graph

Dual roles of maximizing likelihood and Shannon entropy in Bayesian prediction

Ohnishi, T. & Yanagimoto, T., 2014, The 59th ISI World Statistics Congress. p. 3785-3790

研究成果: 著書/レポートタイプへの貢献会議での発言

Examining the role of a non-informative prior function through weakly informative prior densities

Yanagimoto, T. & Ohnishi, T., 2014, The 59th ISI World Statistics Congress. p. 3765-3766

研究成果: 著書/レポートタイプへの貢献会議での発言

Firm size distribution in oblivious equilibrium model with quality ladder

Murao, T., 1 1 2014, Distributed Computing and Artificial Intelligence, 11th International Conference, DCAI 2014. Springer Verlag, p. 99-106 8 p. (Advances in Intelligent Systems and Computing; 巻数 290).

研究成果: 著書/レポートタイプへの貢献会議での発言

Ladders
Depreciation
Operations research
Costs
Economics
17 引用 (Scopus)

On the parameterized complexity for token jumping on graphs

Ito, T., Kamiński, M., Ono, H., Suzuki, A., Uehara, R. & Yamanaka, K., 1 1 2014, Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings. Springer Verlag, p. 341-351 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8402 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Parameterized Complexity
Independent Set
Graph in graph theory
Maximum Degree
Vertex of a graph
1 引用 (Scopus)

Subexponential fixed-parameter algorithms for partial vector domination

Ishii, T., Ono, H. & Uno, Y., 1 1 2014, Combinatorial Optimization - Third International Symposium, ISCO 2014, Revised Selected Papers. Springer Verlag, p. 292-304 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8596 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Fixed-parameter Algorithms
Domination
Partial
Dominating Set
Apex
2013
1 引用 (Scopus)

Base location problems for base-monotone regions

Chun, J., Horiyama, T., Ito, T., Kaothanthong, N., Ono, H., Otachi, Y., Tokuyama, T., Uehara, R. & Uno, T., 2 4 2013, WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. 巻 7748 LNCS. p. 53-64 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7748 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Location Problem
Monotone
Pixels
Pixel
Grid
1 引用 (Scopus)

Complexity of finding maximum regular induced subgraphs with prescribed degree

Asahiro, Y., Eto, H., Ito, T. & Miyano, E., 9 3 2013, Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Proceedings. p. 28-39 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8070 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Induced Subgraph
Polynomials
Graph in graph theory
NP-complete problem
Bounded Treewidth

Recent advances on distance constrained labeling problems

Ono, H., 2013, Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013. p. 26-29 4 p. 6726875

研究成果: 著書/レポートタイプへの貢献会議での発言

Labeling
2012

A framework for segmenting customers based on probability density of transaction data

Lu, K. & Furukawa, T., 12 14 2012, Proceedings of the 2012 IIAI International Conference on Advanced Applied Informatics, IIAIAAI 2012. p. 273-278 6 p. 6337202. (Proceedings of the 2012 IIAI International Conference on Advanced Applied Informatics, IIAIAAI 2012).

研究成果: 著書/レポートタイプへの貢献会議での発言

Clustering algorithms
Data mining
Sales

An extension of Matthews' bound to multiplex random walks

Hosaka, Y., Yamauchi, Y., Kijima, S., Ono, H. & Yamashita, M., 10 18 2012, Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. p. 872-877 6 p. 6270730. (Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012).

研究成果: 著書/レポートタイプへの貢献会議での発言

Internet
14 引用 (Scopus)

Coalescing random walks and voting on graphs

Cooper, C., Elsässer, R., Ono, H. & Radzik, T., 8 20 2012, PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. p. 47-55 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

研究成果: 著書/レポートタイプへの貢献会議での発言

Coalescence

Finding longest common segments in protein structures in nearly linear time

Ng, Y. K., Ono, H., Ge, L. & Li, S. C., 7 4 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 334-348 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7354 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Protein Structure
Linear Time
Proteins
FPTAS
Root mean square deviation
3 引用 (Scopus)

Graph orientations optimizing the number of light or heavy vertices

Asahiro, Y., Jansson, J., Miyano, E. & Ono, H., 8 27 2012, Combinatorial Optimization - Second International Symposium, ISCO 2012, Revised Selected Papers. 巻 7422 LNCS. p. 332-343 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7422 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Maximise
Graph in graph theory
Minimise
Directed graphs
Maximum Independent Set

Minimum certificate dispersal with tree structures

Izumi, T., Izumi, T., Ono, H. & Wada, K., 5 18 2012, Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. p. 548-559 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7287 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Certificate
Tree Structure
Topology
Polynomials
Distributed computer systems
8 引用 (Scopus)

Reconfiguration of list L(2, 1)-labelings in a graph

Ito, T., Kawamura, K., Ono, H. & Zhou, X., 12 31 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. p. 34-43 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7676 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

L(2, 1)-labeling
Reconfiguration
Labeling
Labels
Graph in graph theory

Similarity of transactions for customer segmentation

Lu, K. & Furukawa, T., 9 6 2012, Multidisciplinary Research and Practice for Information Systems - IFIP WG 8.4, 8.9/TC 5 Int. Cross-Domain Conference and Workshop on Availability, Reliability, and Security, CD-ARES 2012, Proceedings. p. 347-359 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7465 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Transactions
Distance Measure
Segmentation
Customers
Data mining
11 引用 (Scopus)

Upper and lower degree bounded graph orientation with minimum penalty

Asahiro, Y., Jansson, J., Miyano, E. & Ono, H., 7 24 2012, Theory of Computing 2012 - Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, CATS 2012. p. 139-146 8 p. (Conferences in Research and Practice in Information Technology Series; 巻数 128).

研究成果: 著書/レポートタイプへの貢献会議での発言

Pipe
Polynomial approximation
Trees (mathematics)
Directed graphs
Approximation algorithms
2011
2 引用 (Scopus)

Approximability of the path-distance-width for AT-free graphs

Otachi, Y., Saitoh, T., Yamanaka, K., Kijima, S., Okamoto, Y., Ono, H., Uno, Y. & Yamazaki, K., 12 1 2011, Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers. 巻 6986 LNCS. p. 271-282 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6986 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Approximability
Approximation algorithms
Computational complexity
Polynomials
Path
2 引用 (Scopus)

Fast random walks on finite graphs and graph topological information

Ono, H., 12 1 2011, Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. p. 360-363 4 p. 6131864. (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011).

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

How slow, or fast, are standard random walks? - Analysis of hitting and cover times on trees

Nonaka, Y., Ono, H., Kijima, S. & Yamashita, M., 12 1 2011, Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011. p. 63-68 6 p. (Conferences in Research and Practice in Information Technology Series; 巻数 119).

研究成果: 著書/レポートタイプへの貢献会議での発言

Internet
4 引用 (Scopus)

Maximum Domination problem

Miyano, E. & Ono, H., 12 1 2011, Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011. p. 55-61 7 p. (Conferences in Research and Practice in Information Technology Series; 巻数 119).

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials
Approximation algorithms

On the approximability of minimum topic connected overlay and its special instances

Hosoda, J., Hromkovič, J., Izumi, T., Ono, H., Steinová, M. & Wada, K., 9 1 2011, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings. p. 376-387 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6907 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Approximability
Overlay
Hardness
Polynomials
Overlay networks
2 引用 (Scopus)

The (2,1)-total labeling number of outerplanar graphs is at most Δ + 2

Hasunuma, T., Ishii, T., Ono, H. & Uno, Y., 4 4 2011, Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, Revised Selected Papers. p. 103-106 4 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6460 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Outerplanar Graph
Labeling
Assignment
Adjacent
Vertex of a graph
2010
14 引用 (Scopus)

Pattern formation through optimum matching by oblivious CORDA robots

Fujinaga, N., Ono, H., Kijima, S. & Yamashita, M., 12 1 2010, Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. p. 1-15 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6490 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Pattern Formation
Robot
Robots
Proof of correctness
Landmarks

The (p,q)-total labeling problem for trees

Hasunuma, T., Ishii, T., Ono, H. & Uno, Y., 12 1 2010, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings. PART 2 版 p. 49-60 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6507 LNCS, 番号 PART 2).

研究成果: 著書/レポートタイプへの貢献会議での発言

Labeling
Assignment
Adjacent
Integer
Graph in graph theory
2 引用 (Scopus)

Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol

Mizoguchi, R., Ono, H., Kijima, S. & Yamashita, M., 12 1 2010, Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. p. 491-503 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6490 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Leader Election
Space Complexity
Upper and Lower Bounds
Data storage equipment
Distributed Computation
2009

A generic algorithm for approximately solving stochastic graph optimization problems

Ando, E., Ono, H. & Yamashita, M., 12 1 2009, Stochastic Algorithms: Foundations and Applications - 5th International Symposium, SAGA 2009, Proceedings. p. 89-103 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5792 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Optimization Problem
Graph in graph theory
Random variables
Elementary Functions
Approximation algorithms
16 引用 (Scopus)

A Linear Time Algorithm for L(2,1)-Labeling of Trees

Hasunuma, T., Ishii, T., Ono, H. & Uno, Y., 11 2 2009, Algorithms - ESA 2009 - 17th Annual European Symposium, Proceedings. p. 35-46 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5757 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

L(2, 1)-labeling
Linear-time Algorithm
Labeling
Assignment
Treewidth
2 引用 (Scopus)

Computing the exact distribution function of the stochastic longest path length in a dag

Ando, E., Ono, H., Sadakane, K. & Yamashita, M., 7 16 2009, Theory and Applications of Models of Computation - 6th Annual Conference, TAMC 2009, Proceedings. p. 98-107 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5532 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Longest Path
Exact Distribution
Path Length
Random variables
Distribution functions

Graph orientaion to maximize the minmum weighted outdegre

Asahiro, Y., Jansso, J., Miyano, E. & Ono, H., 11 25 2009, IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. 5160872. (IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium).

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials
Directed graphs
Approximation algorithms
Scheduling
1 引用 (Scopus)

How to design a linear cover time random walk on a finite graph

Nonaka, Y., Ono, H., Sadakane, K. & Yamashita, M., 12 1 2009, Stochastic Algorithms: Foundations and Applications - 5th International Symposium, SAGA 2009, Proceedings. p. 104-116 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5792 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Cover Time
Finite Graph
Linear Time
Random walk
Hitting Time

Relationship between Approximability and request structures in the minimum certificate dispersal problem

Izumi, T., Izumi, T., Ono, H. & Wada, K., 12 1 2009, Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings. p. 56-65 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5609 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Approximability
Approximation algorithms
Certificate
Polynomials
Vertex of a graph
5 引用 (Scopus)

Route-enabling graph orientation problems

Ito, T., Miyamoto, Y., Ono, H., Tamaki, H. & Uehara, R., 12 1 2009, Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. p. 403-412 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5878 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials
Min-max
Graph in graph theory
Cactus
Polynomial time
4 引用 (Scopus)

Speeding up local-search type algorithms for designing DNA sequences under thermodynamical constraints

Kawashimo, S., Kaow Ng, Y., Ono, H., Sadakane, K. & Yamashita, M., 11 27 2009, DNA Computing - 14th International Meeting on DNA Computing, DNA14, Revised Selected Papers. 巻 5347 LNCS. p. 168-178 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5347 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

DNA sequences
DNA Sequence
Local Search
Free energy
Free Energy
2008
1 引用 (Scopus)

An O(n1.75) algorithm for L(2,1)-labeling of trees

Hasunuma, T., Ishii, T., Ono, H. & Uno, Y., 10 27 2008, Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings. p. 185-197 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5124 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

L(2, 1)-labeling
Labeling
Assignment
Treewidth
Computational complexity

Deductive inference for the interiors and exteriors of horn theories

Makino, K. & Ono, H., 12 1 2008, Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. p. 390-401 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5369 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Interior
Deduction
NP-complete problem
Knowledge Base
Model-based
10 引用 (Scopus)

Dynamic neighborhood searches for thermodynamically designing DNA sequence

Kawashimo, S., Ono, H., Sadakane, K. & Yamashita, M., 8 27 2008, DNA Computing - 13th International Meeting on DNA Computing, DNA13, Revised Selected Papers. p. 130-139 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4848 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Neighborhood Search
DNA sequences
DNA Sequence
Free energy
Hamming distance
3 引用 (Scopus)

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Asahiro, Y., Miyano, E. & Ono, H., 12 1 2008, Theory of Computing 2008 - Proceedings of the Fourteenth Computing: The Australasian Theory Symposium, CATS 2008. (Conferences in Research and Practice in Information Technology Series; 巻数 77).

研究成果: 著書/レポートタイプへの貢献会議での発言

Directed graphs
Diamonds
Hardness