Satoshi Taoka

Last Updated :2024/05/07

Affiliations, Positions
Graduate School of Advanced Science and Engineering, Assistant Professor
E-mail
satoshihiroshima-u.ac.jp

Basic Information

Academic Degrees

  • Doctor of Engineering, Hiroshima University
  • Master of Engineering, Hiroshima University

Research Fields

  • Informatics;Principles of Informatics;Theory of informatics

Educational Activity

Course in Charge

  1. 2024, Undergraduate Education, 2Term, Programming I
  2. 2024, Undergraduate Education, 3Term, Programming II
  3. 2024, Undergraduate Education, 1Term, Programming III
  4. 2024, Undergraduate Education, Year, Graduation Thesis
  5. 2024, Graduate Education (Master's Program) , 1Term, Special Exercises on Electrical, Systems, and Control Engineering A
  6. 2024, Graduate Education (Master's Program) , 2Term, Special Exercises on Electrical, Systems, and Control Engineering A
  7. 2024, Graduate Education (Master's Program) , 3Term, Special Exercises on Electrical, Systems, and Control Engineering B
  8. 2024, Graduate Education (Master's Program) , 4Term, Special Exercises on Electrical, Systems, and Control Engineering B
  9. 2024, Graduate Education (Master's Program) , Academic Year, Special Study on Electrical, Systems, and Control Engineering

Research Activities

Academic Papers

  1. Performance comparison of algorithms for the dynamic shortest path problem, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A(4), 847-856, 200704
    Link to Paper Search Results by DOI
  2. Enhancing PC cluster-based parallel branch-and-bound algorithms for the graph coloring problem, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A(4), 1140-1149, 200804
    Link to Paper Search Results by DOI
  3. Enhanced approximation algorithms for maximum weight matchings of graphs, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A(4), 1129-1139, 200804
    Link to Paper Search Results by DOI
  4. Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A(11), 2707-2716, 200911
    Link to Paper Search Results by DOI
  5. Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A(11), 2732-2744, 200911
    Link to Paper Search Results by DOI
  6. The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E94A(9), 1833-1841, 201109
    Link to Paper Search Results by DOI
  7. Experimental evaluation of two algorithms for computing Petri net invariants, IEICE Trans. Fundamentals, Vol. E84-A(No. 11), 20011101
  8. Two efficient methods for computing petri net invariants, Proceedings of the 2006 IEEE International Conference on Systems= Man= and Cybernetics= Taipei, pp. 2717 - 2722, 20011001
  9. Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph by Solving the Independent Set Problem, Proceedings of the 2004 IEEE International Midwest Symposium on Circuits and Systems, pp. V-153 - V-156, 20010501
  10. A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets, IEICE Trans. Fundamentals, Vol. E84-A(No. 3), pp. 771 - 780, 20010301
  11. A New Heuristic Method for Solving the Minimum Initial Marking Problem of Petri Nets, Proceedings of the 2006 IEEE International Conference on Systems= Man= and Cybernetics= Taipei, pp. 3218 - 3223, 20001001
  12. k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity, pp. IV-601 - IV-604, 20000501
  13. On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure, IEICE Trans. Fundamentals, Vol. E83-A(No. 3), pp. 480 - 486, 20000301
  14. A Linear Time Algorithm Solving the Legal Firing Sequence Problem for a Class of Edge-Weighted Cactuses, Proc. 1997 IEEE International Conference on Systems= Man and Cybernetics(SMC), pp. III-893 - III-898, 19991001
  15. A Fast and Space-Saving Algorithm for Computing Invariants of Petri Nets, Proc. 1999 IEEE International Conference on Systems= Man and Cybernetics (SMC 99), pp. I-866-I-871, 19991001
  16. Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph, Lecture Notes in Computer Science 834 ((D-Z Du and X-S Zhang (Eds.)) Algorithms and Computation)= Springer-Verlag= Berlin, pp. 217 - 225, 19940801
  17. Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph, Proc. 1993 IEEE International Symposium on Circuits and Systems, pp. 2311 - 2314, 19930501
  18. Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph, Proc. 1993 IEEE International Symposium on Circuits and Systems, pp. 2556 - 2559, 19930501
  19. The k-Edge-Connectivity Augmentation Problem of Weighted Graphs, Lecture Notes in Computer Science 650= Algorithms and Computation (T.Ibaraki= Y.Inagaki= K.Iwama= T.Nishizeki and M.Yamashita (Eds.))= Springer-Verlag= Berlin, pp. 31 - 40, 19921201
  20. Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets, IEICE Trans. Fundamentals, E84-A(3), 771-780, 20010301
  21. Experimental evaluation of two algorithms for computing Petri net invariants, IEICE Trans. Fundamentals, E84-A(11), 2871-2880, 20011101
  22. Extracting Minimal Siphon-traps of Petri Nets and its Application to Computing Nonnegative Integer-Invariants, IEICE Trans. Fundamentals, E85-A(11), 2436-2446, 20021101
  23. A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph, IEICE Trans. Fundamentals, E86-A(4), 822-828, 20030401
  24. Performance Comparison of Algorithms for the Dynamic Shortest Path Problem, IEICE Trans. Fundamentals, E90-A(4), PP. 847-856, 20070401
  25. On the legal firing sequence problem of Petri nets with cactus structure, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E83A(3), 480-486, 200003
    Link to Paper Search Results by DOI
  26. A heuristic algorithm FMDB for the minimum initial marking problem of Petri nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E84A(3), 771-780, 200103
    Link to Paper Search Results by DOI
  27. Experimental evaluation of two algorithms for computing Petri net invariants, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E84A(11), 2871-2880, 200111
    Link to Paper Search Results by DOI
  28. Extracting minimal siphon-traps of Petri nets and its application to computing nonnegative integer-invariants, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E85A(11), 2436-2446, 200211
    Link to Paper Search Results by DOI
  29. Bi-connectivity augmentation for specified vertices of a graph with upper bounds on vertex-degree increase, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D(2), 751-762, 200602
    Link to Paper Search Results by DOI
  30. A linear time algorithm for bi-connectivity augmentation of graphs with upper bounds on vertex-degree increase, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A(4), 954-963, 200504
    Link to Paper Search Results by DOI
  31. Siphon-trap-based algorithms for efficiently computing Petri net invariants, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A(4), 964-971, 200504
    Link to Paper Search Results by DOI
  32. A 2-approximation algorithm to (k+1)-edge-connect a specified set of vertices in a k-edge-connected graph, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A(5), 1290-1300, 200512
    Link to Paper Search Results by DOI
  33. Improved heuristic algorithms for minimizing initial markings of Petri nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A(11), 3051-3061, 200511
    Link to Paper Search Results by DOI
  34. On minimum k-edge-connectivity augmentation for specified vertices of a graph with upper bounds on vertex-degree, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A(4), 1042-1048, 200604
    Link to Paper Search Results by DOI
  35. Experimental evaluation of maximum-supply partitioning algorithms for demand-supply graphs, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A(4), 1049-1057, 200604
    Link to Paper Search Results by DOI
  36. Time complexity analysis of the legal firing sequence problem of Petri nets with inhibitor arcs, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A(11), 3216-3226, 200611
    Link to Paper Search Results by DOI
  37. A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D(3), 769-777, 201203
    Link to Paper Search Results by DOI
  38. Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A(2), 540-553, 201302
    Link to Paper Search Results by DOI
  39. Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A(6), 1331-1339, 201306
    Link to Paper Search Results by DOI
  40. A Web-Based Questionnaire and Its Evaluation of Class-Assessment-by-Students, Vol. J97-D(No. 5), 1024-1034, 20140501
  41. Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E101A(2), 357-366, 201802
    Link to Paper Search Results by DOI