default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoichi Yamazaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j31]Takaaki Fujita, Koichi Yamazaki
:
Tangle and Ultrafilter: Game Theoretical Interpretation. Graphs Comb. 36(2): 319-330 (2020)- [c7]Michiko Yasukawa, Koichi Yamazaki:
Categorizing Bibliographic Data for Detection of Transition in Academic Subjects. IIAI-AAI 2020: 842-844
2010 – 2019
- 2019
- [c6]Michiko Yasukawa, Hirofumi Yokouchi, Koichi Yamazaki:
Syllabus Mining for Faculty Development in Science and Engineering Courses. IIAI-AAI 2019: 334-341 - 2018
- [j30]Koichi Yamazaki:
Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis. Algorithms 11(11): 173 (2018) - 2017
- [j29]Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki:
Thin strip graphs. Discret. Appl. Math. 216: 203-210 (2017) - [j28]Daiki Isayama, Masaki Ishiyama, Raissa Relator, Koichi Yamazaki:
Computer Science Education for Primary and Lower Secondary School Students: Teaching the Concept of Automata. ACM Trans. Comput. Educ. 17(1): 2:1-2:28 (2017) - [c5]Koichi Yamazaki:
Tangle and Maximal Ideal. WALCOM 2017: 81-92 - 2015
- [j27]Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki:
Anti-Slide. J. Inf. Process. 23(3): 252-257 (2015) - 2014
- [j26]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
Lower bounds for treewidth of product graphs. Discret. Appl. Math. 162: 251-258 (2014) - [j25]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168: 69-77 (2014) - [j24]Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki:
Outerplanar obstructions for matroid pathwidth. Discret. Math. 315-316: 95-101 (2014) - [j23]Masanobu Furuse, Koichi Yamazaki:
A revisit of the scheme for computing treewidth and minimum fill-in. Theor. Comput. Sci. 531: 66-76 (2014) - 2012
- [j22]Kazuyuki Amano, Yuta Kojima, Toshiya Kurabayashi, Keita Kurihara, Masahiro Nakamura, Ayaka Omi, Toshiyuki Tanaka, Koichi Yamazaki:
How to Solve the Torus Puzzle. Algorithms 5(1): 18-29 (2012) - [j21]Koichi Yamazaki:
Foreword. IEICE Trans. Inf. Syst. 95-D(3): 711 (2012) - 2011
- [j20]Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki:
Outerplanar Obstructions for Matroid Pathwidth. Electron. Notes Discret. Math. 38: 541-546 (2011) - [c4]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximability of the Path-Distance-Width for AT-free Graphs. WG 2011: 271-282 - 2010
- [j19]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
The carving-width of generalized hypercubes. Discret. Math. 310(21): 2867-2876 (2010)
2000 – 2009
- 2009
- [j18]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
Security number of grid-like graphs. Discret. Appl. Math. 157(11): 2555-2561 (2009) - [j17]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
On spanning tree congestion of graphs. Discret. Math. 309(13): 4215-4224 (2009) - [j16]Kaori Umezawa, Koichi Yamazaki:
Tree-length equals branch-length. Discret. Math. 309(13): 4656-4660 (2009) - 2008
- [j15]Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki:
An improved algorithm for the longest induced path problem on k-chordal graphs. Discret. Appl. Math. 156(15): 3057-3059 (2008) - [j14]Yota Otachi, Koichi Yamazaki:
A lower bound for the vertex boundary-width of complete k-ary trees. Discret. Math. 308(12): 2389-2395 (2008) - 2007
- [j13]Yota Otachi, Yoshio Okamoto, Koichi Yamazaki:
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discret. Appl. Math. 155(17): 2383-2390 (2007) - 2004
- [j12]Hiroyuki Nagashima, Koichi Yamazaki:
Hiroyuki Nagashima and Koichi Yamazaki. Discret. Appl. Math. 137(3): 293-309 (2004) - 2003
- [j11]Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki:
A note on greedy algorithms for the maximum weighted independent set problem. Discret. Appl. Math. 126(2-3): 313-322 (2003) - [j10]Sinichiro Kawano, Koichi Yamazaki:
Worst case analysis of a greedy algorithm for graph thickness. Inf. Process. Lett. 85(6): 333-337 (2003) - 2002
- [j9]Mitsunori Togasaki, Koichi Yamazaki:
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs. Discret. Math. 259(1-3): 361-368 (2002) - 2001
- [j8]Koichi Yamazaki:
On approximation intractability of the path-distance-width problem. Discret. Appl. Math. 110(2-3): 317-325 (2001) - [j7]Koichi Yamazaki, Sei'ichi Tani, Tetsuro Nishino:
A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees. Int. J. Found. Comput. Sci. 12(4): 435-444 (2001)
1990 – 1999
- 1999
- [j6]Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24(2): 105-127 (1999) - 1997
- [j5]Koichi Yamazaki:
A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions. Acta Informatica 34(5): 325-335 (1997) - [j4]Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki:
It is Hard to Know when Greedy is Good for Finding Independent Sets. Inf. Process. Lett. 61(2): 101-111 (1997) - [c3]Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width. CIAC 1997: 276-287 - 1995
- [j3]Koichi Yamazaki:
A Normal Form Problem for Unlabeled Boundary NLC Graph Languages. Inf. Comput. 120(1): 1-10 (1995) - [c2]Sei'ichi Tani, Koichi Yamazaki:
Learning of Restricted RNLC Graph Languages. ISAAC 1995: 171-180 - 1994
- [j2]Koichi Yamazaki:
The Generating Power of Boundary NLC Graph Grammars and Cycle Graphs. Inf. Sci. 80(1-2): 133-148 (1994) - 1993
- [j1]Koichi Yamazaki, Takeo Yaku:
A Pumping lemma and the structure of derivations in the boundary NLC graph languages. Inf. Sci. 75(1-2): 81-97 (1993) - [c1]Koichi Yamazaki:
The Generating Power of the Boundary NLC Graph Grammars. ACM Conference on Computer Science 1993: 404-409
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
