Daniel R. Page
Ph.D. Candidate, Researcher, Science Educator
Table of Contents
Contact:
UWO Office: MC22, University of Western Ontario/Western University, Canada
Email: drpage[a_t]pagewizardgames.com
Email (University of Western Ontario): dpage6[a_t]uwo.ca
Phone: (226) 4481966 (new number as of November, 2014)

< 
I am from Winnipeg, Manitoba, Canada, and have recently moved to London, Ontario to complete my Ph.D. program at Western University under the supervision of Dr. Roberto SolisOba. My primary research interests are in Theoretical Computer Science:
 Algorithms,
 Combinatorial Optimization,
 Graph Theory,
 Theory of Computation,
 Computational Discrete Mathematics,
 Parallel Algorithms
Recently, I have been interested in scheduling theory and its ties with graph theory in the development of approximation algorithms and computational complexity results. The types of algorithms that interest me most at the present time in no particular order are approximation algorithms, combinatorial algorithms, parallel algorithms, and sequential algorithms. At the present time I am investigating parallel machine scheduling problems, and attempting to further unravel why parallel machine scheduling is so hard. Many of the algorithmic problems I investigate have applications in Operations Research.
2015  (Expected) 2019 Ph.D. Western University/University of Western Ontario (Doctorate) [Started January 2015]
 Field: Computer Science
 Branch: Theoretical Computer Science
 Advisor: Dr. Roberto SolisOba
 Grade Average: 96%
2012  2014 M.Sc University of Manitoba (Master of Science)
2011 B.C.Sc. (Hons.) University of Manitoba (Bachelor of Computer ScienceHonours)
At the moment I am especially interested in the area of Combinatorial Optimization in relation to approximation algorithms. In particular, the relationship between efficient exactsolution algorithms for restricted variations of NPHard problems, their hardness of approximation results, and approximation algorithms for NPHard problems. I focus on both algorithmic and theoretic results.
Current Research
Some of my current investigations:
 The makespan minimization problem on unrelated parallel machines and special cases of this problem: computational complexity results, approximation algorithms, and combinatorial algorithms.
 The study of approximation algorithms and inapproximability for NPhard problems closely related to hard scheduling problems.
Peerreviewed articles and theses
Makespan Minimization on Unrelated Parallel Machines with a Few Bags.
D.R. Page, Roberto SolisOba. Accepted, to be presented at the Twelfth International Conference on Algorithmic Aspects in Information and Management (AAIM 2018).
Makespan Minimization on Unrelated Parallel Machines with Simple JobIntersection Structure and Bounded Job Assignments.
D.R. Page, Roberto SolisOba, Marten Maack. Accepted, to be presented at the 12th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2018).
Approximation Algorithms for the Graph Balancing Problem with Two Speeds and Two Weights [SharedIt  View Only*].
D.R. Page, Roberto SolisOba. Online  August 2018, Journal of Combinatorial Optimization (JOCO), Springer. DOI: https://doi.org/10.1007/s108780180339x
A 3/2Approximation Algorithm for the Graph Balancing Problem with Two Weights [Open Access].
D.R. Page, Roberto SolisOba, Volume 9 (Issue 2), 38  June 2016, Algorithms, MDPI.
Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel Machines with Restricted Processing Times [Mirror][Accepted Version, has a minor correction].
D. R. Page, Volume 2 (Issue 1)  January 2015, SOP Transactions on Applied Mathematics, Scientific Online Publishing.
Thesis: Tractability and Approximability for Subclasses of the Makespan Problem on Unrelated Parallel Machines.
D. R. Page, Supervisor: Dr. Ben Pak Ching Li, M.Sc. Thesis, August 2014, University of Manitoba.
Parallel Algorithm for SecondOrder Restricted Weak Integer Composition Generation for Shared Memory Machines [Accepted Version*].
D. R. Page, Volume 23 (Issue 3)  September 2013, Parallel Processing Letters (PPL), World Scientific.
Generalized Algorithm for Restricted Weak Composition Generation [Accepted Version*].
D. R. Page, Volume 12 (Issue 4), pages 345372  December 2013, Journal of Mathematical Modelling and Algorithms in Operations Research (JMMA), Springer.
Thesis: Generalized Methods for Restricted Weak Composition Enumeration, (not online) (August 2011).
D.R. Page, Supervisor: Dr. John van Rees, University of Manitoba, Summer 2011. (Undergraduate Thesis)
Nonrefereed articles and reports
Retrogressive "Classic Game" Image Processing [ResearchGate].
D.R. Page, Neil D.B. Bruce, Selfpublished Oct. 6, 2014, prepared October 2013. ResearchGate DOI: 10.13140/2.1.1582.4647
Drawing String Graphs for 8Grid Outerplanar Grid Drawings [ResearchGate].
D.R. Page, Selfpublished Oct. 2, 2014, research completed May 2013. ResearchGate DOI: 10.13140/2.1.1496.9602
Survey: Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online) (January 2011).
D. R. Page, originally completed at University of Manitoba, Winter 2011.
I have reviewed for the following conferences and journals:
 Information Processing Letters (2017) (2)
 WAOA (Workshop on Approximation and Online Algorithms) 2016, 2017, 2018 .
