Search results for "René Sitters"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee	A note on sorting buffers offline.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie	The traveling salesman problem on cubic and subcubic graphs	CoRR	2011	DBLP BibTeX RDF
1	René Sitters	The generalized work function algorithm is competitive for the generalized 2-server problem	CoRR	2011	DBLP BibTeX RDF
1	Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie	TSP on Cubic and Subcubic Graphs.	IPCO	2011	DBLP DOI BibTeX RDF
1	René Sitters	Competitive analysis of preemptive single-machine scheduling.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
1	Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters	The Sorting Buffer Problem is NP-hard	CoRR	2010	DBLP BibTeX RDF
1	Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff	The Traveling Salesman Problem Under Squared Euclidean Distances	CoRR	2010	DBLP BibTeX RDF
1	Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg	The Traveling Salesman Problem under Squared Euclidean Distances.	STACS	2010	DBLP DOI BibTeX RDF
1	René Sitters	Efficient Algorithms for Average Completion Time Scheduling.	IPCO	2010	DBLP DOI BibTeX RDF
1	Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz	Optimal pricing of capacitated networks.	Networks	2009	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle	On the minimum corridor connection problem and other generalized geometric problems.	Comput. Geom.	2009	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters	Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Alexander Grigoriev, René Sitters	Connected Feedback Vertex Set in Planar Graphs.	WG	2009	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters	On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.	SODA	2009	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters	On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.	SAGT	2009	DBLP DOI BibTeX RDF
1	René A. Sitters	Generalized Two-Server Problem.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	René A. Sitters	Approximability of Average Completion Time Scheduling on Unrelated Machines.	ESA	2008	DBLP DOI BibTeX RDF
1	René A. Sitters	Minimizing Average Flow Time on Unrelated Machines.	WAOA	2008	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, René Sitters, Yan Zhang	A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.	ESA	2007	DBLP DOI BibTeX RDF
1	René A. Sitters, Leen Stougie	The generalized two-server problem.	J. ACM	2006	DBLP DOI BibTeX RDF	k-server problem, Work function, metrical service system, competitive analysis, on-line algorithms
1	Corinne Feremans, Alexander Grigoriev, René Sitters	The geometric generalized minimum spanning tree problem with grid clustering.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 68Q17, 68W25
1	Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz	How to Sell a Graph: Guidelines for Graph Retailers.	WG	2006	DBLP DOI BibTeX RDF	Pricing problems, tollbooth problem, highway problem, computational complexity, dynamic programming, fully polynomial time approximation scheme
1	Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle	On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.	WAOA	2006	DBLP DOI BibTeX RDF	minimum corridor connection, generalized geometric problems, complexity, approximations, exact algorithms
1	Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters	On the Value of Preemption in Scheduling.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters	On Approximating the TSP with Intersecting Neighborhoods.	ISAAC	2006	DBLP DOI BibTeX RDF
1	René Sitters	Complexity of preemptive minsum scheduling on unrelated parallel machines.	J. Algorithms	2005	DBLP DOI BibTeX RDF
1	Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters	Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.	ESA	2005	DBLP DOI BibTeX RDF	identical machines, migration delay, scheduling, preemption
1	Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters	Approximation Algorithms for Euclidean Group TSP.	ICALP	2005	DBLP DOI BibTeX RDF
1	Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie	Computer-Aided Complexity Classification of Dial-a-Ride Problems.	INFORMS Journal on Computing	2004	DBLP DOI BibTeX RDF
1	Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie	On-Line Dial-a-Ride Problems Under a Restricted Information Model.	Algorithmica	2004	DBLP DOI BibTeX RDF	On-line optimization, Dial-a-ride, Competitive analysis
1	Xiwen Lu, René Sitters, Leen Stougie	A class of on-line scheduling algorithms to minimize total completion time.	Oper. Res. Lett.	2003	DBLP DOI BibTeX RDF
1	René Sitters, Leen Stougie, Willem de Paepe	A Competitive Algorithm for the General 2-Server Problem.	ICALP	2003	DBLP DOI BibTeX RDF
1	Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie	On-Line Dial-a-Ride Problems under a Restricted Information Model.	ESA	2002	DBLP DOI BibTeX RDF
1	René Sitters	The Minimum Latency Problem Is NP-Hard for Weighted Trees.	IPCO	2002	DBLP BibTeX RDF
1	René Sitters	Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.	IPCO	2001	DBLP DOI BibTeX RDF
1	René Sitters	A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.	Discrete Applied Mathematics	1999	DBLP DOI BibTeX RDF

Publications of René Sitters René A. Sitters ( http://dblp.L3S.de/Authors/René_Sitters )