René Sitters Home Page Coauthor index DBLP Vis pubzone.org

René A. Sitters

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters: On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled 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. 19(2): 173-193 (2009)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz: Optimal pricing of capacitated networks. Networks 53(1): 79-87 (2009)
2008
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené A. Sitters: Approximability of Average Completion Time Scheduling on Unrelated Machines. ESA 2008: 768-779
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené A. Sitters: Minimizing Average Flow Time on Unrelated Machines. WAOA 2008: 67-77
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené A. Sitters: Generalized Two-Server Problem. Encyclopedia of Algorithms 2008
2007
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled M. Elbassioni, René Sitters, Yan Zhang: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ESA 2007: 451-462
2006
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYair Bartal, Stefano Leonardi, Gil Shallom, René Sitters: On the Value of Preemption in Scheduling. APPROX-RANDOM 2006: 39-48
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled M. Elbassioni, Aleksei V. Fishkin, René Sitters: On Approximating the TSP with Intersecting Neighborhoods. ISAAC 2006: 213-222
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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: 69-82
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz: How to Sell a Graph: Guidelines for Graph Retailers. WG 2006: 125-136
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCorinne Feremans, Alexander Grigoriev, René Sitters: The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4(4): 319-329 (2006)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené A. Sitters, Leen Stougie: The generalized two-server problem. J. ACM 53(3): 437-458 (2006)
2005
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters: Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. ESA 2005: 580-591
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters: Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené Sitters: Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms 57(1): 37-48 (2005)
2004
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie: On-Line Dial-a-Ride Problems Under a Restricted Information Model. Algorithmica 40(4): 319-329 (2004)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWillem 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 16(2): 120-132 (2004)
2003
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené Sitters, Leen Stougie, Willem de Paepe: A Competitive Algorithm for the General 2-Server Problem. ICALP 2003: 624-636
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXiwen Lu, René Sitters, Leen Stougie: A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31(3): 232-236 (2003)
2002
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie: On-Line Dial-a-Ride Problems under a Restricted Information Model. ESA 2002: 674-685
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené Sitters: The Minimum Latency Problem Is NP-Hard for Weighted Trees. IPCO 2002: 230-239
2001
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené Sitters: Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. IPCO 2001: 396-405
1999
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRené Sitters: A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles. Discrete Applied Mathematics 92(2-3): 243-246 (1999)

Coauthor Index

1Yair Bartal [17]
2Hans L. Bodlaender [15]
3Khaled M. Elbassioni [10] [16] [18] [23] [24] [25]
4Corinne Feremans [13] [15]
5Aleksei V. Fishkin [10] [11] [16] [23]
6Alexander Grigoriev [13] [14] [15] [22]
7Klaus Jansen [11]
8Jan Karel Lenstra [7]
9Stefano Leonardi [17]
10Maarten Lipmann [4] [8]
11Joyce van Loon [14] [22]
12Xiwen Lu [4] [5] [8]
13Nabil H. Mustafa [10]
14Willem de Paepe [4] [6] [7] [8]
15Eelko Penninkx [15]
16Rajiv Raman [24] [25]
17Saurabh Ray [24] [25]
18Sergey V. Sevastianov [11]
19Jiri Sgall [7]
20Gil Shallom [17]
21Leen Stougie [4] [5] [6] [7] [8] [12]
22Marc Uetz [14] [22]
23Thomas Wolle [15]
24Yan Zhang [18]

Copyright © Wed Nov 25 14:46:41 2009 by Michael Ley (ley@uni-trier.de)