Mordechai Shalom
According to our database^{1},
Mordechai Shalom
authored at least 68 papers
between 2004 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2020
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020
Theory Comput. Syst., 2020
CoRR, 2020
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes.
CoRR, 2020
2019
Theor. Comput. Sci., 2019
Networks, 2019
Discret. Appl. Math., 2019
CoRR, 2019
CoRR, 2019
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
J. Comb. Optim., 2018
Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Representations of HolesPart II.
Discret. Math. Theor. Comput. Sci., 2018
Discret. Math., 2018
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
Theory Comput. Syst., 2017
A polynomialtime algorithm for the maximum cardinality cut problem in proper interval graphs.
Inf. Process. Lett., 2017
Discret. Math. Theor. Comput. Sci., 2017
Discret. Optim., 2017
2016
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
Electron. Notes Discret. Math., 2016
Discret. Math., 2016
Online maximum matching in complete multipartite 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 edgeintersecting nonsplitting paths in a tree: Representations of holes  Part I.
Discret. Appl. Math., 2016
CoRR, 2016
2015
IEEE/ACM Trans. Netw., 2015
Theor. Comput. Sci., 2015
Discret. Math., 2015
CoRR, 2015
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+1free for k ≥ 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Algorithmica, 2014
2013
Discret. Appl. Math., 2013
Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Towards Hole RepresentationsPart I.
CoRR, 2013
Graphs of EdgeIntersecting Nonsplitting Paths in a Tree: Towards Hole Representations  (Extended Abstract).
Proceedings of the GraphTheoretic Concepts in Computer Science, 2013
2012
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
Proceedings of the Theory and Applications of Models of Computation, 2012
2011
Theor. Comput. Sci., 2011
2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010
J. Discrete Algorithms, 2010
On the performance of Dijkstra's third selfstabilizing algorithm for mutual exclusion and related algorithms.
Distributed Comput., 2010
Proceedings of the Structural Information and Communication Complexity, 2010
Proceedings of the Principles of Distributed Systems  14th International Conference, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
Discret. Appl. Math., 2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
OnLine 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
J. Parallel Distributed Comput., 2008
J. Discrete Algorithms, 2008
Selfishness, collusion and power of local search for the ADMs minimization problem.
Comput. Networks, 2008
Proceedings of the Distributed Computing, 22nd International Symposium, 2008
On the Performance of Beauquier and Debas' Selfstabilizing Algorithm for Mutual Exclusion.
Proceedings of the Structural Information and Communication Complexity, 2008
Proceedings of the EuroPar 2008, 2008
2007
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 Selfstabilizing Algorithm for Mutual Exclusion.
Proceedings of the Stabilization, 2007
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
2005
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