• 77 Citations
  • 5 h-Index
1985 …2019
If you made any changes in Pure these will be visible here soon.

Research Output 1985 2019

  • 77 Citations
  • 5 h-Index
  • 50 Article
  • 5 Conference contribution
Filter
Conference contribution
2019

The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver

Jinbo, S. & Maruoka, A., Jan 1 2019, WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. Nakano, S., Das, G. K., Mandal, P. S. & Mukhopadhyaya, K. (eds.). Springer Verlag, p. 199-208 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11355 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Integer programming
Integer Programming
Complete Graph
Odd
Upper bound
2015

The NP-completeness of Eulerian Recurrent Length for 4-regular Eulerian Graphs

Jinbo, S., Dec 9 2015, Proceedings - 2014 4th International Conference on Artificial Intelligence with Applications in Engineering and Technology, ICAIET 2014. Institute of Electrical and Electronics Engineers Inc., p. 155-159 5 p. 7351828

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Graph theory
Networks (circuits)
Operations research
Computer science
Artificial intelligence
2014
3 Citations (Scopus)

On the Eulerian recurrent lengths of complete bipartite graphs and complete graphs

Jinbo, S., 2014, IOP Conference Series: Materials Science and Engineering. 1 ed. Institute of Physics Publishing, Vol. 58. 012019

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Networks (circuits)
1992
1 Citation (Scopus)

Selection networks with 8n log2n size and O(log n) depth

Jinbo, S. & Maruoka, A., 1992, Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. Springer Verlag, Vol. 650 LNCS. p. 165-174 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 650 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Selector
Expander
Classify
Arbitrary
Class
1985
6 Citations (Scopus)

EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS.

Jinbo, S. & Maruoka, A., 1985, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), p. 88-97 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Linear algebra