Mordechai Shalom

According to our database1, Mordechai Shalom authored at least 68 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020

Profit Maximization in Flex-Grid All-Optical Networks.
Theory Comput. Syst., 2020

Defensive Domination in Proper Interval Graphs.
CoRR, 2020

On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes.
CoRR, 2020

2019
Complexity and online algorithms for minimum skyline coloring of intervals.
Theor. Comput. Sci., 2019

Complexity of edge coloring with minimum reload/changeover costs.
Networks, 2019

On one extension of Dirac's theorem on Hamiltonicity.
Discret. Appl. Math., 2019

Maximizing Communication Throughput in Tree Networks.
CoRR, 2019

Hierarchical b-Matching.
CoRR, 2019

Minimum Reload Cost Graph Factors.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018
The maximum cardinality cut problem in co-bipartite chain graphs.
J. Comb. Optim., 2018

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
Discret. Math. Theor. Comput. Sci., 2018

Equimatchable claw-free graphs.
Discret. Math., 2018

Online Coalition Structure Generation in Graph Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Theor. Comput. Sci., 2017

Online Regenerator Placement.
Theory Comput. Syst., 2017

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.
Inf. Process. Lett., 2017

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
Discret. Math. Theor. Comput. Sci., 2017

On two extensions of equimatchable graphs.
Discret. Optim., 2017

2016
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Theor. Comput. Sci., 2016

Graphs of edge-intersecting and non-splitting paths.
Theor. Comput. Sci., 2016

On Three Extensions of Equimatchable Graphs.
Electron. Notes Discret. Math., 2016

Equimatchable graphs are C<sub>2k+1</sub>-free for k≥4.
Discret. Math., 2016

On-line maximum matching in complete multi-partite graphs with an application to optical networks.
Discret. Appl. Math., 2016

On the complexity of the regenerator location problem treewidth and other parameters.
Discret. Appl. Math., 2016

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I.
Discret. Appl. Math., 2016

A Simple Extension of Dirac's Theorem on Hamiltonicity.
CoRR, 2016

2015
A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks.
IEEE/ACM Trans. Netw., 2015

Optimizing busy time on parallel machines.
Theor. Comput. Sci., 2015

On the interval chromatic number of proper interval graphs.
Discret. Math., 2015

The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs.
CoRR, 2015

The Maximum Cut Problem in Co-bipartite Chain Graphs.
CoRR, 2015

Edge Coloring with Minimum Reload/Changeover Costs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Equimatchable Graphs are C_2k+1-free for k ≥ 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Online optimization of busy time on parallel machines.
Theor. Comput. Sci., 2014

On the complexity of constructing minimum changeover cost arborescences.
Theor. Comput. Sci., 2014

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Algorithmica, 2014

2013
On approximating the <i>d</i>-girth of a graph.
Discret. Appl. Math., 2013

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I.
CoRR, 2013

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012
Placing regenerators in optical networks to satisfy multiple sets of requests.
IEEE/ACM Trans. Netw., 2012

On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Online Optimization of Busy Time on Parallel Machines - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2012

2011
Optimizing regenerator cost in traffic grooming.
Theor. Comput. Sci., 2011

2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010

Optimal on-line colorings for minimizing the number of ADMs in optical networks.
J. Discrete Algorithms, 2010

On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms.
Distributed Comput., 2010

Traffic Grooming in Star Networks via Matching Techniques.
Proceedings of the Structural Information and Communication Complexity, 2010

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
On minimizing the number of ADMs in a general topology optical network.
Discret. Appl. Math., 2009

Shmuel Zaks - The Mathematician, Computer Scientist and Personality.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.
Proceedings of the Structural Information and Communication Complexity, 2009

2008
Approximating the traffic grooming problem in tree and star networks.
J. Parallel Distributed Comput., 2008

Approximating the traffic grooming problem.
J. Discrete Algorithms, 2008

Selfishness, collusion and power of local search for the ADMs minimization problem.
Comput. Networks, 2008

A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion.
Proceedings of the Structural Information and Communication Complexity, 2008

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
Proceedings of the Euro-Par 2008, 2008

2007
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings.
IEEE/ACM Trans. Netw., 2007

Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem.
Theor. Comput. Sci., 2007

On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing.
J. Parallel Distributed Comput., 2007

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.
Proceedings of the Stabilization, 2007

On the Complexity of the Traffic Grooming Problem in Optical Networks.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2005
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput.
Proceedings of the Structural Information and Communication Complexity, 2005

2004
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings.
Proceedings of the 1st International Conference on Broadband Networks (BROADNETS 2004), 2004


  Loading...