Koichi Yamazaki

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