Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Shmuel Zaks - MaRDI portal

Shmuel Zaks

From MaRDI portal
(Redirected from Person:1098290)
Person:248937

Available identifiers

zbMath Open zaks.shmuelDBLP50/5932WikidataQ7499670 ScholiaQ7499670MaRDI QIDQ248937

List of research outcomes





PublicationDate of PublicationType
A lower bound for linear interval routing2024-07-11Paper
Labelled trees and pairs of input-output permutations in priority queues2024-01-05Paper
Minimum dominating sets of intervals on lines2023-12-12Paper
Optimal layouts on a chain ATM network2023-05-08Paper
Hierarchical \(b\)-matching2022-03-24Paper
Approximation algorithms for maximum weight k-coverings of graphs by packings2022-03-17Paper
On the Online Coalition Structure Generation Problem2022-02-07Paper
Profit maximization in flex-grid all-optical networks2020-02-27Paper
Complexity and online algorithms for minimum skyline coloring of intervals2019-08-09Paper
Optimal bounds for the change-making problem2019-03-29Paper
https://portal.mardi4nfdi.de/entity/Q45602242018-12-10Paper
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid2018-11-30Paper
Flexible bandwidth assignment with application to optical networks2018-11-07Paper
A complete characterization of the path layout construction problem for ATM networks with given hop count and load2018-07-04Paper
Complexity and online algorithms for minimum skyline coloring of intervals2018-03-26Paper
Online regenerator placement2017-10-12Paper
Optimizing bandwidth allocation in elastic optical networks with application to scheduling2017-10-06Paper
The virtual path layout problem in fast networks (extended abstract)2017-09-29Paper
On the complexity of the regenerator cost problem in general networks with traffic grooming2017-05-17Paper
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks2016-10-21Paper
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I2016-10-07Paper
Graphs of edge-intersecting and non-splitting paths2016-05-27Paper
Constructing minimum changeover cost arborescenses in bounded treewidth graphs2016-02-26Paper
On the intersection of tolerance and cocomparability graphs2015-12-10Paper
On-line maximum matching in complete multi-partite graphs with an application to optical networks2015-12-10Paper
On the complexity of the regenerator location problem treewidth and other parameters2015-12-10Paper
Optimizing busy time on parallel machines2014-12-02Paper
Online optimization of busy time on parallel machines2014-12-02Paper
Flexible Bandwidth Assignment with Application to Optical Networks2014-10-14Paper
On the complexity of constructing minimum changeover cost arborescences2014-06-06Paper
Profit Maximization in Flex-Grid All-Optical Networks2013-12-17Paper
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations2013-12-06Paper
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters2013-09-13Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony2013-02-04Paper
Approximating the traffic grooming problem in tree and star networks2012-07-26Paper
Online Optimization of Busy Time on Parallel Machines2012-07-16Paper
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism2012-06-29Paper
The Recognition of Tolerance and Bounded Tolerance Graphs2012-02-11Paper
The recognition of tolerance and bounded tolerance graphs.2012-01-23Paper
Optimizing regenerator cost in traffic grooming2012-01-04Paper
On the Intersection of Tolerance and Cocomparability Graphs2010-12-09Paper
A New Intersection Model and Improved Algorithms for Tolerance Graphs2010-12-03Paper
Minimizing total busy time in parallel scheduling with application to optical networks2010-10-11Paper
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony2010-09-10Paper
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms2010-09-09Paper
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests2010-09-07Paper
Traffic Grooming in Star Networks via Matching Techniques2010-06-17Paper
Optimal on-line colorings for minimizing the number of ADMs in optical networks2010-05-25Paper
On minimizing the number of ADMs in a general topology optical network2010-04-28Paper
More Patterns in Trees: Up and Down, Young and Old, Odd and Even2010-03-17Paper
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology2010-02-24Paper
Traffic Grooming: Combinatorial Results and Practical Resolutions2010-02-09Paper
A New Intersection Model and Improved Algorithms for Tolerance Graphs2010-01-21Paper
Approximating the traffic grooming problem2009-05-13Paper
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring2008-11-20Paper
On Minimizing the Number of ADMs in a General Topology Optical Network2008-09-09Paper
Approximating the Traffic Grooming Problem in Tree and Star Networks2008-09-04Paper
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks2008-09-02Paper
Intersection representations of matrices by subtrees and unicycles on graphs2008-08-08Paper
On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion2008-07-10Paper
Selfishness, collusion and power of local search for the ADMs minimization problem2008-06-25Paper
On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing2008-04-17Paper
On the Complexity of the Traffic Grooming Problem in Optical Networks2007-11-15Paper
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem2007-10-02Paper
On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing2007-04-26Paper
Algorithms and Computation2006-11-14Paper
Structural Information and Communication Complexity2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q47916662003-01-30Paper
The complexity of the characterization of networks supporting shortest-path interval routing.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45363472002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q27668662002-01-28Paper
On the total\(_k\)-diameter of connection networks2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q45039362000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q42626931999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42599831999-09-08Paper
Scheduling in synchronous networks and the greedy algorithm1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42328891999-03-16Paper
Labelled trees and pairs of input--output permutations in priority queues1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43736801998-06-11Paper
Optimal layouts on a chain ATM network1998-01-01Paper
The bit complexity of distributed sorting1997-07-23Paper
Tight bounds on the round complexity of distributed 1-solvable tasks1997-02-28Paper
A new characterization of tree medians with applications to distributed sorting1994-11-17Paper
A lower bound on the period length of a distributed scheduler1994-05-15Paper
https://portal.mardi4nfdi.de/entity/Q42816391994-03-10Paper
Optimal bounds for the change-making problem1994-02-22Paper
Optimal Linear Broadcast1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40281171993-03-28Paper
The cycle lemma and some applications1990-01-01Paper
A combinatorial characterization of the distributed 1-solvable tasks1990-01-01Paper
Bit complexity of order statistics on a distributed star network1989-01-01Paper
Efficient elections in chordal ring networks1989-01-01Paper
Optimal lower bounds for some distributed algorithms for a complete network of processors1989-01-01Paper
Patterns in trees1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37906221988-01-01Paper
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38147911988-01-01Paper
On the bit complexity of distributed computations in a ring with a leader1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37534761987-01-01Paper
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859071987-01-01Paper
Ordered trees and non-crossing partitions1986-01-01Paper
Optimal Distributed Algorithms for Sorting and Ranking1985-01-01Paper
A new algorithm for generation of permutations1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33382691984-01-01Paper
On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47442841983-01-01Paper
Golden ratios in a pairs covering problem1982-01-01Paper
Fair derivations in context-free grammars1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120311981-01-01Paper
Lexicographic generation of ordered trees1980-01-01Paper
Enumerations of ordered trees1980-01-01Paper
An NP-complete matching problem1980-01-01Paper

Research outcomes over time

This page was built for person: Shmuel Zaks