default search action
Ashwin Ganesan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Ashwin Ganesan:
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model. Theor. Comput. Sci. 947: 113718 (2023) - [c3]Ashwin Ganesan:
Structured Hypergraphs in Cellular Mobile Communication Systems. ICDCN 2023: 188-196 - 2022
- [i21]Ashwin Ganesan:
Structured Hypergraphs in Cellular Mobile Communication Systems. CoRR abs/2207.00515 (2022) - 2021
- [j12]Ashwin Ganesan:
On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models. IEEE Trans. Inf. Theory 67(5): 2952-2957 (2021) - [c2]Ashwin Ganesan:
Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model. ICDCN 2021: 96-105 - 2020
- [j11]Ashwin Ganesan:
Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks. IEEE/ACM Trans. Netw. 28(1): 182-195 (2020) - [i20]Ashwin Ganesan:
Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model. CoRR abs/2007.07921 (2020)
2010 – 2019
- 2019
- [j10]Ashwin Ganesan:
Fault tolerant supergraphs with automorphisms. Discret. Appl. Math. 254: 274-279 (2019) - [i19]Ashwin Ganesan:
On some distributed scheduling algorithms for wireless networks with hypergraph interference models. CoRR abs/1910.01909 (2019) - 2018
- [j9]Ashwin Ganesan:
On the automorphism group of a Johnson graph. Ars Comb. 136: 391-396 (2018) - [i18]Ashwin Ganesan:
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 abs/1810.04109 (2018) - 2017
- [i17]Ashwin Ganesan:
Cayley graphs and symmetric interconnection networks. CoRR abs/1703.08109 (2017) - 2016
- [j8]Ashwin Ganesan:
On the automorphism group of Cayley graphs generated by transpositions. Australas. J Comb. 64: 432-436 (2016) - [j7]Ashwin Ganesan:
Edge-transitivity of Cayley graphs generated by transpositions. Discuss. Math. Graph Theory 36(4): 1035-1042 (2016) - [i16]Ashwin Ganesan:
Fault tolerant supergraphs with automorphisms. CoRR abs/1604.04855 (2016) - 2015
- [i15]Ashwin Ganesan:
Structure of the automorphism group of the augmented cube graph. CoRR abs/1508.07257 (2015) - 2014
- [j6]Ashwin Ganesan:
Performance of sufficient conditions for distributed quality-of-service support in wireless networks. Wirel. Networks 20(6): 1321-1334 (2014) - [i14]Ashwin Ganesan:
A direct product decomposition of the automorphism group of Cayley graphs generated by transposition sets. CoRR abs/1409.5959 (2014) - 2013
- [j5]Ashwin Ganesan:
Automorphism groups of Cayley graphs generated by connected transposition sets. Discret. Math. 313(21): 2482-2485 (2013) - [i13]Ashwin Ganesan:
Automorphisms of Cayley graphs generated by transposition sets. CoRR abs/1303.5974 (2013) - 2012
- [i12]Ashwin Ganesan:
Diameter of Cayley graphs generated by transposition trees. CoRR abs/1202.5888 (2012) - [i11]Ashwin Ganesan:
The automorphism group of Cayley graphs generated by connected transposition sets. CoRR abs/1205.5199 (2012) - [i10]Ashwin Ganesan:
Automorphism groups of graphs. CoRR abs/1206.6279 (2012) - 2011
- [i9]Ashwin Ganesan:
Minimal resolving sets for the hypercube. CoRR abs/1106.3632 (2011) - [i8]Ashwin Ganesan:
On some sufficient conditions for distributed QoS support in wireless networks. CoRR abs/1109.0687 (2011) - [i7]Ashwin Ganesan:
On a bound for the diameter of Cayley networks of symmetric groups generated by transposition trees. CoRR abs/1111.3114 (2011) - [i6]Ashwin Ganesan, Radha R. Iyer:
The regular number of a graph. CoRR abs/1111.6836 (2011) - 2010
- [j4]Ashwin Ganesan:
The performance of an upper bound on the fractional chromatic number of weighted graphs. Appl. Math. Lett. 23(5): 597-599 (2010) - [i5]Ashwin Ganesan:
On some upper bounds on the fractional chromatic number of weighted graphs. CoRR abs/1001.3053 (2010)
2000 – 2009
- 2009
- [c1]Ashwin Ganesan:
On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks. NetCoM 2009: 301-306 - [i4]Ashwin Ganesan:
On some sufficient conditions for distributed Quality-of-Service support in wireless networks. CoRR abs/0906.3782 (2009) - 2007
- [j3]Ashwin Ganesan, Pascal O. Vontobel:
On the Existence of Universally Decodable Matrices. IEEE Trans. Inf. Theory 53(7): 2572-2575 (2007) - 2006
- [j2]Pascal O. Vontobel, Ashwin Ganesan:
On universally decodable matrices for space-time coding. Des. Codes Cryptogr. 41(3): 325-342 (2006) - [i3]Ashwin Ganesan, Pascal O. Vontobel:
On the Existence of Universally Decodable Matrices. CoRR abs/cs/0601066 (2006) - [i2]Pascal O. Vontobel, Ashwin Ganesan:
On Universally Decodable Matrices for Space-Time Coding. CoRR abs/cs/0601075 (2006) - 2005
- [i1]Pascal O. Vontobel, Ashwin Ganesan:
An Explicit Construction of Universally Decodable Matrices. CoRR abs/cs/0508098 (2005) - 2003
- [j1]Ashwin Ganesan, Akbar M. Sayeed:
A virtual input-output framework for transceiver analysis and design for multipath fading channels. IEEE Trans. Commun. 51(7): 1149-1161 (2003)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint