Yoshiyasu Ishigami

According to our database1, Yoshiyasu Ishigami authored at least 15 papers between 1993 and 2007.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2007
Linear Ramsey Numbers for Bounded-Degree Hypergrahps.
Electronic Notes in Discrete Mathematics, 2007

2003
Vertex-disjoint cycles containing prescribed vertices.
Journal of Graph Theory, 2003

2002
Proof of a Conjecture of Bolloba's and Kohayakawa on the Erds-Stone Theorem.
J. Comb. Theory, Ser. B, 2002

Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs.
Eur. J. Comb., 2002

A Common Extension of the Erdos-Stone Theorem and the Alon-Yuster Theorem for Unbounded Graphs*1.
Eur. J. Comb., 2002

An extension of a theorem on cycles containing specified independent edges.
Discrete Mathematics, 2002

2001
Vertex-disjoint cycles of length at most four each of which contains a specified vertex.
Journal of Graph Theory, 2001

2000
Vertex-Disjoint Cycles Containing Specified Edges.
Graphs and Combinatorics, 2000

How Many Diagonal Rectangles Are Needed to Cover an Orthogonal Polygon?
Discrete & Computational Geometry, 2000

1997
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States.
Discrete Applied Mathematics, 1997

VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States.
Discrete Applied Mathematics, 1997

1996
An extremal problem of d permutations containing every permutation of every t elements.
Discrete Mathematics, 1996

1995
Containment problems in high-dimensional spaces.
Graphs and Combinatorics, 1995

1994
An extremal problem of orthants containing at most one point besides the origin.
Discrete Mathematics, 1994

1993
The VC-Dimensions of Finite Automata with n States.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993


  Loading...