Conflict-Free Cuts: Exploring the Boundaries of Tractability
1 version
SK
Subrahmanyam Kalyanasundaram
math.COcs.DMcs.DScs.CCcs.DCcs.GTcs.AIcs.CRcs.ITcs.LG
On Valency
published · living versionsPreprints & journals
20 papers in the corpus · 2011–2026Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
0 citations
A bound for the cops and robber problem in terms of 2-component order connectivity
0 citations
The Complexity of Optimizing Atomic Congestion
2 citations
VEXIR2Vec: An Architecture-Neutral Embedding Framework for Binary Similarity
12 citations
Extremal Results on Conflict-free Coloring
0 citations
Conflict-free coloring on open neighborhoods of claw-free graphs
0 citations
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
6 citations
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
10 citations
A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster
1 citation
Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods
1 citation
Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods
7 citations
Conflict-free coloring on closed neighborhoods of bounded degree graphs
11 citations
Conflict-Free Coloring on Open Neighborhoods
0 citations
Bipartitioning Problems on Graphs with Bounded Tree-Width
0 citations
On the Tractability of (k,i)-Coloring
1 citation
Algorithms and hardness results for happy coloring problems
14 citations
Multi-threaded Graph Coloring Algorithm for Shared Memory Architecture
7 citations
An Incentivized Approach for Fair Participation in Wireless Ad hoc Networks
0 citations
The chromatic discrepancy of graphs
1 citation
A Note on Even Cycles and Quasi-Random Tournaments
0 citations
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in beta. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.