default search action
Akihiro Fujiwara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Reo Ueno, Akihiro Fujiwara:
An asynchronous P system with branch and bound for the minimum Steiner tree. Int. J. Netw. Comput. 14(2): 248-261 (2024) - [c54]Reo Ueno, Akihiro Fujiwara:
An asynchronous P system with improved branch and bound for solving the minimum Steiner tree. CANDARW 2024: 236-239 - 2023
- [j35]Takuya Noguchi, Akihiro Fujiwara:
An asynchronous P system with the Bron-Kerbosch algorithm for solving the maximum clique. Int. J. Netw. Comput. 13(2): 131-148 (2023) - [c53]Reo Ueno, Akihiro Fujiwara:
An asynchronous P system for solving the minimum Steiner tree with branch and bound. CANDARW 2023: 128-134 - 2022
- [j34]Takuya Noguchi, Akihiro Fujiwara:
An asynchronous P system with a DPLL algorithm for solving SAT. Int. J. Netw. Comput. 12(2): 238-252 (2022) - [c52]Takuya Noguchi, Akihiro Fujiwara:
An asynchronous P system for solving the maximum clique problem with the Bron-Kerbosch algorithm. CANDARW 2022: 199-205 - [c51]Takuya Miyamoto, Akihiro Fujiwara:
Robust optimization algorithms for multi-objective knapsack problem. CANDARW 2022: 430-432 - 2021
- [c50]Naoki Tojima, Akihiro Fujiwara:
Robust asynchronous P systems for basic operations. CSCI 2021: 592-597 - [c49]Takuya Noguchi, Akihiro Fujiwara:
An asynchronous P system with a DPLL algorithm for solving a satisfiability problem. CANDAR 2021: 155-161 - [c48]Kosei Nagao, Akihiro Fujiwara:
An asynchronous P system with branch and bound for solving the subset sum problem. CANDAR (Workshops) 2021: 241-247 - 2020
- [j33]Kotaro Umetsu, Akihiro Fujiwara:
P systems with branch and bound for solving two hard graph problems. Int. J. Netw. Comput. 10(2): 159-173 (2020) - [c47]Yoshikata Nakano, Akihiro Fujiwara:
An asynchronous P system with branch and bound for solving the knapsack problem. CANDAR (Workshops) 2020: 230-236 - [c46]Kosei Nagao, Akihiro Fujiwara:
An asynchronous P system for counting sort. CANDAR (Workshops) 2020: 430-434
2010 – 2019
- 2019
- [j32]Akihiro Fujiwara, Susumu Matsumae:
Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2018. Int. J. Netw. Comput. 9(1): 1 (2019) - [c45]Kotaro Umetsu, Akihiro Fujiwara:
An Asynchronous P System Using Branch and Bound for Minimum Graph Coloring. CANDAR Workshops 2019: 242-248 - [c44]Akihiro Fujiwara, Kotaro Umetsu, Fumiya Nozato:
An Asynchronous P System with Branch and Bound for Solving Hamiltonian Cycle Problem. CANDAR Workshops 2019: 256-259 - [c43]Yamato Mizobe, Kei Ohnishi, Akihiro Fujiwara:
Strawberry Optimization for Multi-Objective Knapsack Problem. CANDAR Workshops 2019: 481-483 - [c42]Zaixiang Zhang, Yunhao Zhu, Akihiro Fujiwara, Kei Ohnishi:
Population-based Search Relying on Spatial and/or Temporal Scale-free Behaviors of Individuals. SSCI 2019: 2327-2334 - 2018
- [j31]Akihiro Fujiwara:
Foreword. IEICE Trans. Inf. Syst. 101-D(12): 2863 (2018) - [j30]Akihiro Fujiwara, Susumu Matsumae:
Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2017. Int. J. Netw. Comput. 8(1): 1 (2018) - [j29]Yuki Jimen, Akihiro Fujiwara:
An asynchronous P system with branch and bound for solving the satisfiability problem. Int. J. Netw. Comput. 8(2): 141-152 (2018) - [c41]Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae:
Introduction to APDCM 2018. IPDPS Workshops 2018: 730-731 - 2017
- [j28]Akihiro Fujiwara, Susumu Matsumae:
Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2016. Int. J. Netw. Comput. 7(1): 1 (2017) - [c40]Yuki Jimen, Akihiro Fujiwara:
An Asynchronous P System Using Branch and Bound for the Satisfiability Problem. CANDAR 2017: 408-413 - [c39]Yuta Matsumoto, Akihiro Fujiwara:
A Firefly Optimization for a Connected Dominating Set in a Sensor Network. CANDAR 2017: 594-596 - 2016
- [j27]Akihiro Fujiwara, Susumu Matsumae:
Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2015. Int. J. Netw. Comput. 6(1): 1 (2016) - [c38]Kei Ohnishi, Akihiro Fujiwara, Mario Koeppen:
Non-swarm intelligence search algorithm based on the foraging behaviors of fruit flies. CEC 2016: 1509-1516 - [c37]Junichiro Imatomi, Akihiro Fujiwara:
An Asynchronous P System for MAX-SAT. CANDAR 2016: 572-578 - [c36]Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae
:
APDCM Introduction and Committees. IPDPS Workshops 2016: 479 - [c35]Tomohiro Shiiba, Akihiro Fujiwara:
Solving Subset Sum Problem Using EN P System with Active Membranes. SCIS&ISIS 2016: 886-891 - 2015
- [j26]Akihiro Fujiwara, Susumu Matsumae:
Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2014. Int. J. Netw. Comput. 5(1): 1 (2015) - [c34]Hiroyuki Yotsuyanagi, Akihiro Fujiwara, Masaki Hashizume:
On TSV array defect detection method using two ring-oscillators considering signal transitions at adjacent TSVs. 3DIC 2015: TS8.24.1-TS8.24.4 - [c33]Yutaka Nishida, Akihiro Fujiwara:
Asynchronous P Systems for a Compare-and-Exchange Operation and Sorting. CANDAR 2015: 328-333 - [c32]Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae
APDCM Introduction and Committees. IPDPS Workshops 2015: 384 - 2014
- [j25]Akihiro Fujiwara, Susumu Matsumae:
Preface. Int. J. Netw. Comput. 4(1): 1 (2014) - [j24]Kohei Tanaka, Akihiro Fujiwara:
Asynchronous P systems for hard graph problems. Int. J. Netw. Comput. 4(1): 2-22 (2014) - [c31]Akifumi Nakanishi, Akihiro Fujiwara:
Reaction Systems for Logical Operations and Sorting. CANDAR 2014: 342-346 - [c30]Yukihide Sasamura, Akihiro Fujiwara:
A Bee Colony Optimization Algorithm for a Connected Sensor Cover on GPGPU. CANDAR 2014: 582-585 - [c29]Shohei Maeda, Akihiro Fujiwara:
Enzymatic numerical P systems for basic operations and sorting. SCIS&ISIS 2014: 1333-1338 - 2013
- [j23]Akihiro Fujiwara:
Preface. Int. J. Netw. Comput. 3(1): 1 (2013) - [c28]Kohei Tanaka, Akihiro Fujiwara:
Asynchronous P Systems for the Maximum Independent Set and Related Graph Problems. IPDPS Workshops 2013: 620-629 - 2012
- [j22]Hirofumi Tagawa, Akihiro Fujiwara:
Solving SAT and Hamiltonian Cycle Problem Using Asynchronous P Systems. IEICE Trans. Inf. Syst. 95-D(3): 746-754 (2012) - [j21]Jacir Luiz Bordim, Akihiro Fujiwara, Koji Nakano:
Preface. Int. J. Found. Comput. Sci. 23(4): 761-762 (2012) - [j20]Akihiro Fujiwara:
Preface. Int. J. Netw. Comput. 2(1): 1 (2012) - [j19]Takayuki Murakawa, Akihiro Fujiwara:
Arithmetic Operations and Factorization using Asynchronous P Systems. Int. J. Netw. Comput. 2(2): 217-233 (2012) - [c27]Shunsuke Aoki, Akihiro Fujiwara:
Asynchronous SN P Systems for Sorting. ICNC 2012: 221-225 - [c26]Kohei Tanaka, Akihiro Fujiwara:
Asynchronous P Systems for Graph Coloring Problems. ICNC 2012: 254-258 - [c25]Tatsuya Shimokawa, Akihiro Fujiwara:
Centralized Algorithms for the Connected Target Coverage in Wireless Sensor Networks. ICNC 2012: 307-310 - 2011
- [j18]Jacir Luiz Bordim, Koji Nakano, Akihiro Fujiwara:
Preface. Int. J. Found. Comput. Sci. 22(3) (2011) - [j17]Akihiro Fujiwara, Takeshi Tateishi:
Logic and Arithmetic Operations with a Constant Number of Steps in Membrane Computing. Int. J. Found. Comput. Sci. 22(3): 547-564 (2011) - [j16]Akihiro Fujiwara, Hirotsugu Kakugawa, Koji Nakano:
Preface. Int. J. Found. Comput. Sci. 22(5) (2011) - [j15]Akihiro Fujiwara:
Preface. Int. J. Netw. Comput. 1(1): 1 (2011) - [c24]Takayuki Murakawa, Akihiro Fujiwara:
Asynchronous P Systems for Arithmetic Operations and Factorization. ICNC 2011: 214-220 - 2010
- [j14]Jacir Luiz Bordim, Akihiro Fujiwara, Koji Nakano:
Preface. Int. J. Found. Comput. Sci. 21(3): 385-386 (2010) - [c23]Kohta Nakamoto, Akihiro Fujiwara:
Distributed Algorithms for 2-Connected Sensor Cover in Sensor Network. ICWN 2010: 370-376 - [c22]Kota Ishii, Akihiro Fujiwara, Hirofumi Tagawa:
Asynchronous P systems for SAT and Hamiltonian cycle problem. NaBIC 2010: 513-519
2000 – 2009
- 2009
- [j13]Akihiro Fujiwara, Jacir Luiz Bordim, Koji Nakano:
Special issue on Advances in Parallel and Distributed Computational Models. Int. J. Parallel Emergent Distributed Syst. 24(4): 273 (2009) - [c21]Hirofumi Tagawa, Akihiro Fujiwara:
Dictionary Operations in Membrane Computing. FCS 2009: 20-26 - [c20]Yuichiro Tokumaru, Akihiro Fujiwara:
Procedures for Floating Point Operations with DNA Molecules. FCS 2009: 41-46 - [c19]Akihiro Fujiwara, Takeshi Tateishi:
Computation with a constant number of steps in membrane computing. IPDPS 2009: 1-8 - 2008
- [c18]Yasuhiro Sagara, Akihiro Fujiwara:
An Access Point Selection Algorithm for Heterogeneous Stations. ICWN 2008: 334-340 - 2007
- [j12]Akihiro Fujiwara, Koji Nakano, Hong Chen:
Special Section on Parallel/Distributed Processing and Systems. IEICE Trans. Inf. Syst. 90-D(1): 1 (2007) - [j11]Akihiro Fujiwara, Satoshi Kamio, Akiko Takehara:
Procedures for Computing the Maximum with DNA. Int. J. Found. Comput. Sci. 18(3): 475-493 (2007) - [c17]Takeshi Tateishi, Akihiro Fujiwara:
Data structures for storing binary numbers in DNA computing. FCS 2007: 34-40 - [c16]Akihiro Fujiwara, Yasuhiro Sagara, Masahiko Nakamura:
Access point selection algorithms for maximizing throughputs in wireless LAN environment. ICPADS 2007: 1-8 - 2006
- [j10]Akihiro Fujiwara:
Special Section on Foundations of Computer Science. IEICE Trans. Inf. Syst. 89-D(2): 743 (2006) - [j9]Takaaki Nakashima, Akihiro Fujiwara:
A Cost Optimal Parallel Algorithm for Patience Sorting. Parallel Process. Lett. 16(1): 39-52 (2006) - [c15]Hiroki Fukagawa, Akihiro Fujiwara:
Procedures for multiplication and division in DNA computing. FCS 2006: 95-101 - [c14]Yuichiro Tokumaru, Akihiro Fujiwara:
A Procedure for Max-SAT with DNA Strands. FCS 2006: 123-129 - 2005
- [j8]Akihiro Fujiwara, Satoshi Kamio:
Procedures For Multiple Input Functions With Dna Molecules. Int. J. Found. Comput. Sci. 16(1): 37-54 (2005) - [c13]Mizue Ushijima, Akihiro Fujiwara:
Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands. FCS 2005: 52-58 - [c12]Akihiro Fujiwara, Kota Atsuyama:
A Procedure for Computing 0-1 Integer Programming with DNA Strands. FCS 2005: 125-134 - [c11]Kenta Nakahira, Akihiro Fujiwara:
A Scheduling Algorithm with Static Partition for Total Exchange. PDPTA 2005: 739-745 - 2004
- [j7]Akihiro Fujiwara, Ken-ichi Matsumoto, Wei Chen:
Procedures For Logic And Arithmetic Operations With Dna Molecules. Int. J. Found. Comput. Sci. 15(3): 461-474 (2004) - [c10]Akihiro Fujiwara, Satoshi Kamio:
Procedures for Multiple Input Functions with DNA Strands. IPDPS 2004 - 2003
- [c9]Akihiro Fujiwara, Ken-ichi Matsumoto, Wei Chen:
Addressable Procedures for Logic and Arithmetic Operations with DNA Strands. IPDPS 2003: 162 - [c8]Yuya Jinno, Masashi Ito, Akihiro Fujiwara:
Efficient Scheduling Algorithms for Total Exchange on GRID Environment. PDPTA 2003: 81-87 - [c7]Satoshi Kamio, Akiko Takehara, Akihiro Fujiwara:
Procedures for Computing the Maximum with DNA Strands. PDPTA 2003: 351-357 - 2002
- [j6]Akihiro Fujiwara, Kenichi Higuchi, Mamoru Sawahashi:
SIR Measurement with Data Channel Transmission Gap Using Multipath Interference Canceller for High-Speed Packet Transmission in W-CDMA Forward Link. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(7): 1546-1556 (2002) - [j5]Kenichi Higuchi, Akihiro Fujiwara, Mamoru Sawahashi:
Multipath interference canceller for high-speed packet transmission with adaptive modulation and coding scheme in W-CDMA forward link. IEEE J. Sel. Areas Commun. 20(2): 419-432 (2002) - [j4]Takashi Ishimizu, Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara:
Parallel algorithms for selection on the BSP and BSP* models. Syst. Comput. Jpn. 33(12): 97-107 (2002) - 2001
- [c6]Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara:
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. COCOON 2001: 59-63 - 2000
- [c5]Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa:
Parallelizability of Some P-Complete Problems. IPDPS Workshops 2000: 116-122
1990 – 1999
- 1999
- [j3]Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara:
A cost optimal parallel algorithm for weighted distance transforms. Parallel Comput. 25(4): 405-416 (1999) - [c4]Akihiro Fujiwara, H. Katsuki, Michiko Inoue, Toshimitsu Masuzawa:
Parallel Selection Algorithms with Analysis on Clusters. ISPAN 1999: 388-393 - [c3]Takashi Ishimizu, Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara:
Parallel Algorithms for All Nearest Neighbors of Binary Images on the BSP Model. ISPAN 1999: 394-399 - 1997
- [j2]Akihiro Fujiwara, Toshimitsu Masuzawa, Hideo Fujiwara:
Parallel algorithms for connected-component problems of gray-scale images. Syst. Comput. Jpn. 28(1): 74-86 (1997) - [c2]Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara:
A Parallel Algorithm for Weighted Distance Transforms. IPPS 1997: 407-412 - 1995
- [j1]Akihiro Fujiwara, Toshimitsu Masuzawa, Hideo Fujiwara:
An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images. Inf. Process. Lett. 54(5): 295-300 (1995) - 1992
- [c1]T. Yamada, Akihiro Fujiwara, Michiko Inoue:
COM (Cost Oriented Memory) Testing. ITC 1992: 259
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 2025-01-28 22:33 CET 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: