Andrew Vince

Miklós Bóna, Andrew Vince: The number of ways to assemble a graph. ANALCO 2013: 8-17

Andrew Vince: A Combinatorial Approach to Positional Number Systems. CoRR abs/1205.6460 (2012)

Andrew Vince, Hua Wang: The average order of a subtree of a tree. J. Comb. Theory, Ser. B 100(2): 161-170 (2010)

Andrew Vince, Xiqiang Zheng: Computing the Discrete Fourier Transform on a Hexagonal Lattice. Journal of Mathematical Imaging and Vision 28(2): 125-133 (2007)

Andrew Vince, Hua Wang: Infinitely Many Trees Have Non-Sperner Subtree Poset. Order 24(2): 133-138 (2007)

Deniz Kazanci, Andrew Vince: A Property of Normal Tilings. The American Mathematical Monthly 111(9): 813-816 (2004)

Andrew Vince: A framework for the greedy algorithm. Discrete Applied Mathematics 121(1-3): 247-260 (2002)

Mustafa Atici, Andrew Vince: Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families. Graphs and Combinatorics 18(3): 403-413 (2002)

Andrew Vince: Separation index of a graph. Journal of Graph Theory 41(1): 53-61 (2002)

Andrew Vince, Kenneth Schilling: Almost Fixed Sets: 10843. The American Mathematical Monthly 108(10): 981-982 (2001)

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

Andrew Vince: Self-Replicating Tiles and Their Boundary. Discrete & Computational Geometry 21(3): 463-476 (1999)

Kevin Keating, Andrew Vince: Isohedral Polyomino Tiling of the Plane. Discrete & Computational Geometry 21(4): 615-630 (1999)

H. Pulapaka, Andrew Vince: Non-revisiting paths on surfaces with low genus. Discrete Mathematics 182(1-3): 267-277 (1998)

H. Pulapaka, Andrew Vince: Nonrevisiting Paths on Surfaces. Discrete & Computational Geometry 15(3): 353-357 (1996)

Andrew Vince, Yongzhi Yang: Reconstruction of the set of branches of a graph. Graphs and Combinatorics 12(1): 69-80 (1996)

Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince: On Representations of Some Thickness-Two Graphs. Graph Drawing 1995: 324-332

Wei Z. Kitto, Andrew Vince, David Clifford Wilson: An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra. Discrete Applied Mathematics 52(1): 39-51 (1994)

Andrew Vince: The classification of closed surfaces using colored graphs. Graphs and Combinatorics 9(1): 75-84 (1993)

Andrzej Rucinski, Andrew Vince: The solution to an extremal problem on balanced extensions of graphs. Journal of Graph Theory 17(3): 417-431 (1993)

Andrew Vince: Replicating Tessellations. SIAM J. Discrete Math. 6(3): 501-521 (1993)

Andrew Vince, Clare A. Morris: Discrete mathematics for computing. Ellis Horwood series in mathematics and its applications, Ellis Horwood 1990, isbn 978-0-13-217522-7, pp. 1-297

Andrew Vince, Charles H. C. Little: Discrete Jordan Curve Theorems. J. Comb. Theory, Ser. B 47(3): 251-261 (1989)

Andrzej Rucinski, Andrew Vince: Balanced extensions of graphs and hypergraphs. Combinatorica 8(3): 279-291 (1988)

Andrew Vince: n-Graphs. Discrete Mathematics 72(1-3): 367-380 (1988)

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

Andrew Vince: An algebraic theory of graph factorization. Discrete Mathematics 46(2): 211-213 (1983)

Andrew Vince: Combinatorial maps. J. Comb. Theory, Ser. B 34(1): 1-21 (1983)

Andrew Vince: Regular combinatorial maps. J. Comb. Theory, Ser. B 35(3): 256-277 (1983)