The SCEAS System
| |||||||

## Search the dblp DataBase
Hirotaka Ono:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hoong Chuin Lau, Qi Zhang Liu, Hirotaka Ono
**Integrating Local Search and Network Flow to Solve the Inventory Routing Problem.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:9-14 [Conf] - Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
**Logical Analysis of Data with Decomposable Structures.**[Citation Graph (0, 0)][DBLP] COCOON, 2000, pp:396-406 [Conf] - Hirotaka Ono, Yen Kaow Ng
**Best Fitting Fixed-Length Substring Patterns for a Set of Strings.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:240-250 [Conf] - Yen Kaow Ng, Hirotaka Ono, Takeshi Shinohara
**Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2005, pp:176-188 [Conf] - Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
**DNA Sequence Design by Dynamic Neighborhood Searches.**[Citation Graph (0, 0)][DBLP] DNA, 2006, pp:157-171 [Conf] - Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
**A Probabilistic Model of the DNA Conformational Change.**[Citation Graph (0, 0)][DBLP] DNA, 2006, pp:274-285 [Conf] - Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
**A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions.**[Citation Graph (0, 0)][DBLP] DNA, 2005, pp:359-370 [Conf] - Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
**An Index for the Data Size to Extract Decomposable Structures in LAD.**[Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:279-290 [Conf] - Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
**Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks.**[Citation Graph (0, 0)][DBLP] ISPA, 2006, pp:39-50 [Conf] - Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
**Neighborhood Composition: A Parallelization of Local Search Algorithms.**[Citation Graph (0, 0)][DBLP] PVM/MPI, 2004, pp:155-163 [Conf] - Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
**Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.**[Citation Graph (0, 0)][DBLP] WONS, 2005, pp:125-130 [Conf] - Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
**Interior and exterior functions of positive Boolean functions.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:3, pp:417-436 [Journal] - Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
**A decomposability index in logical analysis of data.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:165-180 [Journal] - Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
**How to collect balls moving in the Euclidean plane.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:16, pp:2247-2262 [Journal] - Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
**How to Collect Balls Moving in the Euclidean Plane.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:229-245 [Journal] - Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
**Logical analysis of data with decomposable structures.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:289, n:2, pp:977-995 [Journal] - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
**Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.**[Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:167-177 [Conf] - Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
**On Approximation of Bookmark Assignments.**[Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:115-124 [Conf] - Kazuo Iwama, Eiji Miyano, Hirotaka Ono
**Drawing Borders Efficiently.**[Citation Graph (0, 0)][DBLP] FUN, 2007, pp:213-226 [Conf] **Graph Orientation Algorithms to Minimize the Maximum Outdegree.**[Citation Graph (, )][DBLP]**Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.**[Citation Graph (, )][DBLP]**Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.**[Citation Graph (, )][DBLP]**Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints.**[Citation Graph (, )][DBLP]**Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence.**[Citation Graph (, )][DBLP]**A Linear Time Algorithm for**[Citation Graph (, )][DBLP]*L*(2, 1)-Labeling of Trees.**The space complexity of the leader election in anonymous networks.**[Citation Graph (, )][DBLP]**Graph orientation to maximize the minimum weighted outdegree.**[Citation Graph (, )][DBLP]**Route-Enabling Graph Orientation Problems.**[Citation Graph (, )][DBLP]**Deductive Inference for the Interiors and Exteriors of Horn Theories.**[Citation Graph (, )][DBLP]**The Balanced Edge Cover Problem.**[Citation Graph (, )][DBLP]**A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.**[Citation Graph (, )][DBLP]**How to Design a Linear Cover Time Random Walk on a Finite Graph.**[Citation Graph (, )][DBLP]**An Algorithm for L(2, 1)-Labeling of Trees.**[Citation Graph (, )][DBLP]**Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.**[Citation Graph (, )][DBLP]**A generic search strategy for large-scale real-world networks.**[Citation Graph (, )][DBLP]**A linear time algorithm for L(2,1)-labeling of trees**[Citation Graph (, )][DBLP]**Deductive Inference for the Interiors and Exteriors of Horn Theories**[Citation Graph (, )][DBLP]**A tight upper bound on the (2,1)-total labeling number of outerplanar graphs**[Citation Graph (, )][DBLP]**Local move connectedness of domino tilings with diagonal impurities.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |