The following pages link to Mordechai Shalom (Q248936):
Displaying 50 items.
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- On three extensions of equimatchable graphs (Q510986) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685) (← links)
- On-line maximum matching in complete multi-partite graphs with an application to optical networks (Q896661) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Selfishness, collusion and power of local search for the ADMs minimization problem (Q931111) (← links)
- On minimizing the number of ADMs in a general topology optical network (Q967313) (← links)
- Optimal on-line colorings for minimizing the number of ADMs in optical networks (Q972358) (← links)
- On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms (Q992514) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- Profit maximization in flex-grid all-optical networks (Q2300629) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem (Q2382677) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Online regenerator placement (Q2408557) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Defensive domination in proper interval graphs (Q2691568) (← links)
- On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters (Q2848912) (← links)
- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Q2864295) (← links)
- Profit Maximization in Flex-Grid All-Optical Networks (Q2868649) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion (Q3511401) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks (Q3523227) (← links)
- On Minimizing the Number of ADMs in a General Topology Optical Network (Q3524325) (← links)
- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring (Q3540221) (← links)
- Traffic Grooming in Star Networks via Matching Techniques (Q3569115) (← links)
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (Q3587450) (← links)
- Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid (Q4558956) (← links)
- (Q4560224) (← links)
