default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToshihiro Fujito
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Toshihiro Fujito, Kento Mukae, Junya Tsuzuki:
Approximating power node-deletion problems. Theor. Comput. Sci. 1012: 114733 (2024)- 2023
- [j30]Toshihiro Fujito
:
A note on approximations of directed edge dominating set. Inf. Process. Lett. 179: 106303 (2023) - [c26]Toshihiro Fujito, Kneto Mukae, Junya Tsuzuki:
Approximating Power Node-Deletion Problems. CIAC 2023: 217-231 - 2021
- [c25]Toshihiro Fujito, Takumi Tatematsu:
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem. WAOA 2021: 65-79 - 2020
- [c24]Toshihiro Fujito, Tomoya Nakamura:
Eternal Connected Vertex Cover Problem. TAMC 2020: 181-192
2010 – 2019
- 2019
- [j29]Toshihiro Fujito, Kei Kimura, Yuki Mizuno:
Approximating Partially Bounded Degree Deletion on Directed Graphs. J. Graph Algorithms Appl. 23(5): 759-780 (2019) - 2018
- [j28]Toshihiro Fujito, Tomoaki Shimoda:
On Approximating (Connected) 2-Edge Dominating Set by a Tree. Theory Comput. Syst. 62(3): 533-556 (2018) - [c23]Kei Kimura, Takuya Kamehashi, Toshihiro Fujito:
The Fewest Clues Problem of Picross 3D. FUN 2018: 25:1-25:13 - [c22]Toshihiro Fujito, Kei Kimura, Yuki Mizuno:
Approximating Partially Bounded Degree Deletion on Directed Graphs. WALCOM 2018: 32-43 - 2017
- [c21]Toshihiro Fujito:
Approximating Bounded Degree Deletion via Matroid Matching. CIAC 2017: 234-246 - [c20]Toshihiro Fujito:
On Approximability of Connected Path Vertex Cover. WAOA 2017: 17-25 - 2016
- [j27]Tomoya Hibi, Toshihiro Fujito:
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. Algorithmica 74(2): 778-786 (2016) - [j26]Hiroshi Fujiwara, Atsushi Matsuda, Toshihiro Fujito:
Competitive Analysis for the Flat-Rate Problem. IEICE Trans. Inf. Syst. 99-D(3): 559-566 (2016) - [j25]Hiroshi Fujiwara, Takahiro Seki, Toshihiro Fujito:
Online Weight Balancing on the Unit Circle. IEICE Trans. Inf. Syst. 99-D(3): 567-574 (2016) - [j24]Hiroshi Fujiwara, Shunsuke Satou, Toshihiro Fujito:
Competitive Analysis for the 3-Slope Ski-Rental Problem with the Discount Rate. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1075-1083 (2016) - [j23]Hiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito:
On the best possible competitive ratio for the multislope ski-rental problem. J. Comb. Optim. 31(2): 463-490 (2016) - [c19]Toshihiro Fujito, Tomoaki Shimoda:
On Approximating (Connected) 2-Edge Dominating Set by a Tree. CSR 2016: 161-176 - [c18]Toshihiro Fujito, Daichi Suzuki:
Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers. WALCOM 2016: 251-262 - 2015
- [j22]Hisashi Araki, Toshihiro Fujito, Shota Inoue:
On the Eternal Vertex Cover Numbers of Generalized Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1153-1160 (2015) - [j21]Hiroshi Fujiwara, Takuya Nakamura, Toshihiro Fujito:
The Huffman Tree Problem with Unit Step Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1189-1196 (2015) - 2014
- [j20]Hiroshi Fujiwara, Yasuhiro Konno, Toshihiro Fujito:
Analysis of Lower Bounds for the Multislope Ski-Rental Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1200-1205 (2014) - [c17]Toshihiro Fujito:
On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem. SWAT 2014: 206-216 - 2013
- [j19]Toshihiro Fujito, Takayoshi Sakamaki:
How to guard a graph against tree moves. Inf. Process. Lett. 113(19-21): 844-847 (2013) - [c16]Hiroshi Fujiwara, Takahiro Seki, Toshihiro Fujito:
Online Weight Balancing on the Unit Circle. JCDCGG 2013: 65-76 - 2012
- [j18]Toshihiro Fujito:
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover. ACM Trans. Algorithms 8(2): 16:1-16:11 (2012) - [c15]Toshihiro Fujito, Takayoshi Sakamaki:
How to guard a graph against tree movements. CATS 2012: 93-96 - [c14]Tomoya Hibi, Toshihiro Fujito:
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. WG 2012: 215-224 - 2011
- [c13]Hiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito:
On the Best Possible Competitive Ratio for Multislope Ski Rental. ISAAC 2011: 544-553
2000 – 2009
- 2009
- [j17]Toshihiro Fujito:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1749 (2009) - 2006
- [j16]Toshihiro Fujito, Tsuyoshi Okumura:
A modified greedy algorithm for dispersively weighted 3-set cover. Discret. Appl. Math. 154(9): 1392-1400 (2006) - [j15]Takashi Doi, Toshihiro Fujito:
A primal-dual method for approximating tree cover with two weights. Discret. Optim. 3(3): 230-237 (2006) - [c12]Toshihiro Fujito:
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. ICALP (1) 2006: 431-442 - 2005
- [c11]Toshihiro Fujito, Hidekazu Kurahashi:
A Better-Than-Greedy Algorithm for k-Set Multicover. WAOA 2005: 176-189 - 2004
- [j14]Takashi Doi, Toshihiro Fujito:
A Primal-Dual Method for Approximating Tree Cover with Two Weights. Electron. Notes Discret. Math. 17: 135-140 (2004) - [j13]Toshihiro Fujito, Takashi Doi:
A 2-approximation NC algorithm for connected vertex cover and tree cover. Inf. Process. Lett. 90(2): 59-63 (2004) - [j12]Toshihiro Fujito:
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. J. Comb. Optim. 8(4): 439-452 (2004) - [c10]Takashi Doi, Toshihiro Fujito:
A Primal-Dual Method for Approximating Tree Cover with Two Weights. CTW 2004: 119-123 - [c9]Toshihiro Fujito, Takatoshi Yabuta:
Submodular Integer Cover and Its Application to Production Planning. WAOA 2004: 154-166 - 2002
- [j11]Toshihiro Fujito, Hiroshi Nagamochi:
A 2-approximation algorithm for the minimum weight edge dominating set problem. Discret. Appl. Math. 118(3): 199-207 (2002) - [j10]Toshihiro Fujito:
Approximating Polymatroid Packing and Covering. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1066-1070 (2002) - 2001
- [j9]Toshihiro Fujito:
On approximability of the independent/connected edge dominating set problems. Inf. Process. Lett. 79(6): 261-266 (2001) - [j8]Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh:
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. 5(3): 317-326 (2001) - [c8]Toshihiro Fujito, Tsuyoshi Okumura:
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. ISAAC 2001: 670-681 - 2000
- [j7]Toshihiro Fujito:
Approximating minimum feedback vertex sets in hypergraphs. Theor. Comput. Sci. 246(1-2): 107-116 (2000) - [c7]Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh:
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA 2000: 132-142 - [c6]Toshihiro Fujito:
On Approximability of the Independent/Connected Edge Dominating Set Problems. FSTTCS 2000: 117-126
1990 – 1999
- 1999
- [j6]Toshihiro Fujito:
Approximating Node-Deletion Problems for Matroidal Properties. J. Algorithms 31(1): 211-227 (1999) - [j5]Piotr Berman, Toshihiro Fujito:
On Approximation Properties of the Independent Set Problem for Low Degree Graphs. Theory Comput. Syst. 32(2): 115-132 (1999) - [j4]Toshihiro Fujito:
On approximation of the submodular set cover problem. Oper. Res. Lett. 25(4): 169-174 (1999) - [j3]Vineet Bafna, Piotr Berman, Toshihiro Fujito:
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discret. Math. 12(3): 289-297 (1999) - 1998
- [j2]Toshihiro Fujito:
A Unified Approximation Algorithm for Node-deletion Problems. Discret. Appl. Math. 86(2-3): 213-231 (1998) - 1997
- [c5]Toshihiro Fujito:
A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties. ICALP 1997: 749-759 - 1996
- [j1]Toshihiro Fujito:
A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach. Inf. Process. Lett. 59(2): 59-63 (1996) - [c4]Toshihiro Fujito:
A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract). ESA 1996: 167-178 - 1995
- [c3]Vineet Bafna, Piotr Berman, Toshihiro Fujito:
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. ISAAC 1995: 142-151 - [c2]Piotr Berman, Toshihiro Fujito:
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. WADS 1995: 449-460 - 1993
- [c1]Toshihiro Fujito:
A 2or3-Approximation of the Matroid Matching Problem. ISAAC 1993: 185-190
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-08-16 18:31 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:
