Koichi Yamazaki

Publication Activity (10 Years)

Years Active: 1993-2020
Publications (10 Years): 7

Top Topics

Engineering Courses

Constraint Graph

Top Venues

Discret. Appl. Math.

IEICE Trans. Inf. Syst.

Publications

Michiko Yasukawa, Koichi Yamazaki
Categorizing Bibliographic Data for Detection of Transition in Academic Subjects. IIAI-AAI (2020)
Takaaki Fujita, Koichi Yamazaki
Tangle and Ultrafilter: Game Theoretical Interpretation. Graphs Comb. 36 (2) (2020)
Michiko Yasukawa, Hirofumi Yokouchi, Koichi Yamazaki
Syllabus Mining for Faculty Development in Science and Engineering Courses. IIAI-AAI (2019)
Koichi Yamazaki
Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis. Algorithms 11 (11) (2018)
Koichi Yamazaki
Tangle and Maximal Ideal. WALCOM (2017)
Daiki Isayama, Masaki Ishiyama, Raissa Relator, Koichi Yamazaki
Computer Science Education for Primary and Lower Secondary School Students: Teaching the Concept of Automata. ACM Trans. Comput. Educ. 17 (1) (2017)
Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki
Thin strip graphs. Discret. Appl. Math. 216 (2017)
Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki
Anti-Slide. J. Inf. Process. 23 (3) (2015)
Masanobu Furuse, Koichi Yamazaki
A revisit of the scheme for computing treewidth and minimum fill-in. Theor. Comput. Sci. 531 (2014)
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
Lower bounds for treewidth of product graphs. Discret. Appl. Math. 162 (2014)
Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki
Outerplanar obstructions for matroid pathwidth. Discret. Math. (2014)
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168 (2014)
Kazuyuki Amano, Yuta Kojima, Toshiya Kurabayashi, Keita Kurihara, Masahiro Nakamura, Ayaka Omi, Toshiyuki Tanaka, Koichi Yamazaki
How to Solve the Torus Puzzle. Algorithms 5 (1) (2012)
Koichi Yamazaki
Foreword. IEICE Trans. Inf. Syst. (3) (2012)
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)
Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki
Outerplanar Obstructions for Matroid Pathwidth. Electron. Notes Discret. Math. 38 (2011)
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
The carving-width of generalized hypercubes. Discret. Math. 310 (21) (2010)
Kaori Umezawa, Koichi Yamazaki
Tree-length equals branch-length. Discret. Math. 309 (13) (2009)
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
On spanning tree congestion of graphs. Discret. Math. 309 (13) (2009)
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
Security number of grid-like graphs. Discret. Appl. Math. 157 (11) (2009)
Yota Otachi, Koichi Yamazaki
A lower bound for the vertex boundary-width of complete k-ary trees. Discret. Math. 308 (12) (2008)
Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki
An improved algorithm for the longest induced path problem on k-chordal graphs. Discret. Appl. Math. 156 (15) (2008)
Yota Otachi, Yoshio Okamoto, Koichi Yamazaki
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discret. Appl. Math. 155 (17) (2007)
Hiroyuki Nagashima, Koichi Yamazaki
Hiroyuki Nagashima and Koichi Yamazaki. Discret. Appl. Math. 137 (3) (2004)
Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki
A note on greedy algorithms for the maximum weighted independent set problem. Discret. Appl. Math. 126 (2-3) (2003)
Sinichiro Kawano, Koichi Yamazaki
Worst case analysis of a greedy algorithm for graph thickness. Inf. Process. Lett. 85 (6) (2003)
Mitsunori Togasaki, Koichi Yamazaki
graphs. Discret. Math. 259 (1-3) (2002)
Koichi Yamazaki
On approximation intractability of the path-distance-width problem. Discret. Appl. Math. 110 (2-3) (2001)
Koichi Yamazaki, Sei'ichi Tani, Tetsuro Nishino
A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees. Int. J. Found. Comput. Sci. 12 (4) (2001)
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24 (2) (1999)
Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki
It is Hard to Know when Greedy is Good for Finding Independent Sets. Inf. Process. Lett. 61 (2) (1997)
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
Isomorphism for Graphs of Bounded Distance Width. CIAC (1997)
Koichi Yamazaki
A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions. Acta Informatica 34 (5) (1997)
Koichi Yamazaki
A Normal Form Problem for Unlabeled Boundary NLC Graph Languages Inf. Comput. 120 (1) (1995)
Sei'ichi Tani, Koichi Yamazaki
Learning of Restricted RNLC Graph Languages. ISAAC (1995)
Koichi Yamazaki
The Generating Power of Boundary NLC Graph Grammars and Cycle Graphs. Inf. Sci. 80 (1-2) (1994)
Koichi Yamazaki, Takeo Yaku
A Pumping lemma and the structure of derivations in the boundary NLC graph languages. Inf. Sci. 75 (1-2) (1993)
Koichi Yamazaki
The Generating Power of the Boundary NLC Graph Grammars. ACM Conference on Computer Science (1993)