Koichi Yamazaki

According to our database, Koichi Yamazaki authored at least 36 papers between 1993 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Tangle and Ultrafilter: Game Theoretical Interpretation.

Takaaki Fujita, Koichi Yamazaki

Graphs Comb., 2020

Categorizing Bibliographic Data for Detection of Transition in Academic Subjects.

Michiko Yasukawa, Koichi Yamazaki

Proceedings of the 9th International Congress on Advanced Applied Informatics, 2020

2019

Syllabus Mining for Faculty Development in Science and Engineering Courses.

Michiko Yasukawa, Hirofumi Yokouchi, Koichi Yamazaki

Proceedings of the 8th International Congress on Advanced Applied Informatics, 2019

2018

Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis.

Koichi Yamazaki

Algorithms, 2018

2017

Computer Science Education for Primary and Lower Secondary School Students: Teaching the Concept of Automata.

Daiki Isayama, Masaki Ishiyama, Raissa Relator, Koichi Yamazaki

ACM Trans. Comput. Educ., 2017

Thin strip graphs.

Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki

Discret. Appl. Math., 2017

Tangle and Maximal Ideal.

Koichi Yamazaki

Proceedings of the WALCOM: Algorithms and Computation, 2017

2015

Anti-Slide.

Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki

J. Inf. Process., 2015

2014

A revisit of the scheme for computing treewidth and minimum fill-in.

Masanobu Furuse, Koichi Yamazaki

Theor. Comput. Sci., 2014

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

Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki

Discret. Appl. Math., 2014

Lower bounds for treewidth of product graphs.

Kyohei Kozawa, Yota Otachi, Koichi Yamazaki

Discret. Appl. Math., 2014

2012

Foreword.

Koichi Yamazaki

IEICE Trans. Inf. Syst., 2012

How to Solve the Torus Puzzle.

Kazuyuki Amano, Yuta Kojima, Toshiya Kurabayashi, Keita Kurihara, Masahiro Nakamura, Ayaka Omi, Toshiyuki Tanaka, Koichi Yamazaki

Algorithms, 2012

2011

Outerplanar Obstructions for Matroid Pathwidth.

Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki

Electron. Notes Discret. Math., 2011

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

Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki

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

2010

The carving-width of generalized hypercubes.

Kyohei Kozawa, Yota Otachi, Koichi Yamazaki

Discret. Math., 2010

2009

Tree-length equals branch-length.

Kaori Umezawa, Koichi Yamazaki

Discret. Math., 2009

On spanning tree congestion of graphs.

Kyohei Kozawa, Yota Otachi, Koichi Yamazaki

Discret. Math., 2009

Security number of grid-like graphs.

Kyohei Kozawa, Yota Otachi, Koichi Yamazaki

Discret. Appl. Math., 2009

2008

A lower bound for the vertex boundary-width of complete k-ary trees.

Yota Otachi, Koichi Yamazaki

Discret. Math., 2008

An improved algorithm for the longest induced path problem on k-chordal graphs.

Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki

Discret. Appl. Math., 2008

2007

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.

Yota Otachi, Yoshio Okamoto, Koichi Yamazaki

Discret. Appl. Math., 2007

2004

Hiroyuki Nagashima and Koichi Yamazaki.

Hiroyuki Nagashima, Koichi Yamazaki

Discret. Appl. Math., 2004

2003

Worst case analysis of a greedy algorithm for graph thickness.

Sinichiro Kawano, Koichi Yamazaki

Inf. Process. Lett., 2003

A note on greedy algorithms for the maximum weighted independent set problem.

Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki

Discret. Appl. Math., 2003

2002

Pagenumber of pathwidth-<i>k</i> graphs and strong pathwidth-<i>k</i> graphs.

Mitsunori Togasaki, Koichi Yamazaki

Discret. Math., 2002

2001

A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees.

Koichi Yamazaki, Sei'ichi Tani, Tetsuro Nishino

Int. J. Found. Comput. Sci., 2001

On approximation intractability of the path-distance-width problem.

Koichi Yamazaki

Discret. Appl. Math., 2001

1999

Isomorphism for Graphs of Bounded Distance Width.

Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos

Algorithmica, 1999

1997

It is Hard to Know when Greedy is Good for Finding Independent Sets.

Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki

Inf. Process. Lett., 1997

A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions.

Koichi Yamazaki

Acta Informatica, 1997

1995

A Normal Form Problem for Unlabeled Boundary NLC Graph Languages

Koichi Yamazaki

Inf. Comput., July, 1995

Learning of Restricted RNLC Graph Languages.

Sei'ichi Tani, Koichi Yamazaki

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

The Generating Power of Boundary NLC Graph Grammars and Cycle Graphs.

Koichi Yamazaki

Inf. Sci., 1994

1993

A Pumping lemma and the structure of derivations in the boundary NLC graph languages.

Koichi Yamazaki, Takeo Yaku

Inf. Sci., 1993

The Generating Power of the Boundary NLC Graph Grammars.

Koichi Yamazaki

Proceedings of the ACM 21th Conference on Computer Science, 1993