Koichi Yamazaki
According to our database^{1},
Koichi Yamazaki
authored at least 34 papers
between 1993 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Inapproximability of Rank, Clique, Boolean, and Maximum Induced MatchingWidths under Small Set Expansion Hypothesis.
Algorithms, 2018
2017
Computer Science Education for Primary and Lower Secondary School Students: Teaching the Concept of Automata.
TOCE, 2017
Thin strip graphs.
Discrete Applied Mathematics, 2017
Tangle and Maximal Ideal.
Proceedings of the WALCOM: Algorithms and Computation, 2017
2015
AntiSlide.
JIP, 2015
2014
A revisit of the scheme for computing treewidth and minimum fillin.
Theor. Comput. Sci., 2014
Outerplanar obstructions for matroid pathwidth.
Discrete Mathematics, 2014
Approximating the pathdistancewidth for ATfree graphs and graphs in related classes.
Discrete Applied Mathematics, 2014
Lower bounds for treewidth of product graphs.
Discrete Applied Mathematics, 2014
2012
Foreword.
IEICE Transactions, 2012
How to Solve the Torus Puzzle.
Algorithms, 2012
2011
Outerplanar Obstructions for Matroid Pathwidth.
Electronic Notes in Discrete Mathematics, 2011
Approximability of the PathDistanceWidth for ATfree Graphs.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2011
2010
The carvingwidth of generalized hypercubes.
Discrete Mathematics, 2010
2009
Treelength equals branchlength.
Discrete Mathematics, 2009
On spanning tree congestion of graphs.
Discrete Mathematics, 2009
Security number of gridlike graphs.
Discrete Applied Mathematics, 2009
2008
A lower bound for the vertex boundarywidth of complete kary trees.
Discrete Mathematics, 2008
An improved algorithm for the longest induced path problem on kchordal graphs.
Discrete Applied Mathematics, 2008
2007
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.
Discrete Applied Mathematics, 2007
2004
Hiroyuki Nagashima and Koichi Yamazaki.
Discrete Applied Mathematics, 2004
2003
Worst case analysis of a greedy algorithm for graph thickness.
Inf. Process. Lett., 2003
A note on greedy algorithms for the maximum weighted independent set problem.
Discrete Applied Mathematics, 2003
2002
Pagenumber of pathwidthk graphs and strong pathwidthk graphs.
Discrete Mathematics, 2002
2001
A Characterization of kth Powers Pn, k of Paths in Terms of kTrees.
Int. J. Found. Comput. Sci., 2001
On approximation intractability of the pathdistancewidth problem.
Discrete Applied Mathematics, 2001
1997
It is Hard to Know when Greedy is Good for Finding Independent Sets.
Inf. Process. Lett., 1997
A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions.
Acta Inf., 1997
Isomorphism for Graphs of Bounded Distance Width.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997
1995
A Normal Form Problem for Unlabeled Boundary NLC Graph Languages
Inf. Comput., July, 1995
Learning of Restricted RNLC Graph Languages.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
1994
The Generating Power of Boundary NLC Graph Grammars and Cycle Graphs.
Inf. Sci., 1994
1993
A Pumping lemma and the structure of derivations in the boundary NLC graph languages.
Inf. Sci., 1993
The Generating Power of the Boundary NLC Graph Grammars.
Proceedings of the ACM 21th Conference on Computer Science, 1993