Eiji Miyano

Randy Goebel

Guohui Lin

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

Graph Orientations Optimizing the Number of Light or Heavy Vertices.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Complexity of finding maximum regular induced subgraphs with prescribed degree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Distance- $$d$$ independent set problems for bipartite and chordal graphs.

[BibT_eX]

[DOI]

Hiroshi Eto

Fengrui Guo

J. Comb. Optim., 2014

Evolutionary algorithms for the pursuit problem.

[BibT_eX]

[DOI]

Keisuke Tahara

Proceedings of the 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS), 2014

2013

(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation.

[BibT_eX]

[DOI]

Kenta Kanmera

J. Comb. Optim., 2013

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems.

[BibT_eX]

[DOI]

Hiroshi Eto

IEICE Trans. Inf. Syst., 2013

Optimal approximability of bookmark assignments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Optimal distortion embedding of complete binary trees into lines.

[BibT_eX]

[DOI]

Masao Kumamoto

Inf. Process. Lett., 2012

NP-hardness of the sorting buffer problem on the uniform metric.

[BibT_eX]

[DOI]

Kenichi Kawahara

Discret. Appl. Math., 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

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

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Hirotaka Ono

Discret. Appl. Math., 2011

Maximum Domination Problem.

[BibT_eX]

[DOI]

Hirotaka Ono

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

2010

Weighted nearest neighbor algorithms for the graph exploration problem on cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Approximating Maximum Diameter-Bounded Subgraphs.

[BibT_eX]

[DOI]

Kazuaki Samizo

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Drawing Borders Efficiently.

[BibT_eX]

[DOI]

Hirotaka Ono

Theory Comput. Syst., 2009

Computational Complexities of University Interview Timetabling.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

2008

Grasp and Delivery for Moving Objects on Broken Lines.

[BibT_eX]

[DOI]

Shinichi Shimoirisa

Theory Comput. Syst., 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

2006

The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

How to Pack Directed Acyclic Graphs into Small Blocks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Pickup and Delivery for Moving Objects on Broken Lines.

[BibT_eX]

[DOI]

Shinichi Shimoirisa

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2001

Efficient randomized routing algorithms on the two-dimensional mesh of buses.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

New Bounds for Oblivious Mesh Routing.

[BibT_eX]

[DOI]

Yahiko Kambayashi

J. Graph Algorithms Appl., 2001

An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.

[BibT_eX]

[DOI]

J. Algorithms, 2001

A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.

[BibT_eX]

[DOI]

J. Algorithms, 2001

2000

Oblivious Routing Algorithms on the Mesh of Buses.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.

[BibT_eX]

[DOI]

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999

An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Better Approximations of Non-Hamiltonian Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Routing Problems on the Mesh of Buses.

[BibT_eX]

[DOI]

Yahiko Kambayashi

J. Algorithms, 1996

1995

Intractability of Read-Once Resolution.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1993

Random generation of test instances with controlled attributes.

[BibT_eX]

[DOI]

Proceedings of the Cliques, 1993

1992

Routing Problems on the Mesh of Buses.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Random Generation of Satisfiable and Unsatisfiable CNF Predicates.

[BibT_eX]

Hidetoshi Abeta