Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Yamazaki, Koich"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A revisit of the scheme for computing treewidth and minimum fill-in
Masanobu Furuse
,
Koichi Yamazaki
Theoretical Computer Science
531
, 2014, pp. 66-76
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
Lecture Notes in Computer Science
6986
, 2011, pp. 271-282
Worst case analysis of a greedy algorithm for graph thickness
Sinichiro Kawano
,
Koichi Yamazaki
Information Processing Letters
85
(6), 2003, pp. 333-337
A characterization of
k
-th powers
P_{n,k}
of paths in terms of
k
-trees
Koich Yamazaki
,
Sei'ichi Tani
,
Tetsuro Nishino
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 435-443
On approximation intractability of the path-distance-width problem
Koichi Yamazaki
Discrete Applied Mathematics
110
(2-3), 2001, pp. 317-325
It is hard to know when greedy is good for finding independent sets
Hans L. Bodlaender
,
Dimitrios M. Thilikos
,
Koichi Yamazaki
Information Processing Letters
61
(2), 1997, pp. 101-106
Isomorphism for graphs of bounded distance width
Koichi Yamazaki
,
Hans L. Bodlaender
,
Babette de Fluiter
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
1203
, 1997, pp. 276-287
Isomorphism for graphs of bounded distance width
Koichi Yamazaki
,
Hans L. Bodlaender
,
Babette de Fluiter
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
1203
, 1997, pp. 276-287
A hierarchy of the class of apex
NLC
graph languages by bounds on the number of nonterminal nodes in productions
Koichi Yamazaki
Acta Informatica
34
(5), 1997, pp. 325-335
Learning of restricted RNLC graph languages
Sei'ichi Tani
,
Koichi Yamazaki
Lecture Notes in Computer Science
1004
, 1995, pp. 171-180
A normal form problem for unlabeled boundary NLC graph languages
Koichi Yamazaki
Information and Computation
120
(1), 1995, pp. 1-10