Result 1 to 20 from 507 total
Edge colored hypergraphic arrangements. (English)
Pure Appl. Math. Q. 8, No. 3, 755-777 (2012).
1
Antimagicness of some families of generalized graphs. (English)
Australas. J. Comb. 53, 179-190 (2012).
2
Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 249-259 (2012).
3
Matching sparse sets of cardiac image cross-sections using large deformation diffeomorphic metric mapping algorithm. (English)
Camara, Oscar (ed.) et al., Statistical atlases and computational models of the heart. Imaging and modelling challenges. Second international workshop, STACOM 2011, held in conjunction with MICCAI 2011, Toronto, ON, Canada, September 22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28325-3/pbk). Lecture Notes in Computer Science 7085, 234-243 (2012).
4
The maximum degree and diameter-bounded subgraph in the mesh. (English)
Discrete Appl. Math. 160, No. 12, 1782-1790 (2012).
5
Construction of antimagic labeling for the Cartesian product of regular graphs. (English)
Math. Comput. Sci. 5, No. 1, 81-87 (2011).
6
Super edge-antimagic total labelings of $mK_{n,n,n}$. (English)
Ars Comb. 101, 97-107 (2011).
7
Egomotion estimation with optic flow and air velocity sensors. (English)
Biol. Cybern. 104, No. 6, 351-367 (2011).
8
Construction for antimagic generalized web graphs. (English)
AKCE Int. J. Graphs Comb. 8, No. 2, 141-149 (2011).
9
Small vertex-transitive and Cayley graphs of girth six and given degree: An algebraic approach. (English)
J. Graph Theory 68, No. 4, 265-284 (2011).
10
On magicness and antimagicness of the union of 4-regular circulant graphs. (English)
Australas. J. Comb. 50, 141-153 (2011).
11
On graphs of defect at most 2. (English)
Discrete Appl. Math. 159, No. 13, 1331-1344 (2011).
12
Nonexistence of graphs with cyclic defect. (English)
Electron. J. Comb. 18, No. 1, Research Paper P71, 5 p., electronic only (2011).
13
On antimagic labeling for generalized web and flower graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 303-313 (2011).
14
On a relationship between completely separating systems and antimagic labeling of regular graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 238-241 (2011).
15
Statistical analysis of cortical morphometrics using pooled distances based on labeled cortical distance maps (English)
Journal of Mathematical Imaging and Vision 40, No. 1, 20-35 (2011).
16
Quantization and analysis of hippocampal morphometric changes due to dementia of alzheimer type using metric distances based on large deformation diffeomorphic metric mapping (English)
Comp. Med. Imag. and Graph. 35, No. 4, 275-293 (2011).
17
io-port 50224605 Lau, Wan F.;
Withka, Jane M.;
Hepworth, David;
Magee, Thomas V.;
Du, Yuhua J.;
Bakken, Gregory A.;
Miller, Michael D.;
Hendsch, Zachary S.;
Thanabal, Venkataraman;
Kolodziej, Steve A.;
Xing, Li;
Hu, Qiyue;
Narasimhan, Lakshmi S.;
Love, Robert;
Charlton, Maura E.;
Hughes, Samantha;
Van Hoorn, Willem P.;
Mills, James E.
Design of a multi-purpose fragment screening library using molecular complexity and orthogonal diversity metrics (English)
Journal of Computer-Aided Molecular Design 25, No. 7, 621-636 (2011).
18
Construction of antimagic labeling for the Cartesian product of regular graphs (English)
Mathematics in Computer Science 5, No. 1, 81-87 (2011).
19
Foreword (English)
Mathematics in Computer Science 5, No. 1, 1-2 (2011).
20
Result 1 to 20 from 507 total
Start
Contact
Print
General Help
