Zobrazeno 1 - 10
of 334
pro vyhledávání: '"Aravind N."'
Autor:
Nathan R. Fons, Ranjini K. Sundaram, Gregory A. Breuer, Sen Peng, Ryan L. McLean, Aravind N. Kalathil, Mark S. Schmidt, Diana M. Carvalho, Alan Mackay, Chris Jones, Ángel M. Carcaboso, Javad Nazarian, Michael E. Berens, Charles Brenner, Ranjit S. Bindra
Publikováno v:
Nature Communications, Vol 10, Iss 1, Pp 1-10 (2019)
Mutations in the Protein Phosphatase PPM1D are oncogenic in certain cancers including diffuse intrinsic pontine glioma (DIPG). Here, the authors show that PPM1D mutations in DIPG induce the silencing of the nicotinic acid phosphoribosyltransferase ge
Externí odkaz:
https://doaj.org/article/cc9d2729a55c414fbabbdf50c1cccd2e
Autor:
Aravind, N. R., Saxena, Roopam
In Terminal Monitoring Set (TMS), the input is an undirected graph $G=(V,E)$, together with a collection $T$ of terminal pairs and the goal is to find a subset $S$ of minimum size that hits a shortest path between every pair of terminals. We show tha
Externí odkaz:
http://arxiv.org/abs/2406.01730
Suppose we are given a set $\cal B$ of blue points and a set $\cal R$ of red points, all lying above a horizontal line $\ell$, in the plane. Let the weight of a given point $p_i\in {\cal B}\cup{\cal R}$ be $w_i>0$ if $p_i\in {\cal B}$ and $w_i<0$ if
Externí odkaz:
http://arxiv.org/abs/2307.03488
Publikováno v:
Curved and Layered Structures, Vol 2, Iss 1 (2015)
Strengthening the structural members of old buildings using advanced materials is a contemporary research in the field of repairs and rehabilitation. Many researchers used plain Glass Fiber Reinforced Polymer (GFRP) sheets for strengthening Reinforce
Externí odkaz:
https://doaj.org/article/9a7ae36615654e35b1636efee377b0ae
Autor:
Aravind, N. R., Saxena, Roopam
In Path Set Packing, the input is an undirected graph $G$, a collection $\calp$ of simple paths in $G$, and a positive integer $k$. The problem is to decide whether there exist $k$ edge-disjoint paths in $\calp$. We study the parameterized complexity
Externí odkaz:
http://arxiv.org/abs/2209.08757
We introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 x 8 chessboard by a single player, with only white pieces, using the followi
Externí odkaz:
http://arxiv.org/abs/2203.14864
Publikováno v:
Advances in Tribology, Vol 2012 (2012)
Accurate touchdown power detection is a prerequisite for read-write head-to-disk spacing calibration and control in current hard disk drives, which use the thermal fly-height control slider technology. The slider air bearing surface and head gimbal a
Externí odkaz:
https://doaj.org/article/982005800657437c8e94f13e73f25752
Autor:
Aravind, N. R., Saxena, Roopam
In an undirected graph $G=(V,E)$, we say $(A,B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$) has exactly one neighbor in $B$ (resp. $A$). The size of a pair of perfectly matched s
Externí odkaz:
http://arxiv.org/abs/2107.08584
Autor:
Aravind, N R, Saxena, Roopam
Given a positive integer $d$, the d-CUT is the problem of deciding if an undirected graph $G=(V,E)$ has a cut $(A,B)$ such that every vertex in $A$ (resp. $B$) has at most $d$ neighbors in $B$ (resp. $A$). For $d=1$, the problem is referred to as MAT
Externí odkaz:
http://arxiv.org/abs/2101.06998
Autor:
Aravind, N. R., Maniyar, Udit
Publikováno v:
In: Changat M., Das S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science, vol 12016. Springer, Cham (2020)
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices has a repres
Externí odkaz:
http://arxiv.org/abs/2010.01286