• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 186 matches

• 2022
• 
  Fanica Gavril, Mordechai Shalom, Shmuel Zaks:
  Approximation algorithms for maximum weight k-coverings of graphs by packings. Discret. Math. Algorithms Appl. 14(1): 2150099:1-2150099:14 (2022)
• 2021
• 
  Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
  The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14(5): 151 (2021)
• 
  Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
  On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72: 1215-1250 (2021)
• 
  Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
  Multicast Communications with Varying Bandwidth Constraints. INFOCOM 2021: 1-10
• 
  Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
  Hierarchical b-Matching. SOFSEM 2021: 189-202
• 2020
• 
  Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
  Profit Maximization in Flex-Grid All-Optical Networks. Theory Comput. Syst. 64(2): 311-326 (2020)
• 2019
• 
  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)
• 
  Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
  Hierarchical b-Matching. CoRR abs/1904.10210 (2019)
• 
  Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
  Maximizing Communication Throughput in Tree Networks. CoRR abs/1904.10215 (2019)
• 2018
• 
  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)
• 
  Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
  Flexible bandwidth assignment with application to optical networks. J. Sched. 21(3): 327-336 (2018)
• 
  Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
  Online Coalition Structure Generation in Graph Games. AAMAS 2018: 1353-1361
• 2017
• 
  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)
• 
  Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
  Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms 45: 1-13 (2017)
• 
  George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
  Online Regenerator Placement. Theory Comput. Syst. 61(3): 739-754 (2017)
• 
  Kshitiz Verma, Gianluca Rizzo, Antonio Fernández Anta, Rubén Cuevas Rumín, Arturo Azcorra, Shmuel Zaks, Alberto García-Martínez:
  Energy-optimal collaborative file distribution in wired networks. Peer-to-Peer Netw. Appl. 10(4): 925-944 (2017)
• 
  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
• 2016
• 
  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)
• 
  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)
• 
  George B. Mertzios, Shmuel Zaks:
  On the intersection of tolerance and cocomparability graphs. Discret. Appl. Math. 199: 46-88 (2016)
• 
  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)
• 
  Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
  Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629: 40-50 (2016)
• 
  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)
• 
  Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone:
  Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks. IEEE Trans. Wirel. Commun. 15(11): 7517-7530 (2016)
• 
  Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez:
  SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches. AINA 2016: 266-273
• 2015
• 
  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)
• 
  Shmuel Zaks:
  Online Lower Bounds and Offline Inapproximability in Optical Networks. ADHOC-NOW 2015: 253-270
• 
  Shmuel Zaks:
  On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. WG 2015: 31-46
• 
  Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
  Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204
• 
  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)

skipping 156 more matches