Publikacje

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2026

  1. F. Abbasi, H.-C. An, J. Byrka, C. Lee, Y. Shin, Approximating (Weighted) Chromatic Correlation Clustering via Cluster LP, APPROX/RANDOM 2026, pp. 13:1-13:20. (https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2026.13).
  2. J. Balogh, G. Dósa, L. Epstein, Ł. Jeż, Lower bounds on the performance of online algorithms for relaxed packing problems, Discret. Optim., Vol. 60, 100941, 2026. (https://doi.org/10.1016/j.disopt.2026.100941).
  3. M. Basiak, M. Bieńkowski, G. Even, A. Tatarczuk, Online Bisection with Ring Demands, SIROCCO 2026, pp. 93-111. (https://doi.org/10.1007/978-3-032-26465-7_6).
  4. M. Bieńkowski, J. Blikstad, J. Byrka, M. Costa, Y. Disser, A. Lutz, Incremental Submodular Maximization: Better Than Greedy, ESA 2026, pp. 134:1-134:23. (https://doi.org/10.4230/LIPIcs.ESA.2026.134).
  5. M. Bieńkowski, J. Dallot, D. Danelski, M. Pacut, S. Schmid, Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items, ICDCS 2026, pp. 89-97. (https://doi.org/10.1109/2575-8411.2026.00016).
  6. J. Byrka, F. Malinka, T. Ponitka, Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division, AAAI 2026, pp. 16735-16742. (https://doi.org/10.1609/aaai.v40i20.38716).
  7. Q. Hillebrand, P. Manurangsi, V. Suppakitpaisarn, P. Vajanopath, Improved Differentially Private Algorithms for Rank Aggregation, AAAI 2026, pp. 17032-17039. (https://doi.org/10.1609/aaai.v40i20.38751).
  8. K. Paluch, M. Wasylkiewicz, Clique-Free t-Matchings in Degree-Bounded Graphs, SOFSEM 2026, pp. 563-577. (https://doi.org/10.1007/978-3-032-17801-5_41).
  9. Y. Shin, C. Lee, G. Lee, H.-C. An, Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem, ACM Trans. Algorithms, Vol. 22(1), 11:1-11:30, 2026. (https://doi.org/10.1145/3763239).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2025

  1. M. Adamczyk, M. Borkowski, M. Pawlowski, An Improved Mechanism for Pricing Ride-Hailing Fares, AAMAS 2025, pp. 23-31. (https://dl.acm.org/doi/10.5555/3709347.3743513).
  2. M. Basiak, M. Bieńkowski, M. Böhm, M. Chrobak, Ł. Jeż, J. Sgall, A. Tatarczuk, A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs, ESA 2025, pp. 76:1-76:15. (https://doi.org/10.4230/LIPIcs.ESA.2025.76).
  3. M. Bieńkowski, J. Byrka, Ł. Jeż, Online Disjoint Set Covers: Randomization Is Not Necessary, STACS 2025, pp. 18:1-18:16. (https://doi.org/10.4230/LIPIcs.STACS.2025.18).
  4. M. Bieńkowski, M. Englert (eds.), Approximation and Online Algorithms- 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings, WAOA 2025. (https://doi.org/10.1007/978-3-031-81396-2).
  5. M. Böhm, Z. Friggstad, T. Mömke, J. Spoerhase, Approximating Traveling Salesman Problems Using a Bridge Lemma, SODA 2025, pp. 1166-1177. (https://doi.org/10.1137/1.9781611978322.34).
  6. J. Byrka, F. Grandoni, V. Traub, On the Bidirected Cut Relaxation for Steiner Forest, IPCO 2025, pp. 114-127. (https://doi.org/10.1007/978-3-031-93112-3_9).
  7. D. Choo, B. Jin, Y. Shin, Learning-Augmented Online Bipartite Fractional Matching, NeurIPS 2025. (http://papers.nips.cc/paper_files/paper/2025/hash/0b8705a611ed1ce19cdb759031078705-Abstract-Conference.html).
  8. C. Lee, Y. Shin, H.-C. An, Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach, NeurIPS 2025. (http://papers.nips.cc/paper_files/paper/2025/hash/66baf9a4bb9504610bfd751906bfbd55-Abstract-Conference.html).
  9. M. Mari, M. Pawlowski, R. Ren, P. Sankowski, Online Matching with Delays and Stochastic Arrival Times, Theory Comput. Syst., Vol. 69(1), 12, 2025. (https://doi.org/10.1007/s00224-024-10207-6).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2024

  1. F. Abbasi, M. Adamczyk, M. Bosch-Calvo, J. Byrka, F. Grandoni, K. Sornat, A. Tinguely, An O(loglog n)-Approximation for Submodular Facility Location, ICALP 2024, pp. 5:1-5:20. (https://doi.org/10.4230/LIPIcs.ICALP.2024.5).
  2. F. Abbasi, S. Banerjee, J. Byrka, P. Chalermsook, A. Gadekar, K. Khodamoradi, D. Marx, R. Sharma, J. Spoerhase, Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces, ICALP 2024, pp. 6:1-6:19. (https://doi.org/10.4230/LIPIcs.ICALP.2024.6).
  3. S. Angelopoulos, M. Bieńkowski, C. Dürr, B. Simon, Contract Scheduling with Distributional and Multiple Advice, IJCAI 2024, pp. 3652-3660. (https://www.ijcai.org/proceedings/2024/404).
  4. M. Bieńkowski, S. Schmid, A Subquadratic Bound for Online Bisection, STACS 2024, pp. 14:1-14:18. (https://doi.org/10.4230/LIPIcs.STACS.2024.14).
  5. M. Bieńkowski, G. Even, An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement, STACS 2024, pp. 15:1-15:19. (https://doi.org/10.4230/LIPIcs.STACS.2024.15).
  6. M. Böhm, M. Lieskovský, S. Schmitt, J. Sgall, R. van Stee, Improved Online Load Balancing with Known Makespan, APPROX/RANDOM 2024, pp. 10:1-10:21. (https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.10).
  7. J. Byrka, F. Grandoni, V. Traub, The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2, FOCS 2024, pp. 730-753. (https://doi.org/10.1109/FOCS61266.2024.00052).
  8. J. Dallot, M. Pacut, M. Bieńkowski, D. Melnyk, S. Schmid, Learning Minimum Linear Arrangement of Cliques and Lines, ICDCS 2024, pp. 175-185. (https://doi.org/10.1109/ICDCS60910.2024.00025).
  9. P. Gawrychowski, M. Wasylkiewicz, Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity, ESA 2024, pp. 59:1-59:14. (https://doi.org/10.4230/LIPIcs.ESA.2024.59).
  10. P. Ghosal, S. M. Meesum, K. Paluch, Rectangle Tiling Binary Arrays, APPROX/RANDOM 2024, pp. 28:1-28:17. (https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.28).
  11. M. Mari, M. Pawlowski, R. Ren, P. Sankowski, Multi-level Aggregation with Delays and Stochastic Arrivals, AAMAS 2024, pp. 2378-2380. (https://dl.acm.org/doi/10.5555/3635637.3663166).
  12. M. Mari, M. Pawlowski, R. Ren, P. Sankowski, Online Multi-Level Aggregation with Delays and Stochastic Arrivals, ISAAC 2024, pp. 49:1-49:20. (https://doi.org/10.4230/LIPIcs.ISAAC.2024.49).
  13. A. Turko, J. Byrka, Sublogarithmic Approximation for Tollbooth Pricing on a Cactus, SAGT 2024, pp. 297-314. (https://doi.org/10.1007/978-3-031-71033-9_17).
  14. J. Vygen, J. Byrka (eds.), Integer Programming and Combinatorial Optimization- 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings, IPCO 2024. (https://doi.org/10.1007/978-3-031-59835-7).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2023

  1. F. Abbasi, S. Banerjee, J. Byrka, P. Chalermsook, A. Gadekar, K. Khodamoradi, D. Marx, R. Sharma, J. Spoerhase, Parameterized Approximation Schemes for Clustering with General Norm Objectives, FOCS 2023, pp. 1377-1399. (https://doi.org/10.1109/FOCS57990.2023.00085).
  2. S. Banerjee, R. Chitnis, A. Lahiri, How Does Fairness Affect the Complexity of Gerrymandering?, AAMAS 2023, pp. 2869-2871. (https://dl.acm.org/doi/10.5555/3545946.3599106).
  3. M. Basiak, M. Bieńkowski, A. Tatarczuk, An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem, WAOA 2023, pp. 45-58. (https://doi.org/10.1007/978-3-031-49815-2_4).
  4. M. Bieńkowski, M. Mucha, An Improved Algorithm for Online Min-Sum Set Cover, AAAI 2023, pp. 6815-6822. (https://doi.org/10.1609/aaai.v37i6.25835).
  5. M. Bieńkowski, D. Fuchssteiner, S. Schmid, Optimizing Reconfigurable Optical Datacenters: The Power of Randomization, SC 2023, pp. 83:1-83:11. (https://doi.org/10.1145/3581784.3607057).
  6. J. Byrka, A. Wiese (eds.), Approximation and Online Algorithms- 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings, WAOA 2023. (https://doi.org/10.1007/978-3-031-49815-2).
  7. J. Byrka, F. Grandoni, A. J. Ameli, Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree, SIAM J. Comput., Vol. 52(3), 718-739, 2023. (https://doi.org/10.1137/21m1421143).
  8. P. Ghosal, A. Kunysz, K. Paluch, The dynamics of rank-maximal and popular matchings, Theor. Comput. Sci., Vol. 972, 114083, 2023. (https://doi.org/10.1016/j.tcs.2023.114083).
  9. M. Mari, M. Pawlowski, R. Ren, P. Sankowski, Online Matching with Delays and Stochastic Arrival Times, AAMAS 2023, pp. 976-984. (https://dl.acm.org/doi/10.5555/3545946.3598737).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2022

  1. C. Avin, M. Bieńkowski, I. Salem, R. Sama, S. Schmid, P. Schmidt, Deterministic Self-Adjusting Tree Networks Using Rotor Walks, ICDCS 2022, pp. 67-77. (https://doi.org/10.1109/ICDCS54860.2022.00016).
  2. J. Balogh, G. Dósa, L. Epstein, Ł. Jeż, Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems, IWOCA 2022, pp. 101-113. (https://doi.org/10.1007/978-3-031-06678-8_8).
  3. M. Bieńkowski, M. Böhm, J. Byrka, J. Marcinkowski, Online Facility Location with Linear Delay, APPROX/RANDOM 2022, pp. 45:1-45:17. (https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.45).
  4. M. Böhm, N. Megow, J. Schlöter, Throughput scheduling with equal additive laxity, Oper. Res. Lett., Vol. 50(5), 463-469, 2022. (https://doi.org/10.1016/j.orl.2022.06.007).
  5. M. Böhm, R. Hoeksma, N. Megow, L. Nölke, B. Simon, On Hop-Constrained Steiner Trees in Tree-Like Metrics, SIAM J. Discret. Math., Vol. 36(2), 1249-1273, 2022. (https://doi.org/10.1137/21m1425487).
  6. M. Böhm, B. Simon, Discovering and certifying lower bounds for the online bin stretching problem, Theor. Comput. Sci., Vol. 938, 1-15, 2022. (https://doi.org/10.1016/j.tcs.2022.10.004).
  7. P. Veselý, M. Chrobak, Ł. Jeż, J. Sgall, A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines, SIAM J. Comput., Vol. 51(5), 1626-1691, 2022. (https://doi.org/10.1137/21m1469753).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2021

  1. G. Amanatidis, P. Fulla, E. Markakis, K. Sornat, Inequity aversion pricing over social networks: Approximation algorithms and hardness results, Theor. Comput. Sci., Vol. 871, 62-78, 2021. (https://doi.org/10.1016/j.tcs.2021.04.012).
  2. M. Bieńkowski, M. Böhm, M. Koutecký, T. Rothvoß, J. Sgall, P. Veselý, Improved Analysis of Online Balanced Clustering, WAOA 2021, pp. 224-233. (https://doi.org/10.1007/978-3-030-92702-8_14).
  3. M. Bieńkowski, M. Böhm, J. Byrka, M. Chrobak, C. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, K. T. Nguyen, P. Veselý, New results on multi-level aggregation, Theor. Comput. Sci., Vol. 861, 133-143, 2021. (https://doi.org/10.1016/j.tcs.2021.02.016).
  4. M. Bieńkowski, A. Kraska, H.-H. Liu, Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times, ICALP 2021, pp. 28:1-28:20. (https://doi.org/10.4230/LIPIcs.ICALP.2021.28).
  5. M. Bieńkowski, B. Feldkord, P. Schmidt, A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location, STACS 2021, pp. 14:1-14:17. (https://doi.org/10.4230/LIPIcs.STACS.2021.14).
  6. M. Böhm, N. Megow, J. Schlöter, Throughput Scheduling with Equal Additive Laxity, CIAC 2021, pp. 130-143. (https://doi.org/10.1007/978-3-030-75242-2_9).
  7. M. Böhm, Ł. Jeż, J. Sgall, P. Veselý, On packet scheduling with adversarial jamming and speedup, Ann. Oper. Res., Vol. 298(1), 7-42, 2021. (https://doi.org/10.1007/s10479-019-03153-x).
  8. S. Dudycz, P. Manurangsi, J. Marcinkowski, Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems, WAOA 2021, pp. 48-64. (https://doi.org/10.1007/978-3-030-92702-8_4).
  9. P. Faliszewski, P. Manurangsi, K. Sornat, Approximation and hardness of Shift-Bribery, Artif. Intell., Vol. 298, 103520, 2021. (https://doi.org/10.1016/j.artint.2021.103520).
  10. W. Gálvez, F. Grandoni, A. J. Ameli, K. Sornat, On the Cycle Augmentation Problem: Hardness and Approximation Algorithms, Theory Comput. Syst., Vol. 65(6), 985-1008, 2021. (https://doi.org/10.1007/s00224-020-10025-6).
  11. J. Kulkarni, S. Schmid, P. Schmidt, Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters, SPAA 2021, pp. 318-327. (https://doi.org/10.1145/3409964.3461786).
  12. F.-H. Liu, H.-H. Liu, P. W. H. Wong, Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs, Theory Comput. Syst., Vol. 65(6), 1009-1032, 2021. (https://doi.org/10.1007/s00224-021-10037-w).
  13. K. Paluch, M. Wasylkiewicz, Restricted t-Matchings via Half-Edges, ESA 2021, pp. 73:1-73:17. (https://doi.org/10.4230/LIPIcs.ESA.2021.73).
  14. K. Paluch, M. Wasylkiewicz, A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs- via half-edges, Inf. Process. Lett., Vol. 171, 106146, 2021. (https://doi.org/10.1016/j.ipl.2021.106146).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2020

  1. C. Avin, M. Bieńkowski, A. Loukas, M. Pacut, S. Schmid, Dynamic Balanced Graph Partitioning, SIAM J. Discret. Math., Vol. 34(3), 1791-1812, 2020. (https://doi.org/10.1137/17M1158513).
  2. M. Bieńkowski, M. Böhm, J. Byrka, M. Chrobak, C. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, K. T. Nguyen, P. Veselý, Online Algorithms for Multilevel Aggregation, Oper. Res., Vol. 68(1), 214-232, 2020. (https://doi.org/10.1287/opre.2019.1847).
  3. M. Bieńkowski, J. Byrka, C. Coester, Ł. Jeż, Unbounded lower bound for k-server against weak adversaries, STOC 2020, pp. 1165-1169. (https://doi.org/10.1145/3357713.3384306).
  4. M. Bieńkowski, M. Pacut, K. Piecuch, An Optimal Algorithm for Online Multiple Knapsack, ICALP 2020, pp. 13:1-13:17. (https://doi.org/10.4230/LIPIcs.ICALP.2020.13).
  5. M. Bieńkowski, D. Fuchssteiner, J. Marcinkowski, S. Schmid, Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks, SIGMETRICS Perform. Evaluation Rev., Vol. 48(3), 99-108, 2020. (https://doi.org/10.1145/3453953.3453976).
  6. J. Byrka, R. Meka (eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, Virtual Conference, August 17-19, 2020, APPROX-RANDOM 2020. (http://www.dagstuhl.de/dagpub/978-3-95977-164-1).
  7. J. Byrka, M. Lewandowski, S. M. Meesum, J. Spoerhase, S. Uniyal, PTAS for Steiner Tree on Map Graphs, LATIN 2020, pp. 3-14. (https://doi.org/10.1007/978-3-030-61792-9_1).
  8. J. Byrka, F. Grandoni, A. J. Ameli, Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree, STOC 2020, pp. 815-825. (https://doi.org/10.1145/3357713.3384301).
  9. J. Byrka, S. Dudycz, P. Manurangsi, J. Marcinkowski, M. Wlodarczyk, To Close Is Easier Than To Open: Dual Parameterization To k-Median, WAOA 2020, pp. 113-126. (https://doi.org/10.1007/978-3-030-80879-2_8).
  10. J. Byrka, M. Lewandowski, Concave Connection Cost Facility Location and the Star Inventory Routing Problem, WAOA 2020, pp. 174-188. (https://doi.org/10.1007/978-3-030-80879-2_12).
  11. J. Byrka, M. Lewandowski, J. Spoerhase, Approximating Node-Weighted k-MST on Planar Graphs, Theory Comput. Syst., Vol. 64(4), 626-644, 2020. (https://doi.org/10.1007/s00224-020-09965-w).
  12. S. Dudycz, P. Manurangsi, J. Marcinkowski, K. Sornat, Tight Approximation for Proportional Approval Voting, IJCAI 2020, pp. 276-282. (https://doi.org/10.24963/ijcai.2020/39).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2019

  1. M. Adamczyk, J. Byrka, J. Marcinkowski, S. M. Meesum, M. Wlodarczyk, Constant-Factor FPT Approximation for Capacitated k-Median, ESA 2019, pp. 1:1-1:14. (https://doi.org/10.4230/LIPIcs.ESA.2019.1).
  2. S. A. Amiri, S. Dudycz, M. Parham, S. Schmid, S. Wiederrecht, On Polynomial-Time Congestion-Free Software-Defined Network Updates, Networking 2019, pp. 1-9. (https://doi.org/10.23919/IFIPNetworking.2019.8816833).
  3. N. Bansal, M. Eliás, Ł. Jeż, G. Koumoutsos, The (h, k)-Server Problem on Bounded Depth Trees, ACM Trans. Algorithms, Vol. 15(2), 28:1-28:26, 2019. (https://doi.org/10.1145/3301314).
  4. M. Bieńkowski, Ł. Jeż, P. Schmidt, Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics, ISAAC 2019, pp. 14:1-14:14. (https://doi.org/10.4230/LIPIcs.ISAAC.2019.14).
  5. M. Bieńkowski, J. Byrka, M. Chrobak, C. Coester, Ł. Jeż, E. Koutsoupias, Better Bounds for Online Line Chasing, MFCS 2019, pp. 8:1-8:13. (https://doi.org/10.4230/LIPIcs.MFCS.2019.8).
  6. M. Bieńkowski, J. Byrka, M. Mucha, Dynamic Beats Fixed: On Phase-based Algorithms for File Migration, ACM Trans. Algorithms, Vol. 15(4), 46:1-46:21, 2019. (https://doi.org/10.1145/3340296).
  7. M. Bieńkowski, H.-H. Liu, An Improved Online Algorithm for the Traveling Repairperson Problem on a Line, MFCS 2019, pp. 6:1-6:12. (https://doi.org/10.4230/LIPIcs.MFCS.2019.6).
  8. M. Böhm, M. Chrobak, Ł. Jeż, F. Li, J. Sgall, P. Veselý, Online packet scheduling with bounded delay and lookahead, Theor. Comput. Sci., Vol. 776, 95-113, 2019. (https://doi.org/10.1016/j.tcs.2019.01.013).
  9. I. R. Cohen, A. Eden, A. Fiat, Ł. Jeż, Dynamic Pricing of Servers on Trees, APPROX-RANDOM 2019, pp. 10:1-10:22. (https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.10).
  10. A. Deza, A. Levin, S. M. Meesum, S. Onn, Hypergraphic Degree Sequences are Hard, Bull. EATCS, Vol. 127, 2019. (http://bulletin.eatcs.org/index.php/beatcs/article/view/573/572).
  11. S. Dudycz, M. Lewandowski, J. Marcinkowski, Tight Approximation Ratio for Minimum Maximal Matching, IPCO 2019, pp. 181-193. (https://doi.org/10.1007/978-3-030-17953-3_14).
  12. T. Erlebach, F.-H. Liu, H.-H. Liu, M. Shalom, P. W. H. Wong, S. Zaks, Complexity and online algorithms for minimum skyline coloring of intervals, Theor. Comput. Sci., Vol. 788, 66-78, 2019. (https://doi.org/10.1016/j.tcs.2019.05.007).
  13. P. Faliszewski, P. Manurangsi, K. Sornat, Approximation and Hardness of Shift-Bribery, AAAI 2019, pp. 1901-1908. (https://doi.org/10.1609/aaai.v33i01.33011901).
  14. K.-T. Foerster, M. Pacut, S. Schmid, On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures, Comput. Commun. Rev., Vol. 49(2), 2-8, 2019. (https://doi.org/10.1145/3336937.3336939).
  15. W. Gálvez, F. Grandoni, A. J. Ameli, K. Sornat, On the Cycle Augmentation Problem: Hardness and Approximation Algorithms, WAOA 2019, pp. 138-153. (https://doi.org/10.1007/978-3-030-39479-0_10).
  16. P. Ghosal, M. Nasre, P. Nimbhorkar, Rank-maximal matchings- structure and algorithms, Theor. Comput. Sci., Vol. 767, 73-82, 2019. (https://doi.org/10.1016/j.tcs.2018.09.033).
  17. A. Kunysz, A Faster Algorithm for the Strongly Stable b-Matching Problem, CIAC 2019, pp. 299-310. (https://doi.org/10.1007/978-3-030-17402-6_25).
  18. F.-H. Liu, H.-H. Liu, P. W. H. Wong, Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs, WAOA 2019, pp. 217-231. (https://doi.org/10.1007/978-3-030-39479-0_15).
  19. S. M. Meesum, F. Panolan, S. Saurabh, M. Zehavi, Rank Vertex Cover as a Natural Problem for Algebraic Compression, SIAM J. Discret. Math., Vol. 33(3), 1277-1296, 2019. (https://doi.org/10.1137/17M1154370).
  20. P. Veselý, M. Chrobak, Ł. Jeż, J. Sgall, A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines, SODA 2019, pp. 123-142. (https://doi.org/10.1137/1.9781611975482.9).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2018

  1. A. Adamaszek, M. Mnich, K. Paluch, New Approximation Algorithms for (1, 2)-TSP, ICALP 2018, pp. 9:1-9:14. (https://doi.org/10.4230/LIPIcs.ICALP.2018.9).
  2. S. A. Amiri, S. Dudycz, S. Schmid, S. Wiederrecht, Congestion-Free Rerouting of Flows on DAGs, ICALP 2018, pp. 143:1-143:13. (https://doi.org/10.4230/LIPIcs.ICALP.2018.143).
  3. N. Bansal, M. Eliás, Ł. Jeż, G. Koumoutsos, K. Pruhs, Tight Bounds for Double Coverage Against Weak Adversaries, Theory Comput. Syst., Vol. 62(2), 349-365, 2018. (https://doi.org/10.1007/s00224-016-9703-3).
  4. A. Basta, A. Blenk, S. Dudycz, A. Ludwig, S. Schmid, Efficient Loop-Free Rerouting of Multiple SDN Flows, IEEE/ACM Trans. Netw., Vol. 26(2), 948-961, 2018. (http://doi.ieeecomputersociety.org/10.1109/TNET.2018.2810640).
  5. 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, Theor. Comput. Sci., Vol. 707, 89-93, 2018. (https://doi.org/10.1016/j.tcs.2017.10.008).
  6. M. Bieńkowski, A. Kraska, P. Schmidt, Online Service with Delay on a Line, SIROCCO 2018, pp. 237-248. (https://doi.org/10.1007/978-3-030-01325-7_22).
  7. M. Bieńkowski, A. Kraska, H.-H. Liu, P. Schmidt, A Primal-Dual Online Deterministic Algorithm for Matching with Delays, WAOA 2018, pp. 51-68. (https://doi.org/10.1007/978-3-030-04693-4_4).
  8. M. Bieńkowski, T. Jurdzinski, M. Korzeniowski, D. R. Kowalski, Distributed Online and Stochastic Queueing on a Multiple Access Channel, ACM Trans. Algorithms, Vol. 14(2), 21:1-21:22, 2018. (https://doi.org/10.1145/3182396).
  9. M. Bieńkowski, N. Sarrar, S. Schmid, S. Uhlig, Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn, IEEE/ACM Trans. Netw., Vol. 26(1), 591-604, 2018. (https://doi.org/10.1109/TNET.2017.2787419).
  10. J. Byrka, P. Skowron, K. Sornat, Proportional Approval Voting, Harmonic k-median, and Negative Association, ICALP 2018, pp. 26:1-26:14. (https://doi.org/10.4230/LIPIcs.ICALP.2018.26).
  11. J. Byrka, K. Sornat, J. Spoerhase, Constant-factor approximation for ordered k-median, STOC 2018, pp. 620-631. (https://doi.org/10.1145/3188745.3188930).
  12. J. Byrka, M. Lewandowski, J. Spoerhase, Approximating Node-Weighted k-MST on Planar Graphs, WAOA 2018, pp. 87-101. (https://doi.org/10.1007/978-3-030-04693-4_6).
  13. J. Byrka, T. W. Pensyl, B. Rybicki, J. Spoerhase, A. Srinivasan, K. Trinh, An Improved Approximation Algorithm for Knapsack Median Using Sparsification, Algorithmica, Vol. 80(4), 1093-1114, 2018. (https://doi.org/10.1007/s00453-017-0294-4).
  14. J. Byrka, A. Srinivasan, Approximation Algorithms for Stochastic and Risk-Averse Optimization, SIAM J. Discret. Math., Vol. 32(1), 44-63, 2018. (https://doi.org/10.1137/15M1043790).
  15. S. Chaplick, M. De, A. Ravsky, J. Spoerhase, Approximation Schemes for Geometric Coverage Problems, ESA 2018, pp. 17:1-17:15. (https://doi.org/10.4230/LIPIcs.ESA.2018.17).
  16. S. Chaplick, M. De, A. Ravsky, J. Spoerhase, Brief Announcement: Approximation Schemes for Geometric Coverage Problems, ICALP 2018, pp. 107:1-107:4. (https://doi.org/10.4230/LIPIcs.ICALP.2018.107).
  17. M. Cygan, L. Kowalik, A. Socala, K. Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, J. Artif. Intell. Res., Vol. 63, 495-513, 2018. (https://doi.org/10.1613/jair.1.11253).
  18. S. Dudycz, K. Paluch, Optimal General Matchings, WG 2018, pp. 176-189. (https://doi.org/10.1007/978-3-030-00256-5_15).
  19. K.-T. Foerster, A. Ludwig, J. Marcinkowski, S. Schmid, Loop-Free Route Updates for Software-Defined Networks, IEEE/ACM Trans. Netw., Vol. 26(1), 328-341, 2018. (https://doi.org/10.1109/TNET.2017.2778426).
  20. P. Ghosal, K. Paluch, Manipulation Strategies for the Rank-Maximal Matching Problem, COCOON 2018, pp. 316-327. (https://doi.org/10.1007/978-3-319-94776-1_27).
  21. M. Karpinski, K. Piecuch, On Vertex Coloring Without Monochromatic Triangles, CSR 2018, pp. 220-231. (https://doi.org/10.1007/978-3-319-90530-3_19).
  22. J. Kowalski, R. Miernik, P. Pytlik, M. Pawlikowski, K. Piecuch, J. Sekowski, Strategic Features and Terrain Generation for Balanced Heroes of Might and Magic III Maps, CIG 2018, pp. 1-8. (https://doi.org/10.1109/CIG.2018.8490430).
  23. A. Kunysz, An Algorithm for the Maximum Weight Strongly Stable Matching Problem, ISAAC 2018, pp. 42:1-42:13. (https://doi.org/10.4230/LIPIcs.ISAAC.2018.42).
  24. A. Ludwig, S. Dudycz, M. Rost, S. Schmid, Transiently Policy-Compliant Network Updates, IEEE/ACM Trans. Netw., Vol. 26(6), 2569-2582, 2018. (https://doi.org/10.1109/TNET.2018.2871023).
  25. S. M. Meesum, An Efficiently Recognisable Subset of Hypergraphic Sequences, COCOON 2018, pp. 391-402. (https://doi.org/10.1007/978-3-319-94776-1_33).
  26. S. M. Meesum, T. V. H. Prathamesh, Unknot Recognition Through Quantifier Elimination, SC-Square@FLOC 2018, pp. 77. (https://ceur-ws.org/Vol-2189/paper8.pdf).
  27. K. Paluch, Maximum ATSP with Weights Zero and One via Half-Edges, Theory Comput. Syst., Vol. 62(2), 319-336, 2018. (https://doi.org/10.1007/s00224-017-9818-1).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2017

  1. N. Bansal, M. Eliás, Ł. Jeż, G. Koumoutsos, The (h, k)-Server Problem on Bounded Depth Trees, SODA 2017, pp. 1022-1037. (https://doi.org/10.1137/1.9781611974782.65).
  2. M. Bieńkowski, J. Byrka, M. Mucha, Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration, ICALP 2017, pp. 13:1-13:14. (https://doi.org/10.4230/LIPIcs.ICALP.2017.13).
  3. M. Bieńkowski, J. Marcinkowski, M. Pacut, S. Schmid, A. Spyra, Online Tree Caching, SPAA 2017, pp. 329-338. (https://doi.org/10.1145/3087556.3087558).
  4. M. Bieńkowski, A. Kraska, P. Schmidt, A Deterministic Algorithm for Online Steiner Tree Leasing, WADS 2017, pp. 169-180. (https://doi.org/10.1007/978-3-319-62127-2_15).
  5. M. Bieńkowski, A. Kraska, P. Schmidt, A Match in Time Saves Nine: Deterministic Online Matching with Delays, WAOA 2017, pp. 132-146. (https://doi.org/10.1007/978-3-319-89441-6_11).
  6. M. Böhm, Ł. Jeż, J. Sgall, P. Veselý, On Packet Scheduling with Adversarial Jamming and Speedup, WAOA 2017, pp. 190-206. (https://doi.org/10.1007/978-3-319-89441-6_15).
  7. J. Byrka, T. W. Pensyl, B. Rybicki, A. Srinivasan, K. Trinh, An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization, ACM Trans. Algorithms, Vol. 13(2), 23:1-23:31, 2017. (https://doi.org/10.1145/2981561).
  8. M. Cygan, L. Kowalik, A. Socala, K. Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, AAAI 2017, pp. 459-465. (https://doi.org/10.1609/aaai.v31i1.10575).
  9. S. Dudycz, J. Marcinkowski, K. Paluch, B. Rybicki, A 4/5- Approximation Algorithm for the Maximum Traveling Salesman Problem, IPCO 2017, pp. 173-185. (https://doi.org/10.1007/978-3-319-59250-3_15).
  10. C. Dürr, Ł. Jeż, Ó. C. Vásquez, Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling, Theor. Comput. Sci., Vol. 695, 28-41, 2017. (https://doi.org/10.1016/j.tcs.2017.07.020).
  11. T. Erlebach, F.-H. Liu, H.-H. Liu, M. Shalom, P. W. H. Wong, S. Zaks, Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals, COCOA (2) 2017, pp. 317-332. (https://doi.org/10.1007/978-3-319-71147-8_22).
  12. C. Fuerst, M. Pacut, S. Schmid, Data locality and replica aware virtual cluster embeddings, Theor. Comput. Sci., Vol. 697, 37-57, 2017. (https://doi.org/10.1016/j.tcs.2017.06.025).
  13. Ł. Jeż, Y. Mansour, B. Patt-Shamir, Scheduling multipacket frames with frame deadlines, J. Sched., Vol. 20(6), 623-634, 2017. (https://doi.org/10.1007/s10951-017-0522-4).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2016

  1. G. Amanatidis, E. Markakis, K. Sornat, Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results, MFCS 2016, pp. 9:1-9:13. (https://doi.org/10.4230/LIPIcs.MFCS.2016.9).
  2. S. A. Amiri, A. Ludwig, J. Marcinkowski, S. Schmid, Transiently Consistent SDN Updates: Being Greedy is Hard, SIROCCO 2016, pp. 391-406. (https://doi.org/10.1007/978-3-319-48314-6_25).
  3. C. Avin, A. Loukas, M. Pacut, S. Schmid, Online Balanced Repartitioning, DISC 2016, pp. 243-256. (https://doi.org/10.1007/978-3-662-53426-7_18).
  4. Y. Azar, A. Epstein, Ł. Jeż, A. Vardi, Make-to-Order Integrated Scheduling and Distribution, SODA 2016, pp. 140-154. (https://doi.org/10.1137/1.9781611974331.ch11).
  5. M. Bieńkowski, M. Böhm, J. Byrka, M. Chrobak, C. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, K. T. Nguyen, P. Veselý, Online Algorithms for Multi-Level Aggregation, ESA 2016, pp. 12:1-12:17. (https://doi.org/10.4230/LIPIcs.ESA.2016.12).
  6. M. Bieńkowski, M. Klonowski, M. Korzeniowski, D. R. Kowalski, Randomized mutual exclusion on a multiple access channel, Distributed Comput., Vol. 29(5), 341-359, 2016. (https://doi.org/10.1007/s00446-016-0265-z).
  7. M. Bieńkowski, L. Gasieniec, M. Klonowski, M. Korzeniowski, B. Mans, S. Schmid, R. Wattenhofer, Distributed Alarming in the On-Duty and Off-Duty Models, IEEE/ACM Trans. Netw., Vol. 24(1), 218-230, 2016. (https://doi.org/10.1109/TNET.2014.2359684).
  8. M. Böhm, M. Chrobak, Ł. Jeż, F. Li, J. Sgall, P. Veselý, Online Packet Scheduling with Bounded Delay and Lookahead, ISAAC 2016, pp. 21:1-21:13. (https://doi.org/10.4230/LIPIcs.ISAAC.2016.21).
  9. J. Byrka, B. Rybicki, S. Uniyal, An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+ε Capacity Violation, IPCO 2016, pp. 262-274. (https://doi.org/10.1007/978-3-319-33461-5_22).
  10. J. Byrka, M. Lewandowski, C. Moldenhauer, Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs, SWAT 2016, pp. 2:1-2:14. (https://doi.org/10.4230/LIPIcs.SWAT.2016.2).
  11. J. Byrka, S. Li, B. Rybicki, Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties), Theory Comput. Syst., Vol. 58(1), 19-44, 2016. (https://doi.org/10.1007/s00224-014-9575-3).
  12. M. Cygan, Ł. Jeż, J. Sgall, Online Knapsack Revisited, Theory Comput. Syst., Vol. 58(1), 153-190, 2016. (https://doi.org/10.1007/s00224-014-9566-4).
  13. S. Dudycz, A. Ludwig, S. Schmid, Can't Touch This: Consistent Network Updates for Multiple Policies, DSN 2016, pp. 133-143. (https://doi.org/10.1109/DSN.2016.21).
  14. L. Epstein, Ł. Jeż, J. Sgall, R. van Stee, Online Scheduling of Jobs with Fixed Start Times on Related Machines, Algorithmica, Vol. 74(1), 156-176, 2016. (https://doi.org/10.1007/s00453-014-9940-2).
  15. A. Kunysz, K. Paluch, P. Ghosal, Characterisation of Strongly Stable Matchings, SODA 2016, pp. 107-119. (https://doi.org/10.1137/1.9781611974331.ch8).
  16. A. Kunysz, The Strongly Stable Roommates Problem, ESA 2016, pp. 60:1-60:15. (https://doi.org/10.4230/LIPIcs.ESA.2016.60).
  17. A. Ludwig, S. Dudycz, M. Rost, S. Schmid, Transiently Secure Network Updates, SIGMETRICS 2016, pp. 273-284. (https://doi.org/10.1145/2896377.2901476).
  18. A. Shukla, S. Schmid, A. Feldmann, A. Ludwig, S. Dudycz, A. Schuetze, Towards Transiently Secure Updates in Asynchronous SDNs, SIGCOMM 2016, pp. 597-598. (https://doi.org/10.1145/2934872.2959083).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2015

  1. N. Bansal, M. Eliás, Ł. Jeż, G. Koumoutsos, K. Pruhs, Tight Bounds for Double Coverage Against Weak Adversaries, WAOA 2015, pp. 47-58. (https://doi.org/10.1007/978-3-319-28684-6_5).
  2. M. Bieńkowski, J. Byrka, K. Chrobak, T. Jurdzinski, D. R. Kowalski, Provable fairness for TDMA scheduling, INFOCOM 2015, pp. 1320-1327. (https://doi.org/10.1109/INFOCOM.2015.7218508).
  3. M. Bieńkowski, J. Byrka, M. Chrobak, N. B. Dobbs, T. Nowicki, M. Sviridenko, G. Świrszcz, N. E. Young, Approximation algorithms for the joint replenishment problem with deadlines, J. Sched., Vol. 18(6), 545-560, 2015. (https://doi.org/10.1007/s10951-014-0392-y).
  4. M. Bieńkowski, A. Kraska, P. Schmidt, A Randomized Algorithm for Online Scheduling with Interval Conflicts, SIROCCO 2015, pp. 91-103. (https://doi.org/10.1007/978-3-319-25258-2_7).
  5. J. Byrka, T. W. Pensyl, B. Rybicki, J. Spoerhase, A. Srinivasan, K. Trinh, An Improved Approximation Algorithm for Knapsack Median Using Sparsification, ESA 2015, pp. 275-287. (https://doi.org/10.1007/978-3-662-48350-3_24).
  6. J. Byrka, K. Fleszar, B. Rybicki, J. Spoerhase, Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems, SODA 2015, pp. 722-736. (https://doi.org/10.1137/1.9781611973730.49).
  7. J. Byrka, T. W. Pensyl, B. Rybicki, A. Srinivasan, K. Trinh, An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization, SODA 2015, pp. 737-756. (https://doi.org/10.1137/1.9781611973730.50).
  8. J. Byrka, A. Karrenbauer, L. Sanità, The interval constrained 3-coloring problem, Theor. Comput. Sci., Vol. 593, 42-50, 2015. (https://doi.org/10.1016/j.tcs.2015.04.037).
  9. I. R. Cohen, A. Eden, A. Fiat, Ł. Jeż, Pricing Online Decisions: Beyond Auctions, SODA 2015, pp. 73-91. (https://doi.org/10.1137/1.9781611973730.7).
  10. C. Dürr, Ł. Jeż, O. C. Vásquez, Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption, Discret. Appl. Math., Vol. 196, 20-27, 2015. (https://doi.org/10.1016/j.dam.2014.08.001).
  11. C. Fuerst, M. Pacut, P. Costa, S. Schmid, How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings, ICNP 2015, pp. 11-21. (https://doi.org/10.1109/ICNP.2015.30).
  12. Ł. Jeż, Y. Mansour, B. Patt-Shamir, Scheduling Multipacket Frames with Frame Deadlines, SIROCCO 2015, pp. 76-90. (https://doi.org/10.1007/978-3-319-25258-2_6).
  13. A. Ludwig, J. Marcinkowski, S. Schmid, Scheduling Loop-free Network Updates: It's Good to Relax!, PODC 2015, pp. 13-22. (https://doi.org/10.1145/2767386.2767412).
  14. K. Paluch, Balanced matchings, unbalanced ones and related problems, CTW 2015, pp. 269-272..
  15. K. Paluch, Maximum ATSP with Weights Zero and One via Half-Edges, WAOA 2015, pp. 25-34. (https://doi.org/10.1007/978-3-319-28684-6_3).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2014

  1. M. Bieńkowski, J. Byrka, M. Chrobak, Ł. Jeż, D. Nogneng, J. Sgall, Better Approximation Bounds for the Joint Replenishment Problem, SODA 2014, pp. 42-54. (https://doi.org/10.1137/1.9781611973402.4).
  2. M. Bieńkowski, N. Sarrar, S. Schmid, S. Uhlig, Competitive FIB Aggregation without Update Churn, ICDCS 2014, pp. 607-616. (https://doi.org/10.1109/ICDCS.2014.68).
  3. M. Bieńkowski, An Optimal Lower Bound for Buffer Management in Multi-Queue Switches, Algorithmica, Vol. 68(2), 426-447, 2014. (https://doi.org/10.1007/s00453-012-9677-8).
  4. M. Bieńkowski, A. Feldmann, J. Grassler, G. Schaffrath, S. Schmid, The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach, IEEE/ACM Trans. Netw., Vol. 22(1), 165-178, 2014. (https://doi.org/10.1109/TNET.2013.2245676).
  5. J. Byrka, K. Sornat, PTAS for Minimax Approval Voting, WINE 2014, pp. 203-217. (https://doi.org/10.1007/978-3-319-13129-0_15).
  6. P. Gawrychowski, A. Jeż, Ł. Jeż, Validating the Knuth-Morris-Pratt Failure Function, Fast and Online, Theory Comput. Syst., Vol. 54(2), 337-372, 2014. (https://doi.org/10.1007/s00224-013-9522-8).
  7. P. Ghosal, M. Nasre, P. Nimbhorkar, Rank-Maximal Matchings- Structure and Algorithms, ISAAC 2014, pp. 593-605. (https://doi.org/10.1007/978-3-319-13075-0_47).
  8. K. Paluch, Faster and Simpler Approximation of Stable Matchings, Algorithms, Vol. 7(2), 189-202, 2014. (https://doi.org/10.3390/a7020189).
  9. K. Paluch, Popular and clan-popular b-matchings, Theor. Comput. Sci., Vol. 544, 3-13, 2014. (https://doi.org/10.1016/j.tcs.2014.04.017).
  10. B. Rybicki, J. Byrka, Improved Approximation Algorithm for Fault-Tolerant Facility Placement, WAOA 2014, pp. 59-70. (https://doi.org/10.1007/978-3-319-18263-6_6).
  11. N. Sarrar, R. Wuttke, S. Schmid, M. Bieńkowski, S. Uhlig, Leveraging locality for FIB aggregation, GLOBECOM 2014, pp. 1930-1935. (https://doi.org/10.1109/GLOCOM.2014.7037090).

• Publikacje Zakładu Optymalizacji Kombinatorycznej w roku 2013

  1. M. Bieńkowski, J. Byrka, M. Chrobak, Ł. Jeż, J. Sgall, G. Stachowiak, Online Control Message Aggregation in Chain Networks, WADS 2013, pp. 133-145. (https://doi.org/10.1007/978-3-642-40104-6_12).
  2. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak, Collecting Weighted Items from a Dynamic Queue, Algorithmica, Vol. 65(1), 60-94, 2013. (https://doi.org/10.1007/s00453-011-9574-6).
  3. 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, Theor. Comput. Sci., Vol. 475, 92-102, 2013. (https://doi.org/10.1016/j.tcs.2012.12.046).
  4. M. Bieńkowski, J. Byrka, M. Chrobak, N. B. Dobbs, T. Nowicki, M. Sviridenko, G. Świrszcz, N. E. Young, Approximation Algorithms for the Joint Replenishment Problem with Deadlines, ICALP (1) 2013, pp. 135-147. (https://doi.org/10.1007/978-3-642-39206-1_12).
  5. M. Bieńkowski, S. Schmid, Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie, SIROCCO 2013, pp. 92-103. (https://doi.org/10.1007/978-3-319-03578-9_8).
  6. M. Bieńkowski, P. Zalewski, (1, 2)-Hamiltonian Completion on a Matching, Int. J. Found. Comput. Sci., Vol. 24(1), 95-108, 2013. (https://doi.org/10.1142/S0129054113500019).
  7. J. Byrka, S. Li, B. Rybicki, Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter, WAOA 2013, pp. 85-96. (https://doi.org/10.1007/978-3-319-08001-7_8).
  8. J. Byrka, F. Grandoni, T. Rothvoß, L. Sanità, Steiner Tree Approximation via Iterative Randomized Rounding, J. ACM, Vol. 60(1), 6:1-6:33, 2013. (https://doi.org/10.1145/2432622.2432628).
  9. M. Chrobak, Ł. Jeż, J. Sgall, Better bounds for incremental frequency allocation in bipartite graphs, Theor. Comput. Sci., Vol. 514, 75-83, 2013. (https://doi.org/10.1016/j.tcs.2012.05.020).
  10. M. Cygan, Ł. Jeż, Online Knapsack Revisited, WAOA 2013, pp. 144-155. (https://doi.org/10.1007/978-3-319-08001-7_13).
  11. C. Dürr, Ł. Jeż, Ó. C. Vásquez, Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling, WINE 2013, pp. 134-145. (https://doi.org/10.1007/978-3-642-45046-4_12).
  12. Ł. Jeż, A Universal Randomized Packet Scheduling Algorithm, Algorithmica, Vol. 67(4), 498-515, 2013. (https://doi.org/10.1007/s00453-012-9700-0).
  13. Ł. Jeż, J. Schwartz, J. Sgall, J. Békési, Lower bounds for online makespan minimization on a small number of related machines, J. Sched., Vol. 16(5), 539-547, 2013. (https://doi.org/10.1007/s10951-012-0288-7).
  14. K. Paluch, Capacitated Rank-Maximal Matchings, CIAC 2013, pp. 324-335. (https://doi.org/10.1007/978-3-642-38233-8_27).
  15. M. Wodecki, W. Bozejko, M. Karpinski, M. Pacut, Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem, PPAM (2) 2013, pp. 207-214. (https://doi.org/10.1007/978-3-642-55195-6_19).