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 citationsKunihiro Fujiyoshi, Shigetoshi Nakatake et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Yoji Kajitani'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 Yoji Kajitani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yoji Kajitani more than expected).
This network shows the impact of papers produced by Yoji Kajitani. 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 Yoji Kajitani. The network helps show where Yoji Kajitani may publish in the future.
Co-authorship network of co-authors of Yoji Kajitani
This figure shows the co-authorship network connecting the top 25 collaborators of Yoji Kajitani.
A scholar is included among the top collaborators of Yoji Kajitani 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 Yoji Kajitani. Yoji Kajitani is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sakanushi, Keishi, et al.. (2002). Recognition of Floorplan by Parametric BSG for Reuse of Layout Design. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(4). 872–879.
Takahashi, Atsushi, et al.. (2001). An Efficient Algorithm to Extract an Optimal Sub-Circuit by the Minimum Cut. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(5). 1301–1308.1 indexed citations
7.
Yamazaki, Hiroyuki, Keishi Sakanushi, Shigetoshi Nakatake, & Yoji Kajitani. (2000). The 3D-Packing by Meta Data Structure and Packing Heuristics. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(4). 639–645.63 indexed citations
8.
Takahashi, Wataru, et al.. (1999). Schedule-clock-tree routing for semi-synchronous circuits. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 82(11). 2431–2439.7 indexed citations
9.
Takahashi, Atsushi, et al.. (1998). Air-Pressure Model and Fast Algorithms for Zero-Wasted-Area Layout of General Floorplan. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 857–865.4 indexed citations
10.
Kajitani, Yoji, et al.. (1998). Air-Pressure Model and Fast Algorithms for Zero-Wasted-Area Layout of General Floorplan(Special Section on Discrete Mathematics and Its Applications). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(5). 857–865.
Takahashi, Atsushi, Shuichi Ueno, & Yoji Kajitani. (1995). Universal Graphs for Graphs with Bounded Path-Width. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 78(4). 458–462.3 indexed citations
18.
Ueno, Shuichi, et al.. (1991). A Note on Dual Trail Partition of a Plane Graph. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 1915–1917.1 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.