Andrew Vince - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2024

Distortion Reversal in Aperiodic TilingsLouisa Barnsley, Michael F. Barnsley, Andrew Vince. dcg, 71(3):992-1002, April 2024. [doi]

2022

A lower bound on the average size of a connected vertex set of a graphAndrew Vince. jctb, 152:153-170, 2022. [doi]

2021

k-connected graphAndrew Vince. DM, 344(10):112523, 2021. [doi]

The average size of a connected vertex set of a graph - Explicit formulas and open problemsAndrew Vince. jgt, 97(1):82-103, 2021. [doi]

2018

Aparallel digraphs and splicing machinesAndrew Vince. DM, 341(10):2883-2893, 2018. [doi]

Self-Similar Polygonal Tiling: extended abstractAndrew Vince, Michael F. Barnsley. endm, 68:5-10, 2018. [doi]

2017

Self-Similar Polygonal TilingMichael F. Barnsley, Andrew Vince. tamm, 124(10):905-921, 2017. [doi]

Counting connected sets and connected partitions of a graphAndrew Vince. ajc, 67:281-293, 2017. [doi]

2016

Approximation of rough functionsMichael F. Barnsley, Brendan Harding, Andrew Vince, P. Viswanathan. jat, 209:23-43, 2016. [doi]

Symmetry in Sphere-Based Assembly Configuration SpacesMeera Sitharam, Andrew Vince, Menghan Wang, Miklós Bóna. symmetry, 8(1):5, 2016. [doi]

2014

Fractal Tilings from Iterated Function SystemsMichael Barnsley, Andrew Vince. dcg, 51(3):729-752, 2014. [doi]

2013

The number of ways to assemble a graphMiklós Bóna, Andrew Vince. analco 2013: 8-17 [doi]

2012

The Number of Ways to Assemble a GraphAndrew Vince, Miklós Bóna. combinatorics, 19(4):54, 2012. [doi]

2010

The average order of a subtree of a treeAndrew Vince, Hua Wang. JCT, 100(2):161-170, 2010. [doi]

2007

Computing the Discrete Fourier Transform on a Hexagonal LatticeAndrew Vince, Xiqiang Zheng. jmiv, 28(2):125-133, 2007. [doi]

Infinitely Many Trees Have Non-Sperner Subtree PosetAndrew Vince, Hua Wang. order, 24(2):133-138, 2007. [doi]

2004

A Property of Normal TilingsDeniz Kazanci, Andrew Vince. tamm, 111(9):813-816, 2004. [doi]

2003

Topological Graph TheoryTomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 610-786, Chapman & Hall / Taylor & Francis, 2003. [doi]

2002

Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash FamiliesMustafa Atici, Andrew Vince. gc, 18(3):403-413, 2002. [doi]

A framework for the greedy algorithmAndrew Vince. DAM, 121(1-3):247-260, 2002.

Separation index of a graphAndrew Vince. jgt, 41(1):53-61, 2002. [doi]

2001

Almost Fixed Sets: 10843Andrew Vince, Kenneth Schilling. tamm, 108(10):981-982, 2001. [doi]

2000

Problem 10843Andrew Vince. tamm, 107(10):951, 2000. [doi]

1999

On representations of some thickness-two graphsJoan P. Hutchinson, Thomas C. Shermer, Andrew Vince. comgeo, 13(3):161-171, 1999.

Isohedral Polyomino Tiling of the PlaneKevin Keating, Andrew Vince. dcg, 21(4):615-630, 1999. [doi]

Self-Replicating Tiles and Their BoundaryAndrew Vince. dcg, 21(3):463-476, 1999. [doi]

1998

Non-revisiting paths on surfaces with low genusH. Pulapaka, Andrew Vince. DM, 182(1-3):267-277, 1998. [doi]

1996

Nonrevisiting Paths on SurfacesH. Pulapaka, Andrew Vince. dcg, 15(3):353-357, 1996. [doi]

Reconstruction of the set of branches of a graphAndrew Vince, Yongzhi Yang. gc, 12(1):69-80, 1996. [doi]

1995

On Representations of Some Thickness-Two GraphsJoan P. Hutchinson, Thomas C. Shermer, Andrew Vince. gd 1996: 324-332

1994

An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By PermutohedraWei Z. Kitto, Andrew Vince, David Clifford Wilson. DAM, 52(1):39-51, 1994. [doi]

1993

The solution to an extremal problem on balanced extensions of graphsAndrzej Rucinski 0001, Andrew Vince. jgt, 17(3):417-431, 1993. [doi]

Replicating TessellationsAndrew Vince. siamdm, 6(3):501-521, 1993.

The classification of closed surfaces using colored graphsAndrew Vince. gc, 9(1):75-84, 1993. [doi]

1990

Discrete mathematics for computingAndrew Vince, Clare A. Morris. Ellis Horwood series in mathematics and its applications, Ellis Horwood, 1990.

1989

Discrete Jordan Curve TheoremsAndrew Vince, Charles H. C. Little. JCT, 47(3):251-261, 1989. [doi]

1988

Balanced extensions of graphs and hypergraphsAndrzej Rucinski, Andrew Vince. combinatorica, 8(3):279-291, 1988.

n-GraphsAndrew Vince. DM, 72(1-3):367-380, 1988. [doi]

1986

Strongly balanced graphs and random graphsAndrzej Rucinski 0001, Andrew Vince. jgt, 10(2):251-264, 1986. [doi]

1985

A shellable poset that is not lexicographically shellableAndrew Vince, Michelle L. Wachs. combinatorica, 5(3):257-260, 1985.

A Non-Shellable 3-SphereAndrew Vince. ejc, 6(1):91-100, 1985. [doi]

1983

An algebraic theory of graph factorizationAndrew Vince. DM, 46(2):211-213, 1983. [doi]

Combinatorial mapsAndrew Vince. JCT, 34(1):1-21, 1983. [doi]

Regular combinatorial mapsAndrew Vince. JCT, 35(3):256-277, 1983. [doi]

1981

Locally homogeneous graphs from groupsAndrew Vince. jgt, 5(4):417-422, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL