Faculty & Adjuncts

Dale Schoenefeld joined the University in 1976 as an Assistant Professor of Mathematical Sciences. He progressed through the faculty ranks to his current faculty position as Professor of Computer Science and Mathematics, which he has held since 1997.

Journal Articles

• HoeltingC., SchoenefeldD., and WainwrightR. Analysis of Fault Location in a. Vol. 86, Annals of Operations Research, 1999, pp. 161-77.
• ColeD., WainwrightR., and SchoenefeldD. Using Java to Develop Web Based Tutorials. Vol. 30, SIGCSE Bull., 1998, pp. 92–96.
• VernerO., WainwrightR., and SchoenefeldD. Placing Text Labels an Maps and Diagrams Using Genetic Algorithms With Masking. Vol. 9, INFORMS Journal on Computing, 1997, pp. 266–275.
• HaynesT., SenS., SchoenefeldD., and WainwrightR. Evolving a Team. Working notes for the AAAI symposium on genetic programming, 1995, pp. 23–30.
• PrinceC., WainwrightR., SchoenefeldD., and TullT. GATutor: A Graphical Tutorial System for Genetic Algorithms. Vol. 26, SIGCSE Bull., 1994, pp. 203–207.
• SchoenefeldD., and WainwrightR. Integration of Discrete Mathematics Topics into the Secondary Mathematics Curriculum Using Mathematica: A Summer Institute for High School Teachers. Vol. 25, SIGCSE Bull., 1993, pp. 78–82.
• WainwrightR., and SchoenefeldD. Advanced Placement-Plus in Computer Science: A Summer Institute at the University of Tulsa. Vol. 19, SIGCSE Bull., 1987, pp. 84–91.

Conference Proceedings

• CraneD., WainwrightR., and SchoenefeldD. “Scheduling of Multi-Product Fungible Liquid Pipelines Using Genetic Algorithms”. Proceedings of the 1999 ACM Symposium on Applied Computing, ACM, 1999, pp. 280–285.
• ZhuL., WainwrightR., and SchoenefeldD. A Genetic Algorithm for the Point to Multipoint Routing Problem With Varying Number of Requests. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation (ICEC’98), 1998, pp. 171-6.
• ChristensenH., WainwrightR., and SchoenefeldD. A Hybrid Algorithm for the Point to Multipoint Routing Problem. Proceedings of the 1997 ACM Symposium on Applied Computing (SAC’97), 1997, pp. 263–268.
• HoeltingC., SchoenefeldD., and WainwrightR. “A Genetic Algorithm for the Minimum Broadcast Time Problem Using a Global Precedence Vector”. Proceedings of the 1996 ACM Symposium on Applied Computing, ACM, 1996, pp. 258–262.
• Garces-PerezJ., SchoenefeldD., and WainwrightR. “Solving Facility Layout Problems Using Genetic Programming”. Proceedings of the 1st Annual Conference on Genetic Programming, MIT Press, 1996, pp. 182–190.
• AbuAliF., WainwrightR., and SchoenefeldD. “Solving the Subset Interconnection Design Problem Using Genetic Algorithms”. Proceedings of the 1996 ACM Symposium on Applied Computing, ACM, 1996, pp. 299–304.
• HoeltingC., SchoenefeldD., and WainwrightR. “Approximation Techniques for Variations of the P-Median Problem”. Proceedings of the 1995 ACM Symposium on Applied Computing, ACM, 1995, pp. 293–299.
• AbualiF., WainwrightR., and SchoenefeldD. Determinant Factorization and Cycle Basis: Encoding Schemes in Genetic Algorithms for the Representation of Spanning Trees in Incomplete Graphs. Proceedings of the 1995 ACM/SIGAPP Symposium on Applied Computing, 1995.
• AbualiF., WainwrightR., and SchoenefeldD. Determinant Factorization and Cycle Basis: Encoding Schemes for the Representation of Spanning Trees on Incomplete Graphs. Proceedings of the 1995 ACM/SIGAPP Symposium on Applied Computing, 1995, pp. 305–312.
• AbualiF., WainwrightR., and SchoenefeldD. Determinant Factorization: A New Encoding Scheme for Spanning TreesApplied to the Probabilistic Minimum Spanning Tree Problem. Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA’95), 1995, pp. 470–477.
• AbualiF., WainwrightR., and SchoenefeldD. “Solving the Three-Star Tree Isomorphism Problem Using Genetic Algorithms”. Proceedings of the 1995 ACM Symposium on Applied Computing, ACM, 1995, pp. 337–344.
• HaynesT., WainwrightR., SenS., and SchoenefeldD. “Strongly Typed Genetic Programming in Evolving Cooperation Strategies”. Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, PA, USA, July 15-19, 1995, 1995, pp. 271–278.
• AbualiF., SchoenefeldD., and WainwrightR. “Designing Telecommunications Networks Using Genetic Algorithms and Probabilistic Minimum Spanning Trees”. Proceedings of the 1994 ACM Symposium on Applied Computing, ACM, 1994, pp. 242–246.
• AbualiF., SchoenefeldD., and WainwrightR. “Terminal Assignment in a Communications Network Using Genetic Algorithms”. Proceedings of the 22Nd Annual ACM Computer Science Conference on Scaling Up : Meeting the Challenge of Complexity in Real-World Computing Applications: Meeting the Challenge of Complexity in Real-World Computing Applications, ACM, 1994, pp. 74–81.
• AbualiF., SchoenefeldD., and WainwrightR. The Design of a Multipoint Line Topology for a Communication Network Using Genetic Algorithms. Proceedings of the Seventh Oklahoma Conference on Artificial Intelligence, 1993, pp. 101-10.

Book Chapters

• CrawfordK., HoeltingC., WainwrightR., and SchoenefeldD. “A Study of Fixed-Length Subset Recombination”. Foundations of Genetic Algorithms, Vol. 4, Morgan Kaufmann, 1996, pp. 365–378.
• HaynesT., SchoenefeldD., and WainwrightR. “Type Inheritance in Strongly Typed Genetic Programming””. Advances in Genetic Programming 2, MIT Press, 1996, pp. 359-76.

• Introduction to Data Science
• Discrete Mathematics
• Fundamentals of Algorithm and Computer Applications
• Introduction to Topology

• Outstanding Teacher Award