Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMordechai Shalom
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j39]Mordechai Shalom
, Prudence W. H. Wong, Shmuel Zaks:
Profit Maximization in Flex-Grid All-Optical Networks. Theory Comput. Syst. 64(2): 311-326 (2020)- [j38]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75(3): 259-277 (2020)
2010 – 2019
- 2019
- [j37]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom:
On one extension of Dirac's theorem on Hamiltonicity. Discret. Appl. Math. 252: 10-16 (2019) - [j36]Didem Gözüpek, Mordechai Shalom:
Complexity of edge coloring with minimum reload/changeover costs. Networks 73(3): 344-357 (2019) - [j35]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. 788: 66-78 (2019) - [c34]Tínaz Ekim, Mordechai Shalom, Oylum Seker:
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. SEA² 2019: 21-34 - [c33]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. SOFSEM 2019: 67-80 - [i18]Tínaz Ekim, Mordechai Shalom, Oylum Seker:
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. CoRR abs/1904.04916 (2019) - [i17]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. CoRR abs/1904.10210 (2019) - [i16]Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Maximizing Communication Throughput in Tree Networks. CoRR abs/1904.10215 (2019) - 2018
- [j34]Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable claw-free graphs. Discret. Math. 341(10): 2859-2871 (2018) - [j33]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j32]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35(1): 250-265 (2018) - [c32]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Online Coalition Structure Generation in Graph Games. AAMAS 2018: 1353-1361 - [i15]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. CoRR abs/1810.11700 (2018) - 2017
- [j31]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On two extensions of equimatchable graphs. Discret. Optim. 26: 112-130 (2017) - [j30]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j29]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. Inf. Process. Lett. 121: 29-33 (2017) - [j28]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. Theory Comput. Syst. 61(3): 739-754 (2017) - [j27]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690: 91-103 (2017) - [c31]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) 2017: 317-332 - [c30]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - [i14]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017) - 2016
- [j26]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
On-line maximum matching in complete multi-partite graphs with an application to optical networks. Discret. Appl. Math. 199: 123-136 (2016) - [j25]Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the complexity of the regenerator location problem treewidth and other parameters. Discret. Appl. Math. 199: 199-225 (2016) - [j24]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. Discret. Appl. Math. 215: 47-60 (2016) - [j23]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable graphs are C2k+1-free for k≥4. Discret. Math. 339(12): 2964-2969 (2016) - [j22]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55: 177-180 (2016) - [j21]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621: 22-36 (2016) - [j20]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629: 40-50 (2016) - [c29]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG 2016: 195-206 - [i13]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR abs/1605.00532 (2016) - [i12]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom:
A Simple Extension of Dirac's Theorem on Hamiltonicity. CoRR abs/1606.03687 (2016) - [i11]Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Claw-Free Graphs. CoRR abs/1607.00476 (2016) - [i10]Didem Gözüpek, Mordechai Shalom:
Edge Coloring with Minimum Reload/Changeover Costs. CoRR abs/1607.06751 (2016) - 2015
- [j19]Mordechai Shalom:
On the interval chromatic number of proper interval graphs. Discret. Math. 338(11): 1907-1916 (2015) - [j18]George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks:
Optimizing busy time on parallel machines. Theor. Comput. Sci. 562: 524-541 (2015) - [j17]Didem Gözüpek, Mordechai Shalom, Fatih Alagöz:
A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks. IEEE/ACM Trans. Netw. 23(1): 317-328 (2015) - [i9]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW 2015: 125-128 - [i8]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - [i7]Didem Gözüpek, Mordechai Shalom:
Edge Coloring with Minimum Reload/Changeover Costs. CTW 2015: 205-208 - [i6]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The Maximum Cut Problem in Co-bipartite Chain Graphs. CoRR abs/1504.03666 (2015) - [i5]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. CoRR abs/1512.06440 (2015) - [i4]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. CoRR abs/1512.06893 (2015) - 2014
- [j16]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68(3): 671-691 (2014) - [j15]Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks:
On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540: 40-52 (2014) - [j14]Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks:
Online optimization of busy time on parallel machines. Theor. Comput. Sci. 560: 190-206 (2014) - [c28]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting and non-splitting paths. ICTCS 2014: 45-58 - 2013
- [j13]David Peleg, Ignasi Sau, Mordechai Shalom:
On approximating the d-girth of a graph. Discret. Appl. Math. 161(16-17): 2587-2596 (2013) - [c27]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Profit Maximization in Flex-Grid All-Optical Networks. SIROCCO 2013: 249-260 - [c26]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). WG 2013: 115-126 - [i3]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. CoRR abs/1309.0195 (2013) - [i2]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. CoRR abs/1309.2898 (2013) - [i1]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. CoRR abs/1309.6471 (2013) - 2012
- [j12]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. 20(6): 1870-1879 (2012) - [c25]George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks:
Optimizing Busy Time on Parallel Machines. IPDPS 2012: 238-248 - [c24]Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks:
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract). TAMC 2012: 448-460 - [c23]Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). WAOA 2012: 42-55 - 2011
- [j11]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011) - [c22]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. OPODIS 2011: 4-17 - [c21]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS 2011: 96-111 - [c20]David Peleg, Ignasi Sau, Mordechai Shalom:
On Approximating the d-Girth of a Graph. SOFSEM 2011: 467-481 - 2010
- [j10]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. Distributed Comput. 23(1): 43-60 (2010) - [j9]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Optimal on-line colorings for minimizing the number of ADMs in optical networks. J. Discrete Algorithms 8(2): 174-188 (2010) - [j8]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010) - [c19]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) 2010: 333-344 - [c18]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458 - [c17]Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming in Star Networks via Matching Techniques. SIROCCO 2010: 41-56 - [p1]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94
2000 – 2009
- 2009
- [j7]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs in a general topology optical network. Discret. Appl. Math. 157(12): 2701-2717 (2009) - [c16]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12 - [c15]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. SIROCCO 2009: 281-294 - [c14]Mordechai Shalom:
Shmuel Zaks - The Mathematician, Computer Scientist and Personality. DISC 2009: 7 - 2008
- [j6]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52(9): 1721-1731 (2008) - [j5]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008) - [j4]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68(7): 939-948 (2008) - [c13]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929 - [c12]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233 - [c11]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77 - 2007
- [j3]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distributed Comput. 67(4): 448-455 (2007) - [j2]Mordechai Shalom, Shmuel Zaks:
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. Theor. Comput. Sci. 384(2-3): 250-262 (2007) - [j1]Mordechai Shalom, Shmuel Zaks:
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Trans. Netw. 15(6): 1593-1602 (2007) - [c10]Mordechai Shalom, Walter Unger, Shmuel Zaks:
On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271 - [c9]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123 - [c8]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. DISC 2007: 435-449 - [c7]Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE 2007: 404-411 - 2006
- [c6]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85 - [c5]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473 - [c4]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158 - 2005
- [c3]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924 - [c2]Mordechai Shalom, Shmuel Zaks:
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291 - 2004
- [c1]Mordechai Shalom, Shmuel Zaks:
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262
Coauthor Index
[j39] [j35] [i17] [i16] [j33] [c32] [j30] [j28] [c31] [j26] [j25] [j24] [j21] [j20] [j18] [i8] [i5] [j16] [j15] [j14] [c28] [c27] [c26] [i3] [i2] [i1] [j12] [c25] [c24] [c23] [j11] [c22] [c21] [j10] [j9] [j8] [c19] [c18] [c17] [p1] [j7] [c16] [c15] [j6] [j5] [j4] [c13] [c12] [c11] [j3] [j2] [j1] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-05-13 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
