Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jirí Sgall
@article{DBLP:journals/orl/SgallW23,
author = {Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {Multiprocessor jobs, preemptive schedules, and one-competitive online
algorithms},
journal = {Oper. Res. Lett.},
volume = {51},
number = {6},
pages = {583--590},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.09.010},
doi = {10.1016/J.ORL.2023.09.010},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/SgallW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LieskovskySF23,
author = {Matej Lieskovsk{\'{y}} and
Jir{\'{\i}} Sgall and
Andreas Emil Feldmann},
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation Algorithms and Lower Bounds for Graph Burning},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.9},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LieskovskySF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-02224,
author = {Sunny Atalig and
Marek Chrobak and
Erfan Mousavian and
Jiri Sgall and
Pavel Vesel{\'{y}}},
title = {Structural Properties of Search Trees with 2-way Comparisons},
journal = {CoRR},
volume = {abs/2311.02224},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.02224},
doi = {10.48550/ARXIV.2311.02224},
eprinttype = {arXiv},
eprint = {2311.02224},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-02224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VeselyCJS22,
author = {Pavel Vesel{\'{y}} and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {A {\textbackslash}({\textbackslash}boldsymbol\{{\textbackslash}phi
\}{\textbackslash}) -Competitive Algorithm for Scheduling Packets
with Deadlines},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {5},
pages = {1626--1691},
year = {2022},
url = {https://doi.org/10.1137/21m1469753},
doi = {10.1137/21M1469753},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/VeselyCJS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/LieskovskyS22,
author = {Matej Lieskovsk{\'{y}} and
Jir{\'{\i}} Sgall},
editor = {Parinya Chalermsook and
Bundit Laekhanukit},
title = {Graph Burning and Non-uniform k-centers for Small Treewidth},
booktitle = {Approximation and Online Algorithms - 20th International Workshop,
{WAOA} 2022, Potsdam, Germany, September 8-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13538},
pages = {20--35},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18367-6\_2},
doi = {10.1007/978-3-031-18367-6\_2},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/LieskovskyS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BohmJSV21,
author = {Martin B{\"{o}}hm and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {On packet scheduling with adversarial jamming and speedup},
journal = {Ann. Oper. Res.},
volume = {298},
number = {1},
pages = {7--42},
year = {2021},
url = {https://doi.org/10.1007/s10479-019-03153-x},
doi = {10.1007/S10479-019-03153-X},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/BohmJSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiBBCDF21,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {New results on multi-level aggregation},
journal = {Theor. Comput. Sci.},
volume = {861},
pages = {133--143},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.02.016},
doi = {10.1016/J.TCS.2021.02.016},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiBBCDF21.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-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/ior/BienkowskiBBCDF20,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {Online Algorithms for Multilevel Aggregation},
journal = {Oper. Res.},
volume = {68},
number = {1},
pages = {214--232},
year = {2020},
url = {https://doi.org/10.1287/opre.2019.1847},
doi = {10.1287/OPRE.2019.1847},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ior/BienkowskiBBCDF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BaloghBDSS19,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Jir{\'{\i}} Sgall and
Rob van Stee},
title = {The optimal absolute ratio for online bin packing},
journal = {J. Comput. Syst. Sci.},
volume = {102},
pages = {1--17},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2018.11.005},
doi = {10.1016/J.JCSS.2018.11.005},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BaloghBDSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BohmCJLSV19,
author = {Martin B{\"{o}}hm and
Marek Chrobak and
Lukasz Jez and
Fei Li and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Online packet scheduling with bounded delay and lookahead},
journal = {Theor. Comput. Sci.},
volume = {776},
pages = {95--113},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.01.013},
doi = {10.1016/J.TCS.2019.01.013},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BohmCJLSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VeselyCJS19,
author = {Pavel Vesel{\'{y}} and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
editor = {Timothy M. Chan},
title = {A {\(\phi\)}-Competitive Algorithm for Scheduling Packets with Deadlines},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {123--142},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.9},
doi = {10.1137/1.9781611975482.9},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/VeselyCJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BohmDESV18,
author = {Martin B{\"{o}}hm and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Colored Bin Packing: Online Algorithms and Lower Bounds},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {155--184},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0248-2},
doi = {10.1007/S00453-016-0248-2},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BohmDESV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AlthausBKHNRSS18,
author = {Ernst Althaus and
Andr{\'{e}} Brinkmann and
Peter Kling and
Friedhelm Meyer auf der Heide and
Lars Nagel and
S{\"{o}}ren Riechers and
Jir{\'{\i}} Sgall and
Tim S{\"{u}}{\ss}},
title = {Scheduling shared continuous resources on many-cores},
journal = {J. Sched.},
volume = {21},
number = {1},
pages = {77--92},
year = {2018},
url = {https://doi.org/10.1007/s10951-017-0518-0},
doi = {10.1007/S10951-017-0518-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/AlthausBKHNRSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiBJLMS18,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Lukasz Jez and
Pawel Laskos{-}Grabowski and
Jan Marcinkowski and
Jir{\'{\i}} Sgall and
Aleksandra Spyra and
Pavel Vesel{\'{y}}},
title = {Logarithmic price of buffer downscaling on line metrics},
journal = {Theor. Comput. Sci.},
volume = {707},
pages = {89--93},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.10.008},
doi = {10.1016/J.TCS.2017.10.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiBJLMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07177,
author = {Pavel Vesel{\'{y}} and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {A {\(\varphi\)}-Competitive Algorithm for Scheduling Packets with
Deadlines},
journal = {CoRR},
volume = {abs/1807.07177},
year = {2018},
url = {http://arxiv.org/abs/1807.07177},
eprinttype = {arXiv},
eprint = {1807.07177},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07177.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FolwarcznyS17,
author = {Luk'av{s} Folwarczn'y and
Jir{\'{\i}} Sgall},
title = {General Caching Is Hard: Even with Small Pages},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {319--339},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0185-0},
doi = {10.1007/S00453-016-0185-0},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FolwarcznyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BohmSSV17,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {A two-phase algorithm for bin stretching with stretching factor 1.5},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {810--828},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0114-4},
doi = {10.1007/S10878-017-0114-4},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BohmSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BohmSSV17a,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {Erratum to: {A} two-phase algorithm for bin stretching with stretching
factor 1.5},
journal = {J. Comb. Optim.},
volume = {34},
number = {3},
pages = {829},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0116-2},
doi = {10.1007/S10878-017-0116-2},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BohmSSV17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BohmSSV17,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {Online bin stretching with three bins},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {601--621},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0504-y},
doi = {10.1007/S10951-016-0504-Y},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/BohmSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BohmJSV17,
author = {Martin B{\"{o}}hm and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Roberto Solis{-}Oba and
Rudolf Fleischer},
title = {On Packet Scheduling with Adversarial Jamming and Speedup},
booktitle = {Approximation and Online Algorithms - 15th International Workshop,
{WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10787},
pages = {190--206},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-89441-6\_15},
doi = {10.1007/978-3-319-89441-6\_15},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BohmJSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ttcs/2017,
editor = {Mohammad Reza Mousavi and
Jir{\'{\i}} Sgall},
title = {Topics in Theoretical Computer Science - Second {IFIP} {WG} 1.8 International
Conference, {TTCS} 2017, Tehran, Iran, September 12-14, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10608},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68953-1},
doi = {10.1007/978-3-319-68953-1},
isbn = {978-3-319-68952-4},
timestamp = {Sat, 11 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ttcs/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmJSV17,
author = {Martin B{\"{o}}hm and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {On Packet Scheduling with Adversarial Jamming and Speedup},
journal = {CoRR},
volume = {abs/1705.07018},
year = {2017},
url = {http://arxiv.org/abs/1705.07018},
eprinttype = {arXiv},
eprint = {1705.07018},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmJSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinJSS16,
author = {Leah Epstein and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Rob van Stee},
title = {Online Scheduling of Jobs with Fixed Start Times on Related Machines},
journal = {Algorithmica},
volume = {74},
number = {1},
pages = {156--176},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9940-2},
doi = {10.1007/S00453-014-9940-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinJSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganJS16,
author = {Marek Cygan and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Online Knapsack Revisited},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {153--190},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9566-4},
doi = {10.1007/S00224-014-9566-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BienkowskiBBCDF16,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jiri Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Online Algorithms for Multi-Level Aggregation},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.12},
doi = {10.4230/LIPICS.ESA.2016.12},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BienkowskiBBCDF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BohmCJLSV16,
author = {Martin B{\"{o}}hm and
Marek Chrobak and
Lukasz Jez and
Fei Li and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Seok{-}Hee Hong},
title = {Online Packet Scheduling with Bounded Delay and Lookahead},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {21:1--21:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.21},
doi = {10.4230/LIPICS.ISAAC.2016.21},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BohmCJLSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Sgall16,
author = {Jiri Sgall},
title = {Online Preemptive Scheduling on Parallel Machines},
booktitle = {Encyclopedia of Algorithms},
pages = {1461--1464},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_501},
doi = {10.1007/978-1-4939-2864-4\_501},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Sgall16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmSSV16,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {The Best Two-Phase Algorithm for Bin Stretching},
journal = {CoRR},
volume = {abs/1601.08111},
year = {2016},
url = {http://arxiv.org/abs/1601.08111},
eprinttype = {arXiv},
eprint = {1601.08111},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmSSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmCJLSV16,
author = {Martin B{\"{o}}hm and
Marek Chrobak and
Lukasz Jez and
Fei Li and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Online Packet Scheduling with Bounded Delay and Lookahead},
journal = {CoRR},
volume = {abs/1606.09395},
year = {2016},
url = {http://arxiv.org/abs/1606.09395},
eprinttype = {arXiv},
eprint = {1606.09395},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmCJLSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBJLMS16,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Lukasz Jez and
Pawel Laskos{-}Grabowski and
Jan Marcinkowski and
Jir{\'{\i}} Sgall and
Aleksandra Spyra and
Pavel Vesel{\'{y}}},
title = {Logarithmic price of buffer downscaling on line metrics},
journal = {CoRR},
volume = {abs/1610.04915},
year = {2016},
url = {http://arxiv.org/abs/1610.04915},
eprinttype = {arXiv},
eprint = {1610.04915},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBJLMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ChatterjeeS15,
author = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Special Issue for the 38th International Symposium on Mathematical
Foundations of Computer Science, {MFCS} 2013, Klosterneuburg, Austria},
journal = {Inf. Comput.},
volume = {240},
pages = {1},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.09.012},
doi = {10.1016/J.IC.2014.09.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ChatterjeeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EbenlendrS15,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
title = {A Lower Bound on Deterministic Online Algorithms for Scheduling on
Related Machines Without Preemption},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {73--81},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9451-6},
doi = {10.1007/S00224-013-9451-6},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EbenlendrS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FolwarcznyS15,
author = {Luk'av{s} Folwarczn'y and
Jir{\'{\i}} Sgall},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {General Caching Is Hard: Even with Small Pages},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {116--126},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_11},
doi = {10.1007/978-3-662-48971-0\_11},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FolwarcznyS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaloghBDSS15,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Jir{\'{\i}} Sgall and
Rob van Stee},
editor = {Piotr Indyk},
title = {The optimal absolute ratio for online bin packing},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1425--1438},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.94},
doi = {10.1137/1.9781611973730.94},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaloghBDSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FolwarcznyS15,
author = {Luk'av{s} Folwarczn'y and
Jir{\'{\i}} Sgall},
title = {General Caching Is Hard: Even with Small Pages},
journal = {CoRR},
volume = {abs/1506.07905},
year = {2015},
url = {http://arxiv.org/abs/1506.07905},
eprinttype = {arXiv},
eprint = {1506.07905},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/FolwarcznyS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBBCDF15,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {Online Algorithms for Multi-Level Aggregation},
journal = {CoRR},
volume = {abs/1507.02378},
year = {2015},
url = {http://arxiv.org/abs/1507.02378},
eprinttype = {arXiv},
eprint = {1507.02378},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBBCDF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EbenlendrKS14,
author = {Tom{\'{a}}s Ebenlendr and
Marek Krc{\'{a}}l and
Jir{\'{\i}} Sgall},
title = {Graph Balancing: {A} Special Case of Scheduling Unrelated Parallel
Machines},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {62--80},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9668-9},
doi = {10.1007/S00453-012-9668-9},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EbenlendrKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Sgall14,
author = {Jir{\'{\i}} Sgall},
editor = {Arnold Beckmann and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Klaus Meer},
title = {Online Bin Packing: Old Algorithms and New Results},
booktitle = {Language, Life, Limits - 10th Conference on Computability in Europe,
CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8493},
pages = {362--372},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08019-2\_38},
doi = {10.1007/978-3-319-08019-2\_38},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Sgall14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DosaS14,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Jir{\'{\i}} Sgall},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Optimal Analysis of Best Fit Bin Packing},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {429--441},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_36},
doi = {10.1007/978-3-662-43948-7\_36},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DosaS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BienkowskiBCJNS14,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Dorian Nogneng and
Jir{\'{\i}} Sgall},
editor = {Chandra Chekuri},
title = {Better Approximation Bounds for the Joint Replenishment Problem},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {42--54},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.4},
doi = {10.1137/1.9781611973402.4},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/BienkowskiBCJNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BohmSSV14,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Better Algorithms for Online Bin Stretching},
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 = {23--34},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_3},
doi = {10.1007/978-3-319-18263-6\_3},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BohmSSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BohmSV14,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Online Colored Bin Packing},
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 = {35--46},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_4},
doi = {10.1007/978-3-319-18263-6\_4},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BohmSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/SgallW14,
author = {Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online
Algorithms},
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 = {236--247},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_20},
doi = {10.1007/978-3-319-18263-6\_20},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/SgallW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmSV14,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Online Colored Bin Packing},
journal = {CoRR},
volume = {abs/1404.5548},
year = {2014},
url = {http://arxiv.org/abs/1404.5548},
eprinttype = {arXiv},
eprint = {1404.5548},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmSSV14,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {Better Algorithms for Online Bin Stretching},
journal = {CoRR},
volume = {abs/1404.5569},
year = {2014},
url = {http://arxiv.org/abs/1404.5569},
eprinttype = {arXiv},
eprint = {1404.5569},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmSSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AcetoHS13,
author = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {38th International Colloquium on Automata, Languages and Programming},
journal = {Inf. Comput.},
volume = {222},
pages = {1},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2012.11.002},
doi = {10.1016/J.IC.2012.11.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AcetoHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JezSSB13,
author = {Lukasz Jez and
Jarett Schwartz and
Jir{\'{\i}} Sgall and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si},
title = {Lower bounds for online makespan minimization on a small number of
related machines},
journal = {J. Sched.},
volume = {16},
number = {5},
pages = {539--547},
year = {2013},
url = {https://doi.org/10.1007/s10951-012-0288-7},
doi = {10.1007/S10951-012-0288-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/JezSSB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChrobakJS13,
author = {Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better bounds for incremental frequency allocation in bipartite graphs},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {75--83},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.05.020},
doi = {10.1016/J.TCS.2012.05.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChrobakJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DosaS13,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Jir{\'{\i}} Sgall},
editor = {Natacha Portier and
Thomas Wilke},
title = {First Fit bin packing: {A} tight analysis},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {538--549},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.538},
doi = {10.4230/LIPICS.STACS.2013.538},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DosaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BienkowskiBCJSS13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Grzegorz Stachowiak},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Online Control Message Aggregation in Chain Networks},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {133--145},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_12},
doi = {10.1007/978-3-642-40104-6\_12},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BienkowskiBCJSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/PudlakS13,
author = {Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
editor = {Ronald L. Graham and
Jaroslav Nesetril and
Steve Butler},
title = {An Upper Bound for a Communication Game Related to Time-Space Tradeoffs},
booktitle = {The Mathematics of Paul Erd{\H{o}}s {I}},
pages = {399--407},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-1-4614-7258-2\_24},
doi = {10.1007/978-1-4614-7258-2\_24},
timestamp = {Fri, 02 Nov 2018 09:27:04 +0100},
biburl = {https://dblp.org/rec/books/daglib/p/PudlakS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2013,
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2},
doi = {10.1007/978-3-642-40313-2},
isbn = {978-3-642-40312-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBCJS13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better Approximation Bounds for the Joint Replenishment Problem},
journal = {CoRR},
volume = {abs/1307.2531},
year = {2013},
url = {http://arxiv.org/abs/1307.2531},
eprinttype = {arXiv},
eprint = {1307.2531},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBCJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EpsteinJSS12,
author = {Leah Epstein and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Rob van Stee},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Online Scheduling of Jobs with Fixed Start Times on Related Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {134--145},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_12},
doi = {10.1007/978-3-642-32512-0\_12},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/EpsteinJSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Sgall12,
author = {Jir{\'{\i}} Sgall},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Open Problems in Throughput Scheduling},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {2--11},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_2},
doi = {10.1007/978-3-642-33090-2\_2},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Sgall12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Sgall12,
author = {Jir{\'{\i}} Sgall},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {A New Analysis of Best Fit Bin Packing},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {315--321},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_31},
doi = {10.1007/978-3-642-30347-0\_31},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/Sgall12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EbenlendrS11,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
title = {Semi-Online Preemptive Scheduling: One Algorithm for All Variants},
journal = {Theory Comput. Syst.},
volume = {48},
number = {3},
pages = {577--613},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9287-2},
doi = {10.1007/S00224-010-9287-2},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EbenlendrS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChrobakJS11,
author = {Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Better Bounds for Incremental Frequency Allocation in Bipartite Graphs},
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 = {251--262},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_22},
doi = {10.1007/978-3-642-23719-5\_22},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChrobakJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChrobakSW11,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Two-Bounded-Space Bin Packing Revisited},
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 = {263--274},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_23},
doi = {10.1007/978-3-642-23719-5\_23},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChrobakSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EbenlendrS11,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {A Lower Bound on Deterministic Online Algorithms for Scheduling on
Related Machines without Preemption},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {102--108},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_9},
doi = {10.1007/978-3-642-29116-6\_9},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EbenlendrS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-1,
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7},
doi = {10.1007/978-3-642-22006-7},
isbn = {978-3-642-22005-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/2011-1.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-2,
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8},
doi = {10.1007/978-3-642-22012-8},
isbn = {978-3-642-22011-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/2011-2.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3393,
author = {Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better Bounds for Incremental Frequency Allocation in Bipartite Graphs},
journal = {CoRR},
volume = {abs/1102.3393},
year = {2011},
url = {http://arxiv.org/abs/1102.3393},
eprinttype = {arXiv},
eprint = {1102.3393},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3393.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChrobakS10,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
title = {Three results on frequency assignment in linear cellular networks},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {131--137},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.09.019},
doi = {10.1016/J.TCS.2009.09.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChrobakS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EbenlendrJS09,
author = {Tom{\'{a}}s Ebenlendr and
Wojciech Jawor and
Jir{\'{\i}} Sgall},
title = {Preemptive Online Scheduling: Optimal Algorithms for All Speeds},
journal = {Algorithmica},
volume = {53},
number = {4},
pages = {504--522},
year = {2009},
url = {https://doi.org/10.1007/s00453-008-9235-6},
doi = {10.1007/S00453-008-9235-6},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EbenlendrJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChrobakHS09,
author = {Marek Chrobak and
Mathilde Hurand and
Jir{\'{\i}} Sgall},
title = {Algorithms for testing fault-tolerance of sequenced jobs},
journal = {J. Sched.},
volume = {12},
number = {5},
pages = {501--515},
year = {2009},
url = {https://doi.org/10.1007/s10951-009-0126-8},
doi = {10.1007/S10951-009-0126-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChrobakHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/EbenlendrS09,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
title = {Optimal and online preemptive scheduling on uniformly related machines},
journal = {J. Sched.},
volume = {12},
number = {5},
pages = {517--527},
year = {2009},
url = {https://doi.org/10.1007/s10951-009-0119-7},
doi = {10.1007/S10951-009-0119-7},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/EbenlendrS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SgallST09,
author = {Jir{\'{\i}} Sgall and
Hadas Shachnai and
Tami Tamir},
title = {Periodic scheduling with obligatory vacations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5112--5121},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.008},
doi = {10.1016/J.TCS.2009.08.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SgallST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/ChrobakS09,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
editor = {Andrew V. Goldberg and
Yunhong Zhou},
title = {Three Results on Frequency Assignment in Linear Cellular Networks},
booktitle = {Algorithmic Aspects in Information and Management, 5th International
Conference, {AAIM} 2009, San Francisco, CA, USA, June 15-17, 2009.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5564},
pages = {129--139},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02158-9\_12},
doi = {10.1007/978-3-642-02158-9\_12},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/ChrobakS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppam/ZajicekSE09,
author = {Ondrej Zaj{\'{\i}}cek and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Ebenlendr},
editor = {Roman Wyrzykowski and
Jack J. Dongarra and
Konrad Karczewski and
Jerzy Wasniewski},
title = {Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput},
booktitle = {Parallel Processing and Applied Mathematics, 8th International Conference,
{PPAM} 2009, Wroclaw, Poland, September 13-16, 2009, Revised Selected
Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6068},
pages = {52--61},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-14403-5\_6},
doi = {10.1007/978-3-642-14403-5\_6},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ppam/ZajicekSE09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EbenlendrS09,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Semi-Online Preemptive Scheduling: One Algorithm for All Variants},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {349--360},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1840},
doi = {10.4230/LIPICS.STACS.2009.1840},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EbenlendrS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KralST08,
author = {Daniel Kr{\'{a}}l and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
title = {Randomized strategies for the plurality problem},
journal = {Discret. Appl. Math.},
volume = {156},
number = {17},
pages = {3305--3311},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2008.05.014},
doi = {10.1016/J.DAM.2008.05.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KralST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BruhnCHKS08,
author = {Henning Bruhn and
Jakub Cern{\'{y}} and
Alexander Hall and
Petr Kolman and
Jir{\'{\i}} Sgall},
title = {Single Source Multiroute Flows and Cuts on Uniform Capacity Networks},
journal = {Theory Comput.},
volume = {4},
number = {1},
pages = {1--20},
year = {2008},
url = {https://doi.org/10.4086/toc.2008.v004a001},
doi = {10.4086/TOC.2008.V004A001},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BruhnCHKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EbenlendrKS08,
author = {Tom{\'{a}}s Ebenlendr and
Marek Krc{\'{a}}l and
Jir{\'{\i}} Sgall},
editor = {Shang{-}Hua Teng},
title = {Graph balancing: a special case of scheduling unrelated parallel machines},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {483--490},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347135},
timestamp = {Wed, 11 Nov 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EbenlendrKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EbenlendrS08,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
editor = {Evripidis Bampis and
Martin Skutella},
title = {A Lower Bound for Scheduling of Unit Jobs with Immediate Decision
on Parallel 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 = {43--52},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_4},
doi = {10.1007/978-3-540-93980-1\_4},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EbenlendrS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SgallW07,
author = {Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {An Approximation Scheme For Cake Division With {A} Linear Number Of
Cuts},
journal = {Comb.},
volume = {27},
number = {2},
pages = {205--211},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-0052-3},
doi = {10.1007/S00493-007-0052-3},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SgallW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/WoegingerS07,
author = {Gerhard J. Woeginger and
Jir{\'{\i}} Sgall},
title = {On the complexity of cake cutting},
journal = {Discret. Optim.},
volume = {4},
number = {2},
pages = {213--220},
year = {2007},
url = {https://doi.org/10.1016/j.disopt.2006.07.003},
doi = {10.1016/J.DISOPT.2006.07.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/WoegingerS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChrobakJST07,
author = {Marek Chrobak and
Wojciech Jawor and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
title = {Online Scheduling of Equal-Length Jobs: Randomization and Restarts
Help},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {6},
pages = {1709--1728},
year = {2007},
url = {https://doi.org/10.1137/S0097539704446608},
doi = {10.1137/S0097539704446608},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChrobakJST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChrobakJST07,
author = {Marek Chrobak and
Wojciech Jawor and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
title = {Improved online algorithms for buffer management in QoS switches},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {4},
pages = {50},
year = {2007},
url = {https://doi.org/10.1145/1290672.1290687},
doi = {10.1145/1290672.1290687},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChrobakJST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EpsteinKSS07,
author = {Leah Epstein and
Yanir Kleiman and
Jir{\'{\i}} Sgall and
Rob van Stee},
title = {Paging with connections: {FIFO} strikes again},
journal = {Theor. Comput. Sci.},
volume = {377},
number = {1-3},
pages = {55--64},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.009},
doi = {10.1016/J.TCS.2007.02.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EpsteinKSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DingESZ07,
author = {Jihuan Ding and
Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall and
Guochuan Zhang},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {Online Scheduling of Equal-Length Jobs on Parallel Machines},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {427--438},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_39},
doi = {10.1007/978-3-540-75520-3\_39},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DingESZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/ChrobakHS07,
author = {Marek Chrobak and
Mathilde Hurand and
Jir{\'{\i}} Sgall},
title = {Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with
Deadlines},
booktitle = {Proceedings of the 28th {IEEE} Real-Time Systems Symposium {(RTSS}
2007), 3-6 December 2007, Tucson, Arizona, {USA}},
pages = {139--148},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/RTSS.2007.20},
doi = {10.1109/RTSS.2007.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/ChrobakHS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChinCFJST06,
author = {Francis Y. L. Chin and
Marek Chrobak and
Stanley P. Y. Fung and
Wojciech Jawor and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
title = {Online competitive algorithms for maximizing weighted throughput of
unit jobs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {255--276},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.005},
doi = {10.1016/J.JDA.2005.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChinCFJST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlaserMS06,
author = {Markus Bl{\"{a}}ser and
Bodo Manthey and
Jir{\'{\i}} Sgall},
title = {An improved approximation algorithm for the asymmetric {TSP} with
strengthened triangle inequality},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {623--632},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.004},
doi = {10.1016/J.JDA.2005.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlaserMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EbenlendrJS06,
author = {Tom{\'{a}}s Ebenlendr and
Wojciech Jawor and
Jir{\'{\i}} Sgall},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Preemptive Online Scheduling: Optimal Algorithms for All Speeds},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {327--339},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_31},
doi = {10.1007/11841036\_31},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/EbenlendrJS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KralS05,
author = {Daniel Kr{\'{a}}l and
Jir{\'{\i}} Sgall},
title = {Coloring graphs from lists with bounded size of their union},
journal = {J. Graph Theory},
volume = {49},
number = {3},
pages = {177--186},
year = {2005},
url = {https://doi.org/10.1002/jgt.20073},
doi = {10.1002/JGT.20073},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KralS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/neco/SimaS05,
author = {Jiv{r}'{i} v{S}'{i}ma and
Jir{\'{\i}} Sgall},
title = {On the Nonlearnability of a Single Spiking Neuron},
journal = {Neural Comput.},
volume = {17},
number = {12},
pages = {2635--2647},
year = {2005},
url = {https://doi.org/10.1162/089976605774320601},
doi = {10.1162/089976605774320601},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/neco/SimaS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChrobakKS05,
author = {Marek Chrobak and
Petr Kolman and
Jir{\'{\i}} Sgall},
title = {The greedy algorithm for the minimum common string partition problem},
journal = {{ACM} Trans. Algorithms},
volume = {1},
number = {2},
pages = {350--366},
year = {2005},
url = {https://doi.org/10.1145/1103963.1103971},
doi = {10.1145/1103963.1103971},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChrobakKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SgallST05,
author = {Jir{\'{\i}} Sgall and
Hadas Shachnai and
Tami Tamir},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Fairness-Free Periodic Scheduling with Vacations},
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 = {592--603},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_53},
doi = {10.1007/11561071\_53},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/SgallST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FederHKS05,
author = {Tom{\'{a}}s Feder and
Pavol Hell and
Daniel Kr{\'{a}}l and
Jir{\'{\i}} Sgall},
title = {Two algorithms for general list matrix partitions},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {870--876},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070554},
timestamp = {Wed, 11 Nov 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FederHKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EbenlendrNSW05,
author = {Tom{\'{a}}s Ebenlendr and
John Noga and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {A Note on Semi-online Machine Covering},
booktitle = {Approximation and Online Algorithms, Third International Workshop,
{WAOA} 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {3879},
pages = {110--118},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11671411\_9},
doi = {10.1007/11671411\_9},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EbenlendrNSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Sgall05,
author = {Jir{\'{\i}} Sgall},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {Online Scheduling},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/69},
timestamp = {Thu, 10 Jun 2021 13:02:06 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Sgall05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinS04,
author = {Leah Epstein and
Jir{\'{\i}} Sgall},
title = {Approximation Schemes for Scheduling on Uniformly Related and Identical
Parallel Machines},
journal = {Algorithmica},
volume = {39},
number = {1},
pages = {43--57},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1077-7},
doi = {10.1007/S00453-003-1077-7},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinS04.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/rsa/FischerNS04,
author = {Eldar Fischer and
Ilan Newman and
Jir{\'{\i}} Sgall},
title = {Functions that have read-twice constant width branching programs are
not necessarily testable},
journal = {Random Struct. Algorithms},
volume = {24},
number = {2},
pages = {175--193},
year = {2004},
url = {https://doi.org/10.1002/rsa.10110},
doi = {10.1002/RSA.10110},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FischerNS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KralMSTW04,
author = {Daniel Kr{\'{a}}l and
Vladan Majerech and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}} and
Gerhard J. Woeginger},
title = {It is tough to be a plumber},
journal = {Theor. Comput. Sci.},
volume = {313},
number = {3},
pages = {473--484},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2002.12.002},
doi = {10.1016/J.TCS.2002.12.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KralMSTW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChrobakS04,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
title = {The weighted 2-server problem},
journal = {Theor. Comput. Sci.},
volume = {324},
number = {2-3},
pages = {289--312},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.05.020},
doi = {10.1016/J.TCS.2004.05.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChrobakS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChrobakKS04,
author = {Marek Chrobak and
Petr Kolman and
Jir{\'{\i}} Sgall},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {The Greedy Algorithm for the Minimum Common String Partition Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {84--95},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_8},
doi = {10.1007/978-3-540-27821-4\_8},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChrobakKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChrobakJST04,
author = {Marek Chrobak and
Wojciech Jawor and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
editor = {Susanne Albers and
Tomasz Radzik},
title = {Improved Online Algorithms for Buffer Management in QoS Switches},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {204--215},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_20},
doi = {10.1007/978-3-540-30140-0\_20},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChrobakJST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChrobakJST04,
author = {Marek Chrobak and
Wojciech Jawor and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Online Scheduling of Equal-Length Jobs: Randomization and Restarts
Help},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {358--370},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_32},
doi = {10.1007/978-3-540-27836-8\_32},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChrobakJST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BartalCCFJLST04,
author = {Yair Bartal and
Francis Y. L. Chin and
Marek Chrobak and
Stanley P. Y. Fung and
Wojciech Jawor and
Ron Lavi and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
editor = {Volker Diekert and
Michel Habib},
title = {Online Competitive Algorithms for Maximizing Weighted Throughput of
Unit Jobs},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {187--198},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_17},
doi = {10.1007/978-3-540-24749-4\_17},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BartalCCFJLST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EbenlendrS04,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
editor = {Volker Diekert and
Michel Habib},
title = {Optimal and Online Preemptive Scheduling on Uniformly Related Machines},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {199--210},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_18},
doi = {10.1007/978-3-540-24749-4\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EbenlendrS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChrobakS04,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
editor = {Volker Diekert and
Michel Habib},
title = {Errata to Analysis of the Harmonic Algorithm for Three Servers},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {656},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_57},
doi = {10.1007/978-3-540-24749-4\_57},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ChrobakS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/PruhsST04,
author = {Kirk Pruhs and
Jir{\'{\i}} Sgall and
Eric Torng},
editor = {Joseph Y.{-}T. Leung},
title = {Online Scheduling},
booktitle = {Handbook of Scheduling - Algorithms, Models, and Performance Analysis},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch15},
doi = {10.1201/9780203489802.CH15},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/PruhsST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChrobakENSSTV03,
author = {Marek Chrobak and
Leah Epstein and
John Noga and
Jir{\'{\i}} Sgall and
Rob van Stee and
Tom{\'{a}}s Tich{\'{y}} and
Nodari Vakhania},
title = {Preemptive scheduling in overloaded systems},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {1},
pages = {183--197},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00070-9},
doi = {10.1016/S0022-0000(03)00070-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChrobakENSSTV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SgallW03,
author = {Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {A Lower Bound for Cake Cutting},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {459--469},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_42},
doi = {10.1007/978-3-540-39658-1\_42},
timestamp = {Sun, 02 Jun 2019 21:14:37 +0200},
biburl = {https://dblp.org/rec/conf/esa/SgallW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChrobakS03,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
editor = {Helmut Alt and
Michel Habib},
title = {Analysis of the Harmonic Algorithm for Three Servers},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {247--259},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_23},
doi = {10.1007/3-540-36494-3\_23},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChrobakS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndersonCNSW02,
author = {Eric Anderson and
Marek Chrobak and
John Noga and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {Solution of a problem in {DNA} computing},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {387--391},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00252-3},
doi = {10.1016/S0304-3975(01)00252-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AndersonCNSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AzarRSW02,
author = {Yossi Azar and
Oded Regev and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {Off-line temporary tasks assignment},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {419--428},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00254-7},
doi = {10.1016/S0304-3975(01)00254-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AzarRSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChrobakENSSTV02,
author = {Marek Chrobak and
Leah Epstein and
John Noga and
Jir{\'{\i}} Sgall and
Rob van Stee and
Tom{\'{a}}s Tich{\'{y}} and
Nodari Vakhania},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Preemptive Scheduling in Overloaded Systems},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {800--811},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_68},
doi = {10.1007/3-540-45465-9\_68},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChrobakENSSTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/WoegingerS01,
author = {Gerhard J. Woeginger and
Jir{\'{\i}} Sgall},
title = {The complexity of coloring graphs without long induced paths},
journal = {Acta Cybern.},
volume = {15},
number = {1},
pages = {107--117},
year = {2001},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3566},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/WoegingerS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AvidorAS01,
author = {Adi Avidor and
Yossi Azar and
Jir{\'{\i}} Sgall},
title = {Ancient and New Algorithms for Load Balancing in the \emph{l}\({}_{\mbox{p}}\)
Norm},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {422--441},
year = {2001},
url = {https://doi.org/10.1007/s004530010051},
doi = {10.1007/S004530010051},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AvidorAS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/EdmondsIRS01,
author = {Jeff Edmonds and
Russell Impagliazzo and
Steven Rudich and
Jir{\'{\i}} Sgall},
title = {Communication complexity towards lower bounds on circuit depth},
journal = {Comput. Complex.},
volume = {10},
number = {3},
pages = {210--246},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8195-x},
doi = {10.1007/S00037-001-8195-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/EdmondsIRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sgall01,
author = {Jir{\'{\i}} Sgall},
title = {Solution of David Gale's lion and man problem},
journal = {Theor. Comput. Sci.},
volume = {259},
number = {1-2},
pages = {663--670},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00411-4},
doi = {10.1016/S0304-3975(00)00411-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sgall01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChrobakCINSW01,
author = {Marek Chrobak and
J{\'{a}}nos Csirik and
Csan{\'{a}}d Imreh and
John Noga and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {The Buffer Minimization Problem for Multiprocessor Scheduling with
Conflicts},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {862--874},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_70},
doi = {10.1007/3-540-48224-5\_70},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChrobakCINSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2001,
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4},
doi = {10.1007/3-540-44683-4},
isbn = {3-540-42496-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChrobakS00,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
title = {A simple analysis of the harmonic algorithm for two servers},
journal = {Inf. Process. Lett.},
volume = {75},
number = {1-2},
pages = {75--77},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00070-3},
doi = {10.1016/S0020-0190(00)00070-3},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChrobakS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EpsteinS00,
author = {Leah Epstein and
Jir{\'{\i}} Sgall},
title = {A lower bound for on-line scheduling on uniformly related machines},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {17--22},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00062-0},
doi = {10.1016/S0167-6377(99)00062-0},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/EpsteinS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SeidenSW00,
author = {Steven S. Seiden and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {Semi-online scheduling with decreasing job sizes},
journal = {Oper. Res. Lett.},
volume = {27},
number = {5},
pages = {215--221},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00053-5},
doi = {10.1016/S0167-6377(00)00053-5},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SeidenSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BerkmanPS00,
author = {Omer Berkman and
Michal Parnas and
Jir{\'{\i}} Sgall},
title = {Efficient Dynamic Traitor Tracing},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1802--1828},
year = {2000},
url = {https://doi.org/10.1137/S0097539700367984},
doi = {10.1137/S0097539700367984},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BerkmanPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BartalLMSS00,
author = {Yair Bartal and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Jir{\'{\i}} Sgall and
Leen Stougie},
title = {Multiprocessor Scheduling with Rejection},
journal = {{SIAM} J. Discret. Math.},
volume = {13},
number = {1},
pages = {64--78},
year = {2000},
url = {https://doi.org/10.1137/S0895480196300522},
doi = {10.1137/S0895480196300522},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BartalLMSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SavickyS00,
author = {Petr Savick{\'{y}} and
Jir{\'{\i}} Sgall},
title = {{DNF} tautologies with a limited number of occurrences of every variable},
journal = {Theor. Comput. Sci.},
volume = {238},
number = {1-2},
pages = {495--498},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00036-0},
doi = {10.1016/S0304-3975(00)00036-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SavickyS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BerkmanPS00,
author = {Omer Berkman and
Michal Parnas and
Jir{\'{\i}} Sgall},
editor = {David B. Shmoys},
title = {Efficient dynamic traitor tracing},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {586--595},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338611},
timestamp = {Wed, 11 Nov 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BerkmanPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChrobakS00,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
editor = {Horst Reichel and
Sophie Tison},
title = {The Weighted 2-Server Problem},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {593--604},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_49},
doi = {10.1007/3-540-46541-3\_49},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChrobakS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ImpagliazzoPS99,
author = {Russell Impagliazzo and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
title = {Lower Bounds for the Polynomial Calculus and the Gr{\"{o}}bner
Basis Algorithm},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {127--144},
year = {1999},
url = {https://doi.org/10.1007/s000370050024},
doi = {10.1007/S000370050024},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Sgall99,
author = {Jir{\'{\i}} Sgall},
title = {Bounds on Pairs of Families with Restricted Intersections},
journal = {Comb.},
volume = {19},
number = {4},
pages = {555--566},
year = {1999},
url = {https://doi.org/10.1007/s004939970007},
doi = {10.1007/S004939970007},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Sgall99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EpsteinS99,
author = {Leah Epstein and
Jir{\'{\i}} Sgall},
editor = {Jaroslav Nesetril},
title = {Approximation Schemes for Scheduling on Uniformly Related and Identical
Parallel Machines},
booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech
Republic, July 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1643},
pages = {151--162},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48481-7\_14},
doi = {10.1007/3-540-48481-7\_14},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/EpsteinS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EpsteinNSSW99,
author = {Leah Epstein and
John Noga and
Steven S. Seiden and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Randomized Online Scheduling on Two Uniform Machines},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {317--326},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314581},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/EpsteinNSSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DammJS98,
author = {Carsten Damm and
Stasys Jukna and
Jir{\'{\i}} Sgall},
title = {Some Bounds on Multiparty Communication Complexity of Pointer Jumping},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {109--127},
year = {1998},
url = {https://doi.org/10.1007/PL00001595},
doi = {10.1007/PL00001595},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DammJS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FeldmannKST98,
author = {Anja Feldmann and
Ming{-}Yang Kao and
Jir{\'{\i}} Sgall and
Shang{-}Hua Teng},
title = {Optimal On-Line Scheduling of Parallel Jobs with Dependencies},
journal = {J. Comb. Optim.},
volume = {1},
number = {4},
pages = {393--411},
year = {1998},
url = {https://doi.org/10.1023/A:1009794729459},
doi = {10.1023/A:1009794729459},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FeldmannKST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AvidorAS98,
author = {Adi Avidor and
Yossi Azar and
Jir{\'{\i}} Sgall},
editor = {Howard J. Karloff},
title = {Ancient and New Algorithms for Load Balancing in the L\({}_{\mbox{p}}\)
Norm},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {426--435},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314774},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/AvidorAS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-044,
author = {Jir{\'{\i}} Sgall},
title = {Bounds on Pairs of Families with Restricted Intersections},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-044}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-044/index.html},
eprinttype = {ECCC},
eprint = {TR98-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BussIPRS97,
author = {Samuel R. Buss and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Alexander A. Razborov and
Jir{\'{\i}} Sgall},
title = {Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems
with Modular Counting},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {256--298},
year = {1997},
url = {https://doi.org/10.1007/BF01294258},
doi = {10.1007/BF01294258},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BussIPRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sgall97,
author = {Jir{\'{\i}} Sgall},
title = {A Lower Bound for Randomized On-Line Multiprocessor Scheduling},
journal = {Inf. Process. Lett.},
volume = {63},
number = {1},
pages = {51--55},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00093-8},
doi = {10.1016/S0020-0190(97)00093-8},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sgall97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PudlakRS97,
author = {Pavel Pudl{\'{a}}k and
Vojtech R{\"{o}}dl and
Jir{\'{\i}} Sgall},
title = {Boolean Circuits, Tensor Ranks, and Communication Complexity},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {3},
pages = {605--633},
year = {1997},
url = {https://doi.org/10.1137/S0097539794264809},
doi = {10.1137/S0097539794264809},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PudlakRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-042,
author = {Russell Impagliazzo and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
title = {Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-042}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-042/index.html},
eprinttype = {ECCC},
eprint = {TR97-042},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonehDLS96,
author = {Dan Boneh and
Christopher Dunworth and
Richard J. Lipton and
Jir{\'{\i}} Sgall},
title = {On the Computational Power of {DNA}},
journal = {Discret. Appl. Math.},
volume = {71},
number = {1-3},
pages = {79--94},
year = {1996},
url = {https://doi.org/10.1016/S0166-218X(96)00058-3},
doi = {10.1016/S0166-218X(96)00058-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BonehDLS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Sgall96,
author = {Jir{\'{\i}} Sgall},
title = {Randomized On-Line Scheduling of Parallel Jobs},
journal = {J. Algorithms},
volume = {21},
number = {1},
pages = {149--175},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0041},
doi = {10.1006/JAGM.1996.0041},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Sgall96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Sgall96,
author = {Jir{\'{\i}} Sgall},
title = {Solution of a covering problem related to labelled tournaments},
journal = {J. Graph Theory},
volume = {23},
number = {2},
pages = {111--118},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199610)23:2\&\#60;111::AID-JGT2\&\#62;3.0.CO;2-W},
doi = {10.1002/(SICI)1097-0118(199610)23:2\&\#60;111::AID-JGT2\&\#62;3.0.CO;2-W},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Sgall96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Sgall96,
author = {Jir{\'{\i}} Sgall},
editor = {Amos Fiat and
Gerhard J. Woeginger},
title = {On-line Scheduling},
booktitle = {Online Algorithms, The State of the Art (the book grow out of a Dagstuhl
Seminar, June 1996)},
series = {Lecture Notes in Computer Science},
volume = {1442},
pages = {196--231},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/BFb0029570},
doi = {10.1007/BFB0029570},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Sgall96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BonehDLS96,
author = {Dan Boneh and
Christopher Dunworth and
Richard J. Lipton and
Jir{\'{\i}} Sgall},
editor = {Laura F. Landweber and
Eric B. Baum},
title = {Making {DNA} computers error resistant},
booktitle = {{DNA} Based Computers, Proceedings of a {DIMACS} Workshop, Princeton,
New Jersey, USA, June 10-12, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {44},
pages = {163--170},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/044/13},
doi = {10.1090/DIMACS/044/13},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BonehDLS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/PudlakS96,
author = {Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
editor = {Paul Beame and
Samuel R. Buss},
title = {Algebraic models of computation and interpolation for algebraic proof
systems},
booktitle = {Proof Complexity and Feasible Arithmetics, Proceedings of a {DIMACS}
Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {39},
pages = {279--295},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/039/15},
doi = {10.1090/DIMACS/039/15},
timestamp = {Sat, 30 Sep 2023 09:38:58 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/PudlakS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BartalLMSS96,
author = {Yair Bartal and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Jir{\'{\i}} Sgall and
Leen Stougie},
editor = {{\'{E}}va Tardos},
title = {Multiprocessor Scheduling with Rejection},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {95--103},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.313895},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BartalLMSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DammJS96,
author = {Carsten Damm and
Stasys Jukna and
Jir{\'{\i}} Sgall},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Some Bounds on Multiparty Communication Complexity of Pointer Jumping},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {643--654},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_52},
doi = {10.1007/3-540-60922-9\_52},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DammJS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Sgall95,
author = {Jir{\'{\i}} Sgall},
title = {Randomized On-Line Scheduling of Parallel Jobs},
booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
pages = {241--250},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/ISTCS.1995.377026},
doi = {10.1109/ISTCS.1995.377026},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/Sgall95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-010,
author = {Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
title = {An Upper Bound for a Communication Game Related to Time-Space Tradeoffs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-010}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-010/index.html},
eprinttype = {ECCC},
eprint = {TR95-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-044,
author = {Carsten Damm and
Stasys Jukna and
Jir{\'{\i}} Sgall},
title = {Some Bounds on Multiparty Communication Complexity of Pointer Jumping},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-044}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-044/index.html},
eprinttype = {ECCC},
eprint = {TR95-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI95-17,
author = {Carsten Damm and
Stasys Jukna and
Jir{\'{\i}} Sgall},
title = {Some Bounds on Multiparty Communication Complexity of Pointer Jumping},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {95-17},
year = {1995},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI95-17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FeldmannST94,
author = {Anja Feldmann and
Jir{\'{\i}} Sgall and
Shang{-}Hua Teng},
title = {Dynamic Scheduling on Parallel Machines},
journal = {Theor. Comput. Sci.},
volume = {130},
number = {1},
pages = {49--72},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90152-X},
doi = {10.1016/0304-3975(94)90152-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FeldmannST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Sgall94,
author = {Jir{\'{\i}} Sgall},
editor = {Igor Pr{\'{\i}}vara and
Branislav Rovan and
Peter Ruzicka},
title = {On-Line Scheduling of Parallel Jobs},
booktitle = {Mathematical Foundations of Computer Science 1994, 19th International
Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {841},
pages = {159--176},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58338-6\_65},
doi = {10.1007/3-540-58338-6\_65},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Sgall94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmannKST93,
author = {Anja Feldmann and
Ming{-}Yang Kao and
Jir{\'{\i}} Sgall and
Shang{-}Hua Teng},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Optimal online scheduling of parallel jobs with dependencies},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {642--651},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167254},
doi = {10.1145/167088.167254},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeldmannKST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmannST91,
author = {Anja Feldmann and
Jir{\'{\i}} Sgall and
Shang{-}Hua Teng},
title = {Dynamic Scheduling on Parallel Machines},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {111--120},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185355},
doi = {10.1109/SFCS.1991.185355},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/FeldmannST91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EdmondsRIS91,
author = {Jeff Edmonds and
Steven Rudich and
Russell Impagliazzo and
Jir{\'{\i}} Sgall},
title = {Communication Complexity Towards Lower Bounds on Circuit Depth},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {249--257},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185375},
doi = {10.1109/SFCS.1991.185375},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/EdmondsRIS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrajicekPS90,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
editor = {Branislav Rovan},
title = {Interactive Computations of Optimal Solutions},
booktitle = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {452},
pages = {48--60},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0029595},
doi = {10.1007/BFB0029595},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KrajicekPS90.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-05-08 23:28 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:
