Daniel R. Page
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 Solis-Oba. My primary research interests are in Theoretical Computer Science:
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 any particular order are approximation algorithms, combinatorial algorithms, parallel algorithms, and sequential algorithms. Got a problem that has traits that has combinatorial properties, especially additive properties that are shared by combinatorial objects like graphs, weak integer compositions, and more? It's more than likely that I will find the problem interesting to investigate if it is a pragmatic scientific venture.
2015 - ... Ph.D. Western University/University of Western Ontario (Doctorate) [Started January 2015]
2012 - 2014 M.Sc University of Manitoba (Master of Science)
2011 B.C.Sc. (Hons.) University of Manitoba (Bachelor of Computer Science-Honours)
At the moment I am especially interested in the area of Combinatorial Optimization in relation to approximation algorithms. In particular, the relationship between efficient exact-solution algorithms for restricted variations of NP-Hard problems, their hardness of approximation results, and approximation algorithms for NP-Hard problems. I focus on algorithmic and theoretic results. Problems with additive combinatorial properties are especially interesting to me.
Some of my current investigations:
Peer-reviewed articles and theses
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights [Open Access].
Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel Machines with Restricted Processing Times [Accepted Version*].
Thesis: Tractability and Approximability for Subclasses of the Makespan Problem on Unrelated Parallel Machines.
Parallel Algorithm for Second-Order Restricted Weak Integer Composition Generation for Shared Memory Machines [Accepted Version*].
Generalized Algorithm for Restricted Weak Composition Generation [Accepted Version*].
Thesis: Generalized Methods for Restricted Weak Composition Enumeration, (not online) (August 2011).
Non-refereed articles and reports
Drawing String Graphs for 8-Grid Outerplanar Grid Drawings [ResearchGate].
Survey: Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online) (January 2011).
I have reviewed for the following conferences and journals:
Talk: Parallel Algorithm for Second-Order Restricted Weak Composition Generation on Shared Memory Machines [Video].
Seminar: Generalized Methods for Restricted Weak Composition Enumeration [Video],
Generalized Methods for Restricted Weak Composition Enumeration, (not online)
Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online)
All Finite Fields have a Prime Power Order: Morphisms, Cauchy's Theorem, and Proof, (online)
Teaching, and Tutoring
The following is my current, or previous teaching experience:
I tutor through my personal services, but also I have in the past with Tutoring Works. I have been tutoring privately since 2007. I currently reside in the London, Ontario area. In the past and currently I offer services by the following methods:
My services are offered to students in the home, or on campus, at my home (locally, or remotely). I have experience tutoring all kinds of students, and have a passion for explaining the 'why' questions which are important, that barely get touched at certain levels in the formal sciences. I provide deep, but simple explanations but can readily provide more formal explanations as necessary. I have over four years of tutoring experience in the following scientific fields:
I have tutored the following courses in the past:
Secondary School Level:
Post Secondary School Level:
I have tutored for students for the following courses at this level:
If you are interested in services from me, please contact me by my e-mail, or my phone number. I am not just limited to the topics above. Due to my schedule, I will not be taking on any clients, but I will happily take requests for educational videos that I can prepare as a Youtube Partner.
I am able to cover many subjects ranging from software applications, to programming, to other mathematical discourses. In terms of my main interests, I do not go past entry university physics, and I much prefer discrete mathematics (so if you are needing assistance in a discrete mathematics course (any) I can do those, based on the topics). I am always interested in learning more concepts, or to share my knowledge on a subject. If you have any questions, let me know!
Here you will find a small set of examples of software I have worked on independently:
*-Please cite the published version, not the accepted version.
**-Course is currently active.
Last Updated: September 20, 2016.