Combinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes
Loading...
Journal Title
Journal ISSN
Volume Title
School of Electrical Engineering |
Doctoral thesis (article-based)
| Defence date: 2015-09-18
Checking the digitized thesis and permission for publishing
Instructions for the author
Instructions for the author
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
2015
Major/Subject
Mcode
Degree programme
Language
en
Pages
49 + app. 55
Series
Aalto University publication series DOCTORAL DISSERTATIONS, 112/2015
Description
Supervising professor
Östergård, Patric R.J., Prof., Aalto University, Department of Communications and Networking, FinlandKeywords
combinatorial algorithms, cube packing, Shannon capacity, cube tiling
Parts
-
[Publication 1]: K. Ashik Mathew, L. Sunil Chandran. An upper bound for cubicity in terms of boxicity. Discrete Mathematics, 309, 2571–2574, 2009.
DOI: 10.1016/j.disc.2008.04.011 View at publisher
- [Publication 2]: K. Ashik Mathew, Patric R. J. Ostergard, Alexandru Popa. On the Shannon capacity of triangular graphs. Electronic Journal of Combinatorics, 20(2), #P27, 2013.
-
[Publication 3]: K. Ashik Mathew, Patric R. J. Ostergard, Alexandru Popa. Enumerating cube tilings. Discrete and Computational Geometry, 50, 1112–1122, 2013.
DOI: 10.1007/s00454-013-9547-4 View at publisher
- [Publication 4]: K. Ashik Mathew, Patric R. J. Ostergard. Hypercube packings and their holes. Congressus Numerantium, 219, 89–95, 2014.
-
[Publication 5]: K. Ashik Mathew, Patric R. J. Ostergard. On hypercube packings, blocking sets and a covering problem. Information Processing Letters, 115(2), 141–145, 2015.
DOI: 10.1016/j.ipl.2014.08.005 View at publisher
- [Publication 6]: K. Ashik Mathew, Patric R. J. Ostergard. New lower bounds for the Shannon capacity of odd cycles. Submitted to IEEE Transactions on Information Theory, 2015.
