default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoshi Taoka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c21]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: 1-5
2010 – 2019
- 2019
- [j22]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. 102-A(2): 379-388 (2019) - 2018
- [j21]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. 101-A(2): 357-366 (2018) - 2013
- [j20]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. 96-A(2): 540-553 (2013) - [j19]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. 96-A(6): 1331-1339 (2013) - 2012
- [j18]Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe:
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. IEICE Trans. Inf. Syst. 95-D(3): 769-777 (2012) - [c20]Satoshi Taoka, Toshimasa Watanabe:
Performance comparison of approximation algorithms for the minimum weight vertex cover problem. ISCAS 2012: 632-635 - 2011
- [j17]Satoshi Taoka, Toshimasa Watanabe:
The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(9): 1833-1841 (2011) - 2010
- [j16]Satoshi Taoka:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(12): 2708 (2010) - [c19]Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe:
A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints. ICNC 2010: 227-231 - [c18]Satoshi Taoka, Toshimasa Watanabe:
Heuristic algorithms for the marking construction problem of Petri nets. ISCAS 2010: 1344-1347
2000 – 2009
- 2009
- [j15]Toshimasa Watanabe, Satoshi Taoka:
Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(11): 2707-2716 (2009) - [j14]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. 92-A(11): 2732-2744 (2009) - [c17]Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. ISCAS 2009: 2934-2937 - 2008
- [j13]Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe:
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(4): 1129-1139 (2008) - [j12]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. 91-A(4): 1140-1149 (2008) - 2007
- [j11]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. 90-A(4): 847-856 (2007) - 2006
- [j10]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. 89-D(2): 751-762 (2006) - [j9]Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(4): 1042-1048 (2006) - [j8]Satoshi Taoka, Kazuya Watanabe, Toshimasa Watanabe:
Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(4): 1049-1057 (2006) - [j7]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. 89-A(11): 3216-3226 (2006) - [c16]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 - 2005
- [j6]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. 88-A(4): 954-963 (2005) - [j5]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. 88-A(4): 964-971 (2005) - [j4]Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1290-1300 (2005) - [j3]Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(11): 3051-3061 (2005) - [c15]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: 752-755 - [c14]Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima:
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. ISCAS (3) 2005: 2231-2234 - 2003
- [j2]Makoto Tamura, Satoshi Taoka, Toshimasa Watanabe:
A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 822-828 (2003) - [c13]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: 417-439 - [c12]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: 172-175 - [c11]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: 236-239 - 2002
- [j1]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. 85-A(11): 2436-2446 (2002) - [c10]Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe:
Efficient approximation algorithms for the maximum weight matching problem. ISCAS (4) 2002: 457-460 - 2001
- [c9]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: 153-156 - [c8]Katsishi Takano, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
Two efficient methods for computing Petri net invariants. SMC 2001: 2717-2722 - 2000
- [c7]Satoshi Taoka, Toshimasa Watanabe:
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. IFIP TCS 2000: 169-185 - [c6]Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe:
k-edge-connectivity augmentation problem with upper bounds on edge multiplicity. ISCAS 2000: 601-604 - [c5]Shin'ichiro Nishi, Satoshi Taoka, Toshimasa Watanabe:
A new heuristic method for solving the minimum initial marking problem of Petri nets. SMC 2000: 3218-3223
1990 – 1999
- 1994
- [c4]Satoshi Taoka, Toshimasa Watanabe:
Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. ISAAC 1994: 217-225 - 1993
- [c3]Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima:
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. ISCAS 1993: 2311-2314 - [c2]Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka:
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. ISCAS 1993: 2556-2559 - 1992
- [c1]Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka:
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. ISAAC 1992: 31-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
