5 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.DS2019★ 5 cited
Online and Offline Greedy Algorithms for Routing with Switching Costs
Roy Schwartz, Mohit Singh, Sina Yazdanbod
Motivated by the use of high speed circuit switches in large scale data centers, we consider the problem of circuit switch scheduling. In this problem we are given demands between…
cs.CG2016
Minimizing the Total Movement for Movement to Independence Problem on a Line
Mehrdad Ghadiri, Sina Yazdanbod
Given a positive real value , a set of points along a line and a distance function , in the movement to independence problem, we wish to move the points to new positions…
math.CO2015
Cubic Graphs with Total Domatic Number at Least Two
Saieed Akbari, Mohammad Motiei, Sahand Mozaffari +1
Let be a graph. A total dominating set of is a set of vertices of such that every vertex is adjacent to at least one vertex in . The total domatic number of a gr…