Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Thomas Rothvoß
@article{DBLP:journals/rsa/ReisR23,
author = {Victor Reis and
Thomas Rothvoss},
title = {Vector balancing in Lebesgue spaces},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {667--688},
year = {2023},
url = {https://doi.org/10.1002/rsa.21113},
doi = {10.1002/RSA.21113},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ReisR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ReisR23,
author = {Victor Reis and
Thomas Rothvoss},
title = {The Subspace Flatness Conjecture and Faster Integer Programming},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {974--988},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00060},
doi = {10.1109/FOCS57990.2023.00060},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/ReisR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BozzaiRR23,
author = {Rainie Bozzai and
Victor Reis and
Thomas Rothvoss},
title = {The Vector Balancing Constant for Zonotopes},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1292--1300},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00077},
doi = {10.1109/FOCS57990.2023.00077},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BozzaiRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/DadushER23,
author = {Daniel Dadush and
Friedrich Eisenbrand and
Thomas Rothvoss},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {From Approximate to Exact Integer Programming},
booktitle = {Integer Programming and Combinatorial Optimization - 24th International
Conference, {IPCO} 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13904},
pages = {100--114},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_8},
doi = {10.1007/978-3-031-32726-1\_8},
timestamp = {Fri, 26 May 2023 10:40:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/DadushER23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-14605,
author = {Victor Reis and
Thomas Rothvoss},
title = {The Subspace Flatness Conjecture and Faster Integer Programming},
journal = {CoRR},
volume = {abs/2303.14605},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.14605},
doi = {10.48550/ARXIV.2303.14605},
eprinttype = {arXiv},
eprint = {2303.14605},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-14605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-16159,
author = {Sally Dong and
Thomas Rothvoss},
title = {Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential
Extension Complexity},
journal = {CoRR},
volume = {abs/2307.16159},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.16159},
doi = {10.48550/ARXIV.2307.16159},
eprinttype = {arXiv},
eprint = {2307.16159},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-16159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-01406,
author = {Janardhan Kulkarni and
Victor Reis and
Thomas Rothvoss},
title = {Optimal Online Discrepancy Minimization},
journal = {CoRR},
volume = {abs/2308.01406},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.01406},
doi = {10.48550/ARXIV.2308.01406},
eprinttype = {arXiv},
eprint = {2308.01406},
timestamp = {Mon, 21 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-01406.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-08548,
author = {Rainie Bozzai and
Thomas Rothvoss},
title = {Stronger Coreset Bounds for Kernel Density Estimators via Chaining},
journal = {CoRR},
volume = {abs/2310.08548},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.08548},
doi = {10.48550/ARXIV.2310.08548},
eprinttype = {arXiv},
eprint = {2310.08548},
timestamp = {Wed, 25 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-08548.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/RothvossV22,
author = {Thomas Rothvoss and
Moritz Venzin},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {Approximate {\textdollar}{\textbackslash}mathrm \{CVP\}{\_}\{\}{\textdollar}
in Time 2\({}^{\mbox{0.802 n}}\) - Now in Any Norm!},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {440--453},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_33},
doi = {10.1007/978-3-031-06901-7\_33},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/RothvossV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaviesKRSTZ22,
author = {Sami Davies and
Janardhan Kulkarni and
Thomas Rothvoss and
Sai Sandeep and
Jakub Tarnawski and
Yihao Zhang},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {On the Hardness of Scheduling With Non-Uniform Communication Delays},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {316--328},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.15},
doi = {10.1137/1.9781611977073.15},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/DaviesKRSTZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-03614,
author = {Victor Reis and
Thomas Rothvoss},
title = {Approximate Carath{\'{e}}odory bounds via Discrepancy Theory},
journal = {CoRR},
volume = {abs/2207.03614},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.03614},
doi = {10.48550/ARXIV.2207.03614},
eprinttype = {arXiv},
eprint = {2207.03614},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-03614.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-16460,
author = {Laurel Heck and
Victor Reis and
Thomas Rothvoss},
title = {The Vector Balancing Constant for Zonotopes},
journal = {CoRR},
volume = {abs/2210.16460},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.16460},
doi = {10.48550/ARXIV.2210.16460},
eprinttype = {arXiv},
eprint = {2210.16460},
timestamp = {Thu, 03 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-16460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03859,
author = {Daniel Dadush and
Friedrich Eisenbrand and
Thomas Rothvoss},
title = {From approximate to exact integer programming},
journal = {CoRR},
volume = {abs/2211.03859},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03859},
doi = {10.48550/ARXIV.2211.03859},
eprinttype = {arXiv},
eprint = {2211.03859},
timestamp = {Thu, 10 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeveyR21,
author = {Elaine Levey and
Thomas Rothvo{\ss}},
title = {A (1+epsilon)-Approximation for Makespan Scheduling with Precedence
Constraints Using {LP} Hierarchies},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
year = {2021},
url = {https://doi.org/10.1137/16M1105049},
doi = {10.1137/16M1105049},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeveyR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaviesKRTZ21,
author = {Sami Davies and
Janardhan Kulkarni and
Thomas Rothvoss and
Jakub Tarnawski and
Yihao Zhang},
editor = {D{\'{a}}niel Marx},
title = {Scheduling with Communication Delays via {LP} Hierarchies and Clustering
{II:} Weighted Completion Times on Related Machines},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2958--2977},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.176},
doi = {10.1137/1.9781611976465.176},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/DaviesKRTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BienkowskiBKRSV21,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Martin Kouteck{\'{y}} and
Thomas Rothvo{\ss} and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Improved Analysis of Online Balanced Clustering},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {224--233},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_14},
doi = {10.1007/978-3-030-92702-8\_14},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BienkowskiBKRSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-00111,
author = {Sami Davies and
Janardhan Kulkarni and
Thomas Rothvoss and
Sai Sandeep and
Jakub Tarnawski and
Yihao Zhang},
title = {On the Hardness of Scheduling With Non-Uniform Communication Delays},
journal = {CoRR},
volume = {abs/2105.00111},
year = {2021},
url = {https://arxiv.org/abs/2105.00111},
eprinttype = {arXiv},
eprint = {2105.00111},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-00111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-00145,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Martin Kouteck{\'{y}} and
Thomas Rothvo{\ss} and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Improved Analysis of Online Balanced Clustering},
journal = {CoRR},
volume = {abs/2107.00145},
year = {2021},
url = {https://arxiv.org/abs/2107.00145},
eprinttype = {arXiv},
eprint = {2107.00145},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-00145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06309,
author = {Siddharth Iyer and
Anup Rao and
Victor Reis and
Thomas Rothvoss and
Amir Yehudayoff},
title = {Tight bounds on the Fourier growth of bounded functions on the hypercube},
journal = {CoRR},
volume = {abs/2107.06309},
year = {2021},
url = {https://arxiv.org/abs/2107.06309},
eprinttype = {arXiv},
eprint = {2107.06309},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06309.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-02387,
author = {Thomas Rothvoss and
Moritz Venzin},
title = {Approximate {CVP} in time 2\({}^{\mbox{0.802 n}}\) - now in any norm!},
journal = {CoRR},
volume = {abs/2110.02387},
year = {2021},
url = {https://arxiv.org/abs/2110.02387},
eprinttype = {arXiv},
eprint = {2110.02387},
timestamp = {Fri, 08 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-02387.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/IyerRRRY21,
author = {Siddharth Iyer and
Anup Rao and
Victor Reis and
Thomas Rothvoss and
Amir Yehudayoff},
title = {Tight bounds on the Fourier growth of bounded functions on the hypercube},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-102}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/102},
eprinttype = {ECCC},
eprint = {TR21-102},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/IyerRRRY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoemansR20,
author = {Michel X. Goemans and
Thomas Rothvoss},
title = {Polynomiality for Bin Packing with a Constant Number of Item Types},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {38:1--38:21},
year = {2020},
url = {https://doi.org/10.1145/3421750},
doi = {10.1145/3421750},
timestamp = {Mon, 30 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoemansR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaviesKRTZ20,
author = {Sami Davies and
Janardhan Kulkarni and
Thomas Rothvoss and
Jakub Tarnawski and
Yihao Zhang},
editor = {Sandy Irani},
title = {Scheduling with Communication Delays via {LP} Hierarchies and Clustering},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {822--833},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00081},
doi = {10.1109/FOCS46700.2020.00081},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/DaviesKRTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ReisR20,
author = {Victor Reis and
Thomas Rothvoss},
editor = {Shuchi Chawla},
title = {Linear Size Sparsifier and the Geometry of the Operator Norm Ball},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2337--2348},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.143},
doi = {10.1137/1.9781611975994.143},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/ReisR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaviesRZ20,
author = {Sami Davies and
Thomas Rothvoss and
Yihao Zhang},
editor = {Shuchi Chawla},
title = {A Tale of Santa Claus, Hypergraphs and Matroids},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2748--2757},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.167},
doi = {10.1137/1.9781611975994.167},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DaviesRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-09682,
author = {Sami Davies and
Janardhan Kulkarni and
Thomas Rothvoss and
Jakub Tarnawski and
Yihao Zhang},
title = {Scheduling with Communication Delays via {LP} Hierarchies and Clustering},
journal = {CoRR},
volume = {abs/2004.09682},
year = {2020},
url = {https://arxiv.org/abs/2004.09682},
eprinttype = {arXiv},
eprint = {2004.09682},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-09682.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-05634,
author = {Victor Reis and
Thomas Rothvoss},
title = {Vector Balancing in Lebesgue Spaces},
journal = {CoRR},
volume = {abs/2007.05634},
year = {2020},
url = {https://arxiv.org/abs/2007.05634},
eprinttype = {arXiv},
eprint = {2007.05634},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-05634.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HobergR19,
author = {Rebecca Hoberg and
Thomas Rothvoss},
editor = {Timothy M. Chan},
title = {A Fourier-Analytic Approach for the Discrepancy of Random Set Systems},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2547--2556},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.156},
doi = {10.1137/1.9781611975482.156},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/HobergR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-02145,
author = {Victor Reis and
Thomas Rothvoss},
title = {Linear Size Sparsifier and the Geometry of the Operator Norm Ball},
journal = {CoRR},
volume = {abs/1907.02145},
year = {2019},
url = {http://arxiv.org/abs/1907.02145},
eprinttype = {arXiv},
eprint = {1907.02145},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-02145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04484,
author = {Rebecca Hoberg and
Thomas Rothvoss},
title = {A Fourier-Analytic Approach for the Discrepancy of Random Set Systems},
journal = {CoRR},
volume = {abs/1806.04484},
year = {2018},
url = {http://arxiv.org/abs/1806.04484},
eprinttype = {arXiv},
eprint = {1806.04484},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07189,
author = {Sami Davies and
Thomas Rothvoss and
Yihao Zhang},
title = {A Tale of Santa Claus, Hypergraphs and Matroids},
journal = {CoRR},
volume = {abs/1807.07189},
year = {2018},
url = {http://arxiv.org/abs/1807.07189},
eprinttype = {arXiv},
eprint = {1807.07189},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07189.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/RothvossS17,
author = {Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {0/1 Polytopes with Quadratic Chv{\'{a}}tal Rank},
journal = {Oper. Res.},
volume = {65},
number = {1},
pages = {212--220},
year = {2017},
url = {https://doi.org/10.1287/opre.2016.1549},
doi = {10.1287/OPRE.2016.1549},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/RothvossS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rothvoss17,
author = {Thomas Rothvoss},
title = {The Matching Polytope has Exponential Extension Complexity},
journal = {J. {ACM}},
volume = {64},
number = {6},
pages = {41:1--41:19},
year = {2017},
url = {https://doi.org/10.1145/3127497},
doi = {10.1145/3127497},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Rothvoss17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rothvoss17,
author = {Thomas Rothvoss},
title = {Constructive Discrepancy Minimization for Convex Sets},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {1},
pages = {224--234},
year = {2017},
url = {https://doi.org/10.1137/141000282},
doi = {10.1137/141000282},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rothvoss17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HobergRRY17,
author = {Rebecca Hoberg and
Harishchandra Ramadas and
Thomas Rothvoss and
Xin Yang},
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector},
booktitle = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
pages = {254--266},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3\_21},
doi = {10.1007/978-3-319-59250-3\_21},
timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HobergRRY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HobergR17,
author = {Rebecca Hoberg and
Thomas Rothvoss},
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {An Improved Deterministic Rescaling for Linear Programming Algorithms},
booktitle = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
pages = {267--278},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3\_22},
doi = {10.1007/978-3-319-59250-3\_22},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HobergR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LevyRR17,
author = {Avi Levy and
Harishchandra Ramadas and
Thomas Rothvoss},
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {Deterministic Discrepancy Minimization via the Multiplicative Weight
Update Method},
booktitle = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
pages = {380--391},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3\_31},
doi = {10.1007/978-3-319-59250-3\_31},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/LevyRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HobergR17,
author = {Rebecca Hoberg and
Thomas Rothvoss},
editor = {Philip N. Klein},
title = {A Logarithmic Additive Integrality Gap for Bin Packing},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2616--2625},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.172},
doi = {10.1137/1.9781611974782.172},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/HobergR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrandoniR16,
author = {Fabrizio Grandoni and
Thomas Rothvo{\ss}},
title = {Pricing on Paths: {A} {PTAS} for the Highway Problem},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {2},
pages = {216--231},
year = {2016},
url = {https://doi.org/10.1137/140998846},
doi = {10.1137/140998846},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GrandoniR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rothvoss16,
author = {Thomas Rothvoss},
title = {Better Bin Packing Approximations via Discrepancy Theory},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {930--946},
year = {2016},
url = {https://doi.org/10.1137/140955367},
doi = {10.1137/140955367},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rothvoss16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeveyR16,
author = {Elaine Levey and
Thomas Rothvoss},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A (1+epsilon)-approximation for makespan scheduling with precedence
constraints using {LP} hierarchies},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {168--177},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897532},
doi = {10.1145/2897518.2897532},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeveyR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rothvoss16,
author = {Thomas Rothvoss},
title = {Lecture Notes on the {ARV} Algorithm for Sparsest Cut},
journal = {CoRR},
volume = {abs/1607.00854},
year = {2016},
url = {http://arxiv.org/abs/1607.00854},
eprinttype = {arXiv},
eprint = {1607.00854},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rothvoss16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevyRR16,
author = {Avi Levy and
Harishchandra Ramadas and
Thomas Rothvoss},
title = {Deterministic Discrepancy Minimization via the Multiplicative Weight
Update Method},
journal = {CoRR},
volume = {abs/1611.08752},
year = {2016},
url = {http://arxiv.org/abs/1611.08752},
eprinttype = {arXiv},
eprint = {1611.08752},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevyRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HobergRRY16,
author = {Rebecca Hoberg and
Harishchandra Ramadas and
Thomas Rothvoss and
Xin Yang},
title = {Number Balancing is as hard as Minkowski's Theorem and Shortest Vector},
journal = {CoRR},
volume = {abs/1611.08757},
year = {2016},
url = {http://arxiv.org/abs/1611.08757},
eprinttype = {arXiv},
eprint = {1611.08757},
timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HobergRRY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HobergR16,
author = {Rebecca Hoberg and
Thomas Rothvoss},
title = {An Improved Deterministic Rescaling for Linear Programming Algorithms},
journal = {CoRR},
volume = {abs/1612.04782},
year = {2016},
url = {http://arxiv.org/abs/1612.04782},
eprinttype = {arXiv},
eprint = {1612.04782},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HobergR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rts/DavisBBR0G15,
author = {Robert I. Davis and
Alan Burns and
Sanjoy K. Baruah and
Thomas Rothvo{\ss} and
Laurent George and
Oliver Gettings},
title = {Exact comparison of fixed priority and {EDF} scheduling based on speedup
factors for both pre-emptive and non-pre-emptive paradigms},
journal = {Real Time Syst.},
volume = {51},
number = {5},
pages = {566--601},
year = {2015},
url = {https://doi.org/10.1007/s11241-015-9233-0},
doi = {10.1007/S11241-015-9233-0},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rts/DavisBBR0G15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HobergR15,
author = {Rebecca Hoberg and
Thomas Rothvoss},
title = {A Logarithmic Additive Integrality Gap for Bin Packing},
journal = {CoRR},
volume = {abs/1503.08796},
year = {2015},
url = {http://arxiv.org/abs/1503.08796},
eprinttype = {arXiv},
eprint = {1503.08796},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HobergR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeveyR15,
author = {Elaine Levey and
Thomas Rothvoss},
title = {A Lasserre-based {\textdollar}(1+{\textbackslash}varepsilon){\textdollar}-approximation
for {\textdollar}Pm {\textbackslash}mid p{\_}j=1, {\textbackslash}textrm\{prec\}
{\textbackslash}mid C{\_}\{{\textbackslash}max\}{\textdollar}},
journal = {CoRR},
volume = {abs/1509.07808},
year = {2015},
url = {http://arxiv.org/abs/1509.07808},
eprinttype = {arXiv},
eprint = {1509.07808},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeveyR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rothvoss14,
author = {Thomas Rothvo{\ss}},
title = {Constructive Discrepancy Minimization for Convex Sets},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {140--145},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.23},
doi = {10.1109/FOCS.2014.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rothvoss14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansR14,
author = {Michel X. Goemans and
Thomas Rothvo{\ss}},
editor = {Chandra Chekuri},
title = {Polynomiality for Bin Packing with a Constant Number of Item Types},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {830--839},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.61},
doi = {10.1137/1.9781611973402.61},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoemansR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Rothvoss14,
author = {Thomas Rothvo{\ss}},
editor = {David B. Shmoys},
title = {The matching polytope has exponential extension complexity},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {263--272},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591834},
doi = {10.1145/2591796.2591834},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Rothvoss14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rothvoss14,
author = {Thomas Rothvo{\ss}},
title = {Constructive discrepancy minimization for convex sets},
journal = {CoRR},
volume = {abs/1404.0339},
year = {2014},
url = {http://arxiv.org/abs/1404.0339},
eprinttype = {arXiv},
eprint = {1404.0339},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rothvoss14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rothvoss14a,
author = {Thomas Rothvo{\ss}},
title = {A direct proof for Lovett's bound on the communication complexity
of low rank matrices},
journal = {CoRR},
volume = {abs/1409.6366},
year = {2014},
url = {http://arxiv.org/abs/1409.6366},
eprinttype = {arXiv},
eprint = {1409.6366},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rothvoss14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ByrkaGRS13,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {Steiner Tree Approximation via Iterative Randomized Rounding},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {6:1--6:33},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432628},
doi = {10.1145/2432622.2432628},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ByrkaGRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Rothvoss13,
author = {Thomas Rothvo{\ss}},
title = {Some 0/1 polytopes need exponential size extended formulations},
journal = {Math. Program.},
volume = {142},
number = {1-2},
pages = {255--268},
year = {2013},
url = {https://doi.org/10.1007/s10107-012-0574-3},
doi = {10.1007/S10107-012-0574-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Rothvoss13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BollobasPRS13,
author = {B{\'{e}}la Bollob{\'{a}}s and
David Pritchard and
Thomas Rothvo{\ss} and
Alex D. Scott},
title = {Cover-Decomposition and Polychromatic Numbers},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {240--256},
year = {2013},
url = {https://doi.org/10.1137/110856332},
doi = {10.1137/110856332},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BollobasPRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EisenbrandPR13,
author = {Friedrich Eisenbrand and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Thomas Rothvo{\ss}},
title = {Bin Packing via Discrepancy of Permutations},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {3},
pages = {24:1--24:15},
year = {2013},
url = {https://doi.org/10.1145/2483699.2483704},
doi = {10.1145/2483699.2483704},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/EisenbrandPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rothvoss13,
author = {Thomas Rothvo{\ss}},
title = {Approximating Bin Packing within O(log {OPT} * Log Log {OPT)} Bins},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {20--29},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.11},
doi = {10.1109/FOCS.2013.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rothvoss13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Rothvoss13,
author = {Thomas Rothvo{\ss}},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {A Simpler Proof for {\textdollar}O({\textbackslash}textrm\{Congestion\}
+ {\textbackslash}textrm\{Dilation\}){\textdollar} Packet Routing},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {336--348},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_29},
doi = {10.1007/978-3-642-36694-9\_29},
timestamp = {Wed, 03 Apr 2024 19:56:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Rothvoss13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/RothvossS13,
author = {Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {0/1 Polytopes with Quadratic Chv{\'{a}}tal Rank},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {349--361},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_30},
doi = {10.1007/978-3-642-36694-9\_30},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/RothvossS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-4010,
author = {Thomas Rothvo{\ss}},
title = {Approximating Bin Packing within O(log {OPT} * log log {OPT)} bins},
journal = {CoRR},
volume = {abs/1301.4010},
year = {2013},
url = {http://arxiv.org/abs/1301.4010},
eprinttype = {arXiv},
eprint = {1301.4010},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-4010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoemansR13,
author = {Michel X. Goemans and
Thomas Rothvo{\ss}},
title = {Polynomiality for Bin Packing with a Constant Number of Item Types},
journal = {CoRR},
volume = {abs/1307.5108},
year = {2013},
url = {http://arxiv.org/abs/1307.5108},
eprinttype = {arXiv},
eprint = {1307.5108},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoemansR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rothvoss13,
author = {Thomas Rothvo{\ss}},
title = {The matching polytope has exponential extension complexity},
journal = {CoRR},
volume = {abs/1311.2369},
year = {2013},
url = {http://arxiv.org/abs/1311.2369},
eprinttype = {arXiv},
eprint = {1311.2369},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rothvoss13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FioriniRT12,
author = {Samuel Fiorini and
Thomas Rothvo{\ss} and
Hans Raj Tiwary},
title = {Extended Formulations for Polygons},
journal = {Discret. Comput. Geom.},
volume = {48},
number = {3},
pages = {658--668},
year = {2012},
url = {https://doi.org/10.1007/s00454-012-9421-9},
doi = {10.1007/S00454-012-9421-9},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/FioriniRT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Rothvoss12,
author = {Thomas Rothvo{\ss}},
editor = {Yuval Rabani},
title = {The entropy rounding method in approximation algorithms},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {356--372},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.32},
doi = {10.1137/1.9781611973099.32},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/Rothvoss12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoemansORZ12,
author = {Michel X. Goemans and
Neil Olver and
Thomas Rothvo{\ss} and
Rico Zenklusen},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Matroids and integrality gaps for hypergraphic steiner tree relaxations},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {1161--1176},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214081},
doi = {10.1145/2213977.2214081},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoemansORZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4753,
author = {Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {0/1 Polytopes with Quadratic Chvatal Rank},
journal = {CoRR},
volume = {abs/1204.4753},
year = {2012},
url = {http://arxiv.org/abs/1204.4753},
eprinttype = {arXiv},
eprint = {1204.4753},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-4753.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-3718,
author = {Thomas Rothvo{\ss}},
title = {A simpler proof for O(congestion + dilation) packet routing},
journal = {CoRR},
volume = {abs/1206.3718},
year = {2012},
url = {http://arxiv.org/abs/1206.3718},
eprinttype = {arXiv},
eprint = {1206.3718},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-3718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GrandoniRS11,
author = {Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {From Uncertainty to Nonlinearity: Solving Virtual Private Network
via Single-Sink Buy-at-Bulk},
journal = {Math. Oper. Res.},
volume = {36},
number = {2},
pages = {185--204},
year = {2011},
url = {https://doi.org/10.1287/moor.1110.0490},
doi = {10.1287/MOOR.1110.0490},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/GrandoniRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BollobasPRS11,
author = {B{\'{e}}la Bollob{\'{a}}s and
David Pritchard and
Thomas Rothvo{\ss} and
Alex D. Scott},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Cover-Decomposition and Polychromatic Numbers},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {799--810},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_67},
doi = {10.1007/978-3-642-23719-5\_67},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BollobasPRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EisenbrandKRS11,
author = {Friedrich Eisenbrand and
Naonori Kakimura and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Set Covering with Ordered Replacement: Additive and Multiplicative
Gaps},
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 = {170--182},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_14},
doi = {10.1007/978-3-642-20807-2\_14},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/EisenbrandKRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GrandoniR11,
author = {Fabrizio Grandoni and
Thomas Rothvo{\ss}},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Approximation Algorithms for Single and Multi-Commodity Connected
Facility Location},
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 = {248--260},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_20},
doi = {10.1007/978-3-642-20807-2\_20},
timestamp = {Mon, 11 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/GrandoniR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandPR11,
author = {Friedrich Eisenbrand and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Thomas Rothvo{\ss}},
editor = {Dana Randall},
title = {Bin Packing via Discrepancy of Permutations},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {476--481},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.38},
doi = {10.1137/1.9781611973082.38},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenbrandPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrandoniR11,
author = {Fabrizio Grandoni and
Thomas Rothvo{\ss}},
editor = {Dana Randall},
title = {Pricing on Paths: {A} {PTAS} for the Highway Problem},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {675--684},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.53},
doi = {10.1137/1.9781611973082.53},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GrandoniR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4597,
author = {Thomas Rothvo{\ss}},
title = {The Entropy Rounding Method in Approximation Algorithms},
journal = {CoRR},
volume = {abs/1104.4597},
year = {2011},
url = {http://arxiv.org/abs/1104.4597},
eprinttype = {arXiv},
eprint = {1104.4597},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4597.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0036,
author = {Thomas Rothvo{\ss}},
title = {Some 0/1 polytopes need exponential size extended formulations},
journal = {CoRR},
volume = {abs/1105.0036},
year = {2011},
url = {http://arxiv.org/abs/1105.0036},
eprinttype = {arXiv},
eprint = {1105.0036},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-0371,
author = {Samuel Fiorini and
Thomas Rothvo{\ss} and
Hans Raj Tiwary},
title = {Extended formulations for polygons},
journal = {CoRR},
volume = {abs/1107.0371},
year = {2011},
url = {http://arxiv.org/abs/1107.0371},
eprinttype = {arXiv},
eprint = {1107.0371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-0371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-5473,
author = {Thomas Rothvo{\ss}},
title = {Directed Steiner Tree and the Lasserre Hierarchy},
journal = {CoRR},
volume = {abs/1111.5473},
year = {2011},
url = {http://arxiv.org/abs/1111.5473},
eprinttype = {arXiv},
eprint = {1111.5473},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-5473.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-7280,
author = {Michel X. Goemans and
Neil Olver and
Thomas Rothvo{\ss} and
Rico Zenklusen},
title = {Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations},
journal = {CoRR},
volume = {abs/1111.7280},
year = {2011},
url = {http://arxiv.org/abs/1111.7280},
eprinttype = {arXiv},
eprint = {1111.7280},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-7280.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/CominettiCRM10,
author = {Roberto Cominetti and
Jos{\'{e}} R. Correa and
Thomas Rothvo{\ss} and
Jaime San Mart{\'{\i}}n},
title = {Optimal Selection of Customers for a Last-Minute Offer},
journal = {Oper. Res.},
volume = {58},
number = {4-Part-1},
pages = {878--888},
year = {2010},
url = {https://doi.org/10.1287/opre.1090.0787},
doi = {10.1287/OPRE.1090.0787},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/CominettiCRM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EisenbrandGRS10,
author = {Friedrich Eisenbrand and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Guido Sch{\"{a}}fer},
title = {Connected facility location via random facility sampling and core
detouring},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {8},
pages = {709--726},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2010.02.001},
doi = {10.1016/J.JCSS.2010.02.001},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EisenbrandGRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/EisenbrandHRR10,
author = {Friedrich Eisenbrand and
Nicolai H{\"{a}}hnle and
Alexander A. Razborov and
Thomas Rothvo{\ss}},
title = {Diameter of Polyhedra: Limits of Abstraction},
journal = {Math. Oper. Res.},
volume = {35},
number = {4},
pages = {786--794},
year = {2010},
url = {https://doi.org/10.1287/moor.1100.0470},
doi = {10.1287/MOOR.1100.0470},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/EisenbrandHRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GrandoniR10,
author = {Fabrizio Grandoni and
Thomas Rothvo{\ss}},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Network Design via Core Detouring for Problems without a Core},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {490--502},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_42},
doi = {10.1007/978-3-642-14165-2\_42},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GrandoniR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandR10,
author = {Friedrich Eisenbrand and
Thomas Rothvo{\ss}},
editor = {Moses Charikar},
title = {EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1029--1034},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.83},
doi = {10.1137/1.9781611973075.83},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenbrandR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ByrkaGRS10,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
editor = {Leonard J. Schulman},
title = {An improved LP-based approximation for steiner tree},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {583--592},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806769},
doi = {10.1145/1806689.1806769},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ByrkaGRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KarrenbauerR10,
author = {Andreas Karrenbauer and
Thomas Rothvo{\ss}},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling
of Implicit-Deadline Tasks},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {166--177},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_15},
doi = {10.1007/978-3-642-18318-8\_15},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KarrenbauerR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/EisenbrandHRR10,
author = {Friedrich Eisenbrand and
Nicolai H{\"{a}}hnle and
Alexander A. Razborov and
Thomas Rothvo{\ss}},
editor = {Anupam Gupta and
Stefano Leonardi and
Berthold V{\"{o}}cking and
Roger Wattenhofer},
title = {Diameter of Polyhedra: Limits of Abstraction},
booktitle = {Flexible Network Design, 24.05. - 28.05.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10211},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2724/},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/dagstuhl/EisenbrandHRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/EisenbrandR10,
author = {Friedrich Eisenbrand and
Thomas Rothvo{\ss}},
editor = {Susanne Albers and
Sanjoy K. Baruah and
Rolf H. M{\"{o}}hring and
Kirk Pruhs},
title = {Recent Hardness Results for Periodic Uni-processor Scheduling},
booktitle = {Scheduling, 14.02. - 19.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10071},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2545/},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/EisenbrandR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-3051,
author = {Fabrizio Grandoni and
Thomas Rothvo{\ss}},
title = {Prizing on Paths: {A} {PTAS} for the Highway Problem},
journal = {CoRR},
volume = {abs/1004.3051},
year = {2010},
url = {http://arxiv.org/abs/1004.3051},
eprinttype = {arXiv},
eprint = {1004.3051},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-3051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2170,
author = {Friedrich Eisenbrand and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Thomas Rothvo{\ss}},
title = {Bin Packing via Discrepancy of Permutations},
journal = {CoRR},
volume = {abs/1007.2170},
year = {2010},
url = {http://arxiv.org/abs/1007.2170},
eprinttype = {arXiv},
eprint = {1007.2170},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-6144,
author = {David Pritchard and
Thomas Rothvo{\ss}},
title = {Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically
(Packing Covers)},
journal = {CoRR},
volume = {abs/1009.6144},
year = {2010},
url = {http://arxiv.org/abs/1009.6144},
eprinttype = {arXiv},
eprint = {1009.6144},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-6144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-3295,
author = {Friedrich Eisenbrand and
Naonori Kakimura and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {Set Covering with Ordered Replacement -- Additive and Multiplicative
Gaps},
journal = {CoRR},
volume = {abs/1012.3295},
year = {2010},
url = {http://arxiv.org/abs/1012.3295},
eprinttype = {arXiv},
eprint = {1012.3295},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-3295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rts/DavisRBB09,
author = {Robert I. Davis and
Thomas Rothvo{\ss} and
Sanjoy K. Baruah and
Alan Burns},
title = {Exact quantification of the sub-optimality of uniprocessor fixed priority
pre-emptive scheduling},
journal = {Real Time Syst.},
volume = {43},
number = {3},
pages = {211--258},
year = {2009},
url = {https://doi.org/10.1007/s11241-009-9079-4},
doi = {10.1007/S11241-009-9079-4},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rts/DavisRBB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EisenbrandR09,
author = {Friedrich Eisenbrand and
Thomas Rothvo{\ss}},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {New Hardness Results for Diophantine Approximation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {98--110},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_8},
doi = {10.1007/978-3-642-03685-9\_8},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/EisenbrandR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RothvossS09,
author = {Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {On the Complexity of the Asymmetric {VPN} Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {326--338},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_25},
doi = {10.1007/978-3-642-03685-9\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/RothvossS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EisenbrandHR09,
author = {Friedrich Eisenbrand and
Nicolai H{\"{a}}hnle and
Thomas Rothvo{\ss}},
editor = {John Hershberger and
Efi Fogel},
title = {Diameter of polyhedra: limits of abstraction},
booktitle = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
Aarhus, Denmark, June 8-10, 2009},
pages = {386--392},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1542362.1542428},
doi = {10.1145/1542362.1542428},
timestamp = {Mon, 14 Jun 2021 16:24:56 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EisenbrandHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KarrenbauerR09,
author = {Andreas Karrenbauer and
Thomas Rothvo{\ss}},
editor = {Amos Fiat and
Peter Sanders},
title = {An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time
Scheduling},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {432--443},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_39},
doi = {10.1007/978-3-642-04128-0\_39},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KarrenbauerR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/EisenbrandPRS08,
author = {Friedrich Eisenbrand and
J{\'{a}}nos Pach and
Thomas Rothvo{\ss} and
Nir B. Sopher},
title = {Convexly Independent Subsets of the Minkowski Sum of Planar Point
Sets},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1n8.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/EisenbrandPRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EisenbrandR08,
author = {Friedrich Eisenbrand and
Thomas Rothvo{\ss}},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {A {PTAS} for Static Priority Real-Time Scheduling with Resource Augmentation},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {246--257},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_21},
doi = {10.1007/978-3-540-70575-8\_21},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EisenbrandR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/EisenbrandR08,
author = {Friedrich Eisenbrand and
Thomas Rothvo{\ss}},
title = {Static-Priority Real-Time Scheduling: Response Time Computation Is
NP-Hard},
booktitle = {Proceedings of the 29th {IEEE} Real-Time Systems Symposium, {RTSS}
2008, Barcelona, Spain, 30 November - 3 December 2008},
pages = {397--406},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/RTSS.2008.25},
doi = {10.1109/RTSS.2008.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/EisenbrandR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandGRS08,
author = {Friedrich Eisenbrand and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Guido Sch{\"{a}}fer},
editor = {Shang{-}Hua Teng},
title = {Approximating connected facility location problems via random facility
sampling and core detouring},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1174--1183},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347210},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenbrandGRS08.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 2024-04-25 02:21 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:
