default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaisuke Takafuji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Xiaotian Li
, Koji Nakano, Yasuaki Ito, Daisuke Takafuji, Takashi Yazane, Junko Yano, Takumi Kato, Shiro Ozaki, Rie Mori, Ryota Katsuki:
Bit duplication technique to generate hard quadratic unconstrained binary optimization problems with adjustable sizes. Concurr. Comput. Pract. Exp. 36(10) (2024)- 2023
- [j9]Daisuke Takafuji, Koji Nakano, Yasuaki Ito:
Efficient parallel implementations to compute the diameter of a graph. Concurr. Comput. Pract. Exp. 35(11) (2023) - [j8]Daisuke Takafuji, Koji Nakano, Yasuaki Ito, Akihiko Kasagi:
GPU implementations of deflate encoding and decoding. Concurr. Comput. Pract. Exp. 35(19) (2023) - [c14]Koji Nakano, Daisuke Takafuji, Yasuaki Ito, Takashi Yazane, Junko Yano, Shiro Ozaki, Ryota Katsuki, Rie Mori:
Diverse Adaptive Bulk Search: a Framework for Solving QUBO Problems on Multiple GPUs. IPDPS Workshops 2023: 314-325 - 2022
- [c13]Koji Nakano, Yasuaki Ito, Daisuke Takafuji, Takashi Yazane, Junko Yano, Shiro Ozaki, Ryota Katsuki, Rie Mori:
A benchmark QUBO problem inspired by digital halftoning based on the human visual system. CANDAR 2022: 56-65 - [c12]Xiaotian Li, Koji Nakano, Yasuaki Ito, Daisuke Takafuji, Takashi Yazane, Junko Yano, Shiro Ozaki, Ryota Katsuki, Rie Mori:
Bit duplication technique to generate hard QUBO problems. CANDARW 2022: 180-184 - [i1]Koji Nakano, Daisuke Takafuji, Yasuaki Ito, Takashi Yazane, Junko Yano, Shiro Ozaki, Ryota Katsuki, Rie Mori:
Diverse Adaptive Bulk Search: a Framework for Solving QUBO Problems on Multiple GPUs. CoRR abs/2207.03069 (2022) - 2021
- [c11]Daisuke Takafuji, Koji Nakano, Yasuaki Ito, Akihiko Kasagi:
Acceleration of Deflate Encoding and Decoding with GPU implementations. CANDAR (Workshops) 2021: 180-186 - 2020
- [c10]Naoya Yamamoto, Koji Nakano, Yasuaki Ito, Daisuke Takafuji, Akihiko Kasagi, Tsuguchika Tabaru:
Huffman Coding with Gap Arrays for GPU Acceleration. ICPP 2020: 1:1-1:11
2010 – 2019
- 2019
- [c9]Daisuke Takafuji, Koji Nakano, Yasuaki Ito:
Efficient GPU Implementations to Compute the Diameter of a Graph. CANDAR 2019: 102-111 - 2017
- [j7]Daisuke Takafuji, Koji Nakano, Yasuaki Ito, Jacir Luiz Bordim:
C2CU: a CUDA C program generator for bulk execution of a sequential algorithm. Concurr. Comput. Pract. Exp. 29(17) (2017) - [j6]Toru Fujita, Koji Nakano, Yasuaki Ito, Daisuke Takafuji:
An Efficient GPU Implementation of CKY Parsing Using the Bitwise Parallel Bulk Computation Technique. IEICE Trans. Inf. Syst. 100-D(12): 2857-2865 (2017) - 2016
- [j5]Yuji Takeuchi, Koji Nakano, Daisuke Takafuji, Yasuaki Ito:
A character art generator using the local exhaustive search, with GPU acceleration. Int. J. Parallel Emergent Distributed Syst. 31(1): 47-63 (2016) - [c8]Koji Nakano, Daisuke Takafuji, Satoshi Fujita, Hiroki Matsutani, Ikki Fujiwara, Michihiro Koibuchi:
Randomly Optimized Grid Graph for Low-Latency Interconnection Networks. ICPP 2016: 340-349 - 2014
- [c7]Daisuke Takafuji, Koji Nakano, Yasuaki Ito:
C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm. ICA3PP (2) 2014: 178-191 - [c6]Kazuya Tani, Daisuke Takafuji, Koji Nakano, Yasuaki Ito:
Bulk Execution of Oblivious Algorithms on the Unified Memory Machine, with GPU Implementation. IPDPS Workshops 2014: 586-595 - 2013
- [j4]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) - [c5]Yuji Takeuchi, Daisuke Takafuji, Yasuaki Ito, Koji Nakano:
ASCII Art Generation Using the Local Exhaustive Search on the GPU. CANDAR 2013: 194-200
2000 – 2009
- 2008
- [j3]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) - [j2]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
- [j1]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) - 2005
- [c4]Daisuke Takafuji, Toshimasa Watanabe:
Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles. ISCAS (1) 2005: 172-175 - [c3]Makoto Fujimoto, Daisuke Takafuji, Toshimasa Watanabe:
Approximation algorithms for the rectilinear Steiner tree problem with obstacles. ISCAS (2) 2005: 1362-1365 - 2002
- [c2]Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe:
Efficient approximation algorithms for the maximum weight matching problem. ISCAS (4) 2002: 457-460 - 2000
- [c1]Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe:
k-edge-connectivity augmentation problem with upper bounds on edge multiplicity. ISCAS 2000: 601-604
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-05 21:17 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:
