Haruko Okamura

485 total citations
18 papers, 277 citations indexed

About

Haruko Okamura is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Haruko Okamura has authored 18 papers receiving a total of 277 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Haruko Okamura's work include Advanced Graph Theory Research (14 papers), Interconnection Networks and Systems (8 papers) and graph theory and CDMA systems (6 papers). Haruko Okamura is often cited by papers focused on Advanced Graph Theory Research (14 papers), Interconnection Networks and Systems (8 papers) and graph theory and CDMA systems (6 papers). Haruko Okamura collaborates with scholars based in Japan, Canada and Germany. Haruko Okamura's co-authors include Paul Seymour, Ken‐ichi Kawarabayashi, Bojan Mohar and Andreas Huck and has published in prestigious journals such as Discrete Applied Mathematics, Journal of Combinatorial Theory Series B and Journal of the Mathematical Society of Japan.

In The Last Decade

Haruko Okamura

17 papers receiving 259 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Haruko Okamura Japan	8	217	136	76	44	35	18	277
Ján Katrenič Slovakia	6	199 0.9×	103 0.8×	22 0.3×	29 0.7×	54 1.5×	10	236
Mihály Hujter Hungary	6	194 0.9×	42 0.3×	20 0.3×	10 0.2×	83 2.4×	12	250
Gabriel Semanišin Slovakia	8	286 1.3×	85 0.6×	48 0.6×	27 0.6×	123 3.5×	31	327
Matthias Kriesell Germany	11	365 1.7×	170 1.3×	121 1.6×	28 0.6×	107 3.1×	56	415
Frederic Dorn Norway	9	178 0.8×	75 0.6×	23 0.3×	36 0.8×	25 0.7×	16	207
Michael J. Pelsmajer United States	9	185 0.9×	33 0.2×	24 0.3×	74 1.7×	56 1.6×	33	215
Yahav Nussbaum Israel	9	101 0.5×	55 0.4×	13 0.2×	51 1.2×	5 0.1×	13	152
Vladimir P. Korzhik Ukraine	8	191 0.9×	35 0.3×	120 1.6×	83 1.9×	102 2.9×	33	250
Daniel Mölle Germany	5	106 0.5×	61 0.4×	33 0.4×	4 0.1×	12 0.3×	6	130
Vinícius F. dos Santos Brazil	7	88 0.4×	15 0.1×	23 0.3×	4 0.1×	29 0.8×	39	148

Countries citing papers authored by Haruko Okamura

Since Specialization

Citations

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

Fields of papers citing papers by Haruko Okamura

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Haruko Okamura

This figure shows the co-authorship network connecting the top 25 collaborators of Haruko Okamura. A scholar is included among the top collaborators of Haruko Okamura 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 Haruko Okamura. Haruko Okamura is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

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

18 of 18 papers shown

Kawarabayashi, Ken‐ichi, et al.. (2010). Immersing small complete graphs. Ars Mathematica Contemporanea. 3(2). 139–146. 17 indexed citations

Okamura, Haruko. (2010). 2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs. Graphs and Combinatorics. 26(4). 571–589.

Okamura, Haruko. (2005). Two paths joining given vertices in (2k+1)-edge-connected graphs.. Ars Combinatoria. 75. 2 indexed citations

Okamura, Haruko. (2005). Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs. Graphs and Combinatorics. 21(4). 503–514. 1 indexed citations

Okamura, Haruko. (2001). 2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.. Ars Combinatoria. 61. 2 indexed citations

Okamura, Haruko. (1995). 2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs. Graphs and Combinatorics. 11(2). 141–170. 3 indexed citations

Huck, Andreas & Haruko Okamura. (1992). Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs. Graphs and Combinatorics. 8(3). 253–258. 4 indexed citations

Okamura, Haruko. (1990). Every 4k-edge-connected graph is Weakly 3k-linked. Graphs and Combinatorics. 6(2). 179–185. 1 indexed citations

Okamura, Haruko. (1988). Paths in k-edge-connected graphs. Journal of Combinatorial Theory Series B. 45(3). 345–355. 11 indexed citations

10.

Okamura, Haruko. (1987). Paths and edge-connectivity in graphs III. Six-terminalk paths. Graphs and Combinatorics. 3(1). 159–189. 2 indexed citations

11.

Okamura, Haruko. (1984). Paths and edge-connectivity in graphs. Journal of Combinatorial Theory Series B. 37(2). 151–172. 20 indexed citations

12.

Okamura, Haruko. (1984). Multicommodity flows in graphs II. Japanese journal of mathematics. 10(1). 99–116. 9 indexed citations

13.

Okamura, Haruko. (1983). Multicommodity flows in graphs. Discrete Applied Mathematics. 6(1). 55–62. 25 indexed citations

14.

Okamura, Haruko. (1983). Three commodity flows in graphs. Proceedings of the Japan Academy Series A Mathematical Sciences. 59(6). 1 indexed citations

15.

Okamura, Haruko. (1982). Hamiltonian circuits on simple 3-polytopes with up to 30 vertices. Journal of the Mathematical Society of Japan. 34(2). 7 indexed citations

16.

Okamura, Haruko. (1982). Every simple 3‐polytope of order 32 or less is Hamiltonian. Journal of Graph Theory. 6(2). 185–196. 8 indexed citations

17.

Okamura, Haruko & Paul Seymour. (1981). Multicommodity flows in planar graphs. Journal of Combinatorial Theory Series B. 31(1). 75–81. 163 indexed citations

18.

Okamura, Haruko, et al.. (1960). Bending of a Rectangular Plate with Two Opposite Free Edges and Other Two Simply Supported Edges Having Any Clamped Portion. ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik. 40(7-8). 310–327. 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.

Explore authors with similar magnitude of impact