Ephraim Korach

	2010
44		Daniel Berend, Ephraim Korach, Shira Zucker: Anticoloring and separation of graphs. Discrete Mathematics 310(3): 390-399 (2010)
	2008
43		Daniel Berend, Ephraim Korach, Shira Zucker: Tabu search for the BWC problem. SOFSEM (2) 2008: 22-33
42		Ephraim Korach, Michal Stern: The complete optimal stars-clustering-tree problem. Discrete Applied Mathematics 156(4): 444-450 (2008)
41		Ephraim Korach, Uri N. Peled, Udi Rotics: Equistable distance-hereditary graphs. Discrete Applied Mathematics 156(4): 462-477 (2008)
40		Daniel Berend, Ephraim Korach, Vladimir Lipets: Minimal cutwidth linear arrangements of abelian Cayley graphs. Discrete Mathematics 308(20): 4670-4695 (2008)
39		Daniel Berend, Ephraim Korach, Shira Zucker: Anticoloring of a family of grid graphs. Discrete Optimization 5(3): 647-662 (2008)
	2007
38		Shlomi Dolev, Ephraim Korach, Galit Uzan: Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract). SSS 2007: 253-265
37		Daniel Berend, Ephraim Korach, Shira Zucker: A Reduction of the Anticoloring Problem to Connected Graphs. Electronic Notes in Discrete Mathematics 28: 445-451 (2007)
	2006
36		Ephraim Korach, Thành Nguyen, Britta Peis: Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. SODA 2006: 842-850
35		Michal Stern, Ephraim Korach: On the Optimal Stars Clustering Tree Problem. Electronic Notes in Discrete Mathematics 27: 99-100 (2006)
	2005
34		Ephraim Korach, Margarita Razgon: Optimal Hypergraph Tree-Realization. WG 2005: 261-270
33		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)
	2004
32		Ofir Cohen, Yael Edan, Ephraim Korach: Transition matrix methodology for evaluating sensor fusion mapping algorithms. SMC (4) 2004: 3869-3874
31		Ran Giladi, Ephraim Korach, Rony Ohayon: Path selection under multiple QoS constraints-a practical approach. J. High Speed Networks 13(2): 155-167 (2004)
	2003
30		Ofir Cohen, Shayer Gil, Ephraim Korach, Yael Edan: Behavior Analysis of Grid-map based Sensor Fusion Algorithms. Robotics and Applications 2003: 201-206
29		Ran Giladi, Ephraim Korach, Rony Ohayon: Placement of network resources in communication networks. Computer Networks 43(2): 195-209 (2003)
28		Ephraim Korach, Uri N. Peled: Equistable series-parallel graphs. Discrete Applied Mathematics 132(1-3): 149-162 (2003)
27		Ephraim Korach, Michal Stern: The clustering matroid and the optimal clustering tree. Math. Program. 98(1-3): 385-414 (2003)
	2001
26		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
25		Hagai Ilani, Ephraim Korach, Michael Lomonosov: On Extremal Multiflows. J. Comb. Theory, Ser. B 79(2): 183-210 (2000)
	1999
24		Shlomi Dolev, Ephraim Korach, Dmitry Yukelson: The Sound of Silence: Guessing Games for Saving Energy in Mobile Environment. INFOCOM 1999: 768-775
23		Shlomi Dolev, Ephraim Korach, Dmitry Yukelson: The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment. PODC 1999: 273
	1997
22		Phillip B. Gibbons, Ephraim Korach: Testing Shared Memories. SIAM J. Comput. 26(4): 1208-1244 (1997)
	1994
21		Phillip B. Gibbons, Ephraim Korach: On Testing Cache-Coherent Shared Memories. SPAA 1994: 177-188
20		Gerard Tel, Ephraim Korach, Shmuel Zaks: Synchronizing ABD networks. IEEE/ACM Trans. Netw. 2(1): 66-69 (1994)
19		Ephraim Korach: Two-Trees Optimal T-Join and Integral Packing of T-Cuts. J. Comb. Theory, Ser. B 62(1): 1-10 (1994)
	1993
18		Ephraim Korach, Ady Tal: General Vertex Disjoint Paths in Series-Parallel Graphs. Discrete Applied Mathematics 41(2): 147-164 (1993)
17		Ephraim Korach, Nir Solel: Tree-Width, Path-Widt, and Cutwidth. Discrete Applied Mathematics 43(1): 97-101 (1993)
16		Ephraim Korach, Michal Penn: A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. Discrete Applied Mathematics 47(1): 77-83 (1993)
15		Ephraim Korach, Zvi Ostfeld: Recognition of DFS trees: sequential and parallel algorithms with refined verifications. Discrete Mathematics 114(1-3): 305-327 (1993)
	1992
14		Phillip B. Gibbons, Ephraim Korach: The Complexity of Sequential Consistency. SPDP 1992: 317-325
13		Ephraim Korach, Michal Penn: Tight integral duality gap in the Chinese Postman problem. Math. Program. 55: 183-191 (1992)
	1990
12		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
11		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
10		Ephraim Korach, Gerard Tel, Shmuel Zaks: Optimal Synchronization of ABD Networks. Concurrency 1988: 353-367
9		Ephraim Korach, Zvi Ostfeld: DFS Tree Construction: Algorithms and Characterizations. WG 1988: 87-106
	1987
8		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)
7		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
6		Ephraim Korach, Shay Kutten, Shlomo Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. PODC 1985: 163-174
5		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
4		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
3		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)
2		Jan K. Pachl, Ephraim Korach, Doron Rotem: Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31(4): 905-918 (1984)
	1982
1		Jan K. Pachl, Ephraim Korach, Doron Rotem: A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms STOC 1982: 378-382

Coauthor Index

1	Daniel Berend	[37] [39] [40] [43] [44]
2	Avichai Cohen	[33]
3	Ofir Cohen	[30] [32]
4	Shlomi Dolev	[23] [24] [26] [38]
5	Yael Edan	[30] [32]
6	Phillip B. Gibbons	[14] [21] [22]
7	Shayer Gil	[30]
8	Ran Giladi	[29] [31]
9	Hagai Ilani	[25]
10	Shay Kutten	[6] [12]
11	Mark Last	[33]
12	Vladimir Lipets	[40]
13	Michael Lomonosov	[25]
14	Shlomo Moran	[4] [5] [6] [7] [11] [12]
15	Thành Nguyen	[36]
16	Rony Ohayon	[29] [31] [33]
17	Zvi Ostfeld	[9] [15]
18	Jan K. Pachl	[1] [2]
19	Britta Peis	[36]
20	Uri N. Peled	[28] [41]
21	Michal Penn	[13] [16]
22	Margarita Razgon	[34]
23	Doron Rotem	[1] [2] [3] [8]
24	Udi Rotics	[41]
25	Nicola Santoro	[3] [8]
26	Nir Solel	[17]
27	Michal Stern	[27] [35] [42]
28	Ady Tal	[18]
29	Gerard Tel	[10] [20]
30	Galit Uzan	[38]
31	Dmitry Yukelson	[23] [24] [26]
32	Shmuel Zaks	[4] [5] [7] [10] [11] [20]
33	Shira Zucker	[37] [39] [43] [44]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page