- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j30 |      | Daniel Berend, Ephraim Korach, Shira Zucker: Tabu search for the BWC problem. J. Global Optimization 54(4): 649-667 (2012) |
| 2010 | ||
| j29 | | Daniel Berend, Ephraim Korach, Shira Zucker: Anticoloring and separation of graphs. Discrete Mathematics 310(3): 390-399 (2010) |
| 2008 | ||
| j28 | | Ephraim Korach, Michal Stern: The complete optimal stars-clustering-tree problem. Discrete Applied Mathematics 156(4): 444-450 (2008) |
| j27 | | Ephraim Korach, Uri N. Peled, Udi Rotics: Equistable distance-hereditary graphs. Discrete Applied Mathematics 156(4): 462-477 (2008) |
| j26 | | Daniel Berend, Ephraim Korach, Shira Zucker: Anticoloring of a family of grid graphs. Discrete Optimization 5(3): 647-662 (2008) |
| j25 | | Daniel Berend, Ephraim Korach, Vladimir Lipets: Minimal cutwidth linear arrangements of abelian Cayley graphs. Discrete Mathematics 308(20): 4670-4695 (2008) |
| c17 |  | Daniel Berend, Ephraim Korach, Shira Zucker: Tabu search for the BWC problem. SOFSEM (2) 2008: 22-33 |
| 2007 | ||
| j24 | | Daniel Berend, Ephraim Korach, Shira Zucker: A Reduction of the Anticoloring Problem to Connected Graphs. Electronic Notes in Discrete Mathematics 28: 445-451 (2007) |
| c16 | | Shlomi Dolev, Ephraim Korach, Galit Uzan: Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract). SSS 2007: 253-265 |
| 2006 | ||
| j23 | | Michal Stern, Ephraim Korach: On the Optimal Stars Clustering Tree Problem. Electronic Notes in Discrete Mathematics 27: 99-100 (2006) |
| c15 | | Ephraim Korach, Thành Nguyen, Britta Peis: Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. SODA 2006: 842-850 |
| 2005 | ||
| j22 | | Avichai Cohen, Ephraim Korach, Mark Last, Rony Ohayon: A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks. Fuzzy Sets and Systems 150(3): 401-417 (2005) |
| c14 | | |
| 2004 | ||
| j21 | | Ran Giladi, Ephraim Korach, Rony Ohayon: Path selection under multiple QoS constraints-a practical approach. J. High Speed Networks 13(2): 155-167 (2004) |
| c13 | | Ofir Cohen, Yael Edan, Ephraim Korach: Transition matrix methodology for evaluating sensor fusion mapping algorithms. SMC (4) 2004: 3869-3874 |
| 2003 | ||
| j20 | | Ran Giladi, Ephraim Korach, Rony Ohayon: Placement of network resources in communication networks. Computer Networks 43(2): 195-209 (2003) |
| j19 | | Ephraim Korach, Uri N. Peled: Equistable series-parallel graphs. Discrete Applied Mathematics 132(1-3): 149-162 (2003) |
| j18 | | Ephraim Korach, Michal Stern: The clustering matroid and the optimal clustering tree. Math. Program. 98(1-3): 385-414 (2003) |
| c12 | | Ofir Cohen, Shayer Gil, Ephraim Korach, Yael Edan: Behavior Analysis of Grid-map based Sensor Fusion Algorithms. Robotics and Applications 2003: 201-206 |
| 2002 | ||
| c11 | | Ephraim Korach, Rony Ohayon: Path selection in networks with non-deterministic information. ICC 2002: 2227-2231 |
| 2001 | ||
| j17 | | Shlomi Dolev, Ephraim Korach, Dmitry Yukelson: The Sound of Silence: Guessing Games for Saving Energy in a Mobile Environment. J. Parallel Distrib. Comput. 61(7): 868-883 (2001) |
| 2000 | ||
| j16 | | Hagai Ilani, Ephraim Korach, Michael Lomonosov: On Extremal Multiflows. J. Comb. Theory, Ser. B 79(2): 183-210 (2000) |
| 1999 | ||
| c10 | | Shlomi Dolev, Ephraim Korach, Dmitry Yukelson: The Sound of Silence: Guessing Games for Saving Energy in Mobile Environment. INFOCOM 1999: 768-775 |
| c9 | | Shlomi Dolev, Ephraim Korach, Dmitry Yukelson: The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment. PODC 1999: 273 |
| 1997 | ||
| j15 | | Phillip B. Gibbons, Ephraim Korach: Testing Shared Memories. SIAM J. Comput. 26(4): 1208-1244 (1997) |
| 1995 | ||
| j14 | | Ephraim Korach, Zvi Ostfeld: On the existence of special depth first search trees. Journal of Graph Theory 19(4): 535-547 (1995) |
| 1994 | ||
| j13 | | Ephraim Korach: Two-Trees Optimal T-Join and Integral Packing of T-Cuts. J. Comb. Theory, Ser. B 62(1): 1-10 (1994) |
| j12 | | Gerard Tel, Ephraim Korach, Shmuel Zaks: Synchronizing ABD networks. IEEE/ACM Trans. Netw. 2(1): 66-69 (1994) |
| c8 | | |
| 1993 | ||
| j11 | | Ephraim Korach, Ady Tal: General Vertex Disjoint Paths in Series-Parallel Graphs. Discrete Applied Mathematics 41(2): 147-164 (1993) |
| j10 | | Ephraim Korach, Nir Solel: Tree-Width, Path-Widt, and Cutwidth. Discrete Applied Mathematics 43(1): 97-101 (1993) |
| j9 | | Ephraim Korach, Michal Penn: A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. Discrete Applied Mathematics 47(1): 77-83 (1993) |
| j8 | | Ephraim Korach, Zvi Ostfeld: Recognition of DFS trees: sequential and parallel algorithms with refined verifications. Discrete Mathematics 114(1-3): 305-327 (1993) |
| 1992 | ||
| j7 | | Ephraim Korach, Michal Penn: Tight integral duality gap in the Chinese Postman problem. Math. Program. 55: 183-191 (1992) |
| c7 | | |
| 1990 | ||
| j6 | | Ephraim Korach, Shay Kutten, Shlomo Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ACM Trans. Program. Lang. Syst. 12(1): 84-101 (1990) |
| 1989 | ||
| j5 | | Ephraim Korach, Shlomo Moran, Shmuel Zaks: Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64(1): 125-132 (1989) |
| 1988 | ||
| c6 | | Ephraim Korach, Gerard Tel, Shmuel Zaks: Optimal Synchronization of ABD Networks. Concurrency 1988: 353-367 |
| c5 | | Ephraim Korach, Zvi Ostfeld: DFS Tree Construction: Algorithms and Characterizations. WG 1988: 87-106 |
| 1987 | ||
| j4 | | Doron Rotem, Ephraim Korach, Nicola Santoro: Analysis of a Distributed Algorithm for Extrema Finding in a Ring. J. Parallel Distrib. Comput. 4(6): 575-591 (1987) |
| j3 | | Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. SIAM J. Comput. 16(2): 231-236 (1987) |
| 1985 | ||
| c4 | | Ephraim Korach, Shay Kutten, Shlomo Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. PODC 1985: 163-174 |
| c3 | | Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC 1985: 277-286 |
| 1984 | ||
| j2 | | Jan K. Pachl, Ephraim Korach, Doron Rotem: Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31(4): 905-918 (1984) |
| j1 | | Ephraim Korach, Doron Rotem, Nicola Santoro: Distributed Algorithms for Finding Centers and Medians in Networks. ACM Trans. Program. Lang. Syst. 6(3): 380-401 (1984) |
| c2 | | Ephraim Korach, Shlomo Moran, Shmuel Zaks: Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. PODC 1984: 199-207 |
| 1982 | ||
| c1 | | Jan K. Pachl, Ephraim Korach, Doron Rotem: A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. STOC 1982: 378-382 |
Colors in the list of coauthors
Last update Sat May 18 22:59:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page