Picture of social media icons against a pciture of the planet earth

Open Access research that better understands human-computer interaction...

Strathprints makes available scholarly Open Access content by researchers within the Department of Computer & Information Sciences working as part of the Strathclyde iSchool Research Group (SiRG). The SiRG specialises in understanding how people search for information and explores interactive search tools that support their information seeking and retrieval tasks. Research work also includes investigations into information engagement habits of users, particularly in the domains of digital health and social media.

Explore some of this Open Access research from the Departments of Computer & Information Sciences.

Or explore all of Strathclyde's Open Access research...

Browse by Author or creator

Group by: Publication Date | Item type | No Grouping
Number of items: 19.

Article

Arulselvan, Ashwin and Akartunali, Kerem and van den Heuvel, Wilco (2022) Economic lot-sizing problem with remanufacturing option : complexity and algorithms. Optimization Letters, 16 (2). 421–432. ISSN 1862-4472

Polnik, Mateusz and Arulselvan, Ashwin and Riccardi, Annalisa (2021) Scheduling space-to-ground optical communication under cloud cover uncertainty. IEEE Transactions on Aerospace and Electronic Systems, 57 (5). pp. 2838-2849. ISSN 0018-9251

Alozie, Glory Uche and Arulselvan, Ashwin and Akartunali, Kerem and Pasiliao Jr, Eduardo l. (2021) Efficient methods for the distance-based critical node detection problem in complex networks. Computers & Operations Research, 131. 105254. ISSN 0305-0548

Alozie, Glory Uche and Arulselvan, Ashwin and Akartunali, Kerem and Pasiliao, Jr., Eduardo L (2021) A heuristic approach for the distance-based critical node detection problem in complex networks. Journal of the Operational Research Society. ISSN 0160-5682

Attila, Öykü Naz and Agra, Agostinho and Akartunali, Kerem and Arulselvan, Ashwin (2021) Robust formulations for economic lot-sizing problem with remanufacturing. European Journal of Operational Research, 288 (2). pp. 496-510. ISSN 0377-2217

Polnik, Mateusz and Mazzarella, Luca and Di Carlo, Marilena and Oi, Daniel KL and Riccardi, Annalisa and Arulselvan, Ashwin (2020) Scheduling of space to ground quantum key distribution. EPJ Quantum Technology, 7. 3. ISSN 2196-0763

Arulselvan, Ashwin and Bley, Andreas and Ljubić, Ivana (2019) The incremental connected facility location problem. Computers & Operations Research. ISSN 0305-0548 (In Press)

Broby, Daniel and Basu, Devraj and Arulselvan, Ashwin (2019) The role of precision timing in stock market price discovery when trading through distributed ledgers. Journal of Business Thought, 10 (1). ISSN 2231-1734

Morton, Alec and Arulselvan, Ashwin and Thomas, Ranjeeta (2018) Allocation rules for global donors. Journal of Health Economics, 58. pp. 67-75. ISSN 0167-6296

Arulselvan, Ashwin and Rezapour, Mohsen and Welz, Wolfgang A. (2017) Exact approaches for designing multifacility buy-at-bulk networks. INFORMS Journal on Computing, 29 (4). pp. 597-611. ISSN 1526-5528

Arulselvan, Ashwin and Cseh, Ágnes and Groß, Martin and Manlove, David F. and Matuschke, Jannik (2016) Matchings with lower quotas : algorithms and complexity. Algorithmica, 80. pp. 185-208. ISSN 1432-0541

Arulselvan, Ashwin and Groß, Martin and Skutella, Martin (2015) Graph orientation and flows over time. Networks, 66 (3). pp. 196-209. ISSN 1097-0037

Arulselvan, Ashwin (2015) On the geometric rank of matching polytope. Mathematical Programming, 152 (1). pp. 189-200. ISSN 1436-4646

Arulselvan, Ashwin and Maurer, Olaf and Skutella, Martin (2015) An incremental algorithm for uncapacitated facility location problem. Networks, 65 (4). 306–311. ISSN 1097-0037

Book Section

Attila, Öykü Naz and Agra, Agostinho and Akartunali, Kerem and Arulselvan, Ashwin; Gervasi, Osvaldo, ed. (2017) A decomposition algorithm for robust lot sizing problem with remanufacturing option. In: Computational Science and its Applications - ICCSA 2017. Lecture Notes in Computer Science, 10405 . Springer, ITA, pp. 684-695. ISBN 9783319623948

Kotoky, Atreya and Mahajan, Ashutosh and Arulselvan, Ashwin and Belur, Madhu N. and Kalaimani, Rachel K.; (2017) Minimum controller substructure for generic arbitrary pole placement : multicommodity flow and TSP based formulations. In: 2016 European Control Conference (ECC). IEEE, DNK, pp. 849-854. ISBN 9781509025916

Arulselvan, Ashwin and Cseh, Ágnes and Groß, Martin and Manlove, David F. and Matuschke, Jannik; (2015) Many-to-one matchings with lower quotas : algorithms and complexity. In: Algorithms and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9472 . Springer-Verlag, JPN, pp. 176-187. ISBN 9783662489703

Arulselvan, Ashwin and Groß, Martin and Skutella, Martin; Ahn, Hee-Kap and Shin, Chan-Su, eds. (2014) Graph orientations and flows over time. In: Algorithms and Computation. Lecture Notes in Computer Science . Springer, KOR, pp. 741-752. ISBN 9783319130743

Report

Morton, Alec and Arulselvan, Ashwin (2015) Maximising the Benefits of Foreign Aid : Leveraging In-Country Financing. [Report]

This list was generated on Sat May 21 13:21:24 2022 BST.