期刊： THEORETICAL COMPUTER SCIENCE, 2021; 871 ()
It is important to find ride matches for individuals who participate in ridesharing quickly, and it is equally important to minimize the number of dri......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 873 ()
Given a graph G = (V, E) with a vertex ordering <=, the FIXED-ORDER BOOK THICKNESS problem asks whether there is a page assignment sigma such that ......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 871 ()
In this paper, we consider the submodular edge cover problem with submodular penalties. In this problem, we are given an undirected graph G = (V, E) w......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 876 ()
We consider a two-stage production scheduling problem where each operation can be outsourced or processed in-house. For each operation in the same mac......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 882 ()
The rapid development of online social networks (OSNs) has changed the way people communicate and has brought many new opportunities for Internet prod......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 876 ()
The cycle embedding is an important problem of networks, which can determine the fault tolerance of the networks. A network can be viewed as a graph. ......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 886 ()
Motivated by (continuous) facility location, we study the problem of dispersing and grouping points on a set of segments (of streets) in the plane. In......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 886 ()
With the rapid development of wireless networks, the burden on data transmission is becoming much higher, so are the requirements for bandwidth and lo......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 876 ()
In this paper, we study the problem of fast constructions of source-wise round-trip spanners in weighted directed graphs. For a source vertex set S su......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 882 ()
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by ......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 866 ()
For graphs F, G and H, let F -> (G, H) signify that any red/blue edge coloring of F contains either a red G or a blue H. The Ramsey number R(G, H) ......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 871 ()
Let G(n) be an n-dimensional recursive network. A set F subset of V (G(n)) (resp. F subset of E(G(n))) is called a t-embedded vertex cut (resp. t-embe......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 878 ()
The red-blue median problem considers a set of red facilities, a set of blue facilities, and a set of clients located in some metric space. The goal i......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 880 ()
Magnetic Resonance Imaging (MRI) is a widely used medical diagnosis technique. However, the quality of MR image is affected by the noise which is caus......
期刊： THEORETICAL COMPUTER SCIENCE, 2021; 886 ()
This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users wi......
