Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
VLSI module placement based on rectangle-packing by the sequence-pair
1996537 citationsHideyuki Murata, Kunihiro Fujiyoshi et al.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systemsprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Kunihiro Fujiyoshi
Since
Specialization
Citations
This map shows the geographic impact of Kunihiro Fujiyoshi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kunihiro Fujiyoshi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kunihiro Fujiyoshi more than expected).
Fields of papers citing papers by Kunihiro Fujiyoshi
This network shows the impact of papers produced by Kunihiro Fujiyoshi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kunihiro Fujiyoshi. The network helps show where Kunihiro Fujiyoshi may publish in the future.
Co-authorship network of co-authors of Kunihiro Fujiyoshi
This figure shows the co-authorship network connecting the top 25 collaborators of Kunihiro Fujiyoshi.
A scholar is included among the top collaborators of Kunihiro Fujiyoshi based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Kunihiro Fujiyoshi. Kunihiro Fujiyoshi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Fujiyoshi, Kunihiro, et al.. (2017). Max Length and Length Difference Minimization for Set Pair Routing Problem with ILP. IEICE Technical Report; IEICE Tech. Rep.. 117(273). 241–246.
2.
Fujiyoshi, Kunihiro, et al.. (2015). Improved Method of Simulated Annealing for Unreachable Solution Space. IEICE Technical Report; IEICE Tech. Rep.. 115(338). 45–50.3 indexed citations
Fujiyoshi, Kunihiro, et al.. (2012). On Handling Cell Placement with Adjacent Common Centroid Constraints for Analog IC Layout Design. 112(320). 165–170.1 indexed citations
Fujiyoshi, Kunihiro, Hiroshi Kawai, & Keisuke Ishihara. (2009). A Tree Based Novel Representation for 3D-Block Packing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 28(5). 759–764.9 indexed citations
7.
Ohta, Hiroyuki, Tōru Yamada, Chikaaki Kodama, & Kunihiro Fujiyoshi. (2008). The O-Sequence:Representation of 3D-Dissection. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E91-A(8). 2111–2119.2 indexed citations
Saito, Hiroaki, et al.. (2003). An Improved Method of Convex Rectilinear Block Packing Based on Sequence-Pair. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 86(12). 3148–3157.4 indexed citations
Kodama, Chikaaki & Kunihiro Fujiyoshi. (2002). An Efficient Decoding Method of Sequence-Pair with Reduced Redundancy. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(12). 2785–2794.3 indexed citations
Nakatake, Shigetoshi, et al.. (1994). Bounded-Slicing Structure for Module Placement.. 94. 19–24.8 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.