Publications

Publications

Theses

• • Phd: Online Packet Scheduling [pdf] [presentation] (presentation has been extended and revised since the defense)

  • Msc: Deterministyczny broadcast w sieciach radiowych [pdf] [ps.gz]

Articles

• • M. Böhm, Ł. Jeż, J. Sgall, P. Veselý

  • On Packet Scheduling with Adversarial Jamming and Speedup

  • Annals of Operations Research (to appear in a special issue) [Open Access] [arXiv]

  • also appeared in WAOA 2017: 190-206 [Springer Link] [presentation] (courtesy of Pavel)

  • M. Bieńkowski, M. Böhm, J. Byrka, M. Chrobak, C. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, Nguyễn K. T., P. Veselý

  • Online Algorithms for Multi-Level Aggregation

  • Oper. Res. 68(1): 214-232 (2020) [informs]

  • also appeared in ESA 2016: 12:1-12:17 [LIPIcs] [arXiv] [presentation] (courtesy of Marcin)

  • M. Bieńkowski, J. Byrka, C. Coester, Ł. Jeż

  • Unbounded lower bound for k-server against weak adversaries

  • STOC 2020: 1165-1169 [ACM]

  • N. Bansal, M. Eliás, Ł. Jeż, G. Koumoutsos

  • The (h, k)-Server Problem on Bounded Depth Trees

  • ACM Trans. Algorithms 15(2): 28:1-28:26 (2019) [ACM] [arXiv]

  • also appeared in SODA 2017: 1022-1037 [ACM] [presentation] (courtesy of Marek)

  • M. Böhm, M. Chrobak, Ł. Jeż, J. Sgall, P. Veselý

  • Online Packet Scheduling with Bounded Delay and Lookahead

  • Theor. Comput. Sci. 776: 95-113 (2019) [ScienceDirect] [arXiv]

  • also appeared in ISAAC 2016 [presentation] (courtesy of Pavel)

  • I. R. Cohen, A. Eden, A. Fiat, Ł. Jeż,

  • Dynamic Pricing of Servers on Trees

  • APPROX-RANDOM 2019: 10:1-10:22 [LIPIcs]

  • M. Bieńkowski, Ł. Jeż, P. Schmidt

  • Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics

  • ISAAC 2019: 14:1-14:14 [LIPIcs] [arXiv] [presentation] (courtesy of Marcin)

  • M. Bieńkowski, J. Byrka, M. Chrobak, C. Coester, Ł. Jeż, E. Koutsoupias

  • Better Bounds for Online Line Chasing

  • MFCS 2019: 8:1-8:13 [LIPIcs] [arXiv]

  • P. Veselý, M. Chrobak, Ł. Jeż, J. Sgall

  • A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines

  • SODA 2019: 123-142 [SIAM] [arXiv] [short presentation] [long presentation] (both courtesy of Pavel)

  • N. Bansal, M. Eliás, Ł. Jeż, G. Koumoutsos, K. Pruhs

  • Tight Bounds for Double Coverage Against Weak Adversaries

  • Theory of Computing Systems 62(2): 349-365 (2018), special issue [Open Access]

  • also appeared in WAOA 2015 [presentation] (courtesy of Grigorios and Marek)

  • M. Bieńkowski, M. Böhm, Ł. Jeż, P. Laskoś-Grabowski, J. Marcinkowski, J. Sgall, A. Spyra, P. Veselý

  • Logarithmic price of buffer downscaling on line metrics

  • Theoretical Computer Science [arXiv] [ScienceDirect]

  • Ł. Jeż, Y. Mansour, B. Patt-Shamir

  • Scheduling Multipacket Frames With Frame Deadlines

  • Journal of Scheduling 20:623-634 (2017) [Open Access]

  • also appeared in SIROCCO 2015 [pdf] [presentation]

  • C. Dürr, O. C. Vásquez

  • Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling

  • Theoretical Computer Science 695:28-41 (2017) [arXiv] [ScienceDirect]

  • also appeared in WINE 2013 [pdf] [presentation]

  • Y. Azar, A. Epstein, Ł. Jeż, A. Vardi

  • Make-to-Order Integrated Scheduling and Distribution

  • SODA 2016: 140-154 [SIAM] [presentation] (courtesy of Adi)

  • L. Epstein, Ł. Jeż, J. Sgall, R. van Stee

  • Online Scheduling of Jobs with Fixed Start Times on Related Machines

  • Algorithmica 74(1): 156-176 (2016) [Open Access]

  • also appeared in APPROX'12 [presentation] (courtesy of Rob)

  • M. Cygan, Ł. Jeż, J. Sgall

  • Online Knapsack Revisited

  • Theory of Computing Systems 58(1): 153-190 (2016), special issue [Open Access]

  • also appeared in WAOA 2013 [presentation]

  • I. R. Cohen, A. Eden, A. Fiat, Ł. Jeż,

  • Pricing Online Decisions: Beyond Auctions

  • SODA 2015: 73-91 [arXiv] [SIAM] [presentation] (courtesy of Alon, Amos, and Ilan)

  • P. Gawrychowski, A. Jeż, Ł. Jeż

  • Validating the Knuth-Morris-Pratt failure function, fast and online

  • Theory of Computing Systems 54(2): 337-372 (2014), special issue58(1): 153-190 (2016) [Open Access]

  • also appeared in CSR'10 [presentation] (courtesy of Artur)

  • M. Bieńkowski, J. Byrka, M. Chrobak, Dorian Nogneng, Ł. Jeż, J. Sgall

  • Better Approximation Bounds for the Joint Replenishment Problem

  • SODA 2014 [pdf] [presentation] (courtesy of Marek)

  • C. Dürr, Ł. Jeż, Oscar C. Vásquez,

  • Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling

  • M. Bieńkowski, J. Byrka, M. Chrobak, Ł. Jeż, J. Sgall, G. Stachowiak,

  • Online Control Message Aggregation in Chain Networks

  • WADS 2013: 133-145 [pdf] [presentation] (courtesy of Marcin)

  • Ł. Jeż

  • A Universal Randomized Packet Scheduling Algorithm

  • Algorithmica 67(4): 498-515 (2013), special issue [Open Access]

  • also appeared in ESA'11 [presentation]

  • Ł. Jeż, J. Schwartz, J. Sgall, J. Békési

  • Lower Bounds for Online Makespan Minimization on a Small Number of Related Machines

  • Journal of Scheduling 16(5): 539-547 (2013) [Open Access]

  • M. Chrobak, Ł. Jeż, J. Sgall

  • Better Bounds for Incremental Frequency Allocation in Bipartite Graphs

  • Theoretical Computer Science 514: 75-83 (2013), special issue [pdf] [ScienceDirect]

  • also appeared in ESA'11 [presentation] (courtesy of Jiří)

  • M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak,

  • A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue

  • Theoretical Computer Science 475: 92-102 (2013) [pdf] [ScienceDirect]

  • also appeared in SODA'09

  • M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak,

  • Collecting Weighted Items from a Dynamic Queue

  • Algorithmica 65(1): 60-94 (2013) [Open Access]

  • also appeared in SODA'09

  • Ł. Jeż, F. Li, J. Sethuraman, C. Stein

  • Online Scheduling of Packets with Agreeable Deadlines

  • ACM Transactions on Algorithms 9(1):5 (2012) [pdf] [ACM Digital Library]

  • my own results also appeared in STACS'10 [presentation]

  • C. Dürr, Ł. Jeż, Nguyen K. T.,

  • Online Scheduling of Bounded Length Jobs to Maximize Throughput

  • Journal of Scheduling 15(5): 653-664 (2012) [Open Access]

  • also appeared in WAOA'09 [presentation]

  • M. Bieńkowski, M. Chrobak, Ł. Jeż,

  • Randomized competitive algorithms for online buffer management in the adaptive adversary model

  • Theoretical Computer Science 412(39): 5121-5131 (2011) [pdf] [ScienceDirect]

  • also appeared in WAOA'08 [presentation]