Sharif Digital Repository

The task preparation system (TPS) is a tool developed mainly for preparing IOI tasks. It was originally developed for, and successfully used in IOI 2017, and since then, it has been used in several other nationwide and international programming contests, including IOI 2019. The tool consists of a command-line interface for local (offline) work, and a web interface which integrates with git and provides more features. This article presents the main features of the task preparation system, and briefly describes how it works. © 2019 IOI, Vilnius University  

The task preparation system (TPS) is a tool developed mainly for preparing IOI tasks. It was originally developed for, and successfully used in IOI 2017, and since then, it has been used in several other nationwide and international programming contests, including IOI 2019. The tool consists of a command-line interface for local (offline) work, and a web interface which integrates with git and provides more features. This article presents the main features of the task preparation system, and briefly describes how it works. © 2019 IOI, Vilnius University  

Let G be a graph, a dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. In this paper we show that if a graph G has a DIM, then χ(G) ≤ 3. Also, it is shown that if G is a connected graph whose all edges can be partitioned into DIM, then G is either a regular graph or a biregular graph and indeed we characterize all graphs whose edge set can be partitioned into DIM. Also, we prove that if G is an r-regular graph of order n whose edges can be partitioned into DIM, then n is divisible by (2r-1r-1) and n=(2r-1r-1) if and only if G is the Kneser graph with parameters r- 1 , 2 r- 1. © 2022, The Author(s), under exclusive licence to Springer Japan KK, part... 

The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erdös, Simonovits and Sós. For given graphs G and H the anti-Ramsey number ar(G, H) is defined to be the maximum number k such that there exists an assignment of k colors to the edges of G in which every copy of H in G has at least two edges with the same color. Usually, combinatorists study extremal values of anti-Ramsey numbers for various classes of graphs. There are works on the computational complexity of the problem when H is a star. Along this line of research, we study the complexity of computing the anti-Ramsey number ar(G, Pk), where Pk is a path of length k. First, we observe that when k is... 

In this study, the Polyaniline/Polyvinyl Alcohol (PANi/PVA) composite was examined for arsenite (As(III)) removal from aqueous solution. The effect of several parameters including PVA concetration (0–5 g/L), pH (1–13), adsorbent dosage (0.5–6 g/L), contact time (0–120 min), initial As(III) concentration (0.5–100 mg/L), and As(III) oxidation were evaluated on the adsorption efficiency. The results indicated that PVA has an effective role in increasing adsorptive capacity of PANi, by changing its morphology and extending its active surface sites. The adsorption process was pH dependent and As(III) removal consistently improved by increasing solution pH. Adsorption reached equilibrium within... 

Nanogels are three-dimensional nanoscale networks formed by physically or chemically cross-linking polymers. Nanogels have been explored as drug delivery systems due to their advantageous properties, such as biocompatibility, high stability, tunable particle size, drug loading capacity, and possible modification of the surface for active targeting by attaching ligands that recognize cognate receptors on the target cells or tissues. Nanogels can be designed to be stimulus responsive, and react to internal or external stimuli such as pH, temperature, light and redox, thus resulting in the controlled release of loaded drugs. This “smart” targeting ability prevents drug accumulation in...