Mordechai Shalom
Orcid: 0000-0002-2688-5703
According to our database1,
Mordechai Shalom
authored at least 75 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
2022
On the maximum cardinality cut problem in proper interval graphs and related graph classes.
Theor. Comput. Sci., 2022
Discret. Math. Algorithms Appl., 2022
IEEE Access, 2022
2021
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation.
Algorithms, 2021
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021
Proceedings of the 40th IEEE Conference on Computer Communications, 2021
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 Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
Discret. Math. Theor. Comput. Sci., 2018
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.
Inf. Process. Lett., 2017
Discret. Math. Theor. Comput. Sci., 2017
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
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
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
2015
IEEE/ACM Trans. Netw., 2015
CoRR, 2015
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 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
Theor. Comput. Sci., 2014
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014
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
Proceedings of the Structural Information and Communication Complexity, 2013
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
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012
2011
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011
2010
On the performance of Dijkstra's third self-stabilizing 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 Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
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
Minimizing total busy time in parallel scheduling with application to optical networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
2008
Comput. Networks, 2008
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
Proceedings of the Euro-Par 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
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Distributed Computing, 21st International Symposium, 2007
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.
Proceedings of the Stabilization, 2007
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
Proceedings of the Distributed Computing, 20th International Symposium, 2006
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006
2005
Proceedings of the Structural Information and Communication Complexity, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Proceedings of the 1st International Conference on Broadband Networks (BROADNETS 2004), 2004