Ephraim Korach

1.2k total citations
54 papers, 703 citations indexed

About

Ephraim Korach is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Ephraim Korach has authored 54 papers receiving a total of 703 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computer Networks and Communications, 30 papers in Computational Theory and Mathematics and 13 papers in Electrical and Electronic Engineering. Recurrent topics in Ephraim Korach's work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (16 papers) and Optimization and Search Problems (13 papers). Ephraim Korach is often cited by papers focused on Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (16 papers) and Optimization and Search Problems (13 papers). Ephraim Korach collaborates with scholars based in Israel, United States and Canada. Ephraim Korach's co-authors include Phillip B. Gibbons, Shlomo Moran, Doron Rotem, Shmuel Zaks, Jan Pachl, Nicola Santoro, Shay Kutten, Michal Penn, Britta Peis and Uri N. Peled and has published in prestigious journals such as International Journal of Production Economics, Fuzzy Sets and Systems and Journal of the ACM.

In The Last Decade

Ephraim Korach

50 papers receiving 637 citations

Peers

Ephraim Korach

CNC

CTM

HA

AI

EEE

Gerd Behrmann Denmark

Y. Edmund Lien United States

Anastasios Viglas Australia

Tilak Agerwala United States

Koichi Yamazaki Japan

Ari Freund Israel

S. S. Yau United States

Arne Skou Denmark

Shlomit S. Pinter Israel

B.D. Theelen Netherlands

Gerd Behrmann Denmark

Ephraim Korach

292 ×0.6

CNC

363 ×1.4

CTM

129 ×1.0

HA

160 ×1.5

AI

119 ×1.5

EEE

Citations per year, relative to Ephraim Korach Ephraim Korach (= 1×) peers Gerd Behrmann

Countries citing papers authored by Ephraim Korach

Since Specialization

Citations

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

Fields of papers citing papers by Ephraim Korach

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ephraim Korach

This figure shows the co-authorship network connecting the top 25 collaborators of Ephraim Korach. A scholar is included among the top collaborators of Ephraim Korach 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 Ephraim Korach. Ephraim Korach 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:

20 of 20 papers shown

1.

Berend, Daniel, et al.. (2015). Anticoloring of the rook’s graph. Discrete Applied Mathematics. 188. 1–15.

2.

Berend, Daniel, et al.. (2009). Anticoloring and separation of graphs. Discrete Mathematics. 310(3). 390–399. 2 indexed citations

3.

Berend, Daniel, et al.. (2007). Minimal cutwidth linear arrangements of abelian Cayley graphs. Discrete Mathematics. 308(20). 4670–4695. 1 indexed citations

4.

Berend, Daniel, et al.. (2007). A Reduction of the Anticoloring Problem to Connected Graphs. Electronic Notes in Discrete Mathematics. 28. 445–451. 2 indexed citations

5.

Korach, Ephraim, Uri N. Peled, & Udi Rotics. (2007). Equistable distance-hereditary graphs. Discrete Applied Mathematics. 156(4). 462–477. 8 indexed citations

6.

Korach, Ephraim, et al.. (2006). Subgraph characterization of red/blue-split graph and konig egerváry graphs. Symposium on Discrete Algorithms. 842–850. 13 indexed citations

7.

Giladi, Ran, et al.. (2004). Path selection under multiple QoS constraints – a practical approach. Journal of High Speed Networks. 13(2). 155–167. 2 indexed citations

8.

Cohen, Ofir, et al.. (2003). Behavior Analysis of Grid-map based Sensor Fusion Algorithms.. 201–206. 1 indexed citations

9.

Cohen, Ofir, et al.. (2003). An adaptive fuzzy-logic procedure for ranking logical sensory performance. 2. 1317–1322. 3 indexed citations

10.

Cohen, Asaf, et al.. (2003). Fuzzy based paths ordering algorithm in networks with imperfect QoS information. 2. 1373–1380. 4 indexed citations

11.

Korach, Ephraim, et al.. (2000). On Extremal Multiflows. Journal of Combinatorial Theory Series B. 79(2). 183–210. 3 indexed citations

12.

Dolev, Shlomi, et al.. (1999). The sound of silence: guessing games for saving energy in mobile environment. 768–775 vol.2. 4 indexed citations

13.

Korach, Ephraim. (1994). Two-Trees Optimal T-Join and Integral Packing of T-Cuts. Journal of Combinatorial Theory Series B. 62(1). 1–10. 1 indexed citations

14.

Korach, Ephraim, et al.. (1993). Tree-width, path-width, and cutwidth. Discrete Applied Mathematics. 43(1). 97–101. 29 indexed citations

15.

Korach, Ephraim, et al.. (1993). General vertex disjoint paths in series-parallel graphs. Discrete Applied Mathematics. 41(2). 147–164. 6 indexed citations

16.

Korach, Ephraim & Michal Penn. (1993). A fast algorithm for maximum integral two-commodity flow in planar graphs. Discrete Applied Mathematics. 47(1). 77–83. 3 indexed citations

17.

Korach, Ephraim, Shay Kutten, & Shlomo Moran. (1990). A modular technique for the design of efficient distributed leader finding algorithms. ACM Transactions on Programming Languages and Systems. 12(1). 84–101. 56 indexed citations

18.

Korach, Ephraim, Shlomo Moran, & Shmuel Zaks. (1989). Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoretical Computer Science. 64(1). 125–132. 32 indexed citations

19.

Korach, Ephraim, Doron Rotem, & Nicola Santoro. (1984). Distributed election in a circle without a global sense of orientation. International Journal of Computer Mathematics. 16(2). 115–124. 6 indexed citations

20.

Pachl, Jan, Ephraim Korach, & Doron Rotem. (1982). A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. 378–382. 18 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