Art S. Finbow

VLDB 2026 Research / reviewers in the wild / expert

dblp:92/3274 · also Art Stephen Finbow, Arthur S. Finbow · DBLP profile ↗

← Back

9ranked-venue papers

9as first author

1since 2021 · last 2022

0000-0003-2105-2515ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 8 first-author · 1 since 2021Computer networks · 1 · 1 first-author

Year	Publication	Venue	Position
2022	A characterization of well-indumatchable graphs having girth greater than seven Art S. Finbow, Bert L. Hartnell, Michael D. Plummer	Discret. Appl. Math.	1
2020	On the structure of 4-regular planar well-covered graphs Art S. Finbow, Bert L. Hartnell, Michael D. Plummer	Discret. Appl. Math.	1
2017	On well-covered pentagonalizations of the plane Art S. Finbow, Bert L. Hartnell, Michael D. Plummer	Discret. Appl. Math.	1
2016	Well-covered triangulations: Part IV Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer	Discret. Appl. Math.	1
2010	On well-covered triangulations: Part III Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer	Discret. Appl. Math.	1
2010	On the packing chromatic number of some lattices Art S. Finbow, Douglas F. Rall	Discret. Appl. Math.	1
2009	On well-covered triangulations: Part II Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer	Discret. Appl. Math.	1
2003	On well-covered triangulations: Part I Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer	Discret. Appl. Math.	1
1989	On designing a network to defend against random attacks of radius two abstract Abstract This paper considers the following variation on the construction of a reliable communication network. Whenever a vertex is attacked, all vertices within distance 2 are also destroyed (or fail) indirectly. We are interested in designing a connected graph (undirected, all edges of length one) on p vertices such that when a random subset of the vertices are attacked the expected number of vertices that are destroyed (directly and indirectly) is minimized. It is assumed that any of the 2p subsets of vertices is equally likely to be attacked. The optimal structure is determined for all p and is shown to be one of five patterns depending on r where p = 5t + r. Art S. Finbow, Bert L. Hartnell	Networks	1