Andrew Vince - RankMe

59 papers A 1Journal 55Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	The average order of a connected induced subgraph of a graph and union-intersection systems. J. Graph Theory Andrew Vince
2024	J	`jnl`	An Extremal Graph Problem on a Grid and an Isoperimetric Problem for Polyominoes. Electron. J. Comb. Andrew Vince
2024	J	`jnl`	Distortion Reversal in Aperiodic Tilings. Discret. Comput. Geom. Louisa Barnsley, Michael F. Barnsley, Andrew Vince
2022	J	`jnl`	A lower bound on the average size of a connected vertex set of a graph. J. Comb. Theory B Andrew Vince
2021	J	`jnl`	The average size of a connected vertex set of a Discret. Math. Andrew Vince
2021	J	`jnl`	The average size of a connected vertex set of a graph - Explicit formulas and open problems. J. Graph Theory Andrew Vince
2018	J	`jnl`	Aparallel digraphs and splicing machines. Discret. Math. Andrew Vince
2018	J	`jnl`	Self-Similar Polygonal Tiling: extended abstract. Electron. Notes Discret. Math. Andrew Vince, Michael F. Barnsley
2017	J	`jnl`	Counting connected sets and connected partitions of a graph. Australas. J Comb. Andrew Vince
2017	J	`jnl`	Self-Similar Polygonal Tiling. Am. Math. Mon. Michael F. Barnsley, Andrew Vince
2016	J	`jnl`	Approximation of rough functions. J. Approx. Theory Michael F. Barnsley, Brendan Harding, Andrew Vince, P. Viswanathan
2016	J	`jnl`	Symmetry in Sphere-Based Assembly Configuration Spaces. Symmetry Meera Sitharam, Andrew Vince, Menghan Wang, Miklós Bóna
2014	J	`jnl`	Fractal Tilings from Iterated Function Systems. Discret. Comput. Geom. Michael F. Barnsley, Andrew Vince
2013	—	`conf`	The number of ways to assemble a graph. ANALCO Miklós Bóna, Andrew Vince
2012	J	`jnl`	A Combinatorial Approach to Positional Number Systems CoRR Andrew Vince
2012	J	`jnl`	The Number of Ways to Assemble a Graph. Electron. J. Comb. Andrew Vince, Miklós Bóna
2010	J	`jnl`	The average order of a subtree of a tree. J. Comb. Theory B Andrew Vince, Hua Wang
2009	J	`jnl`	Arithmetic and Fourier transform for the PYXIS multi-resolution digital Earth model. Int. J. Digit. Earth Andrew Vince, Xiqiang Zheng
2007	J	`jnl`	Computing the Discrete Fourier Transform on a Hexagonal Lattice. J. Math. Imaging Vis. Andrew Vince, Xiqiang Zheng
2007	J	`jnl`	Discrete Lines and Wandering Paths. SIAM J. Discret. Math. Andrew Vince
2007	J	`jnl`	Infinitely Many Trees Have Non-Sperner Subtree Poset. Order Andrew Vince, Hua Wang
2006	J	`jnl`	Indexing the aperture 3 hexagonal discrete global grid. J. Vis. Commun. Image Represent. Andrew Vince
2006	J	`jnl`	Parity Versions of 2-Connectedness. Electron. J. Comb. Charles H. C. Little, Andrew Vince
2004	J	`jnl`	A Property of Normal Tilings. Am. Math. Mon. Deniz Kazanci, Andrew Vince
2004	J	`jnl`	The integrity of a cubic graph. Discret. Appl. Math. Andrew Vince
2003	J	`jnl`	Graph recurrence. Eur. J. Comb. Andrew Vince
2003	—	`ch.`	Topological Graph Theory. Handbook of Graph Theory Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White
2002	J	`jnl`	A framework for the greedy algorithm. Discret. Appl. Math. Andrew Vince
2002	J	`jnl`	Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families. Graphs Comb. Mustafa Atici, Andrew Vince
2002	J	`jnl`	Separation index of a graph. J. Graph Theory Andrew Vince
2001	J	`jnl`	Almost Fixed Sets: 10843. Am. Math. Mon. Andrew Vince, Kenneth Schilling
2000	J	`jnl`	Problem 10843. Am. Math. Mon. Andrew Vince
1999	J	`jnl`	Isohedral Polyomino Tiling of the Plane. Discret. Comput. Geom. Kevin Keating, Andrew Vince
1999	J	`jnl`	On representations of some thickness-two graphs. Comput. Geom. Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
1999	J	`jnl`	Self-Replicating Tiles and Their Boundary. Discret. Comput. Geom. Andrew Vince
1998	J	`jnl`	Cycles in a graph whose lengths differ by one or two. J. Graph Theory J. Adrian Bondy, Andrew Vince
1998	J	`jnl`	Non-revisiting paths on surfaces with low genus. Discret. Math. H. Pulapaka, Andrew Vince
1996	J	`jnl`	Nonrevisiting Paths on Surfaces. Discret. Comput. Geom. H. Pulapaka, Andrew Vince
1996	J	`jnl`	Reconstruction of the set of branches of a graph. Graphs Comb. Andrew Vince, Yongzhi Yang
1995	A	`conf`	On Representations of Some Thickness-Two Graphs. GD Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
1994	J	`jnl`	An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra. Discret. Appl. Math. Wei Z. Kitto, Andrew Vince, David Clifford Wilson
1993	J	`jnl`	Replicating Tessellations. SIAM J. Discret. Math. Andrew Vince
1993	J	`jnl`	The classification of closed surfaces using colored graphs. Graphs Comb. Andrew Vince
1993	J	`jnl`	The solution to an extremal problem on balanced extensions of graphs. J. Graph Theory Andrzej Rucinski, Andrew Vince
1992	J	`jnl`	Dyck's map (3, 7) J. Comb. Theory B Andrew Vince, Steve Wilson
1991	J	`jnl`	Elementary Divisors of Graphs and Matroids. Eur. J. Comb. Andrew Vince
1990	—	`book`	Discrete mathematics for computing. Andrew Vince, Clare A. Morris
1989	J	`jnl`	Discrete Jordan Curve Theorems. J. Comb. Theory B Andrew Vince, Charles H. C. Little
1989	J	`jnl`	Scheduling periodic events. Discret. Appl. Math. Andrew Vince
1988	J	`jnl`	Balanced extensions of graphs and hypergraphs. Comb. Andrzej Rucinski, Andrew Vince
1988	J	`jnl`	Star chromatic number. J. Graph Theory Andrew Vince
1988	J	`jnl`	n-Graphs. Discret. Math. Andrew Vince
1986	J	`jnl`	Strongly balanced graphs and random graphs. J. Graph Theory Andrzej Rucinski, Andrew Vince
1985	J	`jnl`	A Non-Shellable 3-Sphere. Eur. J. Comb. Andrew Vince
1985	J	`jnl`	A shellable poset that is not lexicographically shellable. Comb. Andrew Vince, Michelle L. Wachs
1983	J	`jnl`	An algebraic theory of graph factorization. Discret. Math. Andrew Vince
1983	J	`jnl`	Combinatorial maps. J. Comb. Theory B Andrew Vince
1983	J	`jnl`	Regular combinatorial maps. J. Comb. Theory B Andrew Vince
1981	J	`jnl`	Locally homogeneous graphs from groups. J. Graph Theory Andrew Vince