|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 14 keywords
|
|
|
|
|
Results
Found 62 publication records. Showing 62 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
The (p, q)-total labeling problem for trees.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik |
Coalescing random walks and voting on graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada |
Minimum Certificate Dispersal with Tree Structures. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita |
Broadcastings and digit tilings on three-dimensional torus networks. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
Graph Orientation to Maximize the Minimum Weighted Outdegree. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada |
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada |
Minimum Certificate Dispersal with Tree Structures |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono |
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
Approximability of the Path-Distance-Width for AT-free Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada |
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono |
Fast Random Walks on Finite Graphs and Graph Topological Information. |
ICNC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada |
Approximability and inapproximability of the minimum certificate dispersal problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The hitting and cover times of Metropolis walks. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The Space Complexity of Leader Election in Anonymous Networks. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fuminiko Nakano, Hirotaka Ono, Taizo Sadahiro |
Local move connectedness of domino tilings with diagonal impurities. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita |
Pattern Formation through Optimum Matching by Oblivious CORDA Robots. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita |
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
The (p, q)-total Labeling Problem for Trees. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
An O(n1.75) algorithm for L(2, 1)-labeling of trees. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kazuhisa Makino, Hirotaka Ono |
Deductive Inference for the Interiors and Exteriors of Horn Theories |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
Drawing Borders Efficiently. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Algorithm, Approximation algorithm, Combinatorial optimization, NP-hardness, Spreadsheet |
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
Graph orientation to maximize the minimum weighted outdegree. |
IPDPS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
How to Design a Linear Cover Time Random Walk on a Finite Graph. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ei Ando, Hirotaka Ono, Masafumi Yamashita |
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada |
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
Route-Enabling Graph Orientation Problems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
A linear time algorithm for L(2,1)-labeling of trees |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. |
DNA |
2008 |
DBLP DOI BibTeX RDF |
Statistical Thermodynamical Constraints, Local Search, DNA Sequence Design |
| 1 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The space complexity of the leader election in anonymous networks. |
IPDPS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono |
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
An Algorithm for L(2, 1)-Labeling of Trees. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
frequency/channel assignment, L(2 and 1)-labeling, graph algorithm, vertex coloring |
| 1 | Kazuhisa Makino, Hirotaka Ono |
Deductive Inference for the Interiors and Exteriors of Horn Theories. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The Balanced Edge Cover Problem. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Graph Orientation Algorithms to minimize the Maximum Outdegree. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. |
DNA |
2007 |
DBLP DOI BibTeX RDF |
DNA Sequence Design Algorithm, Statistical Thermodynamical Constraints, Local Search |
| 1 | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono |
On Approximation of Bookmark Assignments. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
Drawing Borders Efficiently. |
FUN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita |
How to collect balls moving in the Euclidean plane. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
A Probabilistic Model of the DNA Conformational Change. |
DNA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
DNA Sequence Design by Dynamic Neighborhood Searches. |
DNA |
2006 |
DBLP DOI BibTeX RDF |
Combinatorial Constraints, Variable Depth Search, Local Search, Variable Neighborhood Search, DNA Sequence Design |
| 1 | Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. |
ISPA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Graph Orientation Algorithms to Minimize the Maximum Outdegree. |
CATS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
A generic search strategy for large-scale real-world networks. |
Infoscale |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. |
DNA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Yen Kaow Ng |
Best Fitting Fixed-Length Substring Patterns for a Set of Strings. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita |
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. |
WONS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yen Kaow Ng, Hirotaka Ono, Takeshi Shinohara |
Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. |
Discovery Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita |
How to Collect Balls Moving in the Euclidean Plane. |
Electr. Notes Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
A decomposability index in logical analysis of data. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Neighborhood Composition: A Parallelization of Local Search Algorithms. |
PVM/MPI |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki |
Interior and exterior functions of positive Boolean functions. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (eds.) |
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings |
ISAAC |
2003 |
DBLP BibTeX RDF |
|
| 1 | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |
Logical analysis of data with decomposable structures. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoong Chuin Lau, Qi Zhang Liu, Hirotaka Ono |
Integrating Local Search and Network Flow to Solve the Inventory Routing Problem. |
AAAI/IAAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
An Index for the Data Size to Extract Decomposable Structures in LAD. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
logical analysis of data, decomposable functions, Boolean functions, random graphs, probabilistic analysis, computational learning theory |
| 1 | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |
Logical Analysis of Data with Decomposable Structures. |
COCOON |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #62 of 62 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")