default search action
Andrew Vince
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j53]Andrew Vince:
An Extremal Graph Problem on a Grid and an Isoperimetric Problem for Polyominoes. Electron. J. Comb. 31(2) (2024) - [j52]Louisa Barnsley, Michael F. Barnsley, Andrew Vince
:
Distortion Reversal in Aperiodic Tilings. Discret. Comput. Geom. 71(3): 992-1002 (2024) - 2022
- [j51]Andrew Vince
A lower bound on the average size of a connected vertex set of a graph. J. Comb. Theory B 152: 153-170 (2022) - 2021
- [j50]Andrew Vince:
The average size of a connected vertex set of a k-connected graph. Discret. Math. 344(10): 112523 (2021) - [j49]Andrew Vince
The average size of a connected vertex set of a graph - Explicit formulas and open problems. J. Graph Theory 97(1): 82-103 (2021)
2010 – 2019
- 2018
- [j48]Andrew Vince
Aparallel digraphs and splicing machines. Discret. Math. 341(10): 2883-2893 (2018) - [j47]Andrew Vince
Self-Similar Polygonal Tiling: extended abstract. Electron. Notes Discret. Math. 68: 5-10 (2018) - 2017
- [j46]Andrew Vince:
Counting connected sets and connected partitions of a graph. Australas. J Comb. 67: 281-293 (2017) - [j45]Michael F. Barnsley, Andrew Vince:
Self-Similar Polygonal Tiling. Am. Math. Mon. 124(10): 905-921 (2017) - 2016
- [j44]Michael F. Barnsley, Brendan Harding
Approximation of rough functions. J. Approx. Theory 209: 23-43 (2016) - [j43]Meera Sitharam
Symmetry in Sphere-Based Assembly Configuration Spaces. Symmetry 8(1): 5 (2016) - 2014
- [j42]Michael F. Barnsley, Andrew Vince
Fractal Tilings from Iterated Function Systems. Discret. Comput. Geom. 51(3): 729-752 (2014) - 2013
- [c2]Miklós Bóna
The number of ways to assemble a graph. ANALCO 2013: 8-17 - 2012
- [j41]Andrew Vince
The Number of Ways to Assemble a Graph. Electron. J. Comb. 19(4): 54 (2012) - [i1]Andrew Vince:
A Combinatorial Approach to Positional Number Systems. CoRR abs/1205.6460 (2012) - 2010
- [j40]Andrew Vince
The average order of a subtree of a tree. J. Comb. Theory B 100(2): 161-170 (2010)
2000 – 2009
- 2009
- [j39]Andrew Vince
Arithmetic and Fourier transform for the PYXIS multi-resolution digital Earth model. Int. J. Digit. Earth 2(1): 59-79 (2009) - 2007
- [j38]Andrew Vince
Computing the Discrete Fourier Transform on a Hexagonal Lattice. J. Math. Imaging Vis. 28(2): 125-133 (2007) - [j37]Andrew Vince
Infinitely Many Trees Have Non-Sperner Subtree Poset. Order 24(2): 133-138 (2007) - [j36]Andrew Vince
Discrete Lines and Wandering Paths. SIAM J. Discret. Math. 21(3): 647-661 (2007) - 2006
- [j35]Charles H. C. Little, Andrew Vince
Parity Versions of 2-Connectedness. Electron. J. Comb. 13(1) (2006) - [j34]Andrew Vince
Indexing the aperture 3 hexagonal discrete global grid. J. Vis. Commun. Image Represent. 17(6): 1227-1236 (2006) - 2004
- [j33]Andrew Vince
The integrity of a cubic graph. Discret. Appl. Math. 140(1-3): 223-239 (2004) - [j32]Deniz Kazanci, Andrew Vince:
A Property of Normal Tilings. Am. Math. Mon. 111(9): 813-816 (2004) - 2003
- [j31]Andrew Vince
Graph recurrence. Eur. J. Comb. 24(1): 15-32 (2003) - [p1]Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White:
Topological Graph Theory. Handbook of Graph Theory 2003: 610-786 - 2002
- [j30]Andrew Vince
A framework for the greedy algorithm. Discret. Appl. Math. 121(1-3): 247-260 (2002) - [j29]Mustafa Atici, Andrew Vince
Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families. Graphs Comb. 18(3): 403-413 (2002) - [j28]Andrew Vince:
Separation index of a graph. J. Graph Theory 41(1): 53-61 (2002) - 2001
- [j27]Andrew Vince, Kenneth Schilling:
Almost Fixed Sets: 10843. Am. Math. Mon. 108(10): 981-982 (2001) - 2000
- [j26]Andrew Vince:
Problem 10843. Am. Math. Mon. 107(10): 951 (2000)
1990 – 1999
- 1999
- [j25]Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
On representations of some thickness-two graphs. Comput. Geom. 13(3): 161-171 (1999) - [j24]Andrew Vince
Self-Replicating Tiles and Their Boundary. Discret. Comput. Geom. 21(3): 463-476 (1999) - [j23]Kevin Keating, Andrew Vince
Isohedral Polyomino Tiling of the Plane. Discret. Comput. Geom. 21(4): 615-630 (1999) - 1998
- [j22]H. Pulapaka, Andrew Vince
Non-revisiting paths on surfaces with low genus. Discret. Math. 182(1-3): 267-277 (1998) - [j21]J. Adrian Bondy, Andrew Vince:
Cycles in a graph whose lengths differ by one or two. J. Graph Theory 27(1): 11-15 (1998) - 1996
- [j20]H. Pulapaka, Andrew Vince
Nonrevisiting Paths on Surfaces. Discret. Comput. Geom. 15(3): 353-357 (1996) - [j19]Andrew Vince
Reconstruction of the set of branches of a graph. Graphs Comb. 12(1): 69-80 (1996) - 1995
- [c1]Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
On Representations of Some Thickness-Two Graphs. GD 1995: 324-332 - 1994
- [j18]Wei Z. Kitto, Andrew Vince
An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra. Discret. Appl. Math. 52(1): 39-51 (1994) - 1993
- [j17]Andrew Vince
The classification of closed surfaces using colored graphs. Graphs Comb. 9(1): 75-84 (1993) - [j16]Andrzej Rucinski
The solution to an extremal problem on balanced extensions of graphs. J. Graph Theory 17(3): 417-431 (1993) - [j15]Andrew Vince:
Replicating Tessellations. SIAM J. Discret. Math. 6(3): 501-521 (1993) - 1992
- [j14]Andrew Vince
Dyck's map (3, 7)8 is a counterexample to a clique covering conjecture. J. Comb. Theory B 54(1): 157-160 (1992) - 1991
- [j13]Andrew Vince
Elementary Divisors of Graphs and Matroids. Eur. J. Comb. 12(5): 445-453 (1991) - 1990
- [b1]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
1980 – 1989
- 1989
- [j12]Andrew Vince
Scheduling periodic events. Discret. Appl. Math. 25(3): 299-310 (1989) - [j11]Andrew Vince
Discrete Jordan Curve Theorems. J. Comb. Theory B 47(3): 251-261 (1989) - 1988
- [j10]Andrzej Rucinski
Balanced extensions of graphs and hypergraphs. Comb. 8(3): 279-291 (1988) - [j9]Andrew Vince
n-Graphs. Discret. Math. 72(1-3): 367-380 (1988) - [j8]Andrew Vince
Star chromatic number. J. Graph Theory 12(4): 551-559 (1988) - 1986
- [j7]Andrzej Rucinski
Strongly balanced graphs and random graphs. J. Graph Theory 10(2): 251-264 (1986) - 1985
- [j6]Andrew Vince
A shellable poset that is not lexicographically shellable. Comb. 5(3): 257-260 (1985) - [j5]Andrew Vince
A Non-Shellable 3-Sphere. Eur. J. Comb. 6(1): 91-100 (1985) - 1983
- [j4]Andrew Vince
An algebraic theory of graph factorization. Discret. Math. 46(2): 211-213 (1983) - [j3]Andrew Vince
Combinatorial maps. J. Comb. Theory B 34(1): 1-21 (1983) - [j2]Andrew Vince
Regular combinatorial maps. J. Comb. Theory B 35(3): 256-277 (1983) - 1981
- [j1]Andrew Vince
Locally homogeneous graphs from groups. J. Graph Theory 5(4): 417-422 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: