Koichi Yamazaki

From MaRDI portal
Person:187147

Available identifiers

zbMath Open yamazaki.koichiWikidataQ60574368 ScholiaQ60574368MaRDI QIDQ187147

List of research outcomes

PublicationDate of PublicationType
Tangle and ultrafilter: game theoretical interpretation2020-04-03Paper
How to solve the torus puzzle2019-03-26Paper
Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis2019-01-21Paper
Tangle and Maximal Ideal2017-05-05Paper
Thin strip graphs2016-11-24Paper
It is hard to know when greedy is good for finding independent sets2016-05-26Paper
Lower bounds for treewidth of product graphs2014-09-12Paper
Approximating the path-distance-width for AT-free graphs and graphs in related classes2014-04-02Paper
A revisit of the scheme for computing treewidth and minimum fill-in2014-03-28Paper
Outerplanar obstructions for matroid pathwidth2014-01-16Paper
https://portal.mardi4nfdi.de/entity/Q28574022013-11-01Paper
Approximability of the Path-Distance-Width for AT-free Graphs2011-12-16Paper
The carving-width of generalized hypercubes2010-10-19Paper
Security number of grid-like graphs2010-04-28Paper
On spanning tree congestion of graphs2009-12-10Paper
Tree-length equals branch-length2009-12-10Paper
Worst case analysis of a greedy algorithm for graph thickness2009-03-23Paper
An improved algorithm for the longest induced path problem on \(k\)-chordal graphs2009-03-09Paper
A lower bound for the vertex boundary-width of complete \(k\)-ary trees2008-05-13Paper
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs2007-10-29Paper
Hardness of approximation for non-overlapping local alignments.2004-03-14Paper
Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs2003-03-16Paper
A note on greedy algorithms for the maximum weighted independent set problem2003-03-09Paper
https://portal.mardi4nfdi.de/entity/Q43312842002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27438032001-09-17Paper
https://portal.mardi4nfdi.de/entity/Q47618572001-02-21Paper
On approximation intractability of the path-distance-width problem2001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45053972000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49378512000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q47055151999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q47055161999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q47036561999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q42533261999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42533631999-11-08Paper
Isomorphism for graphs of bounded distance width1999-06-29Paper
A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions1997-06-19Paper
A normal form problem for unlabeled boundary NLC graph languages1996-09-15Paper
The generating power of boundary NLC graph grammars and cycle graphs1995-08-27Paper
A pumping lemma and the structure of derivations in the boundary NLC graph languages1994-07-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Koichi Yamazaki