Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: René Sitters
@inproceedings{DBLP:conf/mfcs/EeOSW23,
author = {Martijn van Ee and
Tim Oosterwijk and
Ren{\'{e}} Sitters and
Andreas Wiese},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Exact and Approximation Algorithms for Routing a Convoy Through a
Graph},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {86:1--86:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.86},
doi = {10.4230/LIPICS.MFCS.2023.86},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EeOSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sitters21,
author = {Ren{\'{e}} Sitters},
title = {Polynomial Time Approximation Schemes for the Traveling Repairman
and Other Minimum Latency Problems},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {5},
pages = {1580--1602},
year = {2021},
url = {https://doi.org/10.1137/19M126918X},
doi = {10.1137/19M126918X},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Sitters21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/EeS20,
author = {Martijn van Ee and
Ren{\'{e}} Sitters},
title = {The Chinese deliveryman problem},
journal = {4OR},
volume = {18},
number = {3},
pages = {341--356},
year = {2020},
url = {https://doi.org/10.1007/s10288-019-00420-2},
doi = {10.1007/S10288-019-00420-2},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/EeS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BosmanFOSS19,
author = {Thomas Bosman and
Dario Frascaria and
Neil Olver and
Ren{\'{e}} Sitters and
Leen Stougie},
editor = {Andrea Lodi and
Viswanath Nagarajan},
title = {Fixed-Order Scheduling on Parallel Machines},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International
Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11480},
pages = {88--100},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17953-3\_7},
doi = {10.1007/978-3-030-17953-3\_7},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BosmanFOSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EeS18,
author = {Martijn van Ee and
Ren{\'{e}} Sitters},
title = {The {A} Priori Traveling Repairman Problem},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2818--2833},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0351-z},
doi = {10.1007/S00453-017-0351-Z},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EeIJS18,
author = {Martijn van Ee and
Leo van Iersel and
Teun Janssen and
Ren{\'{e}} Sitters},
title = {\emph{A priori} {TSP} in the scenario model},
journal = {Discret. Appl. Math.},
volume = {250},
pages = {331--341},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.04.002},
doi = {10.1016/J.DAM.2018.04.002},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EeIJS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SittersY18,
author = {Ren{\'{e}} Sitters and
Liya Yang},
title = {A (2+{\unicode{1013}})-approximation for precedence constrained single
machine scheduling with release dates and total weighted completion
time objective},
journal = {Oper. Res. Lett.},
volume = {46},
number = {4},
pages = {438--442},
year = {2018},
url = {https://doi.org/10.1016/j.orl.2018.05.007},
doi = {10.1016/J.ORL.2018.05.007},
timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SittersY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/DurrHKSSVW18,
author = {Christoph D{\"{u}}rr and
Zdenek Hanz{\'{a}}lek and
Christian Konrad and
Yasmina Seddik and
Ren{\'{e}} Sitters and
{\'{O}}scar C. V{\'{a}}squez and
Gerhard J. Woeginger},
title = {The triangle scheduling problem},
journal = {J. Sched.},
volume = {21},
number = {3},
pages = {305--312},
year = {2018},
url = {https://doi.org/10.1007/s10951-017-0533-1},
doi = {10.1007/S10951-017-0533-1},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/DurrHKSSVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EeS18,
author = {Martijn van Ee and
Ren{\'{e}} Sitters},
title = {Approximation and complexity of multi-target graph search and the
Canadian traveler problem},
journal = {Theor. Comput. Sci.},
volume = {732},
pages = {14--25},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.04.022},
doi = {10.1016/J.TCS.2018.04.022},
timestamp = {Tue, 12 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/OlverPSSS18,
author = {Neil Olver and
Kirk Pruhs and
Kevin Schewior and
Ren{\'{e}} Sitters and
Leen Stougie},
editor = {Leah Epstein and
Thomas Erlebach},
title = {The Itinerant List Update Problem},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {310--326},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_19},
doi = {10.1007/978-3-030-04693-4\_19},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/OlverPSSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Sitters17,
author = {Ren{\'{e}} Sitters},
title = {Approximability of average completion time scheduling on unrelated
machines},
journal = {Math. Program.},
volume = {161},
number = {1-2},
pages = {135--158},
year = {2017},
url = {https://doi.org/10.1007/s10107-016-1004-8},
doi = {10.1007/S10107-016-1004-8},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Sitters17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/FeuersteinMSSSS17,
author = {Esteban Feuerstein and
Alberto Marchetti{-}Spaccamela and
Frans Schalekamp and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie and
Anke van Zuylen},
title = {Minimizing worst-case and average-case makespan over scenarios},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {545--555},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0484-y},
doi = {10.1007/S10951-016-0484-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/FeuersteinMSSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SittersY17,
author = {Ren{\'{e}} Sitters and
Liya Yang},
title = {A {\textdollar}(2 + {\(\epsilon\)}){\textdollar}-approximation for
precedence constrained single machine scheduling with release dates
and total weighted completion time objective},
journal = {CoRR},
volume = {abs/1706.07604},
year = {2017},
url = {http://arxiv.org/abs/1706.07604},
eprinttype = {arXiv},
eprint = {1706.07604},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SittersY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangS16,
author = {Chao Wang and
Ren{\'{e}} Sitters},
title = {On some special cases of the restricted assignment problem},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {723--728},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.007},
doi = {10.1016/J.IPL.2016.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EeIJS16,
author = {Martijn van Ee and
Leo van Iersel and
Teun Janssen and
Ren{\'{e}} Sitters},
editor = {Klaus Jansen and
Monaldo Mastrolilli},
title = {A priori {TSP} in the Scenario Model},
booktitle = {Approximation and Online Algorithms - 14th International Workshop,
{WAOA} 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10138},
pages = {183--196},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-51741-4\_15},
doi = {10.1007/978-3-319-51741-4\_15},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EeIJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Sitters16,
author = {Ren{\'{e}} A. Sitters},
title = {Generalized Two-Server Problem},
booktitle = {Encyclopedia of Algorithms},
pages = {819--821},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_162},
doi = {10.1007/978-1-4939-2864-4\_162},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Sitters16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DurrHKSVW16,
author = {Christoph D{\"{u}}rr and
Zdenek Hanz{\'{a}}lek and
Christian Konrad and
Ren{\'{e}} Sitters and
{\'{O}}scar C. V{\'{a}}squez and
Gerhard J. Woeginger},
title = {The triangle scheduling problem},
journal = {CoRR},
volume = {abs/1602.04365},
year = {2016},
url = {http://arxiv.org/abs/1602.04365},
eprinttype = {arXiv},
eprint = {1602.04365},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DurrHKSVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/SchalekampSSSVZ15,
author = {Frans Schalekamp and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie and
V{\'{\i}}ctor Verdugo and
Anke van Zuylen},
title = {Split scheduling with uniform setup times},
journal = {J. Sched.},
volume = {18},
number = {2},
pages = {119--129},
year = {2015},
url = {https://doi.org/10.1007/s10951-014-0370-4},
doi = {10.1007/S10951-014-0370-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/SchalekampSSSVZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EeS15,
author = {Martijn van Ee and
Ren{\'{e}} Sitters},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {On the Complexity of Master Problems},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {567--576},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_47},
doi = {10.1007/978-3-662-48054-0\_47},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BoydSSS14,
author = {Sylvia C. Boyd and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie},
title = {The traveling salesman problem on cubic and subcubic graphs},
journal = {Math. Program.},
volume = {144},
number = {1-2},
pages = {227--245},
year = {2014},
url = {https://doi.org/10.1007/s10107-012-0620-1},
doi = {10.1007/S10107-012-0620-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BoydSSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sitters14,
author = {Ren{\'{e}} Sitters},
title = {The Generalized Work Function Algorithm Is Competitive for the Generalized
2-Server Problem},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {1},
pages = {96--125},
year = {2014},
url = {https://doi.org/10.1137/120885309},
doi = {10.1137/120885309},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sitters14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FeuersteinMSSSSZ14,
author = {Esteban Feuerstein and
Alberto Marchetti{-}Spaccamela and
Frans Schalekamp and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie and
Anke van Zuylen},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Scheduling over Scenarios on Two Machines},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {559--571},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_48},
doi = {10.1007/978-3-319-08783-2\_48},
timestamp = {Thu, 20 Aug 2020 15:36:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/FeuersteinMSSSSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Sitters14,
author = {Ren{\'{e}} Sitters},
editor = {Chandra Chekuri},
title = {Polynomial time approximation schemes for the traveling repairman
and other minimum latency problems},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {604--616},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.46},
doi = {10.1137/1.9781611973402.46},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/Sitters14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EeS14,
author = {Martijn van Ee and
Ren{\'{e}} Sitters},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Routing Under Uncertainty: The a priori Traveling Repairman Problem},
booktitle = {Approximation and Online Algorithms - 12th International Workshop,
{WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8952},
pages = {248--259},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_21},
doi = {10.1007/978-3-319-18263-6\_21},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EeS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeuersteinMSSSSZ14,
author = {Esteban Feuerstein and
Alberto Marchetti{-}Spaccamela and
Frans Schalekamp and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie and
Anke van Zuylen},
title = {Scheduling over Scenarios on Two Machines},
journal = {CoRR},
volume = {abs/1404.4766},
year = {2014},
url = {http://arxiv.org/abs/1404.4766},
eprinttype = {arXiv},
eprint = {1404.4766},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeuersteinMSSSSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Sitters13,
author = {Ren{\'{e}} Sitters},
title = {Polynomial time approximation schemes for the traveling repairman
and other minimum latency problems},
journal = {CoRR},
volume = {abs/1307.4289},
year = {2013},
url = {http://arxiv.org/abs/1307.4289},
eprinttype = {arXiv},
eprint = {1307.4289},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Sitters13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChanMSS12,
author = {Ho{-}Leung Chan and
Nicole Megow and
Ren{\'{e}} Sitters and
Rob van Stee},
title = {A note on sorting buffers offline},
journal = {Theor. Comput. Sci.},
volume = {423},
pages = {11--18},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.12.077},
doi = {10.1016/J.TCS.2011.12.077},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChanMSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElbassioniRRS12,
author = {Khaled M. Elbassioni and
Rajiv Raman and
Saurabh Ray and
Ren{\'{e}} Sitters},
title = {On the complexity of the highway problem},
journal = {Theor. Comput. Sci.},
volume = {460},
pages = {70--77},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.07.028},
doi = {10.1016/J.TCS.2012.07.028},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ElbassioniRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-1754,
author = {Frans Schalekamp and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie and
Victor Verdugo and
Anke van Zuylen},
title = {Split Scheduling with Uniform Setup Times},
journal = {CoRR},
volume = {abs/1212.1754},
year = {2012},
url = {http://arxiv.org/abs/1212.1754},
eprinttype = {arXiv},
eprint = {1212.1754},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-1754.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BoydSSS11,
author = {Sylvia C. Boyd and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {{TSP} on Cubic and Subcubic Graphs},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {65--77},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_6},
doi = {10.1007/978-3-642-20807-2\_6},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/BoydSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-1052,
author = {Sylvia C. Boyd and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie},
title = {The traveling salesman problem on cubic and subcubic graphs},
journal = {CoRR},
volume = {abs/1107.1052},
year = {2011},
url = {http://arxiv.org/abs/1107.1052},
eprinttype = {arXiv},
eprint = {1107.1052},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-1052.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-6600,
author = {Ren{\'{e}} Sitters},
title = {The generalized work function algorithm is competitive for the generalized
2-server problem},
journal = {CoRR},
volume = {abs/1110.6600},
year = {2011},
url = {http://arxiv.org/abs/1110.6600},
eprinttype = {arXiv},
eprint = {1110.6600},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-6600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Sitters10,
author = {Ren{\'{e}} Sitters},
title = {Competitive analysis of preemptive single-machine scheduling},
journal = {Oper. Res. Lett.},
volume = {38},
number = {6},
pages = {585--588},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2010.08.012},
doi = {10.1016/J.ORL.2010.08.012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Sitters10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Sitters10,
author = {Ren{\'{e}} Sitters},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Efficient Algorithms for Average Completion Time Scheduling},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {411--423},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_31},
doi = {10.1007/978-3-642-13036-6\_31},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Sitters10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NijnattenSWWB10,
author = {Fred van Nijnatten and
Ren{\'{e}} Sitters and
Gerhard J. Woeginger and
Alexander Wolff and
Mark de Berg},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {The Traveling Salesman Problem under Squared Euclidean Distances},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {239--250},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2458},
doi = {10.4230/LIPICS.STACS.2010.2458},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/NijnattenSWWB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0236,
author = {Mark de Berg and
Fred van Nijnatten and
Ren{\'{e}} Sitters and
Gerhard J. Woeginger and
Alexander Wolff},
title = {The Traveling Salesman Problem Under Squared Euclidean Distances},
journal = {CoRR},
volume = {abs/1001.0236},
year = {2010},
url = {http://arxiv.org/abs/1001.0236},
eprinttype = {arXiv},
eprint = {1001.0236},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0236.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-4355,
author = {Ho{-}Leung Chan and
Nicole Megow and
Rob van Stee and
Ren{\'{e}} Sitters},
title = {The Sorting Buffer Problem is NP-hard},
journal = {CoRR},
volume = {abs/1009.4355},
year = {2010},
url = {http://arxiv.org/abs/1009.4355},
eprinttype = {arXiv},
eprint = {1009.4355},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-4355.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BodlaenderFGPSW09,
author = {Hans L. Bodlaender and
Corinne Feremans and
Alexander Grigoriev and
Eelko Penninkx and
Ren{\'{e}} Sitters and
Thomas Wolle},
title = {On the minimum corridor connection problem and other generalized geometric
problems},
journal = {Comput. Geom.},
volume = {42},
number = {9},
pages = {939--951},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2009.05.001},
doi = {10.1016/J.COMGEO.2009.05.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BodlaenderFGPSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/ElbassioniFS09,
author = {Khaled M. Elbassioni and
Aleksei V. Fishkin and
Ren{\'{e}} Sitters},
title = {Approximation Algorithms for the Euclidean Traveling Salesman Problem
with Discrete and Continuous Neighborhoods},
journal = {Int. J. Comput. Geom. Appl.},
volume = {19},
number = {2},
pages = {173--193},
year = {2009},
url = {https://doi.org/10.1142/S0218195909002897},
doi = {10.1142/S0218195909002897},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/ElbassioniFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GrigorievLSU09,
author = {Alexander Grigoriev and
Joyce van Loon and
Ren{\'{e}} Sitters and
Marc Uetz},
title = {Optimal pricing of capacitated networks},
journal = {Networks},
volume = {53},
number = {1},
pages = {79--87},
year = {2009},
url = {https://doi.org/10.1002/net.20260},
doi = {10.1002/NET.20260},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/GrigorievLSU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/ElbassioniRRS09,
author = {Khaled M. Elbassioni and
Rajiv Raman and
Saurabh Ray and
Ren{\'{e}} Sitters},
editor = {Marios Mavronicolas and
Vicky G. Papadopoulou},
title = {On Profit-Maximizing Pricing for the Highway and Tollbooth Problems},
booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009,
Paphos, Cyprus, October 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5814},
pages = {275--286},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04645-2\_25},
doi = {10.1007/978-3-642-04645-2\_25},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/ElbassioniRRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ElbassioniRRS09,
author = {Khaled M. Elbassioni and
Rajiv Raman and
Saurabh Ray and
Ren{\'{e}} Sitters},
editor = {Claire Mathieu},
title = {On the approximability of the maximum feasible subsystem problem with
0/1-coefficients},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {1210--1219},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.131},
doi = {10.1137/1.9781611973068.131},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ElbassioniRRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GrigorievS09,
author = {Alexander Grigoriev and
Ren{\'{e}} Sitters},
editor = {Christophe Paul and
Michel Habib},
title = {Connected Feedback Vertex Set in Planar Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {143--153},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_13},
doi = {10.1007/978-3-642-11409-0\_13},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GrigorievS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Sitters08,
author = {Ren{\'{e}} A. Sitters},
editor = {Dan Halperin and
Kurt Mehlhorn},
title = {Approximability of Average Completion Time Scheduling on Unrelated
Machines},
booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
Germany, September 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5193},
pages = {768--779},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87744-8\_64},
doi = {10.1007/978-3-540-87744-8\_64},
timestamp = {Sun, 02 Jun 2019 21:14:36 +0200},
biburl = {https://dblp.org/rec/conf/esa/Sitters08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Sitters08,
author = {Ren{\'{e}} A. Sitters},
editor = {Evripidis Bampis and
Martin Skutella},
title = {Minimizing Average Flow Time on Unrelated Machines},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {67--77},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_6},
doi = {10.1007/978-3-540-93980-1\_6},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Sitters08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Sitters08,
author = {Ren{\'{e}} A. Sitters},
editor = {Ming{-}Yang Kao},
title = {Generalized Two-Server Problem},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_162},
doi = {10.1007/978-0-387-30162-4\_162},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Sitters08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ElbassioniSZ07,
author = {Khaled M. Elbassioni and
Ren{\'{e}} Sitters and
Yan Zhang},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {451--462},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_41},
doi = {10.1007/978-3-540-75520-3\_41},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/ElbassioniSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/FeremansGS06,
author = {Corinne Feremans and
Alexander Grigoriev and
Ren{\'{e}} Sitters},
title = {The geometric generalized minimum spanning tree problem with grid
clustering},
journal = {4OR},
volume = {4},
number = {4},
pages = {319--329},
year = {2006},
url = {https://doi.org/10.1007/s10288-006-0012-6},
doi = {10.1007/S10288-006-0012-6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/FeremansGS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SittersS06,
author = {Ren{\'{e}} A. Sitters and
Leen Stougie},
title = {The generalized two-server problem},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {437--458},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147960},
doi = {10.1145/1147954.1147960},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SittersS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BartalLSS06,
author = {Yair Bartal and
Stefano Leonardi and
Gil Shallom and
Ren{\'{e}} Sitters},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {On the Value of Preemption in Scheduling},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {39--48},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_6},
doi = {10.1007/11830924\_6},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BartalLSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ElbassioniFS06,
author = {Khaled M. Elbassioni and
Aleksei V. Fishkin and
Ren{\'{e}} Sitters},
editor = {Tetsuo Asano},
title = {On Approximating the {TSP} with Intersecting Neighborhoods},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {213--222},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_23},
doi = {10.1007/11940128\_23},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ElbassioniFS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BodlaenderFGPSW06,
author = {Hans L. Bodlaender and
Corinne Feremans and
Alexander Grigoriev and
Eelko Penninkx and
Ren{\'{e}} Sitters and
Thomas Wolle},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {On the Minimum Corridor Connection Problem and Other Generalized Geometric
Problems},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {69--82},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_6},
doi = {10.1007/11970125\_6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BodlaenderFGPSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GrigorievLSU06,
author = {Alexander Grigoriev and
Joyce van Loon and
Ren{\'{e}} Sitters and
Marc Uetz},
editor = {Fedor V. Fomin},
title = {How to Sell a Graph: Guidelines for Graph Retailers},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {125--136},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_12},
doi = {10.1007/11917496\_12},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GrigorievLSU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Sitters05,
author = {Ren{\'{e}} Sitters},
title = {Complexity of preemptive minsum scheduling on unrelated parallel machines},
journal = {J. Algorithms},
volume = {57},
number = {1},
pages = {37--48},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.06.011},
doi = {10.1016/J.JALGOR.2004.06.011},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Sitters05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FishkinJSS05,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Sergey V. Sevastianov and
Ren{\'{e}} Sitters},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Preemptive Scheduling of Independent Jobs on Identical Parallel Machines
Subject to Migration Delays},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {580--591},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_52},
doi = {10.1007/11561071\_52},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/FishkinJSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ElbassioniFMS05,
author = {Khaled M. Elbassioni and
Aleksei V. Fishkin and
Nabil H. Mustafa and
Ren{\'{e}} Sitters},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Approximation Algorithms for Euclidean Group {TSP}},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1115--1126},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_90},
doi = {10.1007/11523468\_90},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ElbassioniFMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LipmannLPSS04,
author = {Maarten Lipmann and
Xiwen Lu and
Willem de Paepe and
Ren{\'{e}} Sitters and
Leen Stougie},
title = {On-Line Dial-a-Ride Problems Under a Restricted Information Model},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {319--329},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1116-z},
doi = {10.1007/S00453-004-1116-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LipmannLPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/PaepeLSSS04,
author = {Willem de Paepe and
Jan Karel Lenstra and
Jir{\'{\i}} Sgall and
Ren{\'{e}} A. Sitters and
Leen Stougie},
title = {Computer-Aided Complexity Classification of Dial-a-Ride Problems},
journal = {{INFORMS} J. Comput.},
volume = {16},
number = {2},
pages = {120--132},
year = {2004},
url = {https://doi.org/10.1287/ijoc.1030.0052},
doi = {10.1287/IJOC.1030.0052},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/PaepeLSSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LuSS03,
author = {Xiwen Lu and
Ren{\'{e}} Sitters and
Leen Stougie},
title = {A class of on-line scheduling algorithms to minimize total completion
time},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {232--236},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00016-6},
doi = {10.1016/S0167-6377(03)00016-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LuSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/SittersSP03,
author = {Ren{\'{e}} Sitters and
Leen Stougie and
Willem de Paepe},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {A Competitive Algorithm for the General 2-Server Problem},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {624--636},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_50},
doi = {10.1007/3-540-45061-0\_50},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/SittersSP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LipmannLPSS02,
author = {Maarten Lipmann and
Xiwen Lu and
Willem de Paepe and
Ren{\'{e}} Sitters and
Leen Stougie},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {On-Line Dial-a-Ride Problems under a Restricted Information Model},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {674--685},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_59},
doi = {10.1007/3-540-45749-6\_59},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/LipmannLPSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Sitters02,
author = {Ren{\'{e}} Sitters},
editor = {William J. Cook and
Andreas S. Schulz},
title = {The Minimum Latency Problem Is NP-Hard for Weighted Trees},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {230--239},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_17},
doi = {10.1007/3-540-47867-1\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Sitters02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Sitters01,
author = {Ren{\'{e}} Sitters},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated
Parallel Machines},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {396--405},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_31},
doi = {10.1007/3-540-45535-3\_31},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Sitters01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Sitters99,
author = {Ren{\'{e}} Sitters},
title = {A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles},
journal = {Discret. Appl. Math.},
volume = {92},
number = {2-3},
pages = {243--246},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00058-X},
doi = {10.1016/S0166-218X(99)00058-X},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Sitters99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-10-24 01:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
