Combinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.authorKizhakkepallathu, Ashik Mathew
dc.contributor.departmentTietoliikenne- ja tietoverkkotekniikan laitosfi
dc.contributor.departmentDepartment of Communications and Networkingen
dc.contributor.labInformation Theoryen
dc.contributor.schoolSähkötekniikan korkeakoulufi
dc.contributor.schoolSchool of Electrical Engineeringen
dc.contributor.supervisorÖstergård, Patric R.J., Prof., Aalto University, Department of Communications and Networking, Finland
dc.date.accessioned2015-09-10T09:02:24Z
dc.date.available2015-09-10T09:02:24Z
dc.date.defence2015-09-18
dc.date.issued2015
dc.format.extent49 + app. 55
dc.format.mimetypeapplication/pdfen
dc.identifier.isbn978-952-60-6327-0 (electronic)
dc.identifier.isbn978-952-60-6326-3 (printed)
dc.identifier.issn1799-4942 (electronic)
dc.identifier.issn1799-4934 (printed)
dc.identifier.issn1799-4934 (ISSN-L)
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/17639
dc.identifier.urnURN:ISBN:978-952-60-6327-0
dc.language.isoenen
dc.opnSzabó, Sándor, Prof., University of Pécs, Hungary
dc.publisherAalto Universityen
dc.publisherAalto-yliopistofi
dc.relation.haspart[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
dc.relation.haspart[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.
dc.relation.haspart[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
dc.relation.haspart[Publication 4]: K. Ashik Mathew, Patric R. J. Ostergard. Hypercube packings and their holes. Congressus Numerantium, 219, 89–95, 2014.
dc.relation.haspart[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
dc.relation.haspart[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.
dc.relation.ispartofseriesAalto University publication series DOCTORAL DISSERTATIONSen
dc.relation.ispartofseries112/2015
dc.revSikirić, Mathieu Dutour, Dr., Ruđer Bošković Institute, Croatia
dc.revVesel, Aleksander, Prof., University of Maribor, Slovenia
dc.subject.keywordcombinatorial algorithmsen
dc.subject.keywordcube packingen
dc.subject.keywordShannon capacityen
dc.subject.keywordcube tilingen
dc.subject.otherComputer scienceen
dc.titleCombinatorial Algorithms for Packings, Coverings and Tilings of Hypercubesen
dc.typeG5 Artikkeliväitöskirjafi
dc.type.dcmitypetexten
dc.type.ontasotDoctoral dissertation (article-based)en
dc.type.ontasotVäitöskirja (artikkeli)fi
local.aalto.archiveyes
local.aalto.digiauthask
local.aalto.digifolderAalto_64733
local.aalto.formfolder2015_09_09_klo_16_44
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
isbn9789526063270.pdf
Size:
330.72 KB
Format:
Adobe Portable Document Format