This list is not up to date, when the information found in more recent talks can be posted online, this list will be updated.
Talk: Parallel Algorithm for SecondOrder Restricted Weak Composition Generation on Shared Memory Machines [Video].
(March 27, 2014) D. R. Page, Department of Computer Science, University of Manitoba (given to graduate class in a course called Advances in Parallel Computing in Winter 2014)
Seminar: Generalized Methods for Restricted Weak Composition Enumeration [Video],
(March 6, 2012) D. R. Page, Department of Computer Science Seminar Series, University of Manitoba
Generalized Methods for Restricted Weak Composition Enumeration, (not online)
(August 2011) Supervisor: Dr. John van Rees, University of Manitoba, Summer 2011.
Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online)
(April 2011) Originally presented at University of Manitoba, Winter 2011.
All Finite Fields have a Prime Power Order: Morphisms, Cauchy's Theorem, and Proof, (online)
(March 2011) Originally presented at University of Manitoba, Winter 2011. (Updated December 20, 2012)
Teaching
Teaching
The following is my current, or previous teaching experience:
 Western University (January 2015  ...)
 LimitedDuties Instructor (Department of Computer Science)
 CS2210B  Data Structures and Algorithms (Winter 2019)
 Graduate Teaching Assistant
 CS1027B  Computer Science Fundamentals II (Winter 2015)
 CS3307A  ObjectOriented Design and Analysis (Fall 2015)
 CS1027B  Computer Science Fundamentals II (Winter 2016)
 CS3307A  ObjectOriented Design and Analysis (Fall 2016)
 CS1027B  Computer Science Fundamentals II (Winter 2017)
 CS1027  Computer Science Fundamentals II (Summer 2017)
 CS4445A/9544A  Analysis of Algorithms II (Fall 2017)
 CS1027B  Computer Science Fundamentals II (Winter 2018)
 CS1026  Computer Science Fundamentals I (Summer 2018)
 University of Manitoba (May 2012  MidAugust 2014)  Sessional Instructor (Department of Computer Science)
 Rate My Professors: 4.9 out of 5 overall as of Nov. 2014, after my teaching positions at U of M.
 University of Manitoba Teaching History:
Course 
Term 
# of Students 
Mode Letter Grade 
COMP 1260 [Introductory Computer Usage 1] 
Summer Session 2012 
21 
A 
COMP 1260 [Introductory Computer Usage 1] 
Fall 2012 
74 
A 
COMP 1260 [Introductory Computer Usage 1] 
Winter 2013 
68 
A 
COMP 2080 [Analysis of Algorithms] 
Summer Session 2013 
44 
A 
COMP 1260 [Introductory Computer Usage 1] 
Fall 2013 
125 
A 
COMP 1260 [Introductory Computer Usage 1] 
Winter 2014 
72 
A 
COMP 2080 [Analysis of Algorithms] 
Summer Session 2014 
46 
B+ 
 Western Canada Aviation Museum (November 2011  Current (away since beginning of November 2014))  Museum Interpreter
 Conducts tours, and educational programs under the Take Flight Program.
 Hosts birthday parties, which entails the tour, activities, and facilitating the event.
 Mad Science (September 2011  April 2012)  Science Instructor
 Lunch Hour, and Afterschool science programs.
 Maximum of 20 students ranging from grades one to six.
 Programs range from 6 to 8 week programs.
 One hour classes that meet weekly.
Tutoring
Due to my schedule, I will not be taking on any clients. I have tutored the following courses in the past:
Secondary School Level:
Post Secondary School Level:
Red River College
University of Manitoba

COMP1010  Introduction to Computer Science 1

COMP1020  Introduction to Computer Science 2

COMP2130  Discrete Mathematics for Computer Science

COMP2140  Data Structures and Algorithms

COMP2080  Analysis of Algorithms

COMP3170  Analysis of Algorithms and Data Structures

MATH1500  Introduction to Calculus

MATH1700  Calculus 2

STAT1000  Basic Statistical Analysis

SOGS, Western University  SOGS Graduate Student Teaching Awards Nominee (2017/2018)
 Nominated while being a TA for CS1027 (Summer 2017)..

UWORCS 2018, Western University  First Prize: Data Mining, Machine Learning, AI & Theory of Computer Science (April 2018)
 Money Prize ($500), and certificate for my talk JobIntersection Structure and Machine Capacities and Bags. Oh my! Approximating Makespan Minimization on Unrelated Parallel Machines.
 Ontario Graduate Scholarship, held Fall 2017 to the end of Summer 2018 ($15,000, distributed over 3 terms).

SOGS, Western University  SOGS Graduate Student Teaching Awards Nominee (2016/2017)
 Nominated by students and faculty. Nominated while being a TA for CS1027B and CS3307A.

UWORCS 2017, Western University  First Prize: Computer Algebra and Theory of Computer Science (April 2017)
 Money Prize ($250), and certificate for my talk Approximation Algorithms for Scheduling Unrelated Parallel Machines.

SOGS, Western University  SOGS Graduate Student Teaching Awards Nominee (2015/2016)
 Nominated by students and faculty. Nominated while being a TA for CS1027B.

UWORCS 2016, Western University  First Prize: Theory of Computer Science, Computer Algebra and Symbolic Computation (April 2016)
 Money Prize ($250), and certificate for my talk Understanding the Gap: Approximation Algorithms and Inapproximability for the Makespan Minimization Problem on Unrelated Parallel Machines.

University 1, University of Manitoba  University 1 Excellence in Teaching Award Nominee (2012/2013)

I am a user on Quora and ResearchGate. On Quora I have been a mostviewed writer on various topics relevant to Theoretical Computer Science, Top Writer 2018.
Here you will find a small set of examples of software I have worked outside my academic work, independently:
Notes
*Please cite the published version, not the accepted version.
**Course is currently active.
Back To Top of Page 