Toshimasa Watanabe
According to our database1,
Toshimasa Watanabe
authored at least 65 papers
between 1977 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2019
Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph.
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.
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.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
2012
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints.
IEICE Trans. Inf. Syst., 2012
Performance comparison of approximation algorithms for the minimum weight vertex cover problem.
Proceedings of the 2012 IEEE International Symposium on Circuits and Systems, 2012
Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems.
Proceedings of the Third International Conference on Networking and Computing, 2012
2011
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
2010
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.
Proceedings of the First International Conference on Networking and Computing, 2010
2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree.
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.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
2007
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
2006
Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs.
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.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase.
IEICE Trans. Inf. Syst., 2006
An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006
2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
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.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
IEICE Trans. Inf. Syst., 2005
IEICE Trans. Inf. Syst., 2005
A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005
Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles.
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.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005
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.
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.
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.
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.
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.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
Proceedings of the 2002 International Symposium on Circuits and Systems, 2002
2001
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.
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.
Proceedings of the IEEE International Conference on Systems, 2000
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.
Proceedings of the Theoretical Computer Science, 2000
1999
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999
1998
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998
1997
Proceedings of the ASP-DAC '97 Asia and South Pacific Design Automation Conference, 1997
1995
Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995
1994
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993
Proceedings of the Application and Theory of Petri Nets 1993, 1993
1992
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
1991
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models, 1991
1990
Proceedings of the Algorithms, 1990
1989
Proceedings of the Third International Workshop on Petri Nets and Performance Models, 1989
FEM-TORUS: token driven processor torus array functional simulation and performance evaluation - for processing of finite-element-method matrices.
Proceedings of the 3rd international conference on Supercomputing, 1989
1987
1983
Discret. Appl. Math., 1983
1981
Discret. Appl. Math., 1981
1977