default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshiyasu Ishigami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j14]Yoshiyasu Ishigami:
Linear Ramsey Numbers for Bounded-Degree Hypergrahps. Electron. Notes Discret. Math. 29: 47-51 (2007)- 2003
- [j13]Yoshiyasu Ishigami, Tao Jiang:
Vertex-disjoint cycles containing prescribed vertices. J. Graph Theory 42(4): 276-296 (2003) - 2002
- [j12]Yoshiyasu Ishigami, Hong Wang:
An extension of a theorem on cycles containing specified independent edges. Discret. Math. 245(1-3): 127-137 (2002) - [j11]Yoshiyasu Ishigami:
A Common Extension of the Erdos-Stone Theorem and the Alon-Yuster Theorem for Unbounded Graphs*1. Eur. J. Comb. 23(4): 431-448 (2002) - [j10]Yoshiyasu Ishigami:
Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs. Eur. J. Comb. 23(5): 583-612 (2002) - [j9]Yoshiyasu Ishigami:
Proof of a Conjecture of Bolloba's and Kohayakawa on the Erds-Stone Theorem. J. Comb. Theory B 85(2): 222-254 (2002) - 2001
- [j8]Yoshiyasu Ishigami:
Vertex-disjoint cycles of length at most four each of which contains a specified vertex. J. Graph Theory 37(1): 37-47 (2001) - 2000
- [j7]Yoshiyasu Ishigami:
How Many Diagonal Rectangles Are Needed to Cover an Orthogonal Polygon? Discret. Comput. Geom. 24(1): 117-140 (2000) - [j6]Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang:
Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. 16(1): 81-92 (2000)
1990 – 1999
- 1997
- [j5]Yoshiyasu Ishigami, Sei'ichi Tani
:
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States. Discret. Appl. Math. 74(2): 123-134 (1997) - [j4]Yoshiyasu Ishigami, Sei'ichi Tani:
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States. Discret. Appl. Math. 74(3): 229-240 (1997) - 1996
- [j3]Yoshiyasu Ishigami:
An extremal problem of d permutations containing every permutation of every t elements. Discret. Math. 159(1-3): 279-283 (1996) - 1995
- [j2]Yoshiyasu Ishigami:
Containment problems in high-dimensional spaces. Graphs Comb. 11(4): 327-335 (1995) - 1994
- [j1]Yoshiyasu Ishigami:
An extremal problem of orthants containing at most one point besides the origin. Discret. Math. 132(1-3): 383-386 (1994) - 1993
- [c1]Yoshiyasu Ishigami, Sei'ichi Tani:
The VC-Dimensions of Finite Automata with n States. ALT 1993: 328-341
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 21:19 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:
