15 citations · 39 across the 20 of their papers we have counts for
21 papers
Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Subrahmanyam Kalyanasundaram, Subodh Kumar
A conflict-free cut on a simple connected graph is defined as a set of edges such that is disconnected, and no two edges in are conflicti…
A bound for the cops and robber problem in terms of 2-component order connectivity
Suryaansh Jain, Subrahmanyam Kalyanasundaram, Kartheek Sriram Tammana
In the cops and robber game, there are multiple cops and a single robber taking turns moving along the edges of a graph. The goal of the cops is to capture the robber (move to the…
The Complexity of Optimizing Atomic Congestion
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram +1
Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various a…
VEXIR2Vec: An Architecture-Neutral Embedding Framework for Binary Similarity
S. VenkataKeerthy, Soumya Banerjee, Sayan Dey +5
Binary similarity involves determining whether two binary programs exhibit similar functionality, often originating from the same source code. In this work, we propose VexIR2Vec, a…
Extremal Results on Conflict-free Coloring
Sriram Bhyravarapu, Shiwali Gupta, Subrahmanyam Kalyanasundaram +1
A conflict-free open neighborhood coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open n…
Conflict-free coloring on open neighborhoods of claw-free graphs
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFON (CFCN) coloring, of a graph using colors is a coloring of the vertices of such that every vert…
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang +2
A conflict-free coloring of a graph is a (partial) coloring of its vertices such that every vertex has a neighbor whose assigned color is unique in the neighborhood of .…
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
In the pliable index coding (PICOD) problem, a server is to serve multiple clients, each of which possesses a unique subset of the complete message set as side information and requ…
A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
Given an undirected graph , a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colore…
Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
Given a graph, the conflict-free coloring problem on open neighborhoods (CFON) asks to color the vertices of the graph so that all the vertices have a uniquely colored vertex in it…
Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
In an undirected graph , a conflict-free coloring with respect to open neighborhoods (denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex…
Conflict-free coloring on closed neighborhoods of bounded degree graphs
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
The closed neighborhood conflict-free chromatic number of a graph , denoted by , is the minimum number of colors required to color the vertices of such that for e…
Conflict-Free Coloring on Open Neighborhoods
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
In an undirected graph, a conflict-free coloring (with respect to open neighborhoods) is an assignment of colors to the vertices of the graph such that every vertex in has…
Bipartitioning Problems on Graphs with Bounded Tree-Width
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induc…
On the Tractability of (k,i)-Coloring
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram +1
In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-col…
Algorithms and hardness results for happy coloring problems
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare +1
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of…
Multi-threaded Graph Coloring Algorithm for Shared Memory Architecture
Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram
In this paper, we present multi-threaded algorithms for graph coloring suitable to the shared memory programming model. We modify an existing algorithm widely used in the literatur…
An Incentivized Approach for Fair Participation in Wireless Ad hoc Networks
Arka Rai Choudhuri, Kalyanasundaram S, Shriyak Sridhar +1
In Wireless Ad hoc networks (WANETs), nodes separated by considerable distance communicate with each other by relaying their messages through other nodes. However, it might not be…
The chromatic discrepancy of graphs
N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep +1
For a proper vertex coloring of a graph , let denote the maximum, over all induced subgraphs of , the difference between the chromatic number and the…
A Note on Even Cycles and Quasi-Random Tournaments
Subrahmanyam Kalyanasundaram, Asaf Shapira
A cycle C={v_1,v_2,....,v_1} in a tournament T is said to be even, if when walking along C, an even number of edges point in the wrong direction, that is, they are directed from v_…
A Wowzer Type Lower Bound for the Strong Regularity Lemma
Subrahmanyam Kalyanasundaram, Asaf Shapira
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to…