Satoshi Taoka

According to our database, Satoshi Taoka authored at least 43 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Target Voltage Control Approach for Active Distribution System Based on PV Active and Reactive Powers Nodal Prices.

Ahmed Bedawy, Kubo Ryuta, Naoto Yorino, Yoshifumi Zoka, Yutaka Sasaki, Satoshi Taoka

Proceedings of the International Symposium on Devices, Circuits and Systems, 2023

2019

Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph.

Satoshi Taoka, Toshimasa Watanabe

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

2018

Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One.

Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe

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

2013

Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs.

Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe

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

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets.

Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe

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

2012

A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints.

Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe

IEICE Trans. Inf. Syst., 2012

Performance comparison of approximation algorithms for the minimum weight vertex cover problem.

Satoshi Taoka, Toshimasa Watanabe

Proceedings of the 2012 IEEE International Symposium on Circuits and Systems, 2012

2011

The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms.

Satoshi Taoka, Toshimasa Watanabe

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

2010

Foreword.

Satoshi Taoka

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

Heuristic algorithms for the marking construction problem of Petri nets.

Satoshi Taoka, Toshimasa Watanabe

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2010), May 30, 2010

A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints.

Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the First International Conference on Networking and Computing, 2010

2009

Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets.

Toshimasa Watanabe, Satoshi Taoka

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

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets.

Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe

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

Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree.

Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

2008

Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem.

Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe

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

Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs.

Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe

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

2007

Performance Comparison of Algorithms for the Dynamic Shortest Path Problem.

Satoshi Taoka, Daisuke Takafuji, Takashi Iguchi, Toshimasa Watanabe

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

2006

Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs.

Satoshi Taoka, Kazuya Watanabe, Toshimasa Watanabe

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

Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs.

Satoshi Taoka, Toshimasa Watanabe

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

On Minimum <i>k</i>-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree.

Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe

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

Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase.

Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe

IEICE Trans. Inf. Syst., 2006

An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets.

Satoru Shimada, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

2005

Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets.

Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe

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

Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants.

Akihiro Taguchi, Atsushi Iriboshi, Satoshi Taoka, Toshimasa Watanabe

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

A 2-Approximation Algorithm to (<i>k</i> + 1)-Edge-Connect a Specified Set of Vertices in a <i>k</i>-Edge-Connected Graph.

Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe

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

A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase.

Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe

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

Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph.

Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree.

Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2003

A 2-Approximation Algorithm 2-<i>ABIS</i> for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph.

Makoto Tamura, Satoshi Taoka, Toshimasa Watanabe

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

A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph.

Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants.

Akihiro Taguchi, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets.

Satoshi Taoka, Shinji Furusato, Toshimasa Watanabe

Proceedings of the Applications and Theory of Petri Nets 2003, 2003

2002

Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants.

Satoshi Taoka, Katsushi Takano, Toshimasa Watanabe

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

Efficient approximation algorithms for the maximum weight matching problem.

Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

2001

Two efficient methods for computing Petri net invariants.

Katsishi Takano, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe

Proceedings of the IEEE International Conference on Systems, 2001

Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem.

Tsutomu Yamaoki, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the 2001 International Symposium on Circuits and Systems, 2001

2000

A new heuristic method for solving the minimum initial marking problem of Petri nets.

Shin'ichiro Nishi, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the IEEE International Conference on Systems, 2000

k-edge-connectivity augmentation problem with upper bounds on edge multiplicity.

Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the IEEE International Symposium on Circuits and Systems, 2000

The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph.

Satoshi Taoka, Toshimasa Watanabe

Proceedings of the Theoretical Computer Science, 2000

1994

Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph.

Satoshi Taoka, Toshimasa Watanabe

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph.

Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph.

Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

1992

The k-Edge-Connectivity Augmentation Problem of Weighted Graphs.

Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka

Proceedings of the Algorithms and Computation, Third International Symposium, 1992