- Using cellular graph embeddings in solving all pairs shortest paths problems.
Journal of Algorithms,Vol. 19, pp 45-85, 1995.- Increasing the weight of minimum spanning trees (with Roberto Solis-Oba).
Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 539-546,- January 1996.
- Searching intervals and compact routing tables.
Algorithmica,Vol. 15, pp 448-466, 1996.- Efficient algorithms for robustness in matroid optimization (with Roberto
- Solis-Oba).
Proc. 8th ACM-SIAM Symposium on Discrete Algorithms,- pp. 659-668, January 1997.
- Ambivalent data structures for dynamic 2-edge-connectivity and
ksmallest- spanning trees.
SIAM Journal on Computing, Vol. 26, pp 484-538, 1997.- A data structure for dynamically maintaining rooted trees.
Journal of Algorithms,Vol. 24, pp 37-65, 1997.- Maintaining regular properties dynamically in
k-terminal graphs.Algorithmica, Vol. 22, pp 330-350, 1998.- Algorithms for measuring perturbability in matroid optimization (with Roberto Solis-Oba).
Combinatorica, Vol. 18, pp. 503-518, 1998.- Increasing the weight of minimum spanning trees (with Roberto Solis-Oba).
Journal of Algorithms, Vol. 33, pp. 244-266, 1999.- Geometric dissections that swing and twist.
Discrete and Computational Geometry, Japanese Conference, JCDCG 2000,- Springer Verlag, LNCS 2098, 2001, pp. 137-148.
- Geometric dissections now swing and twist.
Mathematical Intelligencer, Vol. 23, No. 3, pp. 9-20, 2001.- Piano-hinged dissections: Now let's fold.
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002,- Springer Verlag, LNCS 2866, 2003, pp. 159-171.
- Hinged dissection of polygons is hard (with Robert A. Hearn and Erik D. Demaine).
Proc. 15th Canadian Conference on Computational Geometry,- Halifax, Canada, pp. 98-102, August 2003.
- A new wrinkle on an old folding problem.
College Mathematics JournalVol. 34, No. 4, (September 2003), pp. 258-263.- Hinged dissection of polyominoes and polyforms (with Erik Demaine, Martin Demaine,
- David Eppstein, and Erich Friedman).
Computational Geometry: Theory and Applications,- Vol. 31, No. 3 (June 2005), pp. 237-262.
- The manifold beauty of piano-hinged dissections.
Renaissance Banff: Mathematics, Music, Art, Culture,- Alberta, Canada, pp. 1-8, August 2005.
- Reflecting well: Dissections of two regular polygons to one.
Mathematics Magazine, Vol. 79, No. 2 (April 2006), pp. 87-95.- Efficient algorithms for robustness in resource allocation and scheduling problems (with Roberto Solis-Oba).
Theoretical Computer Science,Vol. 352, Nos. 1-3 (2006), pp. 250-265.- Unexpected twists in geometric dissections,
Graphs and Combinatorics, Vol. 23[Suppl](2007), pp. 245-258.- Symmetry and structure in twist-hinged dissections of polygonal rings and polygonal anti-rings.
Proc. Bridges Donostia: Mathematics, Music, Art, Architecture, Culture,- San Sebastian, Spain, pp. 21-28, July 2007.
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (with Barry Wittman).
APPROX and RANDOM 2007, LNCS 4627,- Princeton, NJ, pp. 119-133, August 2007.
- The heptagon to the square, and other wild twists.
Mathematical Intelligencer, Vol. 29, No. 4, pp. 23-33, 2007.- A tree-covering problem arising in integrity of tree-structured data (with Mikhail J. Atallah and Ashish Kundu).
Information Processing Letters, Vol. 109, No. 1, pp. 79-82, 2008.- Designing a table both swinging and stable.
College Mathematics JournalVol. 34, No. 4, pp. 258-266, 2008.- On the utility of inference mechanisms (with Ethan Blanton and Sonia Fahmy).
29th IEEE International Conference on Distributed Computing Systems,- Montreal, Quebec, Canada, pp. 256-263, June 2009.
- Polishing some visual gems,
Math Horizons, September 2009, pp. 21-25.- Casting light on cube dissections.
Mathematics Magazine, Vol. 82, No. 5 (December 2009), pp. 323-331.- Hugo Hadwiger's influence on geometric dissections with special properties.
Elemente der Mathematik, Vol. 65, No. 4, pp. 154-164, 2010.- On the applicability of network inference mechanisms (with Ethan Blanton, Sonia Fahmy, and Sriharsha Gangam).
IEEE Transactions on Parallel and Distributed Systems, Vol. 22, No. 4, pp. 662-672, 2011.- Folding polyominoes from one level to two.
College Mathematics Journal, Vol. 42, No. 4, pp. 265-274, 2011.- Bracing regular polygons as we race into the future.
College Mathematics Journal, Vol. 43, No. 1, pp. 43-49, 2012.- Also selected for
Martin Gardner in the Twenty-First Century,ed. Michael Henle

and Brian Hopkins, Mathematical Association of America, Washington, DC (2012), pp. 11-18.

(Note that my middle initial is erroneously identified as "W" in this book.)- The proof is in the pizza.
Mathematics Magazine, Vol. 85, No. 1, pp. 26-33, 2012.- Approximation algorithms for the traveling repairman and speeding deliveryman problems (with Barry Wittman).
Algorithmica, Vol. 62, Nos. 3-4, pp. 1198-1221, 2012.- My parade of algorithmic mathematical art.
Proc. Bridges Towson 2012: Mathematics, Music, Art, Architecture, Culture,- Towson, Maryland, July 2012, pp. 41-48.
- Artfully folding hexagons, dodecagons, and dodecagrams.
Proc. Bridges Enschede 2013: Mathematics, Music, Art, Architecture, Culture,- Enschede, the Netherlands, July 2013, pp. 135-142.
- Folding pseudo-stars that are cyclicly hinged.
Proc. Bridges Baltimore 2015: Mathematics, Music, Art, Architecture, Culture,- Baltimore, Maryland, July 2015, pp 1-8.
- Hinged dissections inspired by Ernest Freese's manuscript on geometric dissections.
- presentation at MOVES 2015 (Mathematics Of Various Entertaining Subjects),
- New York, NY, August 2015.

- Enhanced family of arguably minimal dissections of squares.
- revised September 2014. [in 3to4/art10/RichSqu.pdf]
- Flexing our models: tessellations, transformations, tunnels.
- revised September 2014. [in fold/art3/sfspecialy.pdf]

*Last updated April 22, 2015.*