Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154].

[BibT_eX]

[DOI]

Jun Hosoda

Juraj Hromkovic

Theor. Comput. Sci., 2015

The searchlight problem for road networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Linear-time algorithm for sliding tokens on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Finding All Longest Common Segments in Protein Structures Efficiently.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Pattern Formation by Oblivious Asynchronous Mobile Robots.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately.

[BibT_eX]

[DOI]

Kazuya Haraguchi

Hirotaka Ono

J. Inf. Process., 2015

Graph Orientations Optimizing the Number of Light or Heavy Vertices.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions.

[BibT_eX]

[DOI]

Tadashi Wadayama

Taisuke Izumi

Hirotaka Ono

CoRR, 2015

A Fixed-Parameter Algorithm for Max Edge Domination.

[BibT_eX]

[DOI]

Tesshu Hanaka

Hirotaka Ono

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection.

[BibT_eX]

[DOI]

Omar Rifki

Hirotaka Ono

Proceedings of the Operations Research Proceedings 2015, 2015

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

[BibT_eX]

[DOI]

Tadashi Wadayama

Taisuke Izumi

Hirotaka Ono

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Algorithmic aspects of distance constrained labeling: a survey.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2014

Foreword.

[BibT_eX]

[DOI]

Hirotaka Ono

IEICE Trans. Inf. Syst., 2014

Approximating the path-distance-width for AT-free graphs and graphs in related classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

On the Parameterized Complexity for Token Jumping on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Fixed-Parameter Tractability of Token Jumping on Planar Graphs.

[BibT_eX]

[DOI]

Takehiro Ito

Marcin Jakub Kaminski

Hirotaka Ono

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Depth-First Search Using O(n) Bits.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Approximability of Latin Square Completion-Type Puzzles.

[BibT_eX]

[DOI]

Kazuya Haraguchi

Hirotaka Ono

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Coalescing Random Walks and Voting on Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

BLOCKSUM is NP-Complete.

[BibT_eX]

[DOI]

Kazuya Haraguchi

Hirotaka Ono

IEICE Trans. Inf. Syst., 2013

Optimal approximability of bookmark assignments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Route-Enabling Graph Orientation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2013

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

[BibT_eX]

[DOI]

Algorithmica, 2013

Base Location Problems for Base-Monotone Regions.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means.

[BibT_eX]

[DOI]

Omar Rifki

Hirotaka Ono

Proceedings of the Operations Research Proceedings 2013, 2013

Recent Advances on Distance Constrained Labeling Problems.

[BibT_eX]

[DOI]

Hirotaka Ono

Proceedings of the First International Symposium on Computing and Networking, 2013

2012

Deductive inference for the interiors and exteriors of horn theories.

[BibT_eX]

[DOI]

Kazuhisa Makino

Hirotaka Ono

ACM Trans. Comput. Log., 2012

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

On space complexity of self-stabilizing leader election in mediated population protocol.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Minimum Certificate Dispersal with Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Coalescing random walks and voting on graphs.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Reconfiguration of List L(2, 1)-Labelings in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

An Extension of Matthews' Bound to Multiplex Random Walks.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

Finding Longest Common Segments in Protein Structures in Nearly Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Broadcastings and digit tilings on three-dimensional torus networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Graph Orientation to Maximize the Minimum Weighted Outdegree.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Yuichi Asahiro

Eiji Miyano

Hirotaka Ono

Discret. Appl. Math., 2011

Approximability of the Path-Distance-Width for AT-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Fast Random Walks on Finite Graphs and Graph Topological Information.

[BibT_eX]

[DOI]

Hirotaka Ono

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.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

Maximum Domination Problem.

[BibT_eX]

[DOI]

Eiji Miyano

Hirotaka Ono

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

The hitting and cover times of Metropolis walks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Approximability and inapproximability of the minimum certificate dispersal problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The Space Complexity of Leader Election in Anonymous Networks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Local move connectedness of domino tilings with diagonal impurities.

[BibT_eX]

[DOI]

Fuminiko Nakano

Hirotaka Ono

Taizo Sadahiro

Discret. Math., 2010

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Pattern Formation through Optimum Matching by Oblivious CORDA Robots.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The (p, q)-total Labeling Problem for Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Drawing Borders Efficiently.

[BibT_eX]

[DOI]

Kazuo Iwama

Eiji Miyano

Hirotaka Ono

Theory Comput. Syst., 2009

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

[BibT_eX]

[DOI]

CoRR, 2009

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

How to Design a Linear Cover Time Random Walk on a Finite Graph.

[BibT_eX]

[DOI]

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.

[BibT_eX]

[DOI]

Ei Ando

Hirotaka Ono

Masafumi Yamashita

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

A linear time algorithm for L(2,1)-labeling of trees

[BibT_eX]

[DOI]

CoRR, 2008

An Algorithm for L(2, 1)-Labeling of Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

The Balanced Edge Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007

Graph Orientation Algorithms to minimize the Maximum Outdegree.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

On Approximation of Bookmark Assignments.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006

Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing and Applications, 2006

A generic search strategy for large-scale real-world networks.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Scalable Information Systems, 2006

A Probabilistic Model of the DNA Conformational Change.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

DNA Sequence Design by Dynamic Neighborhood Searches.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.

[BibT_eX]

[DOI]

Yen Kaow Ng

Hirotaka Ono

Takeshi Shinohara

Proceedings of the Discovery Science, 8th International Conference, 2005

Best Fitting Fixed-Length Substring Patterns for a Set of Strings.

[BibT_eX]

[DOI]

Hirotaka Ono

Yen Kaow Ng

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

How to Collect Balls Moving in the Euclidean Plane.

[BibT_eX]

[DOI]

Proceedings of Computing: The Australasian Theory Symposium, 2004

A decomposability index in logical analysis of data.

[BibT_eX]

[DOI]

Hirotaka Ono

Mutsunori Yagiura

Toshihide Ibaraki

Discret. Appl. Math., 2004

Neighborhood Composition: A Parallelization of Local Search Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

2003

Interior and exterior functions of positive Boolean functions.

[BibT_eX]

[DOI]

Kazuhisa Makino

Hirotaka Ono

Toshihide Ibaraki

Discret. Appl. Math., 2003

2002

Logical analysis of data with decomposable structures.

[BibT_eX]

[DOI]

Hirotaka Ono

Kazuhisa Makino

Toshihide Ibaraki

Theor. Comput. Sci., 2002

Integrating Local Search and Network Flow to Solve the Inventory Routing Problem.

[BibT_eX]

[DOI]

Hoong Chuin Lau

Qi Zhang Liu

Hirotaka Ono

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

An Index for the Data Size to Extract Decomposable Structures in LAD.

[BibT_eX]

[DOI]

Hirotaka Ono

Mutsunori Yagiura

Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Hirotaka Ono

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...