Subrahmanyam Kalyanasundaram

From MaRDI portal
Revision as of 08:28, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:764329

Available identifiers

zbMath Open kalyanasundaram.subrahmanyamMaRDI QIDQ764329

List of research outcomes





PublicationDate of PublicationType
The complexity of optimizing atomic congestion2025-01-17Paper
Conflict-free coloring on claw-free graphs and interval graphs2024-08-06Paper
Conflict-free coloring: graphs of bounded clique-width and intersection graphs2024-08-02Paper
Pliable index coding via conflict-free colorings of hypergraphs2024-07-23Paper
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs2023-10-04Paper
Combinatorial bounds for conflict-free coloring on open neighborhoods2022-12-21Paper
A tight bound for conflict-free coloring in terms of distance to cluster2022-08-24Paper
Vertex partitioning problems on graphs with bounded tree width2022-08-04Paper
Conflict-free coloring bounds on open neighborhoods2022-08-03Paper
Conflict-free coloring: graphs of bounded clique width and intersection graphs2022-03-22Paper
Conflict-free coloring on open neighborhoods of claw-free graphs2021-12-22Paper
On the tractability of \(( k , i )\)-coloring2021-10-21Paper
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs2021-02-03Paper
Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods2020-09-14Paper
Parameterized complexity of happy coloring problems2020-08-17Paper
Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods2020-07-10Paper
\(H\)-free coloring on graphs with bounded tree-width2019-10-10Paper
Conflict-Free Coloring on Open Neighborhoods2019-10-02Paper
Exact computation of the number of accepting paths of an NTM2018-06-05Paper
On the tractability of \((k,i)\)-coloring2018-06-05Paper
On structural parameterizations of the matching cut problem2018-03-26Paper
An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions2017-10-04Paper
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees2016-09-29Paper
The chromatic discrepancy of graphs2015-04-28Paper
A Note on Even Cycles and Quasirandom Tournaments2013-07-31Paper
A Wowzer-type lower bound for the strong regularity lemma2013-05-16Paper
Algorithms for Message Ferrying on Mobile ad hoc Networks2012-10-24Paper
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma2012-08-22Paper
Improved simulation of nondeterministic Turing machines2012-03-13Paper
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma2011-08-17Paper
Improved Simulation of Nondeterministic Turing Machines2010-09-03Paper
Extremal Results on Conflict-free ColoringN/APaper

Research outcomes over time

This page was built for person: Subrahmanyam Kalyanasundaram