田岡 智志Satoshi Taoka

Last Updated :2024/07/05

所属・職名
大学院先進理工系科学研究科　助教
メールアドレス
satoshihiroshima-u.ac.jp

基本情報

学位

  • 博士（工学）　(広島大学)
  • 修士（工学）　(広島大学)

研究分野

  • 情報学 / 情報学基礎 / 情報学基礎理論

教育活動

授業担当

  1. 2024年, 学部専門, ２ターム, プログラミングI
  2. 2024年, 学部専門, ３ターム, プログラミングII
  3. 2024年, 学部専門, １ターム, プログラミングIII
  4. 2024年, 学部専門, 通年, 卒業論文
  5. 2024年, 修士課程・博士課程前期, １ターム, 電気システム制御特別演習Ａ
  6. 2024年, 修士課程・博士課程前期, ２ターム, 電気システム制御特別演習Ａ
  7. 2024年, 修士課程・博士課程前期, ３ターム, 電気システム制御特別演習Ｂ
  8. 2024年, 修士課程・博士課程前期, ４ターム, 電気システム制御特別演習Ｂ
  9. 2024年, 修士課程・博士課程前期, 年度, 電気システム制御特別研究

研究活動

学術論文（★は代表的な論文）

  1. Performance comparison of algorithms for the dynamic shortest path problem, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A巻, 4号, pp. 847-856, 200704
    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号, pp. 1140-1149, 200804
    DOIを用いた論文検索結果へのリンク
  3. Enhanced approximation algorithms for maximum weight matchings of graphs, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A巻, 4号, pp. 1129-1139, 200804
    DOIを用いた論文検索結果へのリンク
  4. Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A巻, 11号, pp. 2707-2716, 200911
    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号, pp. 2732-2744, 200911
    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号, pp. 1833-1841, 201109
    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. 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. 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. 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. pp. 3218 - 3223, 20001001
  12. The (σ +1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph, Lecture Notes in Computer Science 1872= Theoretical Computer Science= Springer-Verlag= Berlin, pp. pp. 169 - 185, 20000801
  13. k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity, IEEE International Symposium on Circuit and Systems(ISCAS’99), pp. pp. IV-601 - IV-604, 20000501
  14. On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure, IEICE Trans. Fundamentals, Vol. E83-A巻, No. 3号, pp. pp. 480 - 486, 20000301
  15. 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. pp. III-893 - III-898, 19991001
  16. 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. pp. I-866-I-871, 19991001
  17. 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. pp. 217 - 225, 19940801
  18. Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph, Proc. 1993 IEEE International Symposium on Circuits and Systems, pp. pp. 2311 - 2314, 19930501
  19. Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph, Proc. 1993 IEEE International Symposium on Circuits and Systems, pp. pp. 2556 - 2559, 19930501
  20. 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. pp. 31 - 40, 19921201
  21. Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets, IEICE Trans. Fundamentals, E84-A巻, 3号, pp. 771-780, 20010301
  22. Experimental evaluation of two algorithms for computing Petri net invariants, IEICE Trans. Fundamentals, E84-A巻, 11号, pp. 2871-2880, 20011101
  23. Extracting Minimal Siphon-traps of Petri Nets and its Application to Computing Nonnegative Integer-Invariants, IEICE Trans. Fundamentals, E85-A巻, 11号, pp. 2436-2446, 20021101
  24. A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph, IEICE Trans. Fundamentals, E86-A巻, 4号, pp. 822-828, 20030401
  25. Performance Comparison of Algorithms for the Dynamic Shortest Path Problem, IEICE Trans. Fundamentals, E90-A巻, 4号, pp. PP. 847-856, 20070401
  26. On the legal firing sequence problem of Petri nets with cactus structure, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E83A巻, 3号, pp. 480-486, 200003
    DOIを用いた論文検索結果へのリンク
  27. 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号, pp. 771-780, 200103
    DOIを用いた論文検索結果へのリンク
  28. Experimental evaluation of two algorithms for computing Petri net invariants, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E84A巻, 11号, pp. 2871-2880, 200111
    DOIを用いた論文検索結果へのリンク
  29. 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号, pp. 2436-2446, 200211
    DOIを用いた論文検索結果へのリンク
  30. Bi-connectivity augmentation for specified vertices of a graph with upper bounds on vertex-degree increase, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D巻, 2号, pp. 751-762, 200602
    DOIを用いた論文検索結果へのリンク
  31. 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号, pp. 954-963, 200504
    DOIを用いた論文検索結果へのリンク
  32. Siphon-trap-based algorithms for efficiently computing Petri net invariants, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A巻, 4号, pp. 964-971, 200504
    DOIを用いた論文検索結果へのリンク
  33. 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号, pp. 1290-1300, 200512
    DOIを用いた論文検索結果へのリンク
  34. Improved heuristic algorithms for minimizing initial markings of Petri nets, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A巻, 11号, pp. 3051-3061, 200511
    DOIを用いた論文検索結果へのリンク
  35. 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号, pp. 1042-1048, 200604
    DOIを用いた論文検索結果へのリンク
  36. Experimental evaluation of maximum-supply partitioning algorithms for demand-supply graphs, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A巻, 4号, pp. 1049-1057, 200604
    DOIを用いた論文検索結果へのリンク
  37. 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号, pp. 3216-3226, 200611
    DOIを用いた論文検索結果へのリンク
  38. A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D巻, 3号, pp. 769-777, 201203
    DOIを用いた論文検索結果へのリンク
  39. 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号, pp. 540-553, 201302
    DOIを用いた論文検索結果へのリンク
  40. 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号, pp. 1331-1339, 201306
    DOIを用いた論文検索結果へのリンク
  41. Web システムによる学生授業評価アンケートの実施方法とその検証, 電子情報通信学会論文誌D, Vol. J97-D巻, No. 5号, pp. 1024-1034, 20140501
  42. 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号, pp. 357-366, 201802
    DOIを用いた論文検索結果へのリンク