David Petrie Moulton

According to our database, David Petrie Moulton authored at least 7 papers between 1997 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

The Promise Polynomial Hierarchy

Adam Chalcraft, Samuel Kutin, David Petrie Moulton

CoRR, 2013

2009

Simple formulas for lattice paths avoiding certain periodic staircase boundaries.

Robin J. Chapman, Timothy Y. Chow, Amit Khetan, David Petrie Moulton, Robert J. Waters

J. Comb. Theory A, 2009

Graph pegging numbers.

Geir T. Helleloid, Madeeha Khalid, David Petrie Moulton, Philip Matchett Wood

Discret. Math., 2009

2007

Computation at a Distance.

Samuel A. Kutin, David Petrie Moulton, Lawren Smithline

Chic. J. Theor. Comput. Sci., 2007

2005

Flows that are sums of hamiltonian cycles in Cayley graphs on abelian groups.

Dave Witte Morris, Joy Morris, David Petrie Moulton

Discret. Math., 2005

2003

A General Notion of Visibility Graphs.

Mike Develin, Stephen G. Hartke, David Petrie Moulton

Discret. Comput. Geom., 2003

1997

Randomly planar graphs.

Daniel Isaksen, David Petrie Moulton

Discret. Math., 1997