Jirí Sgall

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 31

Top Venues

Publications

Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
Improved online load balancing with known makespan. CoRR (2024)
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
No Tiling of the 70 × 70 Square with Consecutive Squares. FUN (2024)
Josef Minarík, Jirí Sgall
Speed-robust scheduling revisited. CoRR (2024)
Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann
Approximation Algorithms and Lower Bounds for Graph Burning. APPROX/RANDOM (2023)
Jirí Sgall, Gerhard J. Woeginger
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms. Oper. Res. Lett. 51 (6) (2023)
Matej Lieskovský, Jirí Sgall
Graph Burning and Non-uniform k-centers for Small Treewidth. WAOA (2022)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. SIAM J. Comput. 51 (5) (2022)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
New results on multi-level aggregation. Theor. Comput. Sci. 861 (2021)
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
Improved Analysis of Online Balanced Clustering. WAOA (2021)
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
On packet scheduling with adversarial jamming and speedup. Ann. Oper. Res. 298 (1) (2021)
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
Improved Analysis of Online Balanced Clustering. CoRR (2021)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multilevel Aggregation. Oper. Res. 68 (1) (2020)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776 (2019)
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
The optimal absolute ratio for online bin packing. J. Comput. Syst. Sci. 102 (2019)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. SODA (2019)
Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß
Scheduling shared continuous resources on many-cores. J. Sched. 21 (1) (2018)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A φ-Competitive Algorithm for Scheduling Packets with Deadlines. CoRR (2018)
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80 (1) (2018)
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707 (2018)
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
On Packet Scheduling with Adversarial Jamming and Speedup. CoRR (2017)
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
On Packet Scheduling with Adversarial Jamming and Speedup. WAOA (2017)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Online bin stretching with three bins. J. Sched. 20 (6) (2017)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34 (3) (2017)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34 (3) (2017)
Lukas Folwarczny, Jirí Sgall
General Caching Is Hard: Even with Small Pages. Algorithmica 79 (2) (2017)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead. ISAAC (2016)
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
Logarithmic price of buffer downscaling on line metrics. CoRR (2016)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead. CoRR (2016)
Marek Cygan, Lukasz Jez, Jirí Sgall
Online Knapsack Revisited. Theory Comput. Syst. 58 (1) (2016)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
The Best Two-Phase Algorithm for Bin Stretching. CoRR (2016)
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
Online Scheduling of Jobs with Fixed Start Times on Related Machines. Algorithmica 74 (1) (2016)
Krishnendu Chatterjee, Jirí Sgall
Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria. Inf. Comput. 240 (2015)
Lukas Folwarczny, Jirí Sgall
General Caching Is Hard: Even with Small Pages. CoRR (2015)
Lukas Folwarczny, Jirí Sgall
General Caching Is Hard: Even with Small Pages. ISAAC (2015)
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
The optimal absolute ratio for online bin packing. SODA (2015)
Tomás Ebenlendr, Jirí Sgall
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption. Theory Comput. Syst. 56 (1) (2015)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multi-Level Aggregation. CoRR (2015)
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. Algorithmica 68 (1) (2014)
Martin Böhm, Jirí Sgall, Pavel Veselý
Online Colored Bin Packing. CoRR (2014)
Jirí Sgall
Online Bin Packing: Old Algorithms and New Results. CiE (2014)
György Dósa, Jirí Sgall
Optimal Analysis of Best Fit Bin Packing. ICALP (1) (2014)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Better Algorithms for Online Bin Stretching. CoRR (2014)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall
Better Approximation Bounds for the Joint Replenishment Problem. SODA (2014)
Martin Böhm, Jirí Sgall, Pavel Veselý
Online Colored Bin Packing. WAOA (2014)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Better Algorithms for Online Bin Stretching. WAOA (2014)
Jirí Sgall, Gerhard J. Woeginger
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms. WAOA (2014)
Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési
Lower bounds for online makespan minimization on a small number of related machines. J. Sched. 16 (5) (2013)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall
Better Approximation Bounds for the Joint Replenishment Problem. CoRR (2013)
Marek Chrobak, Lukasz Jez, Jirí Sgall
Better bounds for incremental frequency allocation in bipartite graphs. Theor. Comput. Sci. 514 (2013)
György Dósa, Jirí Sgall
First Fit bin packing: A tight analysis. STACS (2013)
Luca Aceto, Monika Henzinger, Jirí Sgall
38th International Colloquium on Automata, Languages and Programming. Inf. Comput. 222 (2013)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak
Online Control Message Aggregation in Chain Networks. WADS (2013)
Jirí Sgall
A New Analysis of Best Fit Bin Packing. FUN (2012)
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM (2012)
Jirí Sgall
Open Problems in Throughput Scheduling. ESA (2012)
Marek Chrobak, Lukasz Jez, Jirí Sgall
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. ESA (2011)
Tomás Ebenlendr, Jirí Sgall
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. WAOA (2011)
Marek Chrobak, Lukasz Jez, Jirí Sgall
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs CoRR (2011)
Tomás Ebenlendr, Jirí Sgall
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. Theory Comput. Syst. 48 (3) (2011)
Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger
Two-Bounded-Space Bin Packing Revisited. ESA (2011)
Marek Chrobak, Jirí Sgall
Three results on frequency assignment in linear cellular networks. Theor. Comput. Sci. 411 (1) (2010)
Tomás Ebenlendr, Jirí Sgall
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. STACS (2009)
Ondrej Zajícek, Jirí Sgall, Tomás Ebenlendr
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. PPAM (2) (2009)
Tomás Ebenlendr, Jirí Sgall
Optimal and online preemptive scheduling on uniformly related machines. J. Sched. 12 (5) (2009)
Marek Chrobak, Mathilde Hurand, Jirí Sgall
Algorithms for testing fault-tolerance of sequenced jobs. J. Sched. 12 (5) (2009)
Marek Chrobak, Jirí Sgall
Three Results on Frequency Assignment in Linear Cellular Networks. AAIM (2009)
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. Algorithmica 53 (4) (2009)
Jirí Sgall, Hadas Shachnai, Tami Tamir
Periodic scheduling with obligatory vacations. Theor. Comput. Sci. 410 (47-49) (2009)
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
Graph balancing: a special case of scheduling unrelated parallel machines. SODA (2008)
Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory Comput. 4 (1) (2008)
Tomás Ebenlendr, Jirí Sgall
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. WAOA (2008)
Daniel Král, Jirí Sgall, Tomás Tichý
Randomized strategies for the plurality problem. Discret. Appl. Math. 156 (17) (2008)
Marek Chrobak, Mathilde Hurand, Jirí Sgall
Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines. RTSS (2007)
Gerhard J. Woeginger, Jirí Sgall
On the complexity of cake cutting. Discret. Optim. 4 (2) (2007)
Jihuan Ding, Tomás Ebenlendr, Jirí Sgall, Guochuan Zhang
Online Scheduling of Equal-Length Jobs on Parallel Machines. ESA (2007)
Jirí Sgall, Gerhard J. Woeginger
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. Comb. 27 (2) (2007)
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. SIAM J. Comput. 36 (6) (2007)
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
Improved online algorithms for buffer management in QoS switches. ACM Trans. Algorithms 3 (4) (2007)
Leah Epstein, Yanir Kleiman, Jirí Sgall, Rob van Stee
Paging with connections: FIFO strikes again. Theor. Comput. Sci. 377 (1-3) (2007)
Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jirí Sgall, Tomás Tichý
Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4 (2) (2006)
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. ESA (2006)
Markus Bläser, Bodo Manthey, Jirí Sgall
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discrete Algorithms 4 (4) (2006)
Jirí Sgall
Online Scheduling. Algorithms for Optimization with Incomplete Information (2005)
Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
Two algorithms for general list matrix partitions. SODA (2005)
Marek Chrobak, Petr Kolman, Jirí Sgall
The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1 (2) (2005)
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
A Note on Semi-online Machine Covering. WAOA (2005)
Jirí Síma, Jirí Sgall
On the Nonlearnability of a Single Spiking Neuron. Neural Comput. 17 (12) (2005)
Daniel Král, Jirí Sgall
Coloring graphs from lists with bounded size of their union. J. Graph Theory 49 (3) (2005)
Jirí Sgall, Hadas Shachnai, Tami Tamir
Fairness-Free Periodic Scheduling with Vacations. ESA (2005)
Eldar Fischer, Ilan Newman, Jirí Sgall
Functions that have read-twice constant width branching programs are not necessarily testable. Random Struct. Algorithms 24 (2) (2004)
Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jirí Sgall, Tomás Tichý
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. STACS (2004)
Tomás Ebenlendr, Jirí Sgall
Optimal and Online Preemptive Scheduling on Uniformly Related Machines. STACS (2004)
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
Improved Online Algorithms for Buffer Management in QoS Switches. ESA (2004)
Daniel Král, Vladan Majerech, Jirí Sgall, Tomás Tichý, Gerhard J. Woeginger
It is tough to be a plumber. Theor. Comput. Sci. 313 (3) (2004)
Marek Chrobak, Petr Kolman, Jirí Sgall
The Greedy Algorithm for the Minimum Common String Partition Problem. APPROX-RANDOM (2004)
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. ICALP (2004)
Marek Chrobak, Jirí Sgall
The weighted 2-server problem. Theor. Comput. Sci. 324 (2-3) (2004)
Marek Chrobak, Jirí Sgall
Errata to Analysis of the Harmonic Algorithm for Three Servers. STACS (2004)
Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie
Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS J. Comput. 16 (2) (2004)
Leah Epstein, Jirí Sgall
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Algorithmica 39 (1) (2004)

Jirí Sgall.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jirí Sgall