Koichi Yamazaki
Koichi Yamazaki
Verified email at cs.gunma-u.ac.jp
Title
Cited by
Cited by
Year
A note on greedy algorithms for the maximum weighted independent set problem
S Sakai, M Togasaki, K Yamazaki
Discrete applied mathematics 126 (2-3), 313-322, 2003
2982003
Isomorphism for graphs of bounded distance width
K Yamazaki, HL Bodlaender, B de Fluiter, DM Thilikos
Algorithmica 24 (2), 105-127, 1999
411999
On spanning tree congestion of graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete mathematics 309 (13), 4215-4224, 2009
262009
It is hard to know when greedy is good for finding independent sets
HL Bodlaender, DM Thilikos, K Yamazaki
Information Processing Letters 61 (2), 101-106, 1997
241997
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Y Otachi, Y Okamoto, K Yamazaki
Discrete Applied Mathematics 155 (17), 2383-2390, 2007
192007
Security number of grid-like graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete applied mathematics 157 (11), 2555-2561, 2009
172009
A pumping lemma and the structure of derivations in the boundary NLC graph languages
K Yamazaki, T Yaku
Information sciences 75 (1-2), 81-97, 1993
151993
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
M Togasaki, K Yamazaki
Discrete mathematics 259 (1-3), 361-368, 2002
122002
Computer science education for primary and lower secondary school students: Teaching the concept of automata
D Isayama, M Ishiyama, R Relator, K Yamazaki
ACM Transactions on Computing Education (TOCE) 17 (1), 1-28, 2016
112016
Outerplanar obstructions for matroid pathwidth
A Koutsonas, DM Thilikos, K Yamazaki
Discrete Mathematics 315, 95-101, 2014
112014
Isomorphism for graphs of bounded distance width
K Yamazaki, HL Bodlaender, B De Fluiter, DM Thilikos
Italian Conference on Algorithms and Complexity, 276-287, 1997
111997
On approximation intractability of the path–distance–width problem
K Yamazaki
Discrete applied mathematics 110 (2-3), 317-325, 2001
102001
A revisit of the scheme for computing treewidth and minimum fill-in
M Furuse, K Yamazaki
Theoretical Computer Science 531, 66-76, 2014
82014
Lower bounds for treewidth of product graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete Applied Mathematics 162, 251-258, 2014
82014
Tree-length equals branch-length
K Umezawa, K Yamazaki
Discrete Mathematics 309 (13), 4656-4660, 2009
82009
An improved algorithm for the longest induced path problem on k-chordal graphs
T Ishizeki, Y Otachi, K Yamazaki
Discrete applied mathematics 156 (15), 3057-3059, 2008
82008
Worst case analysis of a greedy algorithm for graph thickness
S Kawano, K Yamazaki
Information processing letters 85 (6), 333-337, 2003
72003
Hardness of approximation for non-overlapping local alignments
H Nagashima, K Yamazaki
Discrete applied mathematics 137 (3), 293-309, 2004
62004
A normal form problem for unlabeled boundary NLC graph languages
K Yamazaki
Information and Computation 120 (1), 1-10, 1995
61995
Outerplanar obstructions for matroid pathwidth
A Koutsonas, DM Thilikos, K Yamazaki
Electronic Notes in Discrete Mathematics 38, 541-546, 2011
52011
The system can't perform the operation now. Try again later.
Articles 1–20