A 2or3-Approximation of the Matroid Matching Problem. - Toshihiro Fujito (ISAAC, 1993)

Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. - Vineet Bafna; Piotr Berman; Toshihiro Fujito (ISAAC, 1995)

On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. - Piotr Berman; Toshihiro Fujito (WADS, 1995)

A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract). - Toshihiro Fujito (ESA, 1996)

A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach. - Toshihiro Fujito (Inf. Process. Lett., 1996)

A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties. - Toshihiro Fujito (ICALP, 1997)

A Unified Approximation Algorithm for Node-deletion Problems. - Toshihiro Fujito (Discret. Appl. Math., 1998)

Approximating Node-Deletion Problems for Matroidal Properties. - Toshihiro Fujito (J. Algorithms, 1999)

On Approximation Properties of the Independent Set Problem for Low Degree Graphs. - Piotr Berman; Toshihiro Fujito (Theory Comput. Syst., 1999)

On approximation of the submodular set cover problem. - Toshihiro Fujito (Oper. Res. Lett., 1999)

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. - Vineet Bafna; Piotr Berman; Toshihiro Fujito (SIAM J. Discret. Math., 1999)

A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. - Robert D. Carr; Toshihiro Fujito; Goran Konjevod; Ojas Parekh (ESA, 2000)

Approximating minimum feedback vertex sets in hypergraphs. - Toshihiro Fujito (Theor. Comput. Sci., 2000)

A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. - Toshihiro Fujito; Tsuyoshi Okumura (ISAAC, 2001)

On approximability of the independent/connected edge dominating set problems. - Toshihiro Fujito (Inf. Process. Lett., 2001)

A 2 frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. - Robert D. Carr; Toshihiro Fujito; Goran Konjevod; Ojas Parekh (J. Comb. Optim., 2001)

A 2-approximation algorithm for the minimum weight edge dominating set problem. - Toshihiro Fujito; Hiroshi Nagamochi (Discret. Appl. Math., 2002)

Approximating Polymatroid Packing and Covering. - Toshihiro Fujito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Submodular Integer Cover and Its Application to Production Planning. - Toshihiro Fujito; Takatoshi Yabuta (WAOA, 2004)

A 2-approximation NC algorithm for connected vertex cover and tree cover. - Toshihiro Fujito; Takashi Doi (Inf. Process. Lett., 2004)

On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. - Toshihiro Fujito (J. Comb. Optim., 2004)

A Better-Than-Greedy Algorithm for k-Set Multicover. - Toshihiro Fujito; Hidekazu Kurahashi (WAOA, 2005)

How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. - Toshihiro Fujito (ICALP (1), 2006)

A modified greedy algorithm for dispersively weighted 3-set cover. - Toshihiro Fujito; Tsuyoshi Okumura (Discret. Appl. Math., 2006)

A primal-dual method for approximating tree cover with two weights. - Takashi Doi; Toshihiro Fujito (Discret. Optim., 2006)

Foreword. - Toshihiro Fujito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

On the Best Possible Competitive Ratio for Multislope Ski Rental. - Hiroshi Fujiwara; Takuma Kitano; Toshihiro Fujito (ISAAC, 2011)

How to guard a graph against tree movements. - Toshihiro Fujito; Takayoshi Sakamaki (CATS, 2012)

How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover. - Toshihiro Fujito (ACM Trans. Algorithms, 2012)

How to guard a graph against tree moves. - Toshihiro Fujito; Takayoshi Sakamaki (Inf. Process. Lett., 2013)

On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem. - Toshihiro Fujito (SWAT, 2014)

Analysis of Lower Bounds for the Multislope Ski-Rental Problem. - Hiroshi Fujiwara; Yasuhiro Konno; Toshihiro Fujito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

On the Eternal Vertex Cover Numbers of Generalized Trees. - Hisashi Araki; Toshihiro Fujito; Shota Inoue (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

The Huffman Tree Problem with Unit Step Functions. - Hiroshi Fujiwara; Takuya Nakamura; Toshihiro Fujito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers. - Toshihiro Fujito; Daichi Suzuki (WALCOM, 2016)

Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. - Tomoya Hibi; Toshihiro Fujito (Algorithmica, 2016)

Competitive Analysis for the Flat-Rate Problem. - Hiroshi Fujiwara; Atsushi Matsuda; Toshihiro Fujito (IEICE Trans. Inf. Syst., 2016)

Online Weight Balancing on the Unit Circle. - Hiroshi Fujiwara; Takahiro Seki; Toshihiro Fujito (IEICE Trans. Inf. Syst., 2016)

Competitive Analysis for the 3-Slope Ski-Rental Problem with the Discount Rate. - Hiroshi Fujiwara; Shunsuke Satou; Toshihiro Fujito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

On the best possible competitive ratio for the multislope ski-rental problem. - Hiroshi Fujiwara; Takuma Kitano; Toshihiro Fujito (J. Comb. Optim., 2016)

Approximating Bounded Degree Deletion via Matroid Matching. - Toshihiro Fujito (CIAC, 2017)

On Approximability of Connected Path Vertex Cover. - Toshihiro Fujito (WAOA, 2017)

The Fewest Clues Problem of Picross 3D. - Kei Kimura; Takuya Kamehashi; Toshihiro Fujito (FUN, 2018)

On Approximating (Connected) 2-Edge Dominating Set by a Tree. - Toshihiro Fujito; Tomoaki Shimoda (Theory Comput. Syst., 2018)

Approximating Partially Bounded Degree Deletion on Directed Graphs. - Toshihiro Fujito; Kei Kimura; Yuki Mizuno (J. Graph Algorithms Appl., 2019)

Eternal Connected Vertex Cover Problem. - Toshihiro Fujito; Tomoya Nakamura (TAMC, 2020)

On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem. - Toshihiro Fujito; Takumi Tatematsu (WAOA, 2021)

Approximating Power Node-Deletion Problems. - Toshihiro Fujito; Kneto Mukae; Junya Tsuzuki (CIAC, 2023)

A note on approximations of directed edge dominating set. - Toshihiro Fujito (Inf. Process. Lett., 2023)

Approximating power node-deletion problems. - Toshihiro Fujito; Kento Mukae; Junya Tsuzuki (Theor. Comput. Sci., 2024)