Ephraim Korach - Citegraph

Author Info

Name	Affiliation	Papers
EPHRAIM KORACH	Department of Industrial Engineering and Management, BG University of the Negev, Beer Sheva, 84105, Israel	34
Collaborators	Citations	PageRank
33	254	32.05
Referers	Referees	References
478	378	274

Search Limit

100478

Publications (34 rows)

Collaborators (33 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Magnifying computing gaps: establishing encrypted communication over unidirectional channels	1	0.37	2016
Assignment Problems of Different-Sized Inputs in MapReduce	4	0.37	2015
Anticoloring of the rook's graph	0	0.34	2015
Tabu search for the BWC problem.	2	0.40	2012
Equistable distance-hereditary graphs	10	0.65	2008
Minimal cutwidth linear arrangements of abelian Cayley graphs	1	0.35	2008
The complete optimal stars-clustering-tree problem	7	0.69	2008
Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract)	0	0.34	2007
Subgraph characterization of red/blue-split graph and k&odblac;nig egerváry graphs	14	0.81	2006
On the Optimal Stars Clustering Tree Problem	0	0.34	2006
Optimal hypergraph tree-realization	0	0.34	2005
Path selection under multiple QoS constraints - a practical approach	1	0.37	2004
Transition Matrix Methodology For Evaluating Sensor Fusion Mapping Algorithms	1	0.39	2004
Equistable series-parallel graphs	7	0.68	2003
Behavior Analysis of Grid-map based Sensor Fusion Algorithms	0	0.34	2003
Placement of network resources in communication networks	3	0.40	2003
The clustering matroid and the optimal clustering tree	21	1.17	2003
Path selection in networks with non-deterministic information.	1	0.35	2002
The sound of silence: guessing games for saving energy in a mobile environment	8	1.12	2001
On extremal multiflows	4	0.97	2000
Algorithms for Locating Resources in a Communication Network	0	0.34	1998
Testing Shared Memories	53	2.85	1997
On the existence of special depth first search trees	1	0.37	1995
Synchronizing ABD networks	9	0.58	1994
Two-trees optimal T-join and integral packing of T-cuts	1	0.39	1994
On testing cache-coherent shared memories	18	1.29	1994
Recognition of DFS trees: sequential and parallel algorithms with refined verifications	2	0.38	1993
Tree-width, path-width, and cutwidth	28	1.25	1993
A fast algorithm for maximum integral two-commodity flow in planar graphs	7	0.65	1993
General vertex disjoint paths in series-parallel graphs	6	0.59	1993
Tight integral duality gap in the Chinese Postman problem	13	4.50	1992
DFS Tree Construction: Algorithms and Characterizations	5	0.76	1988
Optimal synchronization of ABD networks	4	0.64	1988
A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms	22	6.67	1982