Subrahmanyam Kalyanasundaram

According to our database1, Subrahmanyam Kalyanasundaram authored at least 11 papers between 2009 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Exact Computation of the Number of Accepting Paths of an NTM.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

On the Tractability of (k, i)-Coloring.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

On Structural Parameterizations of the Matching Cut Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
The chromatic discrepancy of graphs.
Discrete Applied Mathematics, 2015

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Combinatorics, Probability & Computing, 2015

2013
A Note on Even Cycles and Quasirandom Tournaments.
Journal of Graph Theory, 2013

2011
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Improved Simulation of Nondeterministic Turing Machines.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Algorithms for Message Ferrying on Mobile ad hoc Networks.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009


  Loading...