5 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…
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…
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…