Satoshi Taoka

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 3

Top Topics

Strongly Connected

Approximation Algorithms

Top Venues

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

Publications

Ahmed Bedawy, Kubo Ryuta, Naoto Yorino, Yoshifumi Zoka, Yutaka Sasaki, Satoshi Taoka
Target Voltage Control Approach for Active Distribution System Based on PV Active and Reactive Powers Nodal Prices. ISDCS (2023)
Satoshi Taoka, Toshimasa Watanabe
Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2019)
Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe
Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2018)
Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2013)
Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe
Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2013)
Satoshi Taoka, Toshimasa Watanabe
Performance comparison of approximation algorithms for the minimum weight vertex cover problem. ISCAS (2012)
Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. IEICE Trans. Inf. Syst. (3) (2012)
Satoshi Taoka, Toshimasa Watanabe
The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2011)
Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints. ICNC (2010)
Satoshi Taoka, Toshimasa Watanabe
Heuristic algorithms for the marking construction problem of Petri nets. ISCAS (2010)
Satoshi Taoka
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2010)
Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2009)
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. ISCAS (2009)
Toshimasa Watanabe, Satoshi Taoka
Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2009)
Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2008)
Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe
Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2008)
Satoshi Taoka, Daisuke Takafuji, Takashi Iguchi, Toshimasa Watanabe
Performance Comparison of Algorithms for the Dynamic Shortest Path Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2007)
Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase. IEICE Trans. Inf. Syst. (2) (2006)
Satoshi Taoka, Kazuya Watanabe, Toshimasa Watanabe
Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2006)
Satoru Shimada, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. ISCAS (2006)
Satoshi Taoka, Toshimasa Watanabe
Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2006)
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2006)
Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2005)
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
-Edge-Connected Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2005)
Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2005)
Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. ISCAS (1) (2005)
Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. ISCAS (3) (2005)
Akihiro Taguchi, Atsushi Iriboshi, Satoshi Taoka, Toshimasa Watanabe
Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2005)
Akihiro Taguchi, Satoshi Taoka, Toshimasa Watanabe
An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants. ISCAS (3) (2003)
Satoshi Taoka, Shinji Furusato, Toshimasa Watanabe
A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets. ICATPN (2003)
Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe
A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph. ISCAS (3) (2003)
Makoto Tamura, Satoshi Taoka, Toshimasa Watanabe
for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2003)
Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe
Efficient approximation algorithms for the maximum weight matching problem. ISCAS (4) (2002)
Satoshi Taoka, Katsushi Takano, Toshimasa Watanabe
Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2002)
Katsishi Takano, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
Two efficient methods for computing Petri net invariants. SMC (2001)
Tsutomu Yamaoki, Satoshi Taoka, Toshimasa Watanabe
Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem. ISCAS (5) (2001)
Shin'ichiro Nishi, Satoshi Taoka, Toshimasa Watanabe
A new heuristic method for solving the minimum initial marking problem of Petri nets. SMC (2000)
Satoshi Taoka, Toshimasa Watanabe
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. IFIP TCS (2000)
Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe
k-edge-connectivity augmentation problem with upper bounds on edge multiplicity. ISCAS (2000)
Satoshi Taoka, Toshimasa Watanabe
Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. ISAAC (1994)
Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. ISCAS (1993)
Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. ISCAS (1993)
Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. ISAAC (1992)