Andrew Vince

Orcid: 0000-0002-1022-1320

According to our database1, Andrew Vince authored at least 56 papers between 1981 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Distortion Reversal in Aperiodic Tilings.
Discret. Comput. Geom., April, 2024

An Extremal Graph Problem on a Grid and an Isoperimetric Problem for Polyominoes.
Electron. J. Comb., 2024

2022
A lower bound on the average size of a connected vertex set of a graph.
J. Comb. Theory B, 2022

2021
The average size of a connected vertex set of a graph - Explicit formulas and open problems.
J. Graph Theory, 2021

The average size of a connected vertex set of a <i>k</i>-connected graph.
Discret. Math., 2021

2018
Self-Similar Polygonal Tiling: extended abstract.
Electron. Notes Discret. Math., 2018

Aparallel digraphs and splicing machines.
Discret. Math., 2018

2017
Self-Similar Polygonal Tiling.
Am. Math. Mon., 2017

Counting connected sets and connected partitions of a graph.
Australas. J Comb., 2017

2016
Symmetry in Sphere-Based Assembly Configuration Spaces.
Symmetry, 2016

Approximation of rough functions.
J. Approx. Theory, 2016

2014
Fractal Tilings from Iterated Function Systems.
Discret. Comput. Geom., 2014

2012
A Combinatorial Approach to Positional Number Systems
CoRR, 2012

The Number of Ways to Assemble a Graph.
Electron. J. Comb., 2012

2010
The average order of a subtree of a tree.
J. Comb. Theory B, 2010

2009
Arithmetic and Fourier transform for the PYXIS multi-resolution digital Earth model.
Int. J. Digit. Earth, 2009

2007
Discrete Lines and Wandering Paths.
SIAM J. Discret. Math., 2007

Infinitely Many Trees Have Non-Sperner Subtree Poset.
Order, 2007

Computing the Discrete Fourier Transform on a Hexagonal Lattice.
J. Math. Imaging Vis., 2007

2006
Indexing the aperture 3 hexagonal discrete global grid.
J. Vis. Commun. Image Represent., 2006

Parity Versions of 2-Connectedness.
Electron. J. Comb., 2006

2004
A Property of Normal Tilings.
Am. Math. Mon., 2004

The integrity of a cubic graph.
Discret. Appl. Math., 2004

2003
Graph recurrence.
Eur. J. Comb., 2003

Topological Graph Theory.
Proceedings of the Handbook of Graph Theory., 2003

2002
Separation index of a graph.
J. Graph Theory, 2002

Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families.
Graphs Comb., 2002

A framework for the greedy algorithm.
Discret. Appl. Math., 2002

2001
Almost Fixed Sets: 10843.
Am. Math. Mon., 2001

2000
Problem 10843.
Am. Math. Mon., 2000

1999
Self-Replicating Tiles and Their Boundary.
Discret. Comput. Geom., 1999

Isohedral Polyomino Tiling of the Plane.
Discret. Comput. Geom., 1999

On representations of some thickness-two graphs.
Comput. Geom., 1999

1998
Cycles in a graph whose lengths differ by one or two.
J. Graph Theory, 1998

Non-revisiting paths on surfaces with low genus.
Discret. Math., 1998

1996
Reconstruction of the set of branches of a graph.
Graphs Comb., 1996

Nonrevisiting Paths on Surfaces.
Discret. Comput. Geom., 1996

1994
An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra.
Discret. Appl. Math., 1994

1993
Replicating Tessellations.
SIAM J. Discret. Math., 1993

The solution to an extremal problem on balanced extensions of graphs.
J. Graph Theory, 1993

The classification of closed surfaces using colored graphs.
Graphs Comb., 1993

1992
Dyck's map (3, 7)<sub>8</sub> is a counterexample to a clique covering conjecture.
J. Comb. Theory B, 1992

1991
Elementary Divisors of Graphs and Matroids.
Eur. J. Comb., 1991

1990
Discrete mathematics for computing.
Ellis Horwood series in mathematics and its applications, Ellis Horwood, ISBN: 978-0-13-217522-7, 1990

1989
Discrete Jordan Curve Theorems.
J. Comb. Theory B, 1989

Scheduling periodic events.
Discret. Appl. Math., 1989

1988
Star chromatic number.
J. Graph Theory, 1988

n-Graphs.
Discret. Math., 1988

Balanced extensions of graphs and hypergraphs.
Comb., 1988

1986
Strongly balanced graphs and random graphs.
J. Graph Theory, 1986

1985
A Non-Shellable 3-Sphere.
Eur. J. Comb., 1985

A shellable poset that is not lexicographically shellable.
Comb., 1985

1983
Combinatorial maps.
J. Comb. Theory B, 1983

Regular combinatorial maps.
J. Comb. Theory B, 1983

An algebraic theory of graph factorization.
Discret. Math., 1983

1981
Locally homogeneous graphs from groups.
J. Graph Theory, 1981


  Loading...