Ephraim Korach

Available identifiers

zbMath Open korach.ephraimMaRDI QIDQ216241

List of research outcomes

Publication	Date of Publication	Type
DFS tree construction: Algorithms and characterizations	2024-02-28	Paper
Magnifying computing gaps. Establishing encrypted communication over unidirectional channels	2016-06-01	Paper
Anticoloring of the rook's graph	2015-05-22	Paper
Applications of a special polynomial class of TSP	2013-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4928166	2013-06-10	Paper
Tabu search for the BWC problem	2013-01-03	Paper
Anticoloring and separation of graphs	2010-03-29	Paper
Minimal cutwidth linear arrangements of abelian Cayley graphs	2008-09-04	Paper
Anticoloring of a family of grid graphs	2008-08-15	Paper
Equistable distance-hereditary graphs	2008-02-26	Paper
The complete optimal stars-clustering-tree problem	2008-02-26	Paper
On the Optimal Stars Clustering Tree Problem	2007-05-29	Paper
A Reduction of the Anticoloring Problem to Connected Graphs	2007-05-29	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q5485315	2006-08-29	Paper
Equistable series-parallel graphs	2003-12-04	Paper
On extremal multiflows	2002-12-10	Paper
The Capacitated p-facility Location Problem on the Real Line	2002-09-11	Paper
The sound of silence: Guessing games for saving energy in a mobile environment	2002-07-22	Paper
Optimal and myopic search in a binary random vector	1998-11-29	Paper
Testing Shared Memories	1998-02-10	Paper
On the existence of special depth first search trees	1997-01-26	Paper
Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts	1995-03-02	Paper
A fast algorithm for maximum integral two-commodity flow in planar graphs	1994-02-22	Paper
Recognition of DFS trees: Sequential and parallel algorithms with refined verifications	1993-10-24	Paper
Tree-width, path-width, and cutwidth	1993-08-17	Paper
General vertex disjoint paths in series-parallel graphs	1993-05-16	Paper
Tight integral duality gap in the Chinese postman problem	1992-12-17	Paper
Optimal lower bounds for some distributed algorithms for a complete network of processors	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3814791	1988-01-01	Paper
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors	1987-01-01	Paper
Distributed algorithms for finding centers and medians in networks	1984-01-01	Paper
Lower Bounds for Distributed Maximum-Finding Algorithms	1984-01-01	Paper
Distributed election in a circle without a global sense of orientation	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3319762	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4745251	1982-01-01	Paper

Research outcomes over time

This page was built for person: Ephraim Korach