W. Just; The steady state system problem is NP-hard even for
monotone quadratic Boolean dynamical systems.
W. Just and B. Stigler;
Efficiently Computing Groebner Bases of Ideals of Points.
W. Just and M. Korb;
(In)consistency:
Some low-dimensional examples.
W. Just and S. Ahn;
Lengths of attractors and transients in neuronal networks with random
connectivities.
W. Just;
Approximating Network Dynamics: Some Open Problems.
B. Oduro, M. Grijalva, and W. Just;
Models of disease vector control: A hysteresis-like effect.
W. Just, J. Saldaña, and Ying Xin;
Oscillations in epidemic models with spread of awareness.
W. Just and H. Callender Highlander;
Vaccination strategies for small worlds.
W. Just and S. Ahn;
Lengths of attractors and transients in neuronal networks with random
connectivities.
W. Just, H. Callender, M. D. LaMar, and N. Toporikova; Transmission
of infectious diseases: Data, models, and simulations.
W. Just, H. Callender, and M. D. LaMar;
Disease transmission dynamics on
networks: Network structure vs. disease dynamics.
W. Just and G. A. Enciso;
Ordered Dynamics in Biased and Cooperative Boolean Networks.
W. Just, M. Korb, B. Elbert, and T. R. Young;
Two classes of ODE models with switch-like behavior.
W. Just and M. Malicki;
Cooperative Boolean systems with generically long attractors II.
W. Just and M. Malicki;
Cooperative Boolean systems with generically long attractors I.
W. Just, S. Ahn, and D. Terman;
Neuronal Networks: A Discrete Model.
In Mathematical Concepts and Methods in Modern Biology, R. Robeva and T. Hodge, eds., Academic Press, 2013, 179-211.
S. Ahn and W. Just;
Digraphs vs. Dynamics in Discrete
Models of Neuronal Networks.
W. Just and G. A. Enciso;
Exponentially long orbits in Boolean networks with exclusively positive interactions.
W. Just and
A. Nevai;
A Kolmogorov-type Competition Model with Finitely Supported Allocation Profiles and its
Applications to Plant Competition for Sunlight.
W. Just, S. Ahn, and
D. Terman;
Minimal attractors in digraph system models of neuronal
networks.
W. Just and
A. Nevai;
A Kolmogorov-type Competition Model with Multiple Coexistence States and its
Applications to Plant Competition for Sunlight.
D. Terman,
S. Ahn, X. Wang, and W. Just;
Reducing neuronal networks to discrete dynamics.
W. Just; Data requirements of reverse-engineering algorithms.
W. Just, M.
R. Morris, and X. Sun; The evolution of aggressive losers.
W. Just and B. Stigler;
Computing Groebner Bases of Ideals of Few Points in High Dimensions..
W. Just; Reverse engineering discrete dynamical
systems from data sets with random input vectors.
Journal of Computational Biology 13(8) (2006) 1435-1456.
W. Just and G. Della Vedova;
Multiple Sequence Alignment
as a Facility Location Problem.
INFORMS Journal on Computing 16(4) (2004) 430-440.
W. Just, I.
Shmulevich, and J. Konvalina; The number and probability of canalizing functions.
Physica D 197(3-4) (2004) 211-221.
W. Just and X. Sun; Is the Predicted ESS in the Sequential
Assessment Game Evolvable? Proceedings of GECCO 2004 (Genetic and Evolutionary Computation Conference 2004), Kalyanmoy Deb et al. (eds.), Lecture Notes in Computer Science 3102, Springer Verlag: Berlin, 499-500.
X. Sun and W. Just; Evolution of Strategies in Modified Sequential Assessment Games.
Proceedings of CEC 2004
(2004 Congress on Evolutionary Computation), Garrison W. Greenwood (ed.),
IEEE Press, 388-394.
W. Just and F. Zhu;
Individual-Based Simulations of the War of Attrition.
Behavioural Processes 66(1) (2004) 53-62.
W. Just and M. R. Morris;
The Napoleon Complex: Why Smaller Males Pick Fights.
Evolutionary Ecology 17(5) (2003) 509-522.
Y. Xiao and W. Just;
A Possible Mechanism of Repressing
Cheating Mutants in Myxobacteria.
E. Cantú-Paz et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2003. LNCS 2723, Springer Verlag: Berlin, 154-155.
W. Just and X. Sun; Simulating the Evolution of
Contest Escalation.
Alwyn Barry (Ed.): Workshop Program for GECCO 2003 (Genetic and Evolutionary Computation Conference), 75-77.
W. Just and F. Zhu; Effects of Genetic Architecture
on Simultaneous Evolution of Multiple Traits.
Alwyn Barry (Ed.): Workshop Program for GECCO 2003 (Genetic and Evolutionary Computation Conference), 22-26.
W. Just; Computational complexity of multiple
sequence alignment with SP-score.
Journal of Computational Biology Vol 8, Number 6 (2001) 615-623.
W. Just; $\clubsuit$-like principles under CH.
Fundamenta Mathematicae 170 (2001) 247-256.
J. Brendle, W. Just, and C. Laflamme;
On the refinement and countable refinement numbers.
Questions and Answers in General Topology 18 (2000) 123-128.
Z. T. Balogh, S. W. Davis, W. Just,
S. Shelah, and P. J. Szeptycki;
Strongly almost disjoint sets and weakly uniform bases.
Transactions of the AMS 352 number 11 (2000) 4971-4987.
W. Just and Gianluca Della Vedova;
Multiple Sequence Alignment as a Facility Location Problem.
Proceedings of the Prague Stringology Club Workshop 2000,
Collaborative Report DC-2000-03, M. Balik and M. Simanek, eds.,
Department of Computer Science and Engineering, Czech Technical University,
60-70.
For a pdf-file of this paper, click here.
W. Just, M. Wu, and J. Holt;
How to Evolve a Napoleon Complex. Proceedings of
the 2000 Congress on Evolutionary Computation, IEEE Press 2000,
851-856.
For a Word file of the paper, click
here.
W. Just, M. V. Matveev, and
P. J. Szeptycki; Some results on property (a).
Topology and its Applications 100 (2000) 67-83.
A. V. Arhangel'skii,
W. Just, E. A. Reznichenko, and
P. J. Szeptycki; Sharp bases and weakly uniform bases versus
point-countable bases.
Topology and its Applications 100 (2000) 39-46.
W. Just, S. Shelah, and S. Thomas;
The Automorphism Tower Problem Revisited.
Advances in Mathematics 148(2) (1999) 243-265.
P. DeLaney and W. Just;
Two remarks on weaker connected topologies.
Comment. Math. Univ. Carolinae 40,2 (1999) 327-329.
S. Garcia-Ferreira and W. Just;
Some remarks on the $\gamma_p$-property.
Questions and Answers in General Topology 17 (1999) 1-8.
S. Garcia-Ferreira and W. Just;
Two examples of relatively pseudocompact spaces.
Questions and Answers in General Topology 17 (1999) 35-45.
W. Just and J. Tartir;
A $\kappa$-normal, not densely normal Tychonoff space.
Proceedings of the AMS 127 Number 3 (1999) 901-905.
W. Just and
P. Vojtas; On matrix rapid filters.
Fundamenta Mathematicae 154 (1997) 177-182.
W. Just and
A. Tanner; Splitting $\omega$-covers.
Comment. Math. Univ. Carolinae 38,2 (1997) 375-378.
W. Just, M. Scheepers, J. Steprans, and
P. J. Szeptycki; $G_\delta$-sets in topological spaces and
games.
Fundamenta Mathematicae 153 (1997) 41-58.
A. V. Arhangel'skii,
W. Just, and G. Plebanek;
Sequential continuity on dyadic compacta and topological groups.
Comment. Math. Univ. Carolinae 37,4 (1996) 775-790.
W. Just, A. W. Miller, M. Scheepers, and
P. J. Szeptycki; The combinatorics of open covers II.
Topology and its Applications 73 (1996) 241-266.
W. Just;
The sizes of relatively compact $T_1$-spaces.
Comment. Math. Univ. Carolinae 37,2 (1996) 379-380.
W. Just,
O. Sipacheva, and P. J. Szeptycki;
Nonnormal spaces $C_p(X)$ with countable extent.
Proceedings of the AMS vol. 124(4) (1996) 1227-1235.
arXiv:0711.3475v1
arXiv:1404.5536
Submitted
Submitted to Discrete and Continuous Dynamical Systems B (DCDS-B).
Submitted to Bulletin of Mathematical Biology.
Submitted to Journal of Mathematical Biology.
To appear
To appear as a chapter in the book
Foundations for Undergraduate Research: A Primer for Starting Student Projects. A. Wootton, V. Peterson, C. Lee, eds., Springer Verlag.
Recent articles and book chapters
SIAM Journal on Discrete Mathematics 30(2) (2016) 912–933.
In Raina Robeva (ed.), Algebraic
and Discrete Mathematical Methods for Modern Biology. Academic Press, 2015, 193-215.
The chapter discusses in detail the process of building mathematical models of disease transmission. Students will frequently be challenged to critically examine the simplifying assumptions that are involved in this process. It also provides an intuitive introduction to thinking about simulation models in terms of pseudocode, intended to empower students
with no prior
knowledge of
computer programming to analyze simulation models at a semiformal level.
The chapter includes numerous conceptual and simulation exercises aimed at developing deeper understanding of the concepts.
In: Raina Robeva (ed.), Algebraic
and Discrete Mathematical Methods for Modern Biology. Academic Press, 2015, 217-235.
The second part introduces students to network-based models of disease transmission. In these models it is assumed that the infection can be transmitted only during a direct
contact between two hosts who are adjacent in the underlying contact network. Models of
this kind allow for incorporation of more realistic details than compartment-based models
that assume uniform mixing.
Students are guided through sequences of conceptual and
simulation exercises to discover how the network structure influences the predictions
of the model, including predictions about the effectiveness of possible control measures.
Advances in Difference Equations 2013, 2013:313.
Physica D 264 (2013) 35-48.
Advances in Difference Equations 2013, 2013:268.
Journal of Difference Equations and Applications 19(5) (2013) 772-795.
Discrete and Continuous Dynamical Systems - Series B (DCDS-B)
17(5) (2012) 1365-1381.
Journal of Difference Equations and Applications 18(2) (2012) 223-238.
Nonlinear Dynamics and Systems Theory 11(3) (2011) 275-284.
Journal of Biological Dynamics 3(6) (2009) 599-619.
Physica D 237 (2008) 3186-3196.
Journal of Mathematical Analysis and its Applications 348(2) (2008), 620-636.
Physica D 237(3) (2008) 324-338.
Annals of the New York Academy of Sciences 1115 (2007) 142-153.
Behavioural Processes 74 (2007) 342-350.
Communications in Computer Algebra 40(3) (2006) 65-76.
For a dvi-file of this paper, click here.
For a postscript file of this paper,
click here.
© Winfried Just.
Last modified April 7, 2017.