| 1996 |
|---|
| 8 | EE | Terunao Soneoka,
Makoto Imase,
Yoshifumi Manabe:
Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II.
Discrete Applied Mathematics 64(3): 267-279 (1996) |
| 1994 |
|---|
| 7 | | Terunao Soneoka,
Toshihide Ibaraki:
Logically Instantaneous Message Passing in Asynchronous Distributed Systems.
IEEE Trans. Computers 43(5): 513-527 (1994) |
| 1992 |
|---|
| 6 | | Noriyasu Arakawa,
Marc Phalippou,
Nathalie Risser,
Terunao Soneoka:
Combination of conformance and interoperability testing.
FORTE 1992: 397-412 |
| 5 | EE | Terunao Soneoka:
Super Edge-Connectivity of Dense Digraphs and Graphs.
Discrete Applied Mathematics 37/38: 511-523 (1992) |
| 1991 |
|---|
| 4 | | Noriyasu Arakawa,
Terunao Soneoka:
A Test Case Generation Method for Concurrent Programs.
Protocol Test Systems 1991: 95-106 |
| 1990 |
|---|
| 3 | EE | Terunao Soneoka,
Hiroshi Nakada,
Makoto Imase:
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter.
Discrete Applied Mathematics 27(3): 255-265 (1990) |
| 1987 |
|---|
| 2 | EE | Terunao Soneoka,
Hiroshi Nakada,
Makoto Imase,
Claudine Peyrat:
Sufficient conditions for maximally connected dense graphs.
Discrete Mathematics 63(1): 53-66 (1987) |
| 1985 |
|---|
| 1 | | Makoto Imase,
Terunao Soneoka,
Keiji Okada:
Connectivity of Regular Directed Graphs with Small Diameters.
IEEE Trans. Computers 34(3): 267-273 (1985) |
