Follow
Koichi Yamazaki
Koichi Yamazaki
Verified email at mail.dendai.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
3572003
Isomorphism for graphs of bounded distance width
K Yamazaki, HL Bodlaender, B de Fluiter, DM Thilikos
Algorithmica 24, 105-127, 1999
451999
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
301997
On spanning tree congestion of graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete mathematics 309 (13), 4215-4224, 2009
282009
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
242016
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
222007
Outerplanar obstructions for matroid pathwidth
A Koutsonas, DM Thilikos, K Yamazaki
Discrete Mathematics 315, 95-101, 2014
192014
Security number of grid-like graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete applied mathematics 157 (11), 2555-2561, 2009
192009
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
152008
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
131993
Lower bounds for treewidth of product graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete Applied Mathematics 162, 251-258, 2014
122014
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
M Togasaki, K Yamazaki
Discrete mathematics 259 (1-3), 361-368, 2002
122002
Isomorphism for graphs of bounded distance width
K Yamazaki, HL Bodlaender, B De Fluiter, DM Thilikos
Algorithms and Complexity: Third Italian Conference, CIAC'97 Rome, Italy …, 1997
121997
A revisit of the scheme for computing treewidth and minimum fill-in
M Furuse, K Yamazaki
Theoretical Computer Science 531, 66-76, 2014
102014
Inapproximability of rank, clique, boolean, and maximum induced matching-widths under small set expansion hypothesis
K Yamazaki
Algorithms 11 (11), 173, 2018
92018
Tree-length equals branch-length
K Umezawa, K Yamazaki
Discrete Mathematics 309 (13), 4656-4660, 2009
92009
On approximation intractability of the path–distance–width problem
K Yamazaki
Discrete applied mathematics 110 (2-3), 317-325, 2001
92001
Worst case analysis of a greedy algorithm for graph thickness
S Kawano, K Yamazaki
Information processing letters 85 (6), 333-337, 2003
82003
Linear width and Single ideal
T Fujita, K Yamazaki
IEICE Technical Report; IEICE Tech. Rep. 117 (269), 21-27, 2017
72017
How to solve the torus puzzle
K Amano, Y Kojima, T Kurabayashi, K Kurihara, M Nakamura, A Omi, ...
Algorithms 5 (1), 18-29, 2012
72012
The system can't perform the operation now. Try again later.
Articles 1–20