Ashwin Ganesan

40 papers Misc 2Journal 37Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management.
CoRR
Ashwin Ganesan
2025 J jnl
The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems.
IEEE Trans. Mob. Comput.
Ashwin Ganesan
2023 J jnl
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model.
Theor. Comput. Sci.
Ashwin Ganesan
2023 Misc conf
Structured Hypergraphs in Cellular Mobile Communication Systems.
ICDCN
Ashwin Ganesan
2022 J jnl
Structured Hypergraphs in Cellular Mobile Communication Systems.
CoRR
Ashwin Ganesan
2021 J jnl
On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models.
IEEE Trans. Inf. Theory
Ashwin Ganesan
2021 Misc conf
Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model.
ICDCN
Ashwin Ganesan
2020 J jnl
Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks.
IEEE/ACM Trans. Netw.
Ashwin Ganesan
2020 J jnl
Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model.
CoRR
Ashwin Ganesan
2019 J jnl
Fault tolerant supergraphs with automorphisms.
Discret. Appl. Math.
Ashwin Ganesan
2019 J jnl
On some distributed scheduling algorithms for wireless networks with hypergraph interference models.
CoRR
Ashwin Ganesan
2018 J jnl
On the automorphism group of a Johnson graph.
Ars Comb.
Ashwin Ganesan
2018 J jnl
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.
CoRR
Ashwin Ganesan
2017 J jnl
Cayley graphs and symmetric interconnection networks.
CoRR
Ashwin Ganesan
2016 J jnl
Edge-transitivity of Cayley graphs generated by transpositions.
Discuss. Math. Graph Theory
Ashwin Ganesan
2016 J jnl
Fault tolerant supergraphs with automorphisms.
CoRR
Ashwin Ganesan
2016 J jnl
On the automorphism group of Cayley graphs generated by transpositions.
Australas. J Comb.
Ashwin Ganesan
2015 J jnl
Structure of the automorphism group of the augmented cube graph.
CoRR
Ashwin Ganesan
2014 J jnl
A direct product decomposition of the automorphism group of Cayley graphs generated by transposition sets.
CoRR
Ashwin Ganesan
2014 J jnl
Performance of sufficient conditions for distributed quality-of-service support in wireless networks.
Wirel. Networks
Ashwin Ganesan
2013 J jnl
Automorphism groups of Cayley graphs generated by connected transposition sets.
Discret. Math.
Ashwin Ganesan
2013 J jnl
Automorphisms of Cayley graphs generated by transposition sets
CoRR
Ashwin Ganesan
2012 J jnl
Automorphism groups of graphs
CoRR
Ashwin Ganesan
2012 J jnl
Diameter of Cayley graphs generated by transposition trees
CoRR
Ashwin Ganesan
2012 J jnl
The automorphism group of Cayley graphs generated by connected transposition sets.
CoRR
Ashwin Ganesan
2011 J jnl
Minimal resolving sets for the hypercube
CoRR
Ashwin Ganesan
2011 J jnl
On a bound for the diameter of Cayley networks of symmetric groups generated by transposition trees
CoRR
Ashwin Ganesan
2011 J jnl
On some sufficient conditions for distributed QoS support in wireless networks
CoRR
Ashwin Ganesan
2011 J jnl
The regular number of a graph
CoRR
Ashwin Ganesan, Radha R. Iyer
2010 J jnl
On some upper bounds on the fractional chromatic number of weighted graphs
CoRR
Ashwin Ganesan
2010 J jnl
The performance of an upper bound on the fractional chromatic number of weighted graphs.
Appl. Math. Lett.
Ashwin Ganesan
2009 — conf
On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks.
NetCoM
Ashwin Ganesan
2009 J jnl
On some sufficient conditions for distributed Quality-of-Service support in wireless networks
CoRR
Ashwin Ganesan
2007 J jnl
On the Existence of Universally Decodable Matrices.
IEEE Trans. Inf. Theory
Ashwin Ganesan, Pascal O. Vontobel
2006 J jnl
On Universally Decodable Matrices for Space-Time Coding
CoRR
Pascal O. Vontobel, Ashwin Ganesan
2006 J jnl
On the Existence of Universally Decodable Matrices
CoRR
Ashwin Ganesan, Pascal O. Vontobel
2006 J jnl
On universally decodable matrices for space-time coding.
Des. Codes Cryptogr.
Pascal O. Vontobel, Ashwin Ganesan
2005 J jnl
An Explicit Construction of Universally Decodable Matrices
CoRR
Pascal O. Vontobel, Ashwin Ganesan
2003 J jnl
A virtual input-output framework for transceiver analysis and design for multipath fading channels.
IEEE Trans. Commun.
Ashwin Ganesan, Akbar M. Sayeed
1993 J jnl
A BiCMOS low-distortion 8-MHz low-pass filter.
IEEE J. Solid State Circuits
Scott D. Willingham, Kenneth W. Martin, Ashwin Ganesan