D. Jacob Wildstrom

According to our database, D. Jacob Wildstrom authored at least 9 papers between 2008 and 2022.

Collaborative distances:

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

2022

Systems of Overlap Representation for Families of Intervals.

Adam S. Jobson, André E. Kézdy, Kevin G. Milans, Douglas B. West, D. Jacob Wildstrom

Graphs Comb., 2022

2018

Axiomatic characterization of the center function. The case of non-universal axioms.

Manoj Changat, Shilpa Mohandas, Henry Martyn Mulder, Prasanth G. Narasimha-Shenoi, Robert C. Powers, D. Jacob Wildstrom

Discret. Appl. Math., 2018

2017

Variations on Narrow Dots-and-Boxes and Dots-and-Triangles.

Adam S. Jobson, Levi Sledd, Susan Calcote White, D. Jacob Wildstrom

Integers, 2017

Axiomatic characterization of the center function. The case of universal axioms.

Manoj Changat, Shilpa Mohandas, Henry Martyn Mulder, Prasanth G. Narasimha-Shenoi, Robert C. Powers, D. Jacob Wildstrom

Discret. Appl. Math., 2017

2016

An upper bound on the extremal version of Hajnal's triangle-free game.

Csaba Biró, Paul Horn, D. Jacob Wildstrom

Discret. Appl. Math., 2016

2013

Parametrized relocation of low-mobility resources.

D. Jacob Wildstrom

Networks, 2013

Stack Domination Density.

Timothy Brauch, Paul Horn, Adam S. Jobson, D. Jacob Wildstrom

Graphs Comb., 2013

2010

Resource relocation on asymmetric networks.

D. Jacob Wildstrom

J. Graph Algorithms Appl., 2010

2008

Cost thresholds for dynamic resource location.

D. Jacob Wildstrom

Discret. Appl. Math., 2008