The following pages link to Subrahmanyam Kalyanasundaram (Q764329):
Displayed 27 items.
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- On structural parameterizations of the matching cut problem (Q1708644) (← links)
- Combinatorial bounds for conflict-free coloring on open neighborhoods (Q2110602) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- \(H\)-free coloring on graphs with bounded tree-width (Q2326574) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- Exact computation of the number of accepting paths of an NTM (Q2636555) (← links)
- On the tractability of \((k,i)\)-coloring (Q2636563) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
- A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma (Q2902884) (← links)
- Algorithms for Message Ferrying on Mobile ad hoc Networks (Q2920109) (← links)
- A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (Q3088120) (← links)
- Improved Simulation of Nondeterministic Turing Machines (Q3586105) (← links)
- A Wowzer-type lower bound for the strong regularity lemma (Q4920227) (← links)
- A Note on Even Cycles and Quasirandom Tournaments (Q5325937) (← links)
- An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions (Q5364234) (← links)
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs (Q6080863) (← links)
- Conflict-Free Coloring on Open Neighborhoods (Q6326394) (← links)
- Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods (Q6344856) (← links)
- Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods (Q6349083) (← links)
- Pliable Index Coding via Conflict-Free Colorings of Hypergraphs (Q6359757) (← links)
- Conflict-free coloring on open neighborhoods of claw-free graphs (Q6386478) (← links)