Search results
- 1.0540790 - MÚ 2022 RIV NL eng J - Journal Article
Bienkowski, M. - Böhm, M. - Byrka, J. - Chrobak, M. - Dürr, Ch. - Folwarczný, Lukáš - Jeż, Ł. - Sgall, J. - Thang, N. K. - Veselý, P.
New results on multi-level aggregation.
Theoretical Computer Science. Roč. 861, March 12 (2021), s. 133-143. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : algorithmic aspects of networks * online algorithms * scheduling and resource allocation
OECD category: Pure mathematics
Impact factor: 1.002, year: 2021
Method of publishing: Limited access
https://doi.org/10.1016/j.tcs.2021.02.016
Permanent Link: http://hdl.handle.net/11104/0318386File Download Size Commentary Version Access Folwarczny.pdf 2 365.3 KB Publisher’s postprint require - 2.0522116 - MÚ 2021 RIV US eng J - Journal Article
Bienkowski, M. - Böhm, M. - Byrka, J. - Chrobak, M. - Dürr, Ch. - Folwarczný, Lukáš - Jeż, Ł. - Sgall, J. - Thang, N. K. - Veselý, P.
Online algorithms for multilevel aggregation.
Operations Research. Roč. 68, č. 1 (2020), s. 214-232. ISSN 0030-364X
Institutional support: RVO:67985840
Keywords : algorithmic aspects of networks * online algorithms * scheduling and resource allocation * Iot sizing * multistage assembly problem
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 3.310, year: 2020
Method of publishing: Open access
https://doi.org/10.1287/opre.2019.1847
Permanent Link: http://hdl.handle.net/11104/0306626File Download Size Commentary Version Access Folwarczny.pdf 1 1.5 MB Publisher’s postprint open-access - 3.0457321 - MÚ 2016 RIV US eng J - Journal Article
Epstein, L. - Jeż, Łukasz - Sgall, J. - van Stee, R.
Online scheduling of jobs with fixed start times on related machines.
Algorithmica. Roč. 74, č. 1 (2016), s. 156-176. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online scheduling * online algorithms * related machines
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-014-9940-2
Permanent Link: http://hdl.handle.net/11104/0257713 - 4.0440693 - MÚ 2015 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Sgall, J.
A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
Theory of Computing Systems. Roč. 56, č. 1 (2015), s. 73-81. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online algorithms * scheduling * makespan
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.719, year: 2015
http://link.springer.com/article/10.1007%2Fs00224-013-9451-6
Permanent Link: http://hdl.handle.net/11104/0243792File Download Size Commentary Version Access Ebenlendr.pdf 1 398.7 KB Publisher’s postprint require - 5.0424750 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Dósa, G. - Sgall, Jiří
First Fit bin packing: a tight analysis.
30th International Symposium on Theoretical Aspects of Computer Science. Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2013 - (Portier, N.; Wilke, T.), s. 538-549. Leibniz International Proceedings in Informatics, 20. ISBN 978-3-939897-50-7. ISSN 1868-8969.
[International Symposium on Theoretical Aspects of Computer Science (STACS 2013), /30./. Kiel (DE), 27.02.2013-02.03.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Keywords : First Fit * bin packing * online algorithms
Subject RIV: BA - General Mathematics
http://drops.dagstuhl.de/opus/volltexte/2013/3963/
Permanent Link: http://hdl.handle.net/11104/0230778File Download Size Commentary Version Access Sgall.pdf 1 585.7 KB Publisher’s postprint open-access - 6.0422569 - MÚ 2014 RIV NL eng J - Journal Article
Chrobak, M. - Jeż, Łukasz - Sgall, J.
Better bounds for incremental frequency allocation in bipartite graphs.
Theoretical Computer Science. Roč. 514, 25 November (2013), s. 75-83. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online algorithms * frequency allocation * graph algorithms
Subject RIV: BA - General Mathematics
Impact factor: 0.516, year: 2013
http://www.sciencedirect.com/science/article/pii/S0304397512004781
Permanent Link: http://hdl.handle.net/11104/0228703 - 7.0397213 - MÚ 2014 RIV US eng J - Journal Article
Jeż, Łukasz
A universal randomized packed scheduling algorithm.
Algorithmica. Roč. 67, č. 4 (2013), s. 498-515. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online algorithms * competitive analysis * adaptive adversary
Subject RIV: BA - General Mathematics
Impact factor: 0.567, year: 2013
http://link.springer.com/article/10.1007%2Fs00453-012-9700-0
Permanent Link: http://hdl.handle.net/11104/0224827File Download Size Commentary Version Access Jez2.pdf 2 658.1 KB Publisher’s postprint open-access - 8.0395516 - MÚ 2014 RIV US eng J - Journal Article
Jeż, Łukasz - Schwartz, J. - Sgall, J. - Békési, J.
Lower bounds for online makespan minimization on a small number of related machines.
Journal of Scheduling. Roč. 16, č. 5 (2013), s. 539-547. ISSN 1094-6136. E-ISSN 1099-1425
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online algorithms * scheduling * makespan
Subject RIV: BA - General Mathematics
Impact factor: 1.186, year: 2013
http://link.springer.com/article/10.1007%2Fs10951-012-0288-7
Permanent Link: http://hdl.handle.net/11104/0223529 - 9.0395509 - MÚ 2014 RIV NL eng J - Journal Article
Bienkowski, M. - Chrobak, M. - Dürr, Ch. - Hurand, M. - Jeż, A. - Jeż, Łukasz - Stachowiak, G.
A phi-competitive algorithm for collecting items with increasing weights from a dynamic queue.
Theoretical Computer Science. Roč. 475, 4 March (2013), s. 92-102. ISSN 0304-3975. E-ISSN 1879-2294
Institutional support: RVO:67985840
Keywords : online algorithms * competitive analysis * buffer management
Subject RIV: BA - General Mathematics
Impact factor: 0.516, year: 2013
http://www.sciencedirect.com/science/article/pii/S0304397513000121
Permanent Link: http://hdl.handle.net/11104/0223526 - 10.0370277 - MÚ 2012 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Sgall, J.
Semi-online preemptive scheduling: one algorithm for all variants.
Theory of Computing Systems. Roč. 48, č. 3 (2011), s. 577-613. ISSN 1432-4350. E-ISSN 1433-0490.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, 26.02.2009-28.02.2009]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling * preemption * linear program
Subject RIV: BA - General Mathematics
Impact factor: 0.442, year: 2011
http://www.springerlink.com/content/k66u6tv1l7731654/
Permanent Link: http://hdl.handle.net/11104/0204123File Download Size Commentary Version Access Ebenlendr.pdf 1 806.8 KB Publisher’s postprint require