Skip to main content
padlock icon - secure page this page is secure

Publisher: Elsevier

Volume 157, Number 1, 2010

Editorial Board
pp. ii-ii(1)

Favourites:
ADD

Preface
pp. 1-1(1)
Authors: Garcia-Ferreira, S.; Kawauchi, A.; Kokubu, H.; Kono, A.; Nogura, T.

Favourites:
ADD

Topological complexity is a fibrewise L-S category
pp. 10-21(12)
Authors: Iwase, N.; Sakai, M.

Favourites:
ADD

The a-limit sets of a unimodal map without homtervals
pp. 22-28(7)
Authors: Cui, H.; Ding, Y.

Favourites:
ADD
Favourites:
ADD

Spin structures on instanton moduli spaces
pp. 35-43(9)
Authors: Kamiyama, Y.; Kishimoto, D.

Favourites:
ADD

Abelian torsion groups with a countably compact group topology
pp. 44-52(9)
Authors: Castro-Pereira, I.; Tomita, A. H.

Favourites:
ADD

Set-maximal selections
pp. 53-61(9)
Authors: Gutev, V.; Nogura, T.

Favourites:
ADD

Relative minimality and co-minimality of subgroups in topological groups
pp. 62-76(15)
Authors: Dikranjan, D.; Megrelishvili, M.

Favourites:
ADD

Hyperbolic topology of normed linear spaces
pp. 77-82(6)
Authors: Hattori, Y.; Tsuiki, H.

Favourites:
ADD

Selections and hyperspaces of finite sets
pp. 83-89(7)
Author: Gutev, V.

Favourites:
ADD

The number of critical elements of discrete Morse functions on non-compact surfaces
pp. 90-101(12)
Authors: Ayala, R.; Fernandez, L. M.; Vilches, J. A.

Favourites:
ADD

On spaces which are linearly D
pp. 102-107(6)
Authors: Guo, H.; Junnila, H.

Favourites:
ADD

On scatteredly continuous maps between topological spaces
pp. 108-122(15)
Authors: Banakh, T.; Bokalo, B.

Favourites:
ADD

Selections and countably-approachable points
pp. 123-126(4)
Author: Jiang, N.

Favourites:
ADD

Orderability of subspaces of well-orderable topological spaces
pp. 127-135(9)
Authors: Hirata, Y.; Kemoto, N.

Favourites:
ADD

Spaces of idempotent measures of compact metric spaces
pp. 136-144(9)
Authors: Bazylevych, L.; Repovs, D.; Zarichnyi, M.

Favourites:
ADD

The Wijsman hyperspace of a metric hereditarily Baire space is Baire
pp. 145-151(7)
Authors: Cao, J.; Tomita, A. H.

Favourites:
ADD
Favourites:
ADD

Applications of computational homology to the analysis of treatment response in breast cancer patients
pp. 157-164(8)
Authors: DeWoskin, D.; Climent, J.; Cruz-White, I.; Vazquez, M.; Park, C.; Arsuaga, J.

Favourites:
ADD
Favourites:
ADD
Favourites:
ADD

Coverings of 3-manifolds by open balls and two open solid tori
pp. 179-181(3)
Authors: Gomez-Larranaga, J. C.; Gonzalez-Acuna, F.; Heil, W.

Favourites:
ADD

Braiding a link with a fixed closed braid
pp. 188-192(5)
Author: Kishimoto, K.

Favourites:
ADD

Crosscap numbers of pretzel knots
pp. 193-201(9)
Authors: Ichihara, K.; Mizushima, S.

Favourites:
ADD

Destabilizing Heegaard splittings of knot exteriors
pp. 202-212(11)
Authors: Kobayashi, T.; Saito, T.

Favourites:
ADD

A circular embedding of a graph in Euclidean 3-space
pp. 213-219(7)
Authors: Kobata, K.; Tanaka, T.

Favourites:
ADD

The polynomial invariants of twisted links
pp. 220-227(8)
Author: Kamada, N.

Favourites:
ADD

Link polynomials derived from magnetic graphs
pp. 228-246(19)
Author: Miyazawa, Y.

Favourites:
ADD

A formula for the braid index of links
pp. 247-260(14)
Authors: Lee, S. Y.; Seo, M.

Favourites:
ADD

Enumerating 3-manifolds with lengths up to 9 by a canonical order
pp. 261-268(8)
Authors: Kawauchi, A.; Tayama, I.

Favourites:
ADD
Favourites:
ADD

On alternation numbers of links
pp. 274-279(6)
Author: Kawauchi, A.

Favourites:
ADD

A design for pseudo-Anosov braids using hypotrochoid curves
pp. 280-289(10)
Authors: Kobayashi, T.; Umeda, S.

Favourites:
ADD

The Miyazawa polynomial for long virtual knots
pp. 290-297(8)
Authors: Ishii, A.; Kamada, N.; Kamada, S.

Favourites:
ADD

Upper bound for the alternation number of a torus knot
pp. 302-318(17)
Author: Kanenobu, T.

Favourites:
ADD

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more