René Sitters

According to our database1, René Sitters authored at least 49 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Fixed-Order Scheduling on Parallel Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Approximation and complexity of multi-target graph search and the Canadian traveler problem.
Theor. Comput. Sci., 2018

The triangle scheduling problem.
J. Scheduling, 2018

A (2+ϵ)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective.
Oper. Res. Lett., 2018

A priori TSP in the scenario model.
Discrete Applied Mathematics, 2018

The A Priori Traveling Repairman Problem.
Algorithmica, 2018

The Itinerant List Update Problem.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017
Minimizing worst-case and average-case makespan over scenarios.
J. Scheduling, 2017

2016
Generalized Two-Server Problem.
Encyclopedia of Algorithms, 2016

On some special cases of the restricted assignment problem.
Inf. Process. Lett., 2016

A priori TSP in the Scenario Model.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015
Split scheduling with uniform setup times.
J. Scheduling, 2015

On the Complexity of Master Problems.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem.
SIAM J. Comput., 2014

The traveling salesman problem on cubic and subcubic graphs.
Math. Program., 2014

Routing Under Uncertainty: The a priori Traveling Repairman Problem.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Scheduling over Scenarios on Two Machines.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2012
On the complexity of the highway problem.
Theor. Comput. Sci., 2012

A note on sorting buffers offline.
Theor. Comput. Sci., 2012

2011
TSP on Cubic and Subcubic Graphs.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Competitive analysis of preemptive single-machine scheduling.
Oper. Res. Lett., 2010

The Traveling Salesman Problem under Squared Euclidean Distances.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Efficient Algorithms for Average Completion Time Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Optimal pricing of capacitated networks.
Networks, 2009

Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.
Int. J. Comput. Geometry Appl., 2009

Connected Feedback Vertex Set in Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008
Generalized Two-Server Problem.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Minimizing Average Flow Time on Unrelated Machines.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Approximability of Average Completion Time Scheduling on Unrelated Machines.
Proceedings of the Algorithms, 2008

2007
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.
Proceedings of the Algorithms, 2007

2006
The generalized two-server problem.
J. ACM, 2006

The geometric generalized minimum spanning tree problem with grid clustering.
4OR, 2006

How to Sell a Graph: Guidelines for Graph Retailers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

On Approximating the TSP with Intersecting Neighborhoods.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

On the Value of Preemption in Scheduling.
Proceedings of the Approximation, 2006

2005
Complexity of preemptive minsum scheduling on unrelated parallel machines.
J. Algorithms, 2005

Approximation Algorithms for Euclidean Group TSP.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.
Proceedings of the Algorithms, 2005

2004
Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS Journal on Computing, 2004

2003
A class of on-line scheduling algorithms to minimize total completion time.
Oper. Res. Lett., 2003

A Competitive Algorithm for the General 2-Server Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
The Minimum Latency Problem Is NP-Hard for Weighted Trees.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

On-Line Dial-a-Ride Problems under a Restricted Information Model.
Proceedings of the Algorithms, 2002

2001
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

1999
A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.
Discrete Applied Mathematics, 1999


  Loading...