Picture of blood cells

Open Access research which pushes advances in bionanotechnology

Strathprints makes available scholarly Open Access content by researchers in the Strathclyde Institute of Pharmacy & Biomedical Sciences (SIPBS) , based within the Faculty of Science.

SIPBS is a major research centre in Scotland focusing on 'new medicines', 'better medicines' and 'better use of medicines'. This includes the exploration of nanoparticles and nanomedicines within the wider research agenda of bionanotechnology, in which the tools of nanotechnology are applied to solve biological problems. At SIPBS multidisciplinary approaches are also pursued to improve bioscience understanding of novel therapeutic targets with the aim of developing therapeutic interventions and the investigation, development and manufacture of drug substances and products.

Explore the Open Access research of SIPBS. Or explore all of Strathclyde's Open Access research...

Browse by Journal or other publication

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Publication Date | Item type | No Grouping
Jump to: 2019 | 2018 | 2017 | 2016 | 2015 | 2013 | 2010 | 2007
Number of items: 14.

2019

Cheon, Gi-Sang and Kitaev, Sergey and Kim, Jinha and Kim, Minki (2019) Word-representability of Toeplitz graphs. Discrete Applied Mathematics. pp. 1-18. ISSN 0166-218X (In Press)

Kitaev, Sergey and Potapov, Vladimir N. and Vajnovszki, Vincent (2019) On shortening u-cycles and u-words for permutations. Discrete Applied Mathematics, 260. pp. 203-213. ISSN 0166-218X

2018

Glen, Marc and Kitaev, Sergey and Pyatkin, Artem (2018) On the representation number of a crown graph. Discrete Applied Mathematics, 244. pp. 89-93. ISSN 0166-218X

2017

Collins, Andrew and Kitaev, Sergey and Lozin, Vadim V. (2017) New results on word-representable graphs. Discrete Applied Mathematics, 216 (Part 1). pp. 136-141. ISSN 0166-218X

2016

Illés, Tibor and Richárd, Molnár-Szipai (2016) Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems. Discrete Applied Mathematics, 214. pp. 201-210. ISSN 0166-218X

Gao, Alice L L and Kitaev, Sergey and Zhang, Philip B. (2016) Pattern-avoiding alternating words. Discrete Applied Mathematics, 207. pp. 56-66. ISSN 0166-218X

Chen, Herman Z.Q. and Kitaev, Sergey and Sun, Brian Y. (2016) Word-representability of triangulations of grid-covered cylinder graphs. Discrete Applied Mathematics. ISSN 0166-218X (In Press)

Halldórsson, Magnús M. and Kitaev, Sergey and Pyatkin, Artem (2016) Semi-transitive orientations and word-representable graphs. Discrete Applied Mathematics, 201. pp. 164-171. ISSN 0166-218X

2015

Kitaev, Sergey and Remmel, Jeffrey (2015) (a,b)-rectangle patterns in permutations and words. Discrete Applied Mathematics, 186. pp. 128-146. ISSN 0166-218X

2013

Kitaev, Sergey and Salimov, Pavel and Severs, Christopher and Ulfarsson, Henning (2013) Restricted non-separable planar maps and some pattern avoiding permutations. Discrete Applied Mathematics, 161 (16-17). pp. 2514-2526. ISSN 0166-218X

Avgustinovich, Sergey and Kitaev, Sergey and Valyuzhenich, Alexander (2013) Avoidance of boxed mesh patterns on permutations. Discrete Applied Mathematics, 161 (1-2). pp. 43-51. ISSN 0166-218X

Estrada, Ernesto and Sanchez-Lirola, M.G. and de la Pena, Jose Antonio (2013) Hyperspherical embedding of graphs and networks in communicability spaces. Discrete Applied Mathematics, n/a (n/a). pp. 1-25.

2010

Avgustinovich, Sergey and Glen, Amy and Halldorsson, Bjarni and Kitaev, Sergey (2010) On shortest crucial words avoiding abelian powers. Discrete Applied Mathematics, 158 (6). pp. 605-607. ISSN 0166-218X

2007

Kitaev, Sergey (2007) Introduction to partially ordered patterns. Discrete Applied Mathematics, 155 (8). pp. 929-944. ISSN 0166-218X

This list was generated on Wed Jul 24 04:21:54 2019 BST.