M. Hanan

678 total citations · 1 hit paper
8 papers, 470 citations indexed

About

M. Hanan is a scholar working on Electrical and Electronic Engineering, Hardware and Architecture and Computational Theory and Mathematics. According to data from OpenAlex, M. Hanan has authored 8 papers receiving a total of 470 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Electrical and Electronic Engineering, 4 papers in Hardware and Architecture and 3 papers in Computational Theory and Mathematics. Recurrent topics in M. Hanan's work include VLSI and FPGA Design Techniques (5 papers), Embedded Systems Design Techniques (4 papers) and Low-power high-performance VLSI design (2 papers). M. Hanan is often cited by papers focused on VLSI and FPGA Design Techniques (5 papers), Embedded Systems Design Techniques (4 papers) and Low-power high-performance VLSI design (2 papers). M. Hanan collaborates with scholars based in United States. M. Hanan's co-authors include and has published in prestigious journals such as IBM Journal of Research and Development, SIAM Journal on Applied Mathematics and Networks.

In The Last Decade

M. Hanan

7 papers receiving 404 citations

Hit Papers

align trajectories

What are hit papers?

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.

On Steiner’s Problem with Rectilinear Distance

1966 429 citations M. Hanan SIAM Journal on Applied Mathematics profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
M. Hanan United States	5	379	216	136	73	72	8	470
Gordon T. Hamachi United States	7	295 0.8×	221 1.0×	85 0.6×	33 0.5×	43 0.6×	8	406
C. L. Liu United States	11	654 1.7×	391 1.8×	191 1.4×	80 1.1×	67 0.9×	21	800
Ralph H. J. M. Otten Netherlands	12	589 1.6×	344 1.6×	168 1.2×	60 0.8×	56 0.8×	24	706
Narendra Shenoy United States	19	852 2.2×	781 3.6×	150 1.1×	198 2.7×	17 0.2×	41	1.0k
Jayaram Bhasker United States	7	105 0.3×	83 0.4×	54 0.4×	54 0.7×	70 1.0×	8	239
A. Weinberger United States	8	208 0.5×	123 0.6×	39 0.3×	146 2.0×	8 0.1×	15	325
Patrick H. Madden United States	19	1.1k 3.0×	886 4.1×	223 1.6×	22 0.3×	16 0.2×	57	1.3k
K. Shahookar United States	5	263 0.7×	165 0.8×	56 0.4×	56 0.8×	6 0.1×	7	369
Chia-Jeng Tseng United States	6	362 1.0×	581 2.7×	231 1.7×	64 0.9×	5 0.1×	16	653
Jerry L. Trahan United States	10	87 0.2×	118 0.5×	277 2.0×	48 0.7×	12 0.2×	67	360

Countries citing papers authored by M. Hanan

Since Specialization

Citations

This map shows the geographic impact of M. Hanan'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 M. Hanan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Hanan more than expected).

Fields of papers citing papers by M. Hanan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by M. Hanan. 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 M. Hanan. The network helps show where M. Hanan may publish in the future.

No nodes

All Works

Sort: Min cites: Since: Top N: Style:

8 of 8 papers shown

1.

Hanan, M., et al.. (1988). Some experimental results on placement techniques. 73–83. 2 indexed citations

2.

Hanan, M.. (1975). Layout, Interconnection, and Placement. Networks. 5(1). 85–88. 6 indexed citations

3.

Hanan, M., et al.. (1974). An interactive man-machine approach to the computer logic partitioning problem. Design Automation Conference. 70–81. 1 indexed citations

4.

Hanan, M., et al.. (1974). Iterative-Interactive Technique for Logic Partitioning. IBM Journal of Research and Development. 18(4). 328–337. 4 indexed citations

5.

Hanan, M.. (1972). A Counterexample to a Theorem of Fu on Steiner's Problem. IEEE Transactions on Circuit Theory. 19(1). 74–74. 7 indexed citations

6.

Hanan, M.. (1966). On Steiner’s Problem with Rectilinear Distance. SIAM Journal on Applied Mathematics. 14(2). 255–265. 429 indexed citations breakdown →

7.

Hanan, M., et al.. (1964). On Cyclic Codes for Multi-Phase Data Transmission Systems. Journal of the Society for Industrial and Applied Mathematics. 12(4). 794–804. 8 indexed citations

8.

Hanan, M., et al.. (1963). An Application of Coding Theory to a File Address Problem. IBM Journal of Research and Development. 7(2). 127–129. 13 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.

Explore authors with similar magnitude of impact