Daniel R. Page

Orcid: 0000-0002-6317-7431

According to our database1, Daniel R. Page authored at least 8 papers between 2013 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Algorithms for the thief orienteering problem on directed acyclic graphs.
Theor. Comput. Sci., 2025

2023
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2019
Approximation algorithms for the graph balancing problem with two speeds and two job lengths.
J. Comb. Optim., 2019

2018
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments.
Proceedings of the Combinatorial Optimization and Applications, 2018

Makespan Minimization on Unrelated Parallel Machines with a Few Bags.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2016
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights.
Algorithms, 2016

2013
Parallel Algorithm for Second-Order Restricted Weak Integer Composition Generation for Shared Memory Machines.
Parallel Process. Lett., 2013

Generalized Algorithm for Restricted Weak Composition Generation - Generation Algorithm for Second-Order Restricted Weak Compositions.
J. Math. Model. Algorithms Oper. Res., 2013


  Loading...