We stand with Ukraine  

Ashwin Ganesan

Orcid: 0000-0002-0972-9303

According to our database1, Ashwin Ganesan authored at least 31 papers between 2003 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems.
[BibTeX]
[DOI]
Ashwin Ganesan
IEEE Trans. Mob. Comput., January, 2025

2023
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model.
[BibTeX]
[DOI]
Ashwin Ganesan
Theor. Comput. Sci., February, 2023

Structured Hypergraphs in Cellular Mobile Communication Systems.
[BibTeX]
[DOI]
Ashwin Ganesan
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

2021
On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models.
[BibTeX]
[DOI]
Ashwin Ganesan
IEEE Trans. Inf. Theory, 2021

Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model.
[BibTeX]
[DOI]
Ashwin Ganesan
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020
Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks.
[BibTeX]
[DOI]
Ashwin Ganesan
IEEE/ACM Trans. Netw., 2020

2019
Fault tolerant supergraphs with automorphisms.
[BibTeX]
[DOI]
Ashwin Ganesan
Discret. Appl. Math., 2019

2018
Performance of distributed algorithms for QoS in wireless ad hoc networks: arbitrary networks under the primary interference model, and line networks under the protocol interference model.
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2018

On the automorphism group of a Johnson graph.
[BibTeX]
Ashwin Ganesan
Ars Comb., 2018

2017
Cayley graphs and symmetric interconnection networks.
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2017

2016
Edge-transitivity of Cayley graphs generated by transpositions.
[BibTeX]
[DOI]
Ashwin Ganesan
Discuss. Math. Graph Theory, 2016

On the automorphism group of Cayley graphs generated by transpositions.
[BibTeX]
[DOI]
Ashwin Ganesan
Australas. J Comb., 2016

2015
Structure of the automorphism group of the augmented cube graph.
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2015

2014
Performance of sufficient conditions for distributed quality-of-service support in wireless networks.
[BibTeX]
[DOI]
Ashwin Ganesan
Wirel. Networks, 2014

A direct product decomposition of the automorphism group of Cayley graphs generated by transposition sets.
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2014

2013
Automorphism groups of Cayley graphs generated by connected transposition sets.
[BibTeX]
[DOI]
Ashwin Ganesan
Discret. Math., 2013

Automorphisms of Cayley graphs generated by transposition sets
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2013

2012
Automorphism groups of graphs
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2012

The automorphism group of Cayley graphs generated by connected transposition sets.
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2012

Diameter of Cayley graphs generated by transposition trees
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2012

2011
The regular number of a graph
[BibTeX]
[DOI]
Ashwin Ganesan
,
Radha R. Iyer
CoRR, 2011

On a bound for the diameter of Cayley networks of symmetric groups generated by transposition trees
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2011

On some sufficient conditions for distributed QoS support in wireless networks
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2011

Minimal resolving sets for the hypercube
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2011

2010
On some upper bounds on the fractional chromatic number of weighted graphs
[BibTeX]
[DOI]
Ashwin Ganesan
CoRR, 2010

The performance of an upper bound on the fractional chromatic number of weighted graphs.
[BibTeX]
[DOI]
Ashwin Ganesan
Appl. Math. Lett., 2010

2009
On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks.
[BibTeX]
[DOI]
Ashwin Ganesan
Proceedings of the First International Conference on Networks and Communications, 2009

2007
On the Existence of Universally Decodable Matrices.
[BibTeX]
[DOI]
Ashwin Ganesan
,
Pascal O. Vontobel
IEEE Trans. Inf. Theory, 2007

2006
On universally decodable matrices for space-time coding.
[BibTeX]
[DOI]
Pascal O. Vontobel
,
Ashwin Ganesan
Des. Codes Cryptogr., 2006

2005
An Explicit Construction of Universally Decodable Matrices
[BibTeX]
[DOI]
Pascal O. Vontobel
,
Ashwin Ganesan
CoRR, 2005

2003
A virtual input-output framework for transceiver analysis and design for multipath fading channels.
[BibTeX]
[DOI]
Ashwin Ganesan
,
Akbar M. Sayeed
IEEE Trans. Commun., 2003


  Loading...