Randomized Algorithms for Buffer Management with 2-Bounded Delay. - Marcin Bienkowski; Marek Chrobak; Lukasz Jez (WAOA, 2008)

Generalized Whac-a-Mole - Marcin Bienkowski; Marek Chrobak; Christoph Dürr; Mathilde Hurand; Artur Jez; Lukasz Jez; Jakub Lopuszanski; Grzegorz Stachowiak (CoRR, 2008)

Optimal, online validation of the pi and pi' failure functions - Pawel Gawrychowski; Artur Jez; Lukasz Jez (CoRR, 2009)

A 4/3-competitive randomised algorithm for online packet scheduling with agreeable deadlines - Lukasz Jez (CoRR, 2009)

Randomised Buffer Management with Bounded Delay against Adaptive Adversary - Lukasz Jez (CoRR, 2009)

Randomized Algorithm for Agreeable Deadlines Packet Scheduling. - Lukasz Jez (STACS, 2010)

One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. - Lukasz Jez (ESA, 2011)

Randomized competitive algorithms for online buffer management in the adaptive adversary model. - Marcin Bienkowski; Marek Chrobak; Lukasz Jez (Theor. Comput. Sci., 2011)

Online scheduling of bounded length jobs to maximize throughput. - Christoph Dürr; Lukasz Jez; Kim Thang Nguyen (J. Sched., 2012)

Online scheduling of packets with agreeable deadlines. - Lukasz Jez; Fei Li 001; Jay Sethuraman; Clifford Stein 001 (ACM Trans. Algorithms, 2012)

Online Control Message Aggregation in Chain Networks. - Marcin Bienkowski; Jaroslaw Byrka; Marek Chrobak; Lukasz Jez; Jirí Sgall; Grzegorz Stachowiak (WADS, 2013)

Online Knapsack Revisited. - Marek Cygan; Lukasz Jez (WAOA, 2013)

Collecting Weighted Items from a Dynamic Queue. - Marcin Bienkowski; Marek Chrobak; Christoph Dürr; Mathilde Hurand; Artur Jez; Lukasz Jez; Grzegorz Stachowiak (Algorithmica, 2013)

A Universal Randomized Packet Scheduling Algorithm. - Lukasz Jez (Algorithmica, 2013)

Better Approximation Bounds for the Joint Replenishment Problem. - Marcin Bienkowski; Jaroslaw Byrka; Marek Chrobak; Lukasz Jez; Jirí Sgall (CoRR, 2013)

Lower bounds for online makespan minimization on a small number of related machines. - Lukasz Jez; Jarett Schwartz; Jirí Sgall; József Békési (J. Sched., 2013)

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. - Marcin Bienkowski; Marek Chrobak; Christoph Dürr; Mathilde Hurand; Artur Jez; Lukasz Jez; Grzegorz Stachowiak (Theor. Comput. Sci., 2013)

Better bounds for incremental frequency allocation in bipartite graphs. - Marek Chrobak; Lukasz Jez; Jirí Sgall (Theor. Comput. Sci., 2013)

Better Approximation Bounds for the Joint Replenishment Problem. - Marcin Bienkowski; Jaroslaw Byrka; Marek Chrobak; Lukasz Jez; Dorian Nogneng; Jirí Sgall (SODA, 2014)

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. - Pawel Gawrychowski; Artur Jez; Lukasz Jez (Theory Comput. Syst., 2014)

Pricing Online Decisions: Beyond Auctions. - Ilan Reuven Cohen; Alon Eden; Amos Fiat; Lukasz Jez (SODA, 2015)

Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. - Christoph Dürr; Lukasz Jez; Oscar C. Vásquez 001 (Discret. Appl. Math., 2015)

Online Algorithms for Multi-Level Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jiri Sgall; Kim Thang Nguyen; Pavel Veselý 001 (ESA, 2016)

Make-to-Order Integrated Scheduling and Distribution. - Yossi Azar; Amir Epstein; Lukasz Jez; Adi Vardi (SODA, 2016)

Online Scheduling of Jobs with Fixed Start Times on Related Machines. - Leah Epstein; Lukasz Jez; Jirí Sgall; Rob van Stee (Algorithmica, 2016)

New Bounds for the $(h, k)$-Server Problem. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (CoRR, 2016)

Online Knapsack Revisited. - Marek Cygan; Lukasz Jez; Jirí Sgall (Theory Comput. Syst., 2016)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (SODA, 2017)

Scheduling multipacket frames with frame deadlines. - Lukasz Jez; Yishay Mansour; Boaz Patt-Shamir (J. Sched., 2017)

Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. - Christoph Dürr; Lukasz Jez; Óscar C. Vásquez 001 (Theor. Comput. Sci., 2017)

Tight Bounds for Double Coverage Against Weak Adversaries. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos; Kirk Pruhs (Theory Comput. Syst., 2018)

Logarithmic price of buffer downscaling on line metrics. - Marcin Bienkowski; Martin Böhm 001; Lukasz Jez; Pawel Laskos-Grabowski; Jan Marcinkowski; Jirí Sgall; Aleksandra Spyra; Pavel Veselý 001 (Theor. Comput. Sci., 2018)

Dynamic Pricing of Servers on Trees. - Ilan Reuven Cohen; Alon Eden; Amos Fiat; Lukasz Jez (APPROX-RANDOM, 2019)

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. - Marcin Bienkowski; Lukasz Jez; Pawel Schmidt (ISAAC, 2019)

Better Bounds for Online Line Chasing. - Marcin Bienkowski; Jaroslaw Byrka; Marek Chrobak; Christian Coester; Lukasz Jez; Elias Koutsoupias (MFCS, 2019)

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. - Pavel Veselý 001; Marek Chrobak; Lukasz Jez; Jirí Sgall (SODA, 2019)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (ACM Trans. Algorithms, 2019)

Online packet scheduling with bounded delay and lookahead. - Martin Böhm 001; Marek Chrobak; Lukasz Jez; Fei Li 001; Jirí Sgall; Pavel Veselý 001 (Theor. Comput. Sci., 2019)

Unbounded lower bound for k-server against weak adversaries. - Marcin Bienkowski; Jaroslaw Byrka; Christian Coester; Lukasz Jez (STOC, 2020)

Online Algorithms for Multilevel Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Oper. Res., 2020)

On packet scheduling with adversarial jamming and speedup. - Martin Böhm 001; Lukasz Jez; Jirí Sgall; Pavel Veselý 001 (Ann. Oper. Res., 2021)

New results on multi-level aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Theor. Comput. Sci., 2021)

Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. - János Balogh; György Dósa; Leah Epstein; Lukasz Jez (IWOCA, 2022)

A ( boldsymbol{ phi } ) -Competitive Algorithm for Scheduling Packets with Deadlines. - Pavel Veselý 001; Marek Chrobak; Lukasz Jez; Jirí Sgall (SIAM J. Comput., 2022)

Online Disjoint Set Covers: Randomization Is Not Necessary. - Marcin Bienkowski; Jaroslaw Byrka; Lukasz Jez (STACS, 2025)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs. - Mateusz Basiak; Marcin Bienkowski; Martin Böhm 001; Marek Chrobak; Lukasz Jez; Jirí Sgall; Agnieszka Tatarczuk (CoRR, 2025)