[J18b] Naoki Takeuchi, Satoshi Fujita, Semi-Deterministic Construction of Scale-Free Networks with Designated Parameters. Journal of Interconnection Networks 18(1): 1-18 (2018).

[J16] Satoshi Fujita, On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs. Int. J. Found. Comput. Sci. 27(7): 829-844 (2016).

[J14] Satoshi Fujita, Worst Case Analysis of Approximation Algorithm of Abrams et al. for the Set k-Cover Problem. IEICE Trans. Information and Systems, 97-D(3): 399-405 (2014).

[J11] Satoshi Fujita, A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques. IEEE Trans. Computers 60(7): 1006-1016 (2011).

[J10a] Satoshi Fujita, A tight bound on the number of mobile servers to guarantee transferability among dominating configurations. Discrete Applied Mathematics 158(8): 913-920 (2010).

[J10b] Satoshi Fujita, Loose Cover of Graphs. Mathematics in Computer Science 3(1): 31-38 (2010).

[J10c] Satoshi Fujita, Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs. Networks 56(2): 149-157 (2010).

[J09] Satoshi Fujita, Semi-Dynamic Multiprocessor Scheduling with an Asymptotically Optimal Performance Ratio, IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, vol. E92-A, no. 8, pp. 1764-1770, August 2009.

[J04a] Masaya Mito, Satoshi Fujita, On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions. J. Heuristics 10(5): 507-523 (2004).

[J04b] Satoshi Fujita, Time-Efficient Multicast to Local Vertices in Star Interconnection Networks under the Single-Port Model. IEICE Trans. Information and Systems, 87-D(2): 315-321 (2004).

[J03a] Satoshi Fujita, Arthur M. Farley, Sparse Hypercube - Minimal k-line Broadcast Graph. Discrete Applied Mathematics 127(3): 431-446 (2003).

[J03b] Satoshi Fujita, On-line grid-packing with a single active grid. Inf. Process. Lett. 85(4): 199-204 (2003).

[J03c] Satoshi Fujita, Optimal Neighborhood Broadcast in Star Graphs. Journal of Interconnection Networks 4(4): 419-428 (2003).

[J03d] Satoshi Fujita, A Greedy Multicast Algorithm in k-Ary n-Cubes and Its Worst Case Analysis, IEICE Trans. Information and Systems, vol. E86-D, no. 2, pp. 238-245, February 2003.

[J02] Satoshi Fujita, Takeshi Hada, Two-dimensional on-line bin packing problem with rotatable items. Theor. Comput. Sci. 289(2): 939-952 (2002).

[J00a] Satoshi Fujita, Masafumi Yamashita, Tiko Kameda, A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discrete Math. 13(2): 227-254 (2000).

[J00b] Satoshi Fujita, Neighborhood Information Dissemination in the Star Graph. IEEE Trans. Computers 49(12): 1366-1370 (2000).

[J99] Satoshi Fujita, A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model. IEEE Trans. Computers 48(10): 1123-1126 (1999).

[J98a] Satoshi Fujita, A Quorum Based k-Mutual Exclusion by Weighted k-Quorum Systems. Inf. Process. Lett. 67(4): 191-197 (1998).

[J98b] Satoshi Fujita, Stephane Perennes, Joseph G. Peters, Neighbourhood Gossiping in Hypercubes. Parallel Processing Letters 8(2): 189-195 (1998).

[J97] Satoshi Fujita, Arthur M. Farley, Minimum-cost Line Broadcast in Paths. Discrete Applied Mathematics 75(3): 255-268 (1997).

[J96a] Satoshi Fujita, Masafumi Yamashita, A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. J. Parallel Distrib. Comput. 34(1): 111-116 (1996).

[J96b] Satoshi Fujita, Masafumi Yamashita, Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. SIAM J. Comput. 25(5): 1045-1060 (1996).

[J96c] Satoshi Fujita, Masafumi Yamashita, Fast Gossiping on Mesh-Bus Computers. IEEE Trans. Computers 45(11): 1326-1330 (1996).

[J95] Satoshi Fujita, A Note on the Size of a Multicast Tree in Hypercubes. Inf. Process. Lett. 54(4): 223-227 (1995).

[J93a] Satoshi Fujita, Masafumi Yamashita, Fast Gossiping on Square Mesh Computers. Inf. Process. Lett. 48(3): 127-130 (1993).

[C14a] Satoshi Fujita, On Vertex Cover with Fractional Fan-Out Bound. CANDAR 2014: 68-75.

[C14b] Satoshi Fujita, Minimum Set Cover of Sparsely Distributed Sensor Nodes by a Collection of Unit Disks. IPDPS Workshops 2014: 755-761.

[C13] Satoshi Fujita, On Oriented Diameter of Star Graphs. CANDAR 2013: 48-56.

[C08a] Masaya Mito, Satoshi Fujita, Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction. COCOON 2008: 425-433.

[C08b] Satoshi Fujita, Vertex Domination in Dynamic Networks. WALCOM 2008: 1-12.