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 Instytutu Informatyki 2022

  Publikacje 2022 (pdf)

• 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 Instytutu Informatyki 2021

  Publikacje 2021 (pdf)

• 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 Instytutu Informatyki 2020

  Publikacje 2020 (pdf)

• 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 Inżynierii Oprogramowania w roku 2019

  1. W. Stallings, L. Brown, Bezpieczeństwo systemów informatycznych : zasady i praktyka. T. 1, tł. Zdzisław Płoski. - Gliwice : Helion, 2019. - 632 s.

• Publikacje Zakładu Inteligencji Obliczeniowej w roku 2019

  1. J. Chorowski, A. Łańcucki, B. Kostka, M. J. Zapotoczny, Towards using context-dependent symbols in CTC without state-tying decision trees, W: Interspeech 2019 : 15-19 September 2019, Graz / editors ą Gernot Kubin, Zdravko Kačič. - [Graz]: International Speech and Communication Association, 2019. - s. 4385-4389. - (http://dx.doi.org/10.21437/Interspeech.2019-2720).
  2. J. Chorowski, R. J. Weiss, S. Bengio, A. van den Oord, Unsupervised speech representation learning using WaveNet autoencoders, W: IEEE-ACM Transactions on Audio Speech and Language Processing. - Vol. 27, iss. 12 (2019), s. 2041-2053. - (https://doi.org/10.1109/TASLP.2019.2938863).
  3. J. Kowalski, M. Mika, J. Sutowicz, M. Szykuła, Regular boardgames, W: The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence : Honolulu, Hawaii USA - January 27-February 1, 2019. - Palo Alto : AAAI Press, 2019. - s. 1699-1706. - (https://doi.org/10.1609/aaai.v33i01.33011699).
  4. P. Wnuk-Lipiński, K. Michalak, Deriving knowledge from local optima networks for evolutionary optimization in inventory routing problem, W: GECCO'19 : proceedings of the Genetic and Evolutionary Computation Conference Companion : July 13-17, 2019, Prague, Czech Republic / editor Manuel López-Ibáńez. - New York : Association for Computing Machinery (ACM), 2019. - s. 1551-1558.
  5. P. Wnuk-Lipiński, K. Michalak, Multidimensional time series feature engineering by hybrid evolutionary approach, W: GECCO'19 : proceedings of the Genetic and Evolutionary Computation Conference Companion : July 13-17, 2019, Prague, Czech Republic / Manuel López-Ibáñez (ed.). - New York : Association for Computing Machinery (ACM), 2019. - s. 67-68. - (https://doi.org/10.1145/3319619.3326795).
  6. M. J. Zapotoczny, P. Pietrzak, A. Łańcucki, J. Chorowski, Lattice generation in attention-based speech recognition models, W: Interspeech 2019 : 15-19 September 2019, Graz / editors Gernot Kubin, Zdravko Kačič. - [Graz]: International Speech and Communication Association, 2019. - s. 2225-2229. - (http://dx.doi.org/10.21437/Interspeech.2019-2667).

• Publikacje Zakładu Teorii Informatyki i Baz Danych w roku 2019

  1. F. Baader, B. Bednarczyk, S. Rudolph, Satisfiability checking and conjunctive query answering in description logics with global and local cardinality constraints, W: CEUR Workshop Proceedings. - Vol. 2373 (2019), s. 3:1-3:13. - (http://ceur-ws.org/Vol-2373/paper-3.pdf).
  2. B. Bednarczyk, S. Demri, Why propositional quantification makes modal logics on trees robustly hard?, W: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019) Vancouver, British Columbia, Canada 24-27 June 2019. - Piscataway : IEEE Computer Society, 2019. - s. 204-216. - (https://doi.org/10.1109/lics.2019.8785656).
  3. B. Bednarczyk, E. Kieroński, P. Witkowski, On the complexity of graded modal logics with converse, W: Logics in Artificial Intelligence : 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019 : Proceedings / Francesco Calimeri, Nicola Leone, Marco Manna (eds.). - Cham : Springer, 2019. - (LNCS ; 11468). - s. 642-658. - (https://doi.org/10.1007/978-3-030-19570-0_42).
  4. B. Bednarczyk, S. Rudolph, Worst-case optimal querying of very expressive description logics with path expressions and succinct counting, W: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) / Sarit Kraus (ed.). - [b.m.w.] : International Joint Conferences on Artificial Intelligence, 2019. - s. 1530-1536. - (http://dx.doi.org/10.24963/ijcai.2019/212).
  5. B. Bednarczyk, S. Rudolph, Worst-case optimal querying of very expressive description logics with path expressions and succinct counting, W: CEUR Workshop Proceedings. - Vol. 2373 (2019), s. 4:1-4:12. - (http://ceur-ws.org/Vol-2373/paper-4.pdf).
  6. K. Chatterjee, T. A. Henzinger, J. Otop, Long-run average behavior of vector addition systems with states, W: 30th International Conference on Concurrency Theory (CONCUR 2019) / Wan Fokkink, Rob van Glabbeek (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 27:1-27:16. - (https://doi.org/10.4230/LIPIcs.CONCUR.2019.27).
  7. K. Chatterjee, T. A. Henzinger, J. Otop, Quantitative automata under probabilistic semantics, W: Logical Methods in Computer Science. - Vol. 15, iss. 3 (2019), s. 16:1-16:45. - (https://doi.org/10.23638/LMCS-15(3:16)2019).
  8. D. Danielski, E. Kieroński, Finite satisfiability of unary negation fragment with transitivity, W: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 17:1-17:15. - (http://doi.org/10.4230/LIPIcs.MFCS.2019.17).
  9. G. Głuch, J. Marcinkowski, P. Ostropolski-Nalewaja, The first order truth behind undecidability of regular path queries determinacy, W: 22nd International Conference on Database Theory (ICDT 2019) / editors: Pablo Barcelo, Marco Calautti. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - (LIPIcs ; vol. 127). - s. 15:1-15:18. - (https://doi.org/10.4230/LIPIcs.ICDT.2019.15).
  10. E. Kieroński, One-dimensional guarded fragments, W: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 16:1-16:14. - (http://doi.org/10.4230/LIPIcs.MFCS.2019.16).
  11. J. Michaliszyn, J. Otop, Approximate learning of limit-average automata, W: 30th International Conference on Concurrency Theory (CONCUR 2019) / Wan Fokkink, Rob van Glabbeek (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 17:1-17:16. - (https://doi.org/10.4230/LIPIcs.CONCUR.2019.17).
  12. J. Michaliszyn, P. Witkowski, Decidability of model checking multi-agent systems with regular expressions against epistemic HS specifications, W: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) / Sarit Kraus (ed.). - [b.m.w.] : International Joint Conferences on Artificial Intelligence, 2019. - s. 4746-4752. - (https://doi.org/10.24963/ijcai.2019/659).
  13. S. Staworko, P. Wieczorek, Containment of shape expression schemas for RDF, W: PODS'19 : Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, July 1-3, 2019, Amsterdam, Netherlands / edited by Dan Suciu. - New York : Association for Computing Machinery (ACM), 2019. - s. 303-319. - (https://doi.org/10.1145/3294052.3319687).

• Publikacje Zakładu Złożoności Obliczeniowej i Analizy Algorytmów w roku 2019

  1. A. Abboud, L. Georgiadis, G. F. Italiano, R. Krauthgamer, N. Parotsidis, O. Trabelsi, P. Uznański, D. Wolleb-Graf, Faster algorithms for all-pairs bounded min-cuts, W: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) / Christel Baier, Ioanis Chatzigiannakis, Paola Flocchini, Stefano Leonardi (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 7:1-7:15. - (https://doi.org/10.4230/LIPIcs.ICALP.2019.7).
  2. P. Berenbrink, R. Klasing, A. Kosowski, F. Mallmann-Trenn, P. Uznański, Improved analysis of deterministic load-balancing schemes, W: ACM Transactions on Algorithms. - Vol. 15, iss. 1 (2019), nr art. 10, s. 1-22. - (https://doi.org/10.1145/3282435).
  3. G. Bernardini, P. Gawrychowski, N. Pisanti, S. P. Pissis, G. Rosone, Even faster elastic-degenerate string matching via fast matrix multiplication, W: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) / Christel Baier, Ioanis Chatzigiannakis, Paola Flocchini, Stefano Leonardi (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 21:1-21:15. - (http://doi.org/10.4230/LIPIcs.ICALP.2019.21).
  4. P. Bille, P. Gawrychowski, I. L. Gørtz, G. M. Landau, O. Weimann, Top tree compression of tries, W: 30th International Symposium on Algorithms and Computation (ISAAC 2019) / Pinyan Lu, Guochuan Zhang (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 4:1-4:18. - (http://doi.org/10.4230/LIPIcs.ISAAC.2019.4).
  5. B. S. Chlebus, E. Hradovich, T. Jurdziński, M. Klonowski, D. R. Kowalski, Energy efficient adversarial routing in shared channels, W: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019; Phoenix; United States; 22 June 2019-24 June 2019 / Christian Scheideler, Petra Berenbrink (eds.). - New York : ACM, 2019. - s. 191-200. - (https://doi.org/10.1145/3323165.3323190).
  6. S. Cicerone, G. D. Stefano, L. Gąsieniec, T. Jurdziński, A. Navarra, T. Radzik, G. Stachowiak, Fair hitting sequence problem: scheduling activities with varied frequency requirements, W: Algorithms and complexity ; 11th international conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings / Pinar Heggernes (ed.). - Cham : Springer, 2019. - (LNCS ; vol. 11485). - s. 174-186. - (https://doi.org/10.1007/978-3-030-17402-6_15).
  7. R. Clifford, P. Gawrychowski, T. Kociumaka, D. P. Martin, P. Uznański, RLE edit distance in near optimal time, W: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum f~:ur Informatik, 2019. - s. 66:1-66:13. - (https://doi.org/10.4230/LIPIcs.MFCS.2019.66).
  8. B. Dudek, P. Gawrychowski, Computing quartet distance is equivalent to counting 4-cycles, W: STOC'19 : Proceedings of the 51th Annual ACM SIGACT Symposium on Theory of Computing : June 23-26, 2019,Phoenix, AZ, USA / Moses Charikar, Edith Cohen (eds.). - New York : Association for Computing Machinery (ACM), 2019. - s. 733-743. - (https://doi.org/10.1145/3313276.3316390).
  9. R. Ferens, M. Szykuła, Complexity of bifix-free regular languages, W: Theoretical Computer Science. - Vol. 787 (2019), s. 14-27. - (https://doi.org/10.1016/j.tcs.2018.09.016).
  10. G. Fici, P. Gawrychowski, Minimal absent words in rooted and unrooted trees, W: String Processing and Information Retrieval : 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings / Nieves R. Brisaboa, Simon J Puglisi (eds.). - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11811). - s. 152-161.
  11. M. Ganardi, A. Jeż, M. Lohrey, Balancing string straight-line programs, W: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science 9-12 November 2019 Baltimore, Maryland / ed. Lisa O'Conner. - Piscataway : IEEE Computer Society, 2019. - s. 1169-1183. - (https://doi.org/10.1109/FOCS.2019.00073).
  12. M. Gańczorz, Entropy lower bounds for dictionary compression, W: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) / Nadia Pisanti, Solon P. Pissis (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 11:1-11:18. - (http://doi.org/10.4230/LIPIcs.CPM.2019.11).
  13. P. Garncarek, T. Jurdziński, D. R. Kowalski, M. A Mosteiro, mmWave wireless backhaul scheduling of stochastic packet arrivals, W: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium / edited by Vinod Rebello. - Los Alamitos : IEEE Computer Society, 2019. - s. 708-717. - (https://doi.org/10.1109/IPDPS.2019.00079).
  14. Paweł Garncarek, Tomasz Jurdziński, Dariusz R. Kowalski, Stable memoryless queuing under contention, W: 33rd International Symposium on Distributed Computing (DISC 2019) / ed. Jukka Suomela. - [Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik], 2019. - s. 17:1-17:16. - (https://doi.org/10.4230/LIPIcs.DISC.2019.17).
  15. P. Garncarek, T. Jurdziński, D. R. Kowalski, K. Loryś, Online packet scheduling under adversarial errors, W: Theoretical Computer Science. - Vol. 795 (2019), s. 492-509. - (https://doi.org/10.1016/j.tcs.2019.08.003).
  16. P. Gawrychowski, Almost optimal distance oracles for planar graphs, W: STOC'19 : Proceedings of the 51th Annual ACM SIGACT Symposium on Theory of Computing : June 23-26, 2019,Phoenix, AZ, USA / Moses Charikar, Edith Cohen (eds.). - New York : Association for Computing Machinery (ACM), 2019. - s. 138-151. - (https://doi.org/10.1145/3313276.3316316).
  17. P. Gawrychowski, F. Manea, R. Mercas, D. Nowotka, Hide and seek with repetitions, W: Journal of Computer and System Sciences. - Vol. 101 (2019), s. 42-67. - (https://doi.org/10.1016/j.jcss.2018.10.004).
  18. P. Gawrychowski, F. Manea, R. Serafin, Fast and longest rollercoasters, W: 36th International Symposium on Theoretical Aspects of Computer Science : STACS 2019, March 13-16, 2019, Berlin, Germany / Rolf Niedermeier, Christophe Paul (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 30:1-30:17. - (https://doi.org/10.4230/LIPIcs.STACS.2019.30).
  19. P. Gawrychowski, O. Merkurev, A. M. Shur, P. Uznański, Tight tradeoffs for real-time approximation of longest palindromes in streams, W: Algorithmica. - Vol. 81, iss. 9 (2019), s. 3630-3654. - (https://doi.org/10.1007/s00453-019-00591-8).
  20. P. Gawrychowski, J. Radoszewski, T. Starikovskaya, Quasi-periodicity in streams, W: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) / Nadia Pisanti, Solon P. Pissis (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 22:1-22:14. - (http://doi.org/10.4230/LIPIcs.CPM.2019.22).
  21. P. Gawrychowski, T. Starikovskaya, Streaming dictionary matching with mismatches, W: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) / Nadia Pisanti, Solon P. Pissis (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 21:1-21:15. - (http://doi.org/10.4230/LIPIcs.CPM.2019.21).
  22. L. Gąsieniec, T. Jurdziński, R. Martin, G. Stachowiak, Communication and location discovery in geometric ring networks, W: Information and Computation. - Vol. 266 (2019), s. 19-48. - (https://doi.org/10.1016/j.ic.2018.12.001).
  23. L. Gąsieniec, G. Stachowiak, P. Uznański, Almost logarithmic-time space optimal leader election in population protocols, W: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019; Phoenix; United States; 22 June 2019-24 June 2019 / Christian Scheideler, Petra Berenbrink (eds.). - New York : ACM, 2019. - s. 93-102.
  24. A. Jeż, Deciding context unification, W: Journal of the ACM. - Vol. 66, iss. 6 (2019), s. 39:1-39:45. - (https://doi.org/10.1145/3356904).
  25. A. Jeż, Deciding context unification (with regular constraints), W: 23rd international conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, proceedings / Piotrek Hofman, Michał Skrzypczak (eds.). - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11647). - s. 18-40.
  26. Michał Karpiński, Marek Piotrów, Competitive sorter-based encoding of PB-constraints into SAT, W: Proceedings of Pragmatics of SAT 2015 and 2018 / Daniel Le Berre, Matti Järvisalo (eds.). - Manchester : EasyChair Publications, 2019. - s. 65-78. - (http://dx.doi.org/10.29007/hh3v).
  27. Michał Karpiński, Marek Piotrów, Encoding cardinality constraints using multiway merge selection networks, W: Constraints. - Vol. 24, iss. 3-4 (2019), s. 234-251. - (https://doi.org/10.1007/s10601-019-09302-0).
  28. A. Kosowski, P. Uznański, L. Viennot, Hardness of exact distance queries in sparse graphs through hub labeling, W: PODC '19 : proceedings of the 2019 ACM Symposium on Principles of Distributed Computing : July 29 - August 2, 2019, Toronto, ON, Canada / Peter Robinson, Faith Ellen (eds.). - New York : ACM, 2019. - s. 272-279
  29. J. Kowalski, M. Mika, J. Sutowicz, M. Szykuła, Regular boardgames, W: The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence : Honolulu, Hawaii USA - January 27-February 1, 2019. - Palo Alto : AAAI Press, 2019. - s. 1699-1706. - (https://doi.org/10.1609/aaai.v33i01.33011699).
  30. K. Labib, P. Uznański, D. Wolleb-Graf, Hamming distance completeness, W: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) / Nadia Pisanti, Solon P. Pissis (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 14:1-14:17. - (https://doi.org/10.4230/LIPIcs.CPM.2019.14).
  31. G. D. Marco, T. Jurdziński, D. R. Kowalski, Optimal channel utilization with limited feedback, W: Fundamentals of Computation Theory : 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings / edited by Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos. - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11651). - s. 140-152. - (https://doi.org/10.1007/978-3-030-25027-0_10).
  32. G. D. Marco, D. R. Kowalski, G. Stachowiak, Deterministic contention resolution on a shared channel, W: 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019; Richardson, Texas, United States 7-9 July 2019. - Ding-Zhu Du (ed.). - Los Alamitos : IEEE Computer Society, 2019. - s. 472-482. - (https://doi.org/10.1109/icdcs.2019.00054).
  33. A. Schickedanz, D. Ajwani, U. Meyer, P. Gawrychowski, Average-case behavior of k-Shortest path algorithms, W: Complex Networks and Their Applications VII : Volume 1 Proceedings The 7th International Conference on Complex Networks and Their Applications - COMPLEX NETWORKS 2018 / Luca Maria Aiello, Chantal Cherifi, Hocine Cherifi, Renaud Lambiotte, Luis M. Rocha (eds.). - Cham : Springer, 2019. - (Studies in Computational Intelligence ; vol. 812). - s. 28-40. - (https://doi.org/10.1007/978-3-030-05411-3_3).
  34. J. Studený, P. Uznański, Approximating approximate pattern matching, W: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) / Nadia Pisanti, Solon P. Pissis (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 15:1-15:13. - (https://doi.org/10.4230/LIPIcs.CPM.2019.15).
  35. M. Szykuła, J. Wittnebel, Syntactic complexity of bifix-free regular languages, W: Theoretical Computer Science. - Vol. 787 (2019), s. 45-76. - (https://doi.org/10.1016/j.tcs.2018.12.025).

• Publikacje Zakładu Języków Programowania w roku 2019

  1. M. Biernacka, W. Charatonik, Deriving an abstract machine for strong call by need, W: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) / Herman Geuvers (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 8:1-8:20. (http://doi.org/10.4230/LIPIcs.FSCD.2019.8).
  2. D. Biernacki, S. Lenglet, P. Polesiuk, A Complete Normal-Form Bisimilarity for State, W: Foundations of software science and computation structures : 22nd international conference FOSSACS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019 : proceedings / edited by Mikołaj Bojańczyk, Alex Simpson. - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11425). - s. 98-114. - (http://dx.doi.org/10.1007/978-3-030-17127-8_6).
  3. D. Biernacki, S. Lenglet, P. Polesiuk, Bisimulations for Delimited-Control operators, W: Logical Methods in Computer Science. - Vol. 15, iss. 2 (2019), s. 18:1-18:57. - (https://doi.org/10.23638/LMCS-15(2:18)2019).
  4. D. Biernacki, S. Lenglet, P. Polesiuk, Diacritical companions, W: Electronic Notes in Theoretical Computer Science. - Vol. 347 (2019), s. 25-43. - (https://doi.org/10.1016/j.entcs.2019.09.003).
  5. D. Biernacki, S. Lenglet, P. Polesiuk, Proving soundness of extensional normal-form bisimilarities, W: Logical Methods in Computer Science. - Vol. 15, iss. 1 (2019), s. 31:1-31:24. - (https://doi.org/10.23638/LMCS-15(1:31)2019).
  6. D. Biernacki, M. Piróg, P. Polesiuk, F. Sieczkowski, Abstracting algebraic effects, W: Proceedings of the ACM on Programming Languages. - Vol. 3, iss. POPL (2019), nr art. 6, s. 1-28. - (https://doi.org/10.1145/3290319).
  7. T. J. Drab, Informatyka oparta na rachunkach, W: Informatyka w edukacji : edukacja informatyczna a rozwój sztucznej inteligencji / redakcja Anna Beata Kwiatkowska, Maciej M. Sysło. - Toruń : Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika, 2019. - s. 168-178. - (https://iwe.mat.umk.pl/tom-iwe2019/19.pdf).
  8. T. J. Drab, Rachunek lambda dla początkujących, W: Informatyka w edukacji : edukacja informatyczna a rozwój sztucznej inteligencji / redakcja Anna Beata Kwiatkowska, Maciej M. Sysło. - Toruń : Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika, 2019. - s. 249-259. - (https://iwe.mat.umk.pl/tom-iwe2019/19.pdf).
  9. S. Goncharov, L. Schröder, C. Rauch, M. Piróg, Guarded and unguarded iteration for generalized processes, W: Logical Methods in Computer Science. - Vol. 15, iss. 3 (2019), s. 1:1-1:47. - (https://doi.org/10.23638/LMCS-15(3:1)2019).
  10. M. Piróg, P. Polesiuk, F. Sieczkowski, Equational theories and monads from polynomial Cayley representations, W: Foundations of software science and computation structures : 22nd international conference FOSSACS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019 : proceedings / edited by Mikołaj Bojańczyk, Alex Simpson. - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11425). - s. 453-469. - (http://dx.doi.org/10.1007/978-3-030-17127-8_26).
  11. M. Piróg, P. Polesiuk, F. Sieczkowski, Typed equivalence of effect handlers and delimited control, W: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) / Herman Geuvers (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 30:1-30:16. - (http://doi.org/10.4230/LIPIcs.FSCD.2019.30).
  12. T. Schrijvers, M. Piróg, N. Wu, M. Jaskelioff, Monad transformers and modular algebraic effects: what binds them together, W: Haskell 2019 - Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, co-located with ICFP 2019 / Richard A. Eisenberg (ed.). - New York : Association for Computing Machinery (ACM), 2019. - s. 98-113. - (https://doi.org/10.1145/3331545.3342595).

• Publikacje Zakładu Metod Numerycznych w roku 2019

  1. W. Bożejko, P. Rajba, M. Wodecki, Robustness of the uncertain single machine total weighted tardiness problem with elimination criteria applied, W: Contemporary Complex Systems and Their Dependability : Proceedings Of The Thirteenth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. July 2 - 6, 2018, Brunów, Poland / editors: Wojciech Zamojski, Jacek Mazurkiewicz, Jarosław Sugier, Tomasz Walkowiak, Janusz Kacprzyk. - Cham : Springer, 2019. - s. 94-103. - (https://doi.org/10.1007/978-3-319-91446-6_10).
  2. R. Nowak, Convergence acceleration of alternating series, W: Numerical Algorithms. - Vol. 81, iss. 2 (2019), s. 591-608. - (https://doi.org/10.1007/s11075-018-0563-6).
  3. J. Wodecki, P. Kruczek, A. Bartkowiak, R. Zimroz, A. Wyłomańska, Novel method of informative frequency band selection for vibration signal using Nonnegative Matrix Factorization of spectrogram matrix, W: Mechanical Systems and Signal Processing. - Vol. 130 (2019), s. 585-596. - (https://doi.org/10.1016/j.ymssp.2019.05.020).

• Publikacje Zakładu Inteligencji Obliczeniowej w roku 2018

  1. J. Chorowski, N. Jaitly, Towards better decoding and language model integration in sequence to sequence models, W: Situated Interaction : 18th Annual Conference of the International Speech Communication Association (INTERSPEECH 2017) : Stockholm, Sweden, 20-24 August 2017 / editor Francisco Lacerda. - Red Hook, NY : Curran Associates, Inc., 2018. - S. 523-527 (https://doi.org/10.21437/Interspeech.2017-343).
  2. J. Chorowski, R. Weiss, R. Saurous, S. Bengio, On using backpropagation for speech texture generation and voice conversion, W: 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing : proceedings : April 15-20, 2018, Calgary Telus Convention Center, Calgary, Alberta, Canada / Editors Monson Hayes, Hanseok Ko. - Piscataway, NJ : IEEE, 2018. - S. 2256-2260 (https://doi.org/10.1109/ICASSP.2018.8461282).
  3. J. Chorowski, A. Łańcucki, S. Malik, M. Pawlikowski, P. Rychlikowski, P. Zykowski, A Talker Ensemble: The University of Wroclaw's entry to the NIPS 2017 Conversational Intelligence Challenge, W: The NIPS '17 Competition: Building Intelligent Systems / Editors Sergio Escalera, Markus Weimer. - Cham : Springer, 2018. - (The Springer Series on Challenges in Machine Learning). - S. 59-77.
  4. J. Kowalski, A. Kisielewicz, Regular language inference for learning rules of simplified boardgames, W: CIG 2018 : proceedings of the 2018 IEEE Conference on Computational Intelligence and Games (CIG'18) : Department of Data Science and Knowledge Engineering, Maastricht University, Maastricht, The Netherlands, 14-17 August, 2018 / editor Mark H.M. Winands. - Piscataway : IEEE, 2018. - S. 78-85 (https://doi.org/10.1109/CIG.2018.8490435).
  5. J. Kowalski, A. Liapis, Ł. Żarczyński, Mapping chess aesthetics onto procedurally generated chess-like games, W: Applications of Evolutionary Computation : 21st International Conference, EvoApplications 2018, Parma, Italy, April 4-6, 2018, Proceedings / Kevin Sim, Paul Kaufmann (eds.). - Cham : Springer, 2018. - (Lecture Notes in Computer Science ; 10784).- S. 325-341 (https://doi.org/10.1007/978-3-319-77538-8_23).
  6. J. Kowalski, R. Miernik, P. Pytlik, M. Pawlikowski, K. Piecuch, J. Sękowski, Strategic features and terrain generation for balanced Heroes of Might and Magic III Maps, W: CIG 2018 : proceedings of the 2018 IEEE Conference on Computational Intelligence and Games (CIG'18) : Department of Data Science and Knowledge Engineering, Maastricht University, Maastricht, The Netherlands, 14-17 August, 2018 / editor Mark H.M. Winands. - Piscataway : IEEE, 2018. - S. 86-93 (https://doi.org/10.1109/CIG.2018.8490430).
  7. S. Malik, A. Łańcucki, J. Chorowski, Efficient purely convolutional text encoding, W: CEUR Workshop Proceedings. - Vol. 2202 (2018), s. 14-23 (http://ceur-ws.org/Vol-2202/paper3.pdf).
  8. C. Siwek, J. Kowalski, C. Sironi, M. Winands, Implementing propositional networks on FPGA, W: AI 2018: advances in artificial intelligence : 31st Australasian joint conference, Wellington, New Zealand, December 11-14, 2018 : proceedings / Editors Tanja Mitrovic, Bing Xue, Xiaodong Li. - Cham : Springer, 2018. - (Lecture Notes in Artificial Intelligence ; 11320). - S. 133-145 (https://doi.org/10.1007/978-3-030-03991-2_14).
  9. R. Weiss, J. Chorowski, N. Jaitly, Y. Wu, Z. Chen, Sequence-to-sequence models can directly translate foreign speech, W: Situated Interaction : 18th Annual Conference of the International Speech Communication Association (INTERSPEECH 2017) : Stockholm, Sweden, 20-24 August 2017 / editor Francisco Lacerda. - Red Hook, NY : Curran Associates, Inc., 2018. - S. 2625-2629 (https://doi.org/10.21437/Interspeech.2017-503).
  10. P. Wnuk-Lipiński, K. Michalak, An evolutionary algorithm with practitioner's-knowledge-based operators for the inventory routing problem, W: Evolutionary Computation in Combinatorial Optimization : 18th European Conference, EvoCOP 2018, Parma, Italy, April 4-6, 2018, Proceedings / Arnaud Liefooghe, Manuel López-Ibáñez (eds.). - Cham : Springer, 2018. - (Lecture Notes in Computer Science ; 10782).- S. 146-157 (https://doi.org/10.1007/978-3-319-77449-7_10).

• Publikacje Zakładu Teorii Informatyki i Baz Danych w roku 2018

  1. K. Chatterjee, T. Henzinger, J. Otop, Computing average response time, W: Principles of Modeling : Essays Dedicated to Edward A. Lee on the Occasion of His 60th Birthday / Marten Lohstroh, Patricia Derler, Marjan Sirjani (eds.). - Cham : Springer International Publishing - Springer, 2018. - (Lecture Notes in Computer Science ; 10760).- S. 143-161 (https://doi.org/10.1007/978-3-319-95246-8_9).
  2. D. Danielski, E. Kieroński, Unary negation fragment with equivalence relations has the finite model property, W: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18. - New York : ACM, 2018.- S. 285-294 (https://doi.org/10.1145/3209108.3209205).
  3. G. Głuch, J. Marcinkowski, P. Ostropolski-Nalewaja, Can one escape Red Chains?: regular path queries determinacy is undecidable, W: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18. - New York : ACM, 2018. - S. 492-501 (https://doi.org/10.1145/3209108.3209120).
  4. E. Kieroński, I. Pratt-Hartmann, L. Tendera, Two-variable logics with counting and semantic constraints, W: ACM SIGLOG News. - Vol. 5, iss. 3 (2018), s. 22-43 .
  5. E. Kieroński, L. Tendera, Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants, W: ACM Transactions on Computational Logic. - Vol. 19, iss. 2 (2018) , s. 8:1-8:34 (https://doi.org/10.1145/3174805).
  6. J. Michaliszyn, J. Otop, Average stack cost of büchi pushdown automata, W: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) / Satya Lokam and R. Ramanujam (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 93).- S. 42-1-42-13 (https://doi.org/10.4230/LIPIcs.FSTTCS.2017.42).
  7. J. Michaliszyn, J. Otop, Non-deterministic weighted automata on random words, W: 29th International Conference on Concurrency Theory (CONCUR 2018) / Sven Schewe, Lijun Zhang (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 118).- S. 10:1-10:16 (https://doi.org/10.4230/LIPIcs.CONCUR.2018.10).
  8. J. Michaliszyn, J. Otop, P. Wieczorek, Querying best paths in graph databases, W: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) / Satya Lokam and R. Ramanujam (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 93).- S. 43-1-43-15 (https://doi.org/10.4230/LIPIcs.FSTTCS.2017.43).
  9. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability versus finite satisfiability in elementary modal logics, W: Fundamenta Informaticae. - Vol. 163, iss. 2 (2018), s. 165-188 (https://doi.org/10.3233/FI-2018-1736).

• Publikacje Zakładu Języków Programowania w roku 2018

  1. B. Bednarczyk, W. Charatonik, Modulo counting on words and trees, W: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) / Satya Lokam and R. Ramanujam (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 93).- S. 12-1-12-16 (https://doi.org/10.4230/LIPIcs.FSTTCS.2017.12).
  2. D. Biernacki, S. Lenglet, P. Polesiuk, Proving soundness of extensional normal : form bisimilarities, W: Electronic Notes in Theoretical Computer Science. - Vol. 336 (2018), s. 41-56 (https://doi.org/10.1016/j.entcs.2018.03.015).
  3. D. Biernacki, M. Piróg, P. Polesiuk, F. Sieczkowski, Handle with care : relational interpretation of algebraic effects and handlers, W: Proceedings of the ACM on Programming Languages. - Vol. 2, Iss. POPL (2018), s. 8-1-8-30 (https://doi.org/10.1145/3158096).
  4. D. Biernacki, P. Polesiuk, Logical relations for coherence of effect subtyping, W: Logical Methods in Computer Science. - Vol. 14, iss. 1 (2018), s. 1-28 (https://doi.org/10.23638/LMCS-14(1:11)2018).
  5. W. Charatonik, Y. Guskov, I. Pratt-Hartmann, P. Witkowski, Two-variable first-order logic with counting in forests, W: LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning / Editors Gilles Barthe, Geoff Sutcliffe, Margus Veanes. - [Manchester] : EasyChair Publications, 2018. - (EPiC Series in Computing ; 57). - S. 214-232 (https://doi.org/10.29007/24fm).
  6. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability versus finite satisfiability in elementary modal logics, W: Fundamenta Informaticae. - Vol. 163, iss. 2 (2018), s. 165-188 (https://doi.org/10.3233/FI-2018-1736).
  7. M. Piróg, T. Schrijvers, N. Wu, M. Jaskelioff, Syntax and semantics for operations with scopes, W: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18. - New York : ACM, 2018. - S. 809-818 (https://doi.org/10.1145/3209108.3209166).
  8. P. Wieczorek, D. Biernacki, A Coq formalization of normalization by evaluation for Martin-Löf type theory, W: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018 / June Andronick, Amy Felty (eds.). - New York : ACM, 2018.- S. 266-279 (https://doi.org/10.1145/3167091).

• Publikacje Zakładu Złożoności Obliczeniowej i Analizy Algorytmów w roku 2018

  1. M. Berlinkov, R. Ferens, M. Szykuła, Complexity of preimage problems for deterministic finite automata, W: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) / Igor Potapov, Paul Spirakis, James Worrell (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 117).- S. 32:1-32:14 (https://doi.org/10.4230/LIPIcs.MFCS.2018.32).
  2. M. Bieńkowski, T. Jurdziński, M. Korzeniowski, D. Kowalski, Distributed online and stochastic queueing on a multiple access channel, W: ACM Transactions on Algorithms. - Vol. 14, nr 2 (2018), s. 21:1-21:22 (https://doi.org/10.1145/3182396).
  3. J. Brzozowski, L. Kari, B. Li, M. Szykuła, State complexity of overlap assembly, W: Implementation and Application of Automata : 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings / Cezar Câmpeanu (ed.). - Cham : Springer International Publishing - Springer, 2018. - (Lecture Notes in Computer Science ; 10977).- S. 109-120 (https://doi.org/10.1007/978-3-319-94812-6_10).
  4. J. Brzozowski, M. Szykuła, Syntactic complexity of suffix-free languages, W: Information and Computation. - Vol. 259, Part 2 (2018), s. 174-190 (https://doi.org/10.1016/j.ic.2017.08.014).
  5. J. Brzozowski, M. Szykuła, Y. Ye, Syntactic complexity of regular ideals, W: Theory of Computing Systems. - Vol. 62, iss. 5 (2018), s. 1175-1202 (https://doi.org/10.1007/s00224-017-9803-8).
  6. H. Chang, P. Gawrychowski, S. Mozes, O. Weimann, Near-optimal distance emulator for planar graphs, W: 26th Annual European Symposium on Algorithms (ESA 2018) / Editors Yossi Azar, Hannah Bast, Grzegorz Herman. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs : 112). - S. 16:1-16:17 (https://doi.org/10.4230/LIPIcs.ESA.2018.16).
  7. H. Chuangpishit, J. Czyzowicz, L. Gąsieniec, K. Georgiou, T. Jurdziński, E. Kranakis, Patrolling a path connecting a set of points with unbalanced frequencies of visits, W: SOFSEM 2018: Theory and Practice of Computer Science : 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings / A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jiří Wiedermann (eds.). - Cham : Springer International Publishing - Edizioni della Normale, 2018. - (Lecture Notes in Computer Science ; 10706). - S. 367-380. - Bibliogr. - Streszcz. w jęz. ang. (https://doi.org/10.1007/978-3-319-73117-9_26).
  8. B. Dudek, P. Gawrychowski, Edit distance between unrooted trees in cubic time, W: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) / Editors Ioanis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald T. Sannella. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 107). - S. 45:1-45:14 (https://doi.org/10.4230/LIPIcs.ICALP.2018.45).
  9. B. Dudek, P. Gawrychowski, Slowing down top trees for better worst-case compression, W: 29th Annual Symposium on Combinatorial Pattern Matching : CPM 2018, July 2-4, 2018, Qingdao, China / Editors Gonzalo Navarro, David Sankoff, Binhai Zhu. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 105). - S. 16:1-16:8 (https://doi.org/10.4230/LIPIcs.CPM.2018.16).
  10. B. Dudek, A. Kosowski, Universal protocols for information dissemination using emergent signals, W: STOC'18 : Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing : June 25-29, 2018, Los Angeles, CA, USA / Editors Ilias Diakonikolas, David Kempe, Monika Henzinger. - New York : ACM, 2018. - S. 87-99 (https://doi.org/10.1145/3188745.3188818).
  11. M. Ganardi, A. Jeż, M. Lohrey, Sliding windows over context-free languages, W: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) / editors: Igor Potapov, Paul Spirakis, James Worrell. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 117). - S. 15:1-15:15 (https://doi.org/10.4230/LIPIcs.MFCS.2018.15).
  12. P. Garncarek, T. Jurdziński, D. Kowalski, Local queuing under contention, W: 32nd International Symposium on Distributed Computing (DISC 2018) / editors Ulrich Schmid, Josef Widder. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPICS ; 121). - S. 28:1-28:18 (https://doi.org/10.4230/LIPIcs.DISC.2018.28).
  13. P. Gawrychowski, A. Karczmarz, Improved bounds for shortest paths in dense distance graphs, W: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) / Editors Ioanis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald T. Sannella. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 107). - S. 61:1-61:15 (https://doi.org/10.4230/LIPIcs.ICALP.2018.61).
  14. P. Gawrychowski, A. Karczmarz, T. Kociumaka, J. Łącki, P. Sankowski, Optimal dynamic strings, W: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 / Artur Czumaj (ed.). - Philadelphia : Society for Industrial and Applied Mathematics, 2018. - (Proceedings).- S. 1509-1528 (https://doi.org/10.1137/1.9781611975031.99).
  15. P. Gawrychowski, F. Kuhn, J. Łopuszański, K. Panagiotou, P. Su, Labeling schemes for nearest common ancestors through minor-universal trees, W: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 / Artur Czumaj (ed.). - Philadelphia : Society for Industrial and Applied Mathematics, 2018. - (Proceedings).- S. 2604-2619 (https://doi.org/10.1137/1.9781611975031.166).
  16. P. Gawrychowski, G. Landau, T. Starikovskaya, Fast entropy-bounded string dictionary look-up with mismatches, W: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) / Editors Igor Potapov, Paul Spirakis, James Worrell. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs : 117). - S. 66:1-66:15 (https://doi.org/10.4230/LIPIcs.MFCS.2018.66).
  17. P. Gawrychowski, G. Landau, W. Sung, O. Weimann, A faster construction of greedy consensus trees, W: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) / Editors Ioanis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald T Sannella. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 107). - S. 63:1-63:14 (https://doi.org/10.4230/LIPIcs.ICALP.2018.63).
  18. P. Gawrychowski, L. Markin, O. Weimann, A faster FPTAS for #knapsack, W: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) / Editors Ioanis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald T. Sannella. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 107). - S. 64:1-64:13 (https://doi.org/10.4230/LIPIcs.ICALP.2018.64).
  19. P. Gawrychowski, P. Uznański, Towards unified approximate pattern matching for hamming and L1 Distance, W: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) / Editors Ioanis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald T. Sannella. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 107). - S. 62:1-62:13 (https://doi.org/10.4230/LIPIcs.ICALP.2018.62).
  20. M. Gańczorz, P. Gawrychowski, A. Jeż, T. Kociumaka, Edit distance with block operations, W: 26th Annual European Symposium on Algorithms (ESA 2018) / Editors Yossi Azar, Hannah Bast, Grzegorz Herman. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs ; 112). - S. 33:1-33:14 (https://doi.org/10.4230/LIPIcs.ESA.2018.33).
  21. M. Ghaffari, K. Nowicki, Congested clique algorithms for the minimum cut problem, W: PODC'18 : proceedings of the 2018 ACM Symposium on Principles of Distributed Computing : July 23-27, 2018, Egham, United Kingdom / Editors Calvin Newport, Idit Keidar. - New York : ACM, 2018. - S. 357-366 (https://doi.org/10.1145/3212734.3212750).
  22. L. Gąsieniec, G. Stachowiak, Fast space optimal leader election in population protocols, W: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 / Artur Czumaj (ed.). - Philadelphia : Society for Industrial and Applied Mathematics, 2018. - (Proceedings).- S. 2653-2667 (https://doi.org/10.1137/1.9781611975031.169).
  23. A. Jeż, A. Okhotin, On the number of nonterminal symbols in unambiguous conjunctive grammars, W: Fundamenta Informaticae. - Vol. 162, nr 1 (2018), s. 43-72 (https://doi.org/10.3233/FI-2018-1713).
  24. T. Jurdziński, D. Kowalski, M. Różański, G. Stachowiak, Deterministic digital clustering of wireless Ad Hoc networks, W: PODC'18 : proceedings of the 2018 ACM Symposium on Principles of Distributed Computing : July 23-27, 2018, Egham, United Kingdom / Editors Calvin Newport, Idit Keidar. - New York : ACM, 2018. - S. 105-114 (https://doi.org/10.1145/3212734.3212752).
  25. T. Jurdziński, K. Loryś, K. Nowicki, Communication complexity in vertex partition whiteboard model, W: Structural Information and Communication Complexity : 25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18-21, 2018, Revised Selected Papers / Editors Zvi Lotker, Boaz Patt-Shamir. - Cham : Springer, 2018. - S. 264-279 (https://doi.org/10.1007/978-3-030-01325-7_24).
  26. T. Jurdziński, K. Nowicki, MST in O(1) rounds of congested clique, W: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 / Artur Czumaj (ed.). - Philadelphia : Society for Industrial and Applied Mathematics, 2018. - (Proceedings). - S. 2620-2632. - Bibliogr. - Streszcz. w jęz. ang. (https://doi.org/10.1137/1.9781611975031.167).
  27. T. Jurdziński, K. Nowicki, On range and edge capacity in the congested clique, W: SOFSEM 2018: Theory and Practice of Computer Science : 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings / A. Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jiří Wiedermann (eds.). - Cham : Springer International Publishing - Edizioni della Normale, 2018. - (Lecture Notes in Computer Science ; 10706). - S. 305-318. - Bibliogr. - Streszcz. w jęz. ang. (https://doi.org/10.1007/978-3-319-73117-9_22).
  28. T. Jurdziński, K. Nowicki, Connectivity and minimum cut approximation in the broadcast congested clique, W: Structural Information and Communication Complexity : 25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18-21, 2018, Revised Selected Papers / Editors Zvi Lotker, Boaz Patt-Shamir. - Cham : Springer, 2018. - S. 331-344 (https://doi.org/10.1007/978-3-030-01325-7_28).
  29. M. Karpiński, Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency, W: Theoretical Computer Science. - Vol. 707 (2018), s. 77-81 (https://doi.org/10.1016/j.tcs.2017.09.036).
  30. M. Karpiński, K. Piecuch, On vertex coloring without monochromatic triangles, W: Computer Science - Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018 : Proceedings / Fedor V. Fomin, Vladimir V. Podolskii (eds.). - Cham : Springer International Publishing , 2018. - (Lecture Notes in Computer Science ; 10846). - S. 220-231. - Bibliogr. - Streszcz. w jęz. ang. (https://doi.org/10.1007/978-3-319-90530-3_19).
  31. J. Kowalski, A. Kisielewicz, Regular language inference for learning rules of simplified boardgames, W: CIG 2018 : proceedings of the 2018 IEEE Conference on Computational Intelligence and Games (CIG'18) : Department of Data Science and Knowledge Engineering, Maastricht University, Maastricht, The Netherlands, 14-17 August, 2018 / editor Mark H.M. Winands. - Piscataway : IEEE, 2018. - S. 78-85 (https://doi.org/10.1109/CIG.2018.8490435).
  32. J. Kowalski, A. Liapis, Ł. Żarczyński, Mapping chess aesthetics onto procedurally generated chess-like games, W: Applications of Evolutionary Computation : 21st International Conference, EvoApplications 2018, Parma, Italy, April 4-6, 2018, Proceedings / Kevin Sim, Paul Kaufmann (eds.). - Cham : Springer, 2018. - (Lecture Notes in Computer Science ; 10784).- S. 325-341 (https://doi.org/10.1007/978-3-319-77538-8_23).
  33. I. Podolak, A. Roman, M. Szykuła, B. Zieliński, A machine learning approach to synchronization of automata, W: Expert Systems with Applications. - Vol. 97 (2018), s. 357-371 (https://doi.org/10.1016/j.eswa.2017.12.043).
  34. A. Ryzhikov, M. Szykuła, Finding short synchronizing words for prefix codes, W: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) / Igor Potapov, Paul Spirakis, James Worrell (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 117).- S. 21:1-21:14 (https://doi.org/10.4230/LIPIcs.MFCS.2018.21).
  35. M. Szykuła, Improving the upper bound on the length of the shortest reset words, W: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) / Rolf Niedermeier, Brigitte Vallée (Eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 96).- S. 56:1-56:13 (https://doi.org/10.4230/LIPIcs.STACS.2018.56).

• 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 Metod Numerycznych w roku 2018

  1. A. Bartkowiak, J. Liebhart, Random forests supplemented by parallel fences plots: a study in spirometric diagnostics, W: Colloquium Biometricum. - Vol. 48 (2018), s. 39-52 (http://collbiom.up.lublin.pl/pdf/cb48_39.pdf).
  2. A. Bartkowiak, R. Zimroz, Complementary view on multivariate data structure based on Kohonen's SOM, parallel coordinates and t-SNE methods, W: Advances in Condition Monitoring of Machinery in Non-Stationary Operations : Proceedings of the 5th International Conference on Condition Monitoring of Machinery in Non-stationary Operations, CMMNO-2016, 12-16 September 2016, Gliwice, Poland / Anna Timofiejczuk, Fakher Chaari, Radoslaw Zimroz, Walter Bartelmus, Mohamed Haddar (eds.). - Cham : Springer, 2018. - (Applied Condition Monitoring ; 9).- S. 255-265 (https://doi.org/10.1007/978-3-319-61927-9_24).
  3. W. Bożejko, P. Rajba, M. Wodecki, Robustness of the uncertain single machine total weighted tardiness problem with elimination criteria applied, W: Contemporary Complex Systems and Their Dependability : Proceedings Of The Thirteenth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. July 2 - 6, 2018, Brunów, Poland / editors: Wojciech Zamojski, Jacek Mazurkiewicz, Jarosław Sugier, Tomasz Walkowiak, Janusz Kacprzyk. - Cham : Springer, 2018. - S. 94-103 (https://doi.org/10.1007/978-3-319-91446-6_10).
  4. W. Bożejko, P. Rajba, M. Wodecki, Własności eliminacyjne dla pewnego probabilistycznego problemu szeregowania zadań, W: Automatyzacja procesów dyskretnych : teoria i zastosowania. T.1 / pod redakcją Andrzeja Świerniaka i Jolanty Krystek. - Gliwice : Wydawnictwo Politechniki Śląskiej, 2018. - S. 15-24.
  5. F. Chudy, P. Woźny, Differential-recurrence properties of dual Bernstein polynomials, W: Applied Mathematics and Computation. - Vol. 338 (2018), s. 537-543 (https://doi.org/10.1016/j.amc.2018.06.039).
  6. P. Rajba, Challenges and mitigation approaches for getting secured applications in an enterprise company, W: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany - August 27 - 30, 2018 / editors Mathias Fischer, Dominik Herrmann. - New York : Association for Computing Machinery (ACM), 2018. - Art. nr 7, s. 1-6 (https://doi.org/10.1145/3230833.3233276).

• 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 Języków Programowania w roku 2017

  1. A. Aristizábal, D. Biernacki, S. Lenglet, P. Polesiuk, Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. LMCS 13 (3:27), 2017, pp. 1–26. (doi:10.23638/LMCS-13(3:27)2017)
  2. B. Bednarczyk, W. Charatonik, Modulo Counting on Words and Trees. FSTTCS 2017, Kanpur, December 2017. To appear
  3. B. Bednarczyk, W. Charatonik, E. Kieroński, Extending Two-Variable Logic on Trees. CSL 2017, Stockholm, Sweden, August 2017, pp. 11:1–20. (doi:10.4230/LIPIcs.CSL.2017.11)
  4. M. Biernacka, D. Biernacki, S. Lenglet, P. Polesiuk, D. Pous and A. Schmitt, Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS 2017, Reykjavik, Iceland, 2017, pp. 1-12. (doi:10.1109/LICS.2017.8005118)
  5. M. Biernacka, W. Charatonik, K. Zielińska, Generalized Refocusing: From Hybrid Strategies to Abstract Machines. FSCD 2017, Oxford, UK, September 2017, pp. 10:1–17. doi:10.4230/LIPIcs.FSCD.2017.10
  6. D. Biernacki, S. Lenglet, P. Polesiuk, Proving Soundness of Extensional Normal-Form Bisimilarities. MFPS XXXIII, Ljubljana, Slovenia, June 2017, pp. 1–15. (http://coalg.org/mfps-calco2017/mfps-papers/5-biernacki.pdf)
  7. S. Goncharov, L. Schröder, C. Rauch, M. Piróg, Unifying guarded and unguarded iteration. FoSSaCS 2017, Uppsala, Sweden, April 2017, pp. 517–533. (doi:10.1007/978-3-662-54458-7_30)
  8. M. Piróg, S, Staton, Backtracking with Cut via a Distributive Law and Left-Zero Monoids. Journal of Functional Programming 27, July 2017. (doi:10.1017/S0956796817000077)
  9. H. de Nivelle, Theorem proving for classical logic with partial functions by reduction to Kleene logic, Journal of Logic and Computation. - Vol. 27, iss. 2 (2017), s. 509-548. (http://dx.doi.org/10.1093/logcom/exu071)

• Publikacje Pracowni Inteligencji Obliczeniowej w roku 2017

  1. P. Wnuk-Lipiński, K. Michalak, A. Łańcucki, Improving classification of patterns in ultra-high frequency time series with evolutionary algorithms, W: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion (GECCO '16 Companion) / Tobias Friedrich (ed.). - New York : ACM, 2017. - S. 127-128. (http://dx.doi.org/10.1145/2908961.2909042)
  2. P. Filipiak, P. Wnuk-Lipiński, Dynamic portfolio optimization in ultra-high frequency environment, // W: Applications of Evolutionary Computation : 20th European Conference, EvoApplications 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings, Part I / Giovanni Squillero, Kevin Sim (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10199). - S. 34-50. (http://dx.doi.org/10.1007/978-3-319-55849-3_3)
  3. A. Łańcucki, J. Chorowski, Multipoint neighbor embedding, // W: Text, Speech, and Dialogue : 20th International Conference, TSD 2017, Prague, Czech Republic, August 27-31, 2017, Proceedings / Kamil Ekštein, Václav Matoušek (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10415).- S. 456-464. (https://doi.org/10.1007/978-3-319-64206-2_51)
  4. A. Kaczmarek, M. Marcińczuk, A preliminary study in zero anaphora coreference resolution for polish, Cognitive Studies = Études Cognitives. - No 17 (2017), s. 1-13. (https://doi.org/10.11649/cs.1316)
  5. C. Versari, S. Stoma, K. Batmanov, A. Llamosi, F. Mróz, A. Kaczmarek, M. Deyell, C. Lhoussaine, P. Hersen, G. Batt, Long-term tracking of budding yeast cells in brightfield microscopy: CellStar and the Evaluation Platform, Journal of the Royal Society Interface. - Vol. 14, iss. 127 (2017), s. 1-10. (https://doi.org/10.1098/rsif.2016.0705)
  6. B. Kostka, J. Kwiecieli, J. Kowalski, P. Rychlikowski, Text-based adventures of the golovin AI agent, // W: 2017 IEEE Conference on Computational Intelligence and Games (CIG) : New York, NY, USA, August 22th-August 25th, 2017 / Samad Ahmadi (ed.). - Piscataway : IEEE, 2017.- S. 181-188. (https://doi.org/10.1109/CIG.2017.8080433)
  7. M.J. Zapotoczny, P. Rychlikowski, J. Chorowski, On multilingual training of neural dependency parsers, // W: Text, Speech, and Dialogue : 20th International Conference, TSD 2017, Prague, Czech Republic, August 27-31, 2017, Proceedings / Kamil Ekštein, Václav Matoušek (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10415).- S. 326-334. (https://doi.org/10.1007/978-3-319-64206-2_37)
  8. P. Wnuk-Lipiński, P. Filipiak, P. Rychlikowski, J. Stanczyk, J. Kajewska-Szkudlarek, J. Lomotowski, T. Konieczny, Discovering weekly seasonality for water demand prediction using evolutionary algorithms, // W: GECCO '17 Proceedings of the Genetic and Evolutionary Computation Conference Companion / Peter A. N. Bosman (general chair). - New York : ACM, Association for Computing Machinery, 2017.- S. 33-34. (https://doi.org/10.1145/3067695.3082049)
  9. P. Wnuk-Lipiński, Evolutionary approach to optimization of data representation for classification of patterns in financial ultra-high frequency time series, // W: GECCO'17 Genetic and Evolutionary Computation Conference Berlin, Germany, July 15 - 19, 2017 / Peter A. N. Bosman (general chair). - New York : ACM, Association for Computing Machinery, 2017.- S. 1177-1184. (https://doi.org/10.1145/3071178.3071341)
  10. P. Wnuk-Lipiński, Optimization of representation for extracting knowledge from ultra-high frequency time series, // W: 2017 IEEE Congress on Evolutionary Computation (CEC) : proceedings : 5-8 June 2017, Donostia-San Sebastián, Spain. - Piscataway : IEEE, 2017.- S. 2759-2766. (https://doi.org/10.1109/CEC.2017.7969643)
  11. P. Wnuk-Lipiński, Solving the firefighter problem with two elements using a multi-modal estimation of distribution algorithm, // W: 2017 IEEE Congress on Evolutionary Computation (CEC) : proceedings : 5-8 June 2017, Donostia-San Sebastián, Spain. - Piscataway : IEEE, 2017. - S. 2161-2168. (https://doi.org/10.1109/CEC.2017.7969566)

• Publikacje Zakładu Teorii Informatyki i Baz Danych w roku 2017

  1. T. Gogacz, J. Marcinkowski, Converging to the chase: a tool for finite controllability, Journal of Computer and System Sciences. - Vol. 83, iss. 1 (2017), s. 180-206. (http://dx.doi.org/10.1016/j.jcss.2016.08.001)
  2. T. A. Henzinger, J. Otop, Model measuring for discrete and hybrid systems, Nonlinear Analysis-Hybrid Systems . - Vol. 23 (2017), s. 166-190. (http://dx.doi.org/10.1016/j.nahs.2016.09.001)
  3. B. Bednarczyk, W. Charatonik, E. Kieroński, Extending Two-Variable Logic on Trees. CSL 2017, Stockholm, Sweden, August 2017, pp. 11:1–20. (doi:10.4230/LIPIcs.CSL.2017.11)
  4. E. Kieroński, I. Pratt-Hartmann, L. Tendera, Equivalence closure in the two-variable guarded fragment, Journal of Logic and Computation. - Vol. 27, Iss. 4 (2017), s. 999-1021. (https://tinyurl.com/y8vu9lqz)
  5. K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit distance for pushdown automata, Logical Methods in Computer Science. - Vol. 13, iss. 3 (2017), art. nr 23, s. 1-23. (https://tinyurl.com/ybblhzxy)
  6. T.A. Henzinger, J. Otop, Model measuring for discrete and hybrid systems, Nonlinear Analysis-Hybrid Systems . - Vol. 23 (2017), s. 166-190. (http://dx.doi.org/10.1016/j.nahs.2016.09.001)
  7. K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative fair simulation games, Information and Computation. - Vol. 254, Part 2 (2017), s. 143-166. (http://dx.doi.org/10.1016/j.ic.2016.10.006)
  8. F. Belardinelli, A. Lomuscio, J. Michaliszyn, Agent-based refinement for predicate abstraction of multi-agent systems, / W: ECAI 2016 : 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands : including Prestigious applications of intelligent systems (PAIS 2016) : proceedings / Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen (eds.). - Amsterdam : IOS Press, 2017. - (Frontiers in artificial intelligence and applications ; 285).- S. 286-294. (https://doi.org/10.3233/978-1-61499-672-9-286)
  9. K. Chatterjee, T.A. Henzinger, J. Otop, Bidirectional nested weighted automata, // W: 28th International Conference on Concurrency Theory (CONCUR 2017) / Roland Meyer, Uwe Nestmann (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 85).- S. 5-1-5-16. (https://doi.org/10.4230/LIPIcs.CONCUR.2017.5)
  10. B. Dudek, P. Gawrychowski, P. Ostropolski-Nalewaja, A family of approximation algorithms for the maximum duo-preservation string mapping problem // W: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017) / Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 78).- S. 10-1-10-14. (https://doi.org/10.4230/LIPIcs.CPM.2017.10)

• Publikacje Zakładu Złożoności Obliczeniowej i Analizy Algorytmów w roku 2017

  1. M. Karpiński, Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete, Theoretical Computer Science. - Vol. 659 (2017), s. 88-94. (http://dx.doi.org/10.1016/j.tcs.2016.10.011)
  2. M. Ganardi, D. Hucke, A. Jeż, M. Lohrey, E. Noeth, Constructing small tree grammars and small circuits for formulas, Journal of Computer and System Sciences. - Vol. 86 (2017), s. 136-158. (https://doi.org/10.1016/j.jcss.2016.12.007)
  3. M. Gańczorz, A. Jeż, Improvements on Re-Pair grammar compressor, // W: DCC 2017 : 2017 Data Compression Conference : 4-7 April 2017, Snowbird, Utah, USA : proceedings / Ali Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer (eds.). - Piscataway : IEEE, 2017. - (Proceedings). - S. 181-190. (http://dx.doi.org/10.1109/DCC.2017.52)
  4. A. Jeż, Recompression: new approach to word equations and context unification (Invited Talk), // W: 34th Symposium on Theoretical Aspects of Computer Science : STACS 2017, March 8-11, 2017, Hannover, Germany / Heribert Vollmer, Brigitte Vallée (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - ( LIPIcs - Leibniz International Proceedings in Informatics ; 66). - S. 2-1-2-3. (http://dx.doi.org/10.4230/LIPIcs.STACS.2017.2)
  5. A. Jeż, A. Okhotin, Unambiguous conjunctive grammars over a one-symbol alphabet, Theoretical Computer Science. - Vol. 665 (2017), s. 13-39. (https://doi.org/10.1016/j.tcs.2016.12.009)
  6. A. Jeż, Word equations in nondeterministic linear space // W: 44th International Colloquium on Automata, Languages, and Programming : ICALP 2017, Warsaw, Poland, July 10-14, 2017 / Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl (eds.). - Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (Leibniz International Proceedings in Informatics (LIPIcs) ; 80). - S. 95-1-95-13. (http://dx.doi.org/10.4230/LIPIcs.ICALP.2017.95)
  7. J. Kowalski, A. Roman, A new evolutionary algorithm for synchronization, // W: Applications of Evolutionary Computation : 20th European Conference, EvoApplications 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings, Part I / Giovanni Squillero, Kevin Sim (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10199).- S. 620-635. (http://dx.doi.org/10.1007/978-3-319-55849-3_40)
  8. L. Gąsieniec, D. Hamilton, R. Martin, P.G. Spirakis, G. Stachowiak, Deterministic population protocols for exact majority and plurality, // W: 20th International Conference On Principles Of Distributed Systems (OPODIS-16), December 13-16th, 2016, Madrid, Spain / Panagiota Fatourou, Ernesto Jiménez, Fernando Pedone (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz Internation Proceedings in Informatics ; 70).- S. 14-1-14-14. (http://dx.doi.org/10.4230/LIPIcs.OPODIS.2016.14)
  9. V.V. Gusev, E. Pribavkina, M. Szykuła, Around the road coloring theorem, // W: Proceedings of the Fourth Russian-Finnish Symposium on Discrete Mathematics Organized in Turku on 16.-19.5.2017 / Juhani Karhumäki, Yuri Matiyasevich, Aleksi Saarela (eds.). - Turku : Turku Centre for Computer Science, 2017. - (TUCS Lecture Notes ; 26). - S. 52-56.
  10. R. Ferens, M. Szykuła, Complexity of bifix-free regular languages, // W: Implementation and Application of Automata : 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings / Arnaud Carayol, Cyril Nicaud (eds.). - Cham : Springer, 2017. - (Lecture Notes in Computer Science ; 10329). - S. 76-88. (http://dx.doi.org/10.1007/978-3-319-60134-2_7)
  11. J.A. Brzozowski, M. Szykuła, Complexity of suffix-free regular languages, Journal of Computer and System Sciences. - Vol. 89 (2017), s. 270-287. (http://dx.doi.org/10.1016/j.jcss.2017.05.011)
  12. M. Szykuła, J. Wittnebel, Syntactic complexity of bifix-free languages, // W: Implementation and Application of Automata : 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings / Arnaud Carayol, Cyril Nicaud (eds.). - Cham : Springer, 2017. - (Lecture Notes in Computer Science ; 10329). - S. 201-212. (http://dx.doi.org/10.1007/978-3-319-60134-2_17)
  13. T. Jurdziński, M. Różański, Deterministic oblivious local broadcast in the SINR model, // W: Fundamentals of Computation Theory : 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings / Ralf Klasing, Marc Zeitoun (eds.). - Berlin, Heidelberg : Springer, 2017. - (Lecture Notes in Computer Science ; 10472). - S. 312-325. (https://doi.org/10.1007/978-3-662-55751-8_25)
  14. P. Garncarek, T. Jurdziński, K. Loryś, Fault-tolerant online packet scheduling on parallel channels, // W: 2017 IEEE 31st International Parallel and Distributed Processing Symposium : IPDPS 2017 : proceedings : 29 May-2 June 2017, Orlando, Florida / Michela Taufer (general chair). - Piscataway, NJ : IEEE, 2017. - S. 347-356. (https://doi.org/10.1109/IPDPS.2017.105)
  15. B.S. Chlebus, V. Cholvi, P. Garncarek, T. Jurdziński, D.R. Kowalski, Routing in wireless networks with interferences, IEEE Communications Letters. - Vol. 21, iss. 9 (2017), s. 2105 - 2108. (https://doi.org/10.1109/LCOMM.2017.2716348)
  16. G. De Marco, T. Jurdziński, M. Różański, G. Stachowiak, Subquadratic non-adaptive threshold group testing, // W: Fundamentals of Computation Theory : 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings / Ralf Klasing, Marc Zeitoun (eds.). - Berlin, Heidelberg : Springer, 2017. - (Lecture Notes in Computer Science ; 10472). - S. 177-189. (https://doi.org/10.1007/978-3-662-55751-8_15)
  17. D. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, Robust detection in leak-prone population protocols, // W: DNA Computing and Molecular Programming : 23rd International Conference, DNA 23, Austin, TX, USA, September 24-28, 2017, Proceedings / Robert Brijder, Lulu Qian (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10467). - S. 155-171. (https://doi.org/10.1007/978-3-319-66799-7_11)
  18. M. Abdulazeez, P. Garncarek, P.W.H. Wong, Lightweight framework for reliable job scheduling in heterogeneous clouds, // W: ICCCN 2017 : 2017 26th International Conference on Computer Communications and Networks (ICCCN) : July 31-August 3, 2017, Vancouver, Canada / Christian Poellabauer (general chair). - Piscataway : IEEE, 2017. - S. 1-6. (https://doi.org/10.1109/ICCCN.2017.8038506)
  19. M. Abdulazeez, P. Garncarek, D.R. Kowalski, P.W.H. Wong, Lightweight robust framework for workload scheduling in clouds, // W: 2017 IEEE 1st International Conference on Edge Computing - IEEE EDGE 2017 : 25-30 June 2017, Honolulu, Hawaii, USA : proceedings / Andrzej M. Goscinski, Min Luo (eds.). - Piscataway : IEEE, 2017. - S. 206-209. (https://doi.org/10.1109/IEEE.EDGE.2017.36)
  20. B. Dudek, P. Gawrychowski, P. Ostropolski-Nalewaja, A family of approximation algorithms for the maximum duo-preservation string mapping problem // W: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017) / Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 78).- S. 10-1-10-14. (https://doi.org/10.4230/LIPIcs.CPM.2017.10)
  21. A. Fernández Anta, T. Jurdziński, M.A. Mosteiro, Y. Zhang, Algorithms for Sensor Systems : 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers / Cham : Springer International Publishing, 2017. - X, 237 s.(https://doi.org/10.1007/978-3-319-72751-6)
  22. T. Jurdziński, K. Nowicki, Brief announcement: on connectivity in the broadcast congested clique, // W: 31st International Symposium on Distributed Computing (DISC 2017) / Andréa W. Richa (Ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 91). - S. 54:1-54:4. (https://doi.org/10.4230/LIPIcs.DISC.2017.54)
  23. T. Jurdziński, M. Różański, G. Stachowiak, Token traversal in ad hoc wireless networks via implicit carrier sensing, // W: Structural Information and Communication Complexity : 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017 / Shantanu Das, Sebastien Tixeuil (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10641). - S. 15-33. (https://doi.org/10.1007/978-3-319-72050-0_2)
  24. J. Kowalski, Ł. Żarczyński, A. Kisielewicz, Evaluating chess-like games using generated natural language descriptions, // W: Advances in Computer Games : 15th International Conferences, ACG 2017, Leiden, The Netherlands, July 3-5, 2017, Revised Selected Papers / Mark H.M. Winands, H. Jaap van den Herik, Walter A. Kosters (eds.). - Cham : Springer International Publishing, 2017. - (Lecture notes in computer science ; 10664).- S. 127-139. (https://doi.org/10.1007/978-3-319-71649-7_11)
  25. B. Kostka, J. Kwiecieli, J. Kowalski, P. Rychlikowski, Text-based adventures of the golovin AI agent, // W: 2017 IEEE Conference on Computational Intelligence and Games (CIG) : New York, NY, USA, August 22th-August 25th, 2017 / Samad Ahmadi (ed.). - Piscataway : IEEE, 2017.- S. 181-188. (https://doi.org/10.1109/CIG.2017.8080433)
  26. G. De Marco, G. Stachowiak, Asynchronous shared channel, // W: Proceedings of the ACM Symposium on Principles of Distributed Computing - PODC'17 / Elad Michael Schiller (general chair). - New York : ACM, 2017. - S. 391-400. (https://doi.org/10.1145/3087801.3087831)
  27. M. Dżyga, R. Ferens, V.V. Gusev, M. Szykuła, Attainable values of reset thresholds, // W: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) / Kim G. Larsen, Hans L. Bodlaender, Jean-Francois Raskin (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 83).- S. 40-1-40-14. ( https://doi.org/10.4230/LIPIcs.MFCS.2017.40)

• Publikacje Zakładu Metod Numerycznych w roku 2017

  1. P. Gospodarczyk, S. Lewanowicz, P. Woźny, Degree reduction of composite Bézier curves, Applied Mathematics and Computation 293 (2017), 40-48. (http://dx.doi.org/10.1016/j.amc.2016.08.004)
  2. A. Bartkowiak, Applied Biclustering Methods for Big and High-Dimensional Data Using R, edited by A. Kasim [et al.]. Boca Raton : CRC/Chapman [recenzja] Rec.: Bartkowiak Anna // ISCB News [International Society for Clinical Biostatistics]. - Nb 63 (2017), s. 14.
  3. A. Bartkowiak, Classic and convex non-negative matrix visualization in clustering two benchmark data / Bibliogr. - Streszcz. w jęz. pol. i ang. Przegląd Elektrotechniczny. - R. 93, Nr 1 (2017) , s. 53-59. (http://pe.org.pl/articles/2017/1/14.pdf)
  4. A. Bartkowiak, R. Zimroz, Kernel PCA in nonlinear visualization of a healthy and a faultyplanetary gearbox data / Bibliogr. - Streszcz. w jęz. ang. Vibroengineering Procedia. - Vol.13 (2017), s. 62-66. (https://doi.org/10.21595/vp.2017.19032)
  5. A. Bartkowiak, J. Liebhart, NMF in screening some spirometric data, an insight into 12-dimensional data space // W: Computer Information Systems and Industrial Management : 16th IFIP TC8 International Conference, CISIM 2017, Bialystok, Poland, June 16-18, 2017, Proceedings / Khalid Saeed, Władysław Homenda, Rituparna Chaki (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10244). - S. 155-166. (https://doi.org/10.1007/978-3-319-59105-6_14)
  6. J. Wodecki, P. Kruczek, A. Wyłomańska, A. Bartkowiak, R. Zimroz, Novel method of informative frequency band selection for vibration signal using nonnegative matrix factorization of short-time fourier transform // W: Proceedings of the 2017 IEEE 11th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED) / Luca Zarri (ed.). - [Piscataway, NJ] : IEEE, 2017.- S. 129-133. (https://doi.org/10.1109/DEMPED.2017.8062345)
  7. R. Nowak, P. Woźny, New properties of a certain method of summation of generalized hypergeometric series, Numerical Algorithms. - Vol. 76, iss. 2 (2017), s. 377-391. (https://doi.org/10.1007/s11075-016-0261-1)
  8. P. Rajba, M. Wodecki, Sampling method for the flow shop with uncertain parameters, // W: Computer Information Systems and Industrial Management : 16th IFIP TC8 International Conference, CISIM 2017, Bialystok, Poland, June 16-18, 2017, Proceedings / Khalid Saeed, Władysław Homenda, Rituparna Chaki (eds.). - Cham : Springer International Publishing - Springer, 2017. - (Lecture Notes in Computer Science ; 10244). - S. 580-591. (https://doi.org/10.1007/978-3-319-59105-6_50)
  9. W. Bożejko, P. Rajba, M. Wodecki, Stable scheduling of single machine with probabilistic parameters, Bulletin of the Polish Academy of Sciences. Technical Sciences. - Vol. 65, nr 2 (2017), s. 219-231. (https://doi.org/10.1515/bpasts-2017-0026)
  10. W. Bożejko, J. Pempera, M. Wodecki, A fine-grained parallel algorithm for the cyclic flexible job shop problem, Archives of Control Sciences. - Vol. 27, no. 2 (2017), s. 169-181. (https://doi.org/10.1515/acsc-2017-0010)
  11. W. Bożejko, Ł. Gniewkowski, M. Wodecki, Blocks for the flow shop scheduling problem with uncertain parameters, // W: Trends in Advanced Intelligent Control, Optimization and Automation : Proceedings of KKA 2017 - The 19th Polish Control Conference, Kraków, Poland, June 18-21, 2017 / ed. Wojciech Mitkowski, Janusz Kacprzyk, Krzysztof Oprzędkiewicz, Paweł Skruch. - [Berlin ; Heidelberg] : Springer, cop. 2017. - (Advances in Intelligent Systems and Computing ; vol. 577). - S. 703-711.
  12. W. Bożejko, A. Gnatowski, R. Idzikowski, M. Wodecki, Cyclic flow shop scheduling with two machine cells, Archives of Control Sciences. - Vol. 27, no. 2 (2017), s. 151-167. (https://doi.org/10.1515/acsc-2017-0009)
  13. W. Bożejko, P. Nadybski, M. Uchroński, M. Wodecki, Cykliczny system produkcyjny z dwumaszynowymi gniazdami, // W: Innowacje w zarządzaniu i inżynierii produkcji. T.1 / pod red. Ryszarda Knosali. - Opole : Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, 2017.- S. 512-523. (http://www.ptzp.org.pl/files/konferencje/kzz/artyk_pdf_2017/T1/t1_512.pdf)
  14. W. Bożejko, Z. Chaczko, M. Uchroński, M. Wodecki, Parallel patterns determination in solving cyclic flow shop problem with setups, Archives of Control Sciences. - Vol. 27, no. 2 (2017), s. 183-195. (https://doi.org/10.1515/acsc-2017-0011)
  15. W. Bożejko, P. Nadybski, M. Wodecki, Planowanie zadań dla klastra obliczeniowego // W: Innowacje w zarządzaniu i inżynierii produkcji. T.1 / pod red. Ryszarda Knosali. - Opole : Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, 2017.- S. 524-533. (http://docplayer.pl/46351824-Planowanie-zadan-dla-klastra-obliczeniowego.html)
  16. W. Bożejko, M. Uchroński, M. Wodecki, The k-opt algorithm analysis: the flexible job shop case // W: Trends in Advanced Intelligent Control, Optimization and Automation : Proceedings of KKA 2017 - The 19th Polish Control Conference, Kraków, Poland, June 18-21, 2017 / ed. Wojciech Mitkowski, Janusz Kacprzyk, Krzysztof Oprzędkiewicz, Paweł Skruch. - [Berlin ; Heidelberg] : Springer, cop. 2017. - (Advances in Intelligent Systems and Computing ; vol. 577). - S. 370-377.
  17. S. Lewanowicz, P. Keller, P. Woźny, Bézier form of dual bivariate Bernstein polynomials, Advances in Computational Mathematics. - Vol. 43, iss. 4 (2017) , s. 777-793. (http://dx.doi.org/10.1007/s10444-016-9506-8)
  18. S. Lewanowicz, P. Keller, P. Woźny, Constrained approximation of rational triangular Bézier surfaces by polynomial triangular Bézier surfaces, Numerical Algorithms. - Vol. 75, iss. 1 (2017), s. 93-111. (http://dx.doi.org/10.1007/s11075-016-0198-4)

• Publikacje Zakładu Inżynierii Oprogramowania w roku 2016

  1. W. Zychla, Heterogeneous system architecture in education management software, W: Software Engineering: Improving Practice through Research / Bogumiła Hnatkowska, Michał Śmiałek Redaktor (eds.). - Warszawa : Polish Information Processing Society, 2016.- S. 13-29.

• Publikacje Pracowników niezależnych w roku 2016

  1. M. M. Sysło, A. B. Kwiatkowska, Introducing a new computer science curriculum for all school levels in Poland, W: Informatics in Schools. Curricula, Competences, and Competitions : 8th International Conference on Informatics in Schools: Situation, Evolution, and Perspectives, ISSEP 2015 Ljubljana, Slovenia, September 28 - October 1, 2015, Proceedings / Andrej Brodnik, Jan Vahrenhold (eds.). - Cham : Springer International Publishing, 2016. - (Lecture Notes in Computer Science ; 9378). - S. 141-154. (http://dx.doi.org/10.1007/978-3-319-25396-1_13)

• Publikacje Zakładu Języków Programowania w roku 2016

  1. A. Aristizábal, D. Biernacki, S. Lenglet, P. Polesiuk, Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. FSCD 2016, pp. 9:1–17. doi:10.4230/LIPIcs.FSCD.2016.9
  2. W. Charatonik, P. Witkowski, Two-variable Logic with Counting and a Linear Order. Logical Methods in Computer Science 12(2) (2016), pp. 1–31. https://arxiv.org/abs/1604.06038
  3. H. de Nivelle, Subsumption Algorithms for Three-Valued Geometric Resolution. IJCAR 2016, pp. 257–272. doi:10.1007/978-3-319-40229-1_18
  4. W. Charatonik, P. Witkowski, Two-Variable Logic with Counting and Trees. ACM Trans. Comput. Logic 17(4), November 2016, pp. 31:1–27. doi:10.1145/2983622

• Publikacje Zakładu Złożoności Obliczeniowej i Analizy Algorytmów w roku 2016

  1. A. Jeż, One-variable word equations in linear time, Algorithmica. - Vol. 74, iss. 1 (2016), s. 1-48. (http://dx.doi.org/10.1007/s00453-014-9931-3)
  2. A. Jeż, A really simple approximation of smallest grammar, Theoretical Computer Science. - Vol. 616 (2016), s. 141-150. (http://dx.doi.org/10.1016/j.tcs.2015.12.032)
  3. A. Jeż, A. Okhotin, Equations over sets of integers with addition only, Journal of Computer and System Sciences. - Vol. 82, Iss. 6 (2016), s. 1007-1019. (http://dx.doi.org/10.1016/j.jcss.2016.02.003)
  4. A. Jeż, A. Okhotin, Least and greatest solutions of equations over sets of integers, Theoretical Computer Science. - Vol. 619 (2016), s. 68-86. (http://dx.doi.org/10.1016/j.tcs.2016.01.013)
  5. A. Jeż, Recompression: a simple and powerful technique for word equations, Journal of the ACM. - Vol. 63, iss. 1 (2016), nr art. 4. (http://dx.doi.org/10.1145/2743014)
  6. V. Diekert, A. Jeż, M. Kufleitner, Solutions of word equations over partially commutative structures, W: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) / Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (eds.). - Wadern : Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016. - (Leibniz International Proceedings in Informatics (LIPIcs) ; 55). - S. 127:1-127:14. (http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.127)
  7. A. Kisielewicz, J. Kowalski, M. Szykuła, Experiments with synchronizing automata, W: Implementation and Application of Automata : 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings / Yo-Sub Han, Kai Salomaa (eds.). - Cham : Springer International Publishing - Springer, 2016. - (Lecture Notes in Computer Science ; 9705).- S. 176-188. (http://dx.doi.org/10.1007/978-3-319-40946-7_15)
  8. J. Kowalski, A. Kisielewicz, Towards a real-time game description language, W: ICAART 2016 : 8th International Conference on Agents and Artificial Intelligence, February 24-26, 2016, in Rome, Italy, Proceedings, Vol.2 / Jaap van den Herik, Joaquim Filipe (eds.). - [Setúbal] : SCITEPRESS , 2016. - S. 494-499. (http://dx.doi.org/10.5220/0005816904940499)
  9. M. Piotrów, Faster merging networks with a small constant period, Theoretical Computer Science. - Vol. 640 (2016) , s. 20-40. (http://dx.doi.org/10.1016/j.tcs.2016.05.038)
  10. M. V. Berlinkov, M. Szykuła, Algebraic synchronization criterion and computing reset words, Information Sciences. - Vol. 369 (2016), s. 718-730. (http://dx.doi.org/10.1016/j.ins.2016.07.049)
  11. M. Szykuła, V. Vorel, An extremal series of eulerian synchronizing automata, W: Developments in Language Theory : 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings / Srečko Brlek, Christophe Reutenauer (eds.). - Berlin, Heidelberg : Springer , 2016. - (Lecture Notes in Computer Science ; 9840).- S. 380-392. (http://dx.doi.org/10.1007/978-3-662-53132-7_31)
  12. J. Kowalski, M. Szykuła, Evolving chess-like games using relative algorithm performance profiles, W: Applications of Evolutionary Computation : 19th European Conference, EvoApplications 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings, Part I / Giovanni Squillero, Paolo Burelli (eds.). - Cham : Springer International Publishing, 2016. - (Lecture Notes in Computer Science ; 9597).- S. 574-589. (http://dx.doi.org/10.1007/978-3-319-31204-0_37)
  13. J. Brzozowski, G. Jirásková, B. Liu, A. Rajasekaran, M. Szykuła, W: Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / Cezar Câmpeanu, Florin Manea, Jeffrey Shallit (eds.). - Cham : Springer International Publishing - Springer, 2016. - (Lecture Notes in Computer Science ; 9777).- S. 73-86. (http://dx.doi.org/10.1007/978-3-319-41114-9_6)
  14. P. Gawrychowski, A. Jeż, LZ77 factorisation of trees, W: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016) / Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. - (LIPIcs - Leibniz Internation Proceedings in Informatics ; 65).- S. 35:1-35:15. (http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2016.35)
  15. T. Jurdziński, D. R. Kowalski, Wake-up problem in multi-hop radio networks, W: Encyclopedia of Algorithms / Ming-Yang Kao (ed.). - New York : Springer, 2016. - S. 2352-2354. (http://dx.doi.org/10.1007/978-1-4939-2864-4_536)
  16. J. Brzozowski, G. Jirásková, B. Liu, A. Rajasekaran, M. Szykuła, On the state complexity of the shuffle of regular languages, W: Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / Cezar Câmpeanu, Florin Manea, Jeffrey Shallit (eds.). - Cham : Springer International Publishing - Springer, 2016. - (Lecture Notes in Computer Science ; 9777).- S. 73-86. (http://dx.doi.org/10.1007/978-3-319-41114-9_6)

• 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 Pracowni Inteligencji Obliczeniowej w roku 2016

  1. A. Kaczmarek, M. Marcińczuk, Evaluation of coreference resolution tools for Polish from the information extraction perspective, BSNLP 2015 : 5th Workshop on Balto-Slavic Natural Language : associated with the 10th International Conference on Recent Advances in Natural Language Processing, RANLP 2015, Hissar, Bulgaria, September 10-11, 2015; proceedings / sponsored by SIGSLAV. - Shumen : INCOMA Ltd, 2016.- S. 24-33. (http://aclweb.org/anthology/W/W15/W15-53.pdf).
  2. J. Chorowski, D. Bahdanau, D. Serdyuk, K. Cho, Y. Bengio, Attention-based models for speech recognition, W: 29th Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada / Corinna Cortes, Neil D. Lawrence, Daniel D. Lee, Masashi Sugiyama, Roman Garnett (eds.). - Red Hook, N.Y : Curran, 2016. - (Advances in Neural Information Processing Systems ; 28).- S. 577-585. (http://tinyurl.com/jpb3jkz)
  3. D. Bahdanau, J. Chorowski, D. Serdyuk, P. Brakel, Y. Bengio, End-to-end attention-based large vocabulary speech recognition, W: 2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016, Shanghai, China, March 20-25, 2016. - [Piscataway] : Institute of Electrical and Electronics Engineers, 2016. - S. 4945-4949. (http://dx.doi.org/10.1109/ICASSP.2016.7472618)
  4. P. Filipiak, B. Golenko, C. Dołęga, NSGA-II based auto-calibration of automatic number plate recognition camera for vehicle speed measurement, // W: Applications of Evolutionary Computation : 19th European Conference, EvoApplications 2016, Porto, Portugal, March 30 - April 1, 2016, Proceedings, Part I / Giovanni Squillero, Paolo Burelli (eds.). - Cham : Springer International Publishing - Springer, 2016. - (Lecture Notes in Computer Science ; 9597).- S. 803-818. (http://dx.doi.org/10.1007/978-3-319-31204-0_51)
  5. A. Łańcucki, I. Saha, S. S. Bhowmick, U. Maulik, P. Wnuk-Lipiński, A new evolutionary microRNA marker selection using next-generation sequencing data, W: 2016 IEEE Congress on Evolutionary Computation (CEC), 24 - 29 July 2016, Vancouver, Canada. - Piscataway : IEEE, 2016. - S. 2752-2759. (http://dx.doi.org/10.1109/CEC.2016.7744136)
  6. A. Brabazon, P. Wnuk-Lipiński, P. Hamill, Characterising order book evolution using self-organising maps, Evolutionary Intelligence. - Vol. 9, iss. 4 (2016), s. 167-179. (http://dx.doi.org/10.1007/s12065-016-0149-y)
  7. K. Michalak, A. Łańcucki, P. Wnuk-Lipiński, Multiobjective optimization of frequent pattern models in ultra-high frequency time series: stability versus universality, W: 2016 IEEE Congress on Evolutionary Computation (CEC), 24 - 29 July 2016, Vancouver, Canada. - Piscataway : IEEE, 2016. - S. 3491-3498. (http://dx.doi.org/10.1109/CEC.2016.7744232)

• Publikacje Zakładu Metod Numerycznych w roku 2016

  1. P. Gospodarczyk, P. Woźny, Merging of Bézier curves with box constraints, Journal of Computational and Applied Mathematics 296 (2016), 265-274. (http://dx.doi.org/10.1016/j.cam.2015.10.005)
  2. P. Gospodarczyk, S. Lewanowicz, P. Woźny, $G^{k,l}$-constrained multi-degree reduction of Bézier curves, Numerical Algorithms 71 (2016), 121-137. (http://dx.doi.org/10.1007/s11075-015-9988-3)
  3. W. Bożejko, M. Uchroński, M. Wodecki, Parallel metaheuristics for the cyclic flow shop scheduling problem, Computers and Industrial Engineering 95 (2016), 156-163. (http://dx.doi.org/10.1016/j.cie.2016.03.008)
  4. W. Bożejko, C. Smutnicki, M. Wodecki, Metropolitan delivery with time windows as a scheduling problem, W: 2016 Smart Cities Symposium Prague (SCSP)Prague May 26-27, 2016 / Milan Koukol (ed.). - Piscataway : Institute of Electrical and Electronics Engineers, 2016.- S. 55:1-55:5. (http://dx.doi.org/10.1109/SCSP.2016.7501038)
  5. W. Bożejko, M. Uchroński, M. Wodecki, Parallel tabu search algorithm with uncertain data for the flexible job shop problem, W: Artificial Intelligence and Soft Computing : 15th International Conference, ICAISC 2016, Zakopane, Poland, June 12-16, 2016, Proceedings, Part II / Leszek Rutkowski, Marcin Korytkowski, Rafał Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, Jacek M. Zurada (eds.). - Cham : Springer International Publishing, 2016. - (Lecture Notes in Computer Science ; 9693).- S. 419-428. (http://dx.doi.org/10.1007/978-3-319-39384-1_36)
  6. K. Borowicka, W. Bożejko, Ł. Kacprzak, M. Wodecki, Problem harmonogramowania zadań wielomaszynowych, W: Innowacje w zarządzaniu i inżynierii produkcji. T. 1 / pod redakcją Ryszarda Knosali. - Opole : Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, 2016.- S. 547-558. (http://tinyurl.com/jm6ynp3)
  7. W. Bożejko, R. Idzikowski, M. Wodecki, Problem przepływowy z przezbrojeniami oraz ciągłą pracą maszyn, W: Innowacje w zarządzaniu i inżynierii produkcji. T. 1 / pod redakcją Ryszarda Knosali. - Opole : Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, 2016.- S. 559-570. (http://tinyurl.com/hpo27bd)
  8. W. Bożejko, A. Gnatowski, T. Niżyński, M. Wodecki, Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem, W: Artificial Intelligence and Soft Computing : 15th International Conference, ICAISC 2016, Zakopane, Poland, June 12-16, 2016, Proceedings, Part II / Leszek Rutkowski, Marcin Korytkowski, Rafał Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, Jacek M. Zurada (eds.). - Cham : Springer International Publishing, 2016. - (Lecture Notes in Computer Science ; 9693).- S. 409-418. (http://dx.doi.org/10.1007/978-3-319-39384-1_35)
  9. A. Bartkowiak, Gianluca Baio: Bayesian methods in health economics. Boca Raton, 2013 : [recenzja] Rec.: Bartkowiak Anna // ISCB News [International Society for Clinical Biostatistics]. - Nb 62, Dec. 2016, s. 36.
  10. W. Bożejko, A. Gnatowski, R. Idzikowski, M. Wodecki, Algorytm wielomianowy dla cyklicznego problemu przydziału operacji w dwumaszynowym gnieździe, W: Automatyzacja procesów dyskretnych : teoria i zastosowania, T.I / pod red. Andrzeja Świerniaka i Jolanty Krystek. - Gliwice : Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego, 2016.- S. 41-48.
  11. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, Computer module for scheduling of transportation of composite beam bridge structures, MATEC Web of Conferences. - Vol. 86 (2016), nr art. 05015. (http://dx.doi.org/10.1051/matecconf/20168605015)
  12. W. Bożejko, Z. Hejducki, M. Rogalska, M. Wodecki, Metody sprzężeń czasowych w inżynierii przedsięwzięć budowlanych = Time couplings method in construction project management, Materiały Budowlane. - 2016, nr 6, s. 11-12. (http://sigma-not.pl/publikacja-99260-2016-6.html)
  13. W. Bożejko, M. Uchroński, M. Wodecki, Równoległe wyznaczanie wzorców w rozwiązywaniu cyklicznego problemu przepływowego z przezbrojeniami, W: Automatyzacja procesów dyskretnych : teoria i zastosowania, T.I / pod red. Andrzeja Świerniaka i Jolanty Krystek. - Gliwice : Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego, 2016. - S. 57-64.
  14. W. Bożejko, J. Pempera, M. Wodecki, Szybki algorytm rozwiązywania cyklicznego problemu gniazdowego, W: Automatyzacja procesów dyskretnych : teoria i zastosowania, T.I / pod red. Andrzeja Świerniaka i Jolanty Krystek. - Gliwice : Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego, 2016.- S. 49-56.
  15. Wojciech Bożejko, Piotr Nadybski, Mieczysław Wodecki, Two step algorithm for virtual machine distributed replication with limited bandwidth problem, W: Computer Information Systems and Industrial Management : 15th IFIP TC8 International Conference, CISIM 2016, Vilnius, Lithuania, September 14-16, 2016, Proceedings / Khalid Saeed, Władysław Homenda (eds.). - Cham : Springer International Publishing, 2016. - (Lecture Notes in Computer Science ; 9842).- S. 312-321. (http://dx.doi.org/10.1007/978-3-319-45378-1_28)

• Publikacje Zakładu Teorii Informatyki i Baz Danych w roku 2016

  1. J. Otop, T. A. Henzinger, R. Samanta, Lipschitz robustness of timed I/O systems, Verification, Model Checking, and Abstract Interpretation : 17th International Conference, VMCAI 2016, St. Petersburg, FL, USA, January 17-19, 2016. Proceedings / Barbara Jobstmann, K. Rustan M. Leino (eds.). - Berlin : Springer Berlin, 2016. - (Lecture Notes in Computer Science ; 9583). - S. 250-267. (http://dx.doi.org/10.1007/978-3-662-49122-5_12)
  2. E. Kieroński, One-dimensional logic over words, W: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) / Jean-Marc Talbot, Laurent Regnier (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. - (LIPIcs - Leibniz International Porceedings in Informatics ; 62).- S. 38:1--38:15. (http://dx.doi.org/10.4230/LIPIcs.CSL.2016.38)
  3. T. Gogacz, J. Marcinkowski, Red spider meets a rainworm: conjunctive query finite determinacy is undecidable, W: PODS'16 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems / Tova Milo (General Chair). - New York, NY : ACM, 2016.- S. 121-134. (http://dx.doi.org/10.1145/2902251.2902288)
  4. A. Lomuscio, J. Michaliszyn, Model checking multi-agent systems against epistemic HS specifications with regular expressions, W: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Cape Town, South Africa, April 25-29, 2016 / Chitta Baral, James Delgrande, and Frank Wolter (eds.).- Palo Alto : AAAI Press, 2016.- S. 298-308. (http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12823/12486)
  5. M. Graboń, J. Michaliszyn, J. Otop, P. Wieczorek, Querying data graphs with arithmetical regular expressions, W: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), New York, New York, USA 9-15 July 2016 / Subbarao Kambhampati (ed.). - Palo Alto : AAAI Press / International Joint Conferences on Artificial Intelligence, 2016. - S. 1088-1094. (http://www.ii.uni.wroc.pl/~piotrek/papers/ijcai16.pdf)
  6. A. Lomuscio, J. Michaliszyn, Verification of multi-agent systems via predicate abstraction against ATLK specifications, W: Proceedings of the 2016 International Conference on Autonomous Agents Multiagent Systems (AAMAS 2016) / Catholijn M. Jonker, Stacy Marsella (General Chairs). - Richland, SC : International Foundation for Autonomous Agents and Multiagent Systems, 2016.- S. 662-670. (http://tinyurl.com/zta6n6n)
  7. T. A. Henzinger, J. Otop, R. Samanta, Lipschitz robustness of timed I/O systems, W: Verification, Model Checking, and Abstract Interpretation : 17th International Conference, VMCAI 2016, St. Petersburg, FL, USA, January 17-19, 2016. Proceedings / Barbara Jobstmann, K. Rustan M. Leino (eds.). - Berlin : Springer Berlin, 2016. - (Lecture Notes in Computer Science ; 9583). - S. 250-267. (http://dx.doi.org/10.1007/978-3-662-49122-5_12)
  8. K. Chatterjee, T. A. Henzinger, J. Otop, Nested weighted limit-average automata of bounded width, W: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) / Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. - (Leibniz International Proceedings in Informatics (LIPIcs) ; 58).- S. 24:1--24:14. (http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.24)
  9. K. Chatterjee, T. A. Henzinger, J. Otop, Quantitative automata under probabilistic semantics, W: LICS '16 31st Annual ACM/IEEE Symposium on Logic in Computer Science New York, NY, USA - July 05 - 08, 2016 / Martin Grohe (General Chairs). - New York : Association for Computing Machinery, 2016.- S. 76-85. (http://dx.doi.org/10.1145/2933575.2933588)
  10. K. Chatterjee, T. A. Henzinger, J. Otop, Quantitative monitor automata, W: Static analysis : 23rd international symposium, SAS 2016 Edinburgh, UK, September 8-10, 2016 : proceedings / Xavier Rival (ed.). - Berlin ; Heidelberg : Springer, 2016. - (Lecture Notes in Computer Science ; 9837).- S. 23-38. (http://dx.doi.org/10.1007/978-3-662-53413-7_2)

• Publikacje Pracowników niezależnych w roku 2015

  1. A. B. Kwiatkowska, M. M. Sysło, Informatyka w edukacji: nauczyciel przewodnik i twórca, Toruń : Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika : Polskie Towarzystwo Informatyczne, 2015. - 243, [10] s. : il.
  2. M. M. Sysło, From algorithmic to computational thinking: on the way for computing for all students, ITICSE '15 : Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education. - New York : The Association for Computing Machinery, 2015. (http://dx.doi.org/10.1145/2729094.2742582).
  3. M. M. Sysło, Jak moglibyśmy się uczyć, II: (as we may learn), Człowiek, media, edukacja / red. nauk. Janusz Morbitzer, Danuta Morańska, Emilia Musiał. - Dąbrowa Górnicza : Wyższa Szkoła Biznesu, 2015. - (Prace Naukowe Wyższej Szkoły Biznesu w Dąbrowie Górniczej). - S. 345-355.

• Publikacje Zakładu Inteligencji Obliczeniowej w roku 2015

  1. J. Chorowski, J.M. Zurada, Learning understandable neural networks with nonnegative weight constraints, IEEE Transactions on Neural Networks and Learning Systems . - Vol.26, iss.1 (2015), s. 62 - 69. (http://dx.doi.org/10.1109/TNNLS.2014.2310059).
  2. A. Faleńska, A. Björkelund, Ö. Cetinoglu, W. Seeker, Stacking or supertagging for dependency parsing - what's the difference, IWPT 2015 : proceedings of the 14th International Conference on Parsing Technologies, July 22-24, 2015, Bilbao, Spain / John Carroll, Koldo Gojenola, Stephan Oepen (chairs). - Stroudsburg : Association for Computational Linguistics, 2015. - S. 118-129. (http://www.aclweb.org/anthology/W15-2215).
  3. A. Kaczmarek, M. Marcińczuk, Heuristic algorithm for zero subject detection in Polish, Text, speech, and dialogue : 18th international conference, TSD 2015, Pilsen, Czech Republic, September 14-17, 2015 ; proceedings / Pavel Král, Václav Matoušek (eds.). - Cham : Springer, 2015. - (Lecture notes in computer science ; 9302). - S. 378-386. (http://dx.doi.org/10.1007/978-3-319-24033-6_43).
  4. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, Infeasibility driven evolutionary algorithm with the anticipation mechanism for the reaching goal in dynamic constrained inverse kinematics, GECCO Companion '15 : proceedings of the companion publication of the 2015 Annual Conference on Genetic and Evolutionary Computation ; July 11 - 15, Madrid, Spain / Sara Silva (ed.). - New York : ACM, 2015.- S. 1389-1390. (http://dx.doi.org/10.1145/2739482.2764683).
  5. P. Filipiak, P. Wnuk-Lipiński, Making IDEA-ARIMA efficient in dynamic constrained optimization problems, Applications of Evolutionary Computation : 18th European Conference, EvoApplications 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings / Antonio M. Mora, Giovanni Squillero (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9028).- S. 882-893. (http://dx.doi.org/10.1007/978-3-319-16549-3_71).
  6. I. Saha, P. Wnuk-Lipiński, A. Łańcucki, A new evolutionary gene selection technique, IEEE Congress on Evolutionary Computation (CEC), 2015 : 25-28 May 2015, Sendai, Japan ; proceedings. - Piscataway : IEEE, 2015. - S. 1612-1619. (http://dx.doi.org/10.1109/CEC.2015.7257080).
  7. P. Wnuk-Lipiński, Training financial decision support systems with thousands of decision rules using differential evolution with embedded dimensionality reduction, Applications of Evolutionary Computation : 18th European Conference, EvoApplications 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings / Antonio M. Mora, Giovanni Squillero (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9028). - S. 289-301. (http://dx.doi.org/10.1007/978-3-319-16549-3_24).

• Publikacje Zakładu Teorii Informatyki i Baz Danych w roku 2015

  1. S. Staworko, P. Wieczorek, Characterizing XML twig queries with examples, 18th International Conference on Database Theory, ICDT-15, March 23-27, 2015, Brussels, Belgium / Marcelo Arenas, Martín Ugarte (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 31).- S. 144-160. (http://dx.doi.org/10.4230/LIPIcs.ICDT.2015.144).
  2. E. Kieroński, A. Kuusisto, Uniform one-dimensional fragments with one equivalence relation, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) / Stephan Kreutzer (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 41).- S. 597-615. (http://dx.doi.org/10.4230/LIPIcs.CSL.2015.597).
  3. E. Kieroński, J. Michaliszyn, J. Otop, On the decidability of elementary modal logics, ACM Transactions on Computational Logic. - Vol. 17, iss. 1 (2015), nr art. 2 (47 str.). (http://dx.doi.org/10.1145/2811262).
  4. T. Gogacz, J. Marcinkowski, The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable, LICS 2015: 281-292.
  5. T. Gogacz, W. Czerwinski, E. Kopczynski, Non-dominating Sequences of Vectors Using only Resets and Increments, Fundam. Inform. 140(2): 123-127 (2015).
  6. U. Boker, T. A. Henzinger, J. Otop, The target discounted-sum problem, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 6 - 10 July 2015, Kyoto, Japan. - Piscataway : IEEE, 2015. - (IEEE Conference Publications). - S. 750 - 761. (http://dx.doi.org/10.1109/LICS.2015.74).
  7. K. Chatterjee, T. A. Henzinger, J. Otop, Nested weighted automata, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 6 - 10 July 2015, Kyoto, Japan. - Piscataway : IEEE, 2015.- (IEEE Conference Publicatons). - S. 725 - 737. (http://dx.doi.org/10.1109/LICS.2015.72).

• 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 Inżynierii Oprogramowania w roku 2015

  1. Z. Płoski, Badanie danych: raport z pierwszej linii działań, Rachel Schutt, Cathy O'Neil ; tł. Zdzisław Płoski Gliwice : Wydawnictwo Helion, 2015. - 318, [18] s. : il.
  2. Z. Płoski, Od matematyki do programowania uogólnionego, A.A. Stepanov, D.E. Rose, tł. Zdzisław Płoski, Gliwice : Wydawnictwo Helion, cop. 2015. - 286 s.

  
  

• Publikacje Zakładu Złożoności Obliczeniowej i Algorytmów w roku 2015

  1. A. Jeż, Faster fully compressed pattern matching by recompression, ACM Transactions on Algorithms. - Vol. 11, iss.3 (2015), s. article no. 20. (http://dx.doi.org/10.1145/2631920).
  2. M. Bieńkowski, J. Byrka, T. Jurdziński, K.Chrobak, D. R. Kowalski, Provable fairness for TDMA scheduling, IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015, Proceedings. - Piscataway : IEEE, 2015.- S. 1320-1327. (http://dx.doi.org/10.1109/INFOCOM.2015.7218508).
  3. A. Jeż, Approximation of grammar-based compression via recompression, Theoretical Computer Science. - Vol. 592 (2015), s. 115-134. (http://dx.doi.org/10.1016/j.tcs.2015.05.027).
  4. A. Kisielewicz, J. Kowalski, M. Szykuła, Computing the shortest reset words of synchronizing automata, Journal of Combinatorial Optimization. - Vol. 29, iss. 1 (2015), s. 88-124. (http://dx.doi.org/10.1007/s10878-013-9682-0).
  5. M. Karpiński, M. Piotrów, Smaller selection networks for cardinality constraints encoding, Principles and Practice of Constraint Programming : 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings / Gilles Pesant (ed.). - Cham : Springer International Publishing , 2015. - (Lecture Notes in Computer Science ; 9255).- S. 210-225. (http://dx.doi.org/10.1007/978-3-319-23219-5_16).
  6. A. Kisielewicz, M. Szykuła, Synchronizing automata with extremal properties, Mathematical Foundations of Computer Science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I / Giuseppe F. Italiano, Giovanni Pighizzini, Donald T. Sannella (eds.). - Berlin, Heidelberg : Springer Berlin, 2015. - (Lecture Notes in Computer Science ; 9234). - S. 331-343. (http://dx.doi.org/10.1007/978-3-662-48057-1_26).
  7. M. Berlinkov, M. Szykuła, Algebraic synchronization criterion and computing reset words, Mathematical Foundations of Computer Science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I / Giuseppe F. Italiano, Giovanni Pighizzini, Donald T. Sannella (eds.). - Berlin, Heidelberg : Springer Berlin, 2015. - (Lecture Notes in Computer Science ; 9234).- S. 103-115. (http://dx.doi.org/10.1007/978-3-662-48057-1_8).
  8. M. Szykuła, Checking whether an automaton is monotonic is NP-complete, Implementation and Application of Automata : 20th International Conference, CIAA 2015, Umea, Sweden, August 18-21, 2015, Proceedings / Frank Drewes (ed.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9223).- S. 279-291. (http://dx.doi.org/10.1007/978-3-319-22360-5).
  9. J. Brzozowski, M. Szykuła, Complexity of suffix-free regular languages, Fundamentals of Computation Theory : 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings / Adrian Kosowski, Igor Walukiewicz (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9210).- S. 146-159. (http://dx.doi.org/10.1007/978-3-319-22177-9_12).
  10. V. V. Gusev, M. Szykuła, On the number of synchronizing colorings of digraphs, Implementation and Application of Automata : 20th International Conference, CIAA 2015, Umea, Sweden, August 18-21, 2015, Proceedings / Frank Drewes (ed.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9223).- S. 127-139. (http://dx.doi.org/10.1007/978-3-319-22360-5_11).
  11. J. Brzozowski, M. Szykuła, Upper bound on syntactic complexity of suffix-free languages, Descriptional Complexity of Formal Systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings / Jeffrey Shallit, Alexander Okhotin (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9118).- S. 33-45. (http://dx.doi.org/10.1007/978-3-319-19225-3_3).
  12. A. Kisielewicz, J. Kowalski, Testing general game players against a Simplified Boardgames player using temporal-difference learning, 2015 IEEE Congress on Evolutionary Computation, (CEC 2015), Sendai, Japan, May 25-28, 2015, Proceedings. - Piscataway : Institute of Electrical and Electronics Engineers, 2015. - S. 1466-1473. (http://dx.doi.org/10.1109/CEC.2015.7257061).
  13. T. Jurdziński, G. Stachowiak, Deterministic symmetry breaking in ring networks, 2015 IEEE 35th International Conference on Distributed Computing Systems (ICDCS 2015) ; Columbus, Ohio, USA, 29 June - 2 July 2015. - Piscataway, NJ : IEEE, 2015.- S. 517-526. (http://dx.doi.org/10.1109/ICDCS.2015.59).
  14. T. Jurdziński, M. Różański, G. Stachowiak, On setting-up asynchronous ad hoc wireless networks, 2015 IEEE Conference on Computer Communications (INFOCOM 2015) : Kowloon, Hong Kong, 26 April - 1 May 2015. - Piscataway, NJ : IEEE, 2015. - S. 2191 - 2199. (http://dx.doi.org/10.1109/INFOCOM.2015.7218605).
  15. T. Jurdziński, G. Stachowiak, The cost of synchronizing multiple-access channels, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15 . - New York : ACM , 2015.- S. 421-430. (http://dx.doi.org/10.1145/2767386.2767439).
  16. T. Jurdziński, D. R. Kowalski, K. Loryś, Online packet scheduling under adversarial jamming, Approximation and Online Algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014. - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 8952). - S. 193-206. (http://dx.doi.org/10.1007/978-3-319-18263-6_17).
  17. A. Roman, M. Szykuła, Forward and backward synchronizing algorithms, Expert Systems with Applications. - Vol. 42, iss. 24 (2015), s. 9512-9527. (http://dx.doi.org/10.1016/j.eswa.2015.07.071).
  18. J. Brzozowski, M. Szykuła, Large aperiodic semigroups, International Journal of Foundations of Computer Science. - Vol. 26, iss. 07 (2015), s. 913-931. (http://dx.doi.org/10.1142/S0129054115400067).

• Publikacje Zakładu Języków Programowania w roku 2015

  1. W. Charatonik, P. Witkowski, Two-variable logic with counting and a linear order, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) / Stephan Kreutzer (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 41).- S. 631-647. (http://dx.doi.org/10.4230/LIPIcs.CSL.2015.631).
  2. M. Materzok, Easyprove: a tool for teaching precise reasoning, Proceedings of the Fourth International Conference on Tools for Teaching Logic 9-12 June 2015 / (eds.) M. Antonia Huertas et al. - Rennes : Université de Rennes, 2015.- S. 129-136. (http://ttl2015.irisa.fr/TTL2015_proceedings.pdf).
  3. D. Biernacki, O. Danvy, K. Millikin, A dynamic continuation-passing style for dynamic delimited continuations, ACM Transactions on Programming Languages and Systems . - Vol.38, iss. 1 (2015), nr art. 2. (http://dx.doi.org/10.1145/2794078).
  4. D. Biernacki, P. Polesiuk, Logical relations for coherence of effect subtyping, 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)/ Thorsten Altenkirch (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 38).- S. 107-122. (http://dx.doi.org/10.4230/LIPIcs.TLCA.2015.107).
  5. J. de Nivelle, Automated Reasoning with Analytic Tableaux and Related Methods, 24th International Conference, TABLEAUX 2015, Wroclaw, Poland, September 21-24, 2015, Proceedings / red. Hans de Nivelle Cham : Springer International Publishing, 2015. (http://dx.doi.org/10.1007/978-3-319-24312-2).

• Publikacje Zakładu Metod Numerycznych w roku 2015

  1. P. Gospodarczyk, Degree reduction of Bézier curves with restricted control points area, Computer-Aided Design 62 (2015), 143-151. (http://dx.doi.org/10.1016/j.cad.2014.11.009)
  2. P. Woźny, P. Gospodarczyk, S. Lewanowicz, Efficient merging of multiple segments of Bézier curves, Applied Mathematics and Computation 268 (2015), 354-363. (http://dx.doi.org/10.1016/j.amc.2015.06.079)
  3. A. Bartkowiak, R. Zimroz, NMF and PCA as applied to gearbox fault data, Intelligent data engineering and automated learning - IDEAL 2015 : 16th international conference, Wroclaw, Poland, October 14-16, 2015 ; proceedings / Konrad Jackowski et al. (eds.). - Cham : Springer, 2015. - (Lecture Notes in Computer Science ; 9375). - S. 199-206. (http://dx.doi.org/10.1007/978-3-319-24834-9_24)
  4. A. Bartkowiak, R. Zimroz, Probabilistic principal components and mixtures, how this works, Computer Information Systems and Industrial Management : 14th IFIP TC 8 International Conference, CISIM 2015, Warsaw, Poland, September 24-26, 2015, Proceedings / Khalid Saeed, Wladyslaw Homenda (eds.). - Cham : Springer, 2015. - (Lecture Notes in Computer Science ; 9339). - S. 24-35. (http://dx.doi.org/10.1007/978-3-319-24369-6_2)
  5. W. Bożejko, M. Uchroński, M. Wodecki, Block approach to the cyclic flow shop scheduling, Computers & Industrial Engineering. - Vol. 81 (2015), s. 158-166. (http://dx.doi.org/10.1016/j.cie.2015.01.004)
  6. W. Bożejko, Ł. Kacprzak, M. Wodecki, Parallel coevolutionary algorithm for three-dimensional bin packing problem, Artificial Intelligence and Soft Computing : 14th International Conference, ICAISC 2015, Zakopane, Poland, June 14-18, 2015, Proceedings, Part I / Leszek Rutkowski, Marcin Korytkowski, Rafal Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, Jacek M. Zurada (eds.) . - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence ; 9119).- S. 319-328. (http://dx.doi.org/10.1007/978-3-319-19324-3_29)
  7. W. Bożejko, S. Jagiełło, J. Pempera, M. Wodecki, Parallel cost function determination on GPU for the vehicle routing problem, Artificial Intelligence and Soft Computing : 14th International Conference, ICAISC 2015, Zakopane, Poland, June 14-18, 2015, Proceedings, Part II / Leszek Rutkowski, Marcin Korytkowski, Rafal Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, Jacek Zurada (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence ; 9120).- S. 778-788. (http://dx.doi.org/10.1007/978-3-319-19369-4_69)
  8. W. Bożejko, Ł. Kacprzak, M. Wodecki, Parallel packing procedure for three dimensional bin packing problem, 2015 20th International Conference on Methods and Models in Automation and Robotics (MMAR) : 24 - 27 Aug. 2015, Miedzyzdroje, Poland. - Piscataway : IEEE, 2015.- S. 1122 - 1126. (http://dx.doi.org/10.1109/MMAR.2015.7284036)
  9. W. Bożejko, J. Pempera, M. Wodecki, Parallel simulated annealing algorithm for cyclic flexible job shop scheduling problem, Artificial Intelligence and Soft Computing : 14th International Conference, ICAISC 2015, Zakopane, Poland, June 14-18, 2015, Proceedings, Part II / Leszek Rutkowski, Marcin Korytkowski, Rafal Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, Jacek Zurada (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence ; 9120).- S. 603-612. (http://dx.doi.org/10.1007/978-3-319-19369-4_53)
  10. W. Bożejko, A. Gnatowski, M. Wodecki, Równoległy algorytm przeszukiwania z zabronieniami dla cyklicznego problemu gniazdowego, Innowacje w zarządzaniu i inżynierii produkcji. T.2 / pod red. Ryszarda Knosali. - Opole : Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, 2015.- S. 622-632. (http://www.ptzp.org.pl/files/konferencje/kzz/artyk_pdf_2015/T2/t2_0622.pdf)
  11. W. Bożejko, P. Rajba, M. Wodecki, Stochastyczny problem przepływowy z terminami zakończenia operacji, Innowacje w zarządzaniu i inżynierii produkcji. T.2 / pod red. Ryszarda Knosali. - Opole : Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, 2015.- S. 633-644. (http://www.ptzp.org.pl/files/konferencje/kzz/artyk_pdf_2015/T2/t2_0633.pdf)

• Publikacje Zakładu Metod Numerycznych w roku 2014

  1. A. Bartkowiak, R. Zimroz, Dimensionality reduction via variables selection: linear and nonlinear approaches with application to vibration-based condition monitoring of planetary gearbox, Applied Acoustics. - Vol. 77 (2014), s. 169-177. (http://dx.doi.org/10.1016/j.apacoust.2013.06.017).
  2. W. Bożejko, M. Karpiński, M. Pacut, M. Wodecki, Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem, Parallel Processing and Applied Mathematics : 10th International Conference, PPAM 2013, Warsaw, Poland, September 8-11, 2013, Revised Selected Papers, Part 2 / Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, Jerzy Wasniewski (eds.). - Berlin : Springer Berlin, 2014. - (Lecture Notes in Computer Science ; 8385).- S. 207-214. (http://dx.doi.org/10.1007/978-3-642-55195-6_19).
  3. P. Woźny, Construction of dual B-spline functions, Journal of Computational and Applied Mathematics. - Vol. 260 (2014), s. 301-311. (http://dx.doi.org/10.1016/j.cam.2013.10.003).
  4. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, Solving resource-constrained construction scheduling problems with overlaps by metaheuristic, Journal of Civil Engineering and Management, Taylor & Francis, 2014, Volume 20(5), 649-659.
  5. W. Bożejko, Ł. Gniewkowski, J. Pempera, M. Wodecki, Cyclic hybrid flow-shop scheduling problem with machine setups, Procedia Computer Science Volume 29, Elsevier (2014), 2127-2136.
  6. W. Bożejko, P. Rajba, M. Wodecki, Scheduling problem with uncertain parameters in Just in Time system, Lecture Notes in Artificial Intelligence No. 8468, Springer (2014), 456-467.
  7. W. Bożejko, Ł. Gniewkowski, M. Wodecki, Solving timetabling problems on GPU, Lecture Notes in Artificial Intelligence No. 8468, Springer (2014), 445-455.
  8. W. Bożejko, M. Uchroński, M. Wodecki, Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem, Advanced Methods and Applications in Computational Intelligence (R. Klempous, J. Nikodem, Z. Chaczko, eds.), Topics in Intelligent Engineering and Informatics series Vol. 6 (2014), ISBN 978-3-319-01435-7, Springer, 43-60.
  9. W. Bożejko, P. Rajba, M. Wodecki, Stable scheduling with random processing times, Advanced Methods and Applications in Computational Intelligence (R. Klempous, J. Nikodem, Z. Chaczko, eds.), Topics in Intelligent Engineering and Informatics series Vol. 6 (2014), ISBN 978-3-319-01435-7, Springer, 61-77.
  10. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, Analiza harmonogramów powykonawczych w budownictwie, Innowacje w Zarządzaniu i Inżynierii Produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2014, 474-483.
  11. W. Bożejko, Ł. Kacprzak, M. Wodecki, Cykliczny problem przepływowy z przezbrojeniami maszyn, Innowacje w Zarządzaniu i Inżynierii Produkcji(red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2014, 484-493.
  12. W. Bożejko, Ł. Kacprzak, M. Wodecki, Równoległe algorytmy populacyjne dla trójwymiarowego problemu pakowania, Innowacje w Zarządzaniu i Inżynierii Produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2014, 494-506.
  13. W. Bożejko, M. Karpiński, M. Pacut, M. Wodecki, Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem, Lecture Notes in Computer Science No. 8386, Springer (2014), 207-214.
  14. W. Bożejko, Ł. Gniewkowski, M. Wodecki, Równoległy algorytm memetyczny dla problemu układania planu zajęć, Automatyzacja procesów dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), Gliwice 2014, ISBN 978-83-62652-67-9, 17-26.
  15. W. Bożejko, M. Wodecki, Problemy cykliczne z równoległymi maszynami, Automatyzacja procesów dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), Gliwice 2014, ISBN 978-83-62652-67-9, 27-36.

• Publikacje Zakładu Języków Programowania w roku 2014

  1. W. Charatonik, E. Kieroński, F. Mazowiecki, Decidability of Weak Logics with Deterministic Transitive Closure, CSL-LICS 2014. Vienna, Austria, July 14 - 18, 2014. Proceedings, pp. 29:1--29:10. (http://dl.acm.org/citation.cfm?doid=2603088.2603134).
  2. D. Biernacki, S. Lenglet, Applicative Bisimilarities for Call-by-Name and Call-by-Value Lambda-Mu-Calculus, In Bart Jacobs, Alexandra Silva, and Sam Staton, editors, Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX), pp. 49-64, Ithaca, NY, June 2014. ENTCS 308, 2014. Elsevier. (http://www.sciencedirect.com/science/article/pii/S1571066114000711).
  3. J. de Nivelle, Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic, workshop Automated Reasoning in Quantified Non-Classical Logics (ARQNL) 2014, edited by Christoph Benzmüller and Jens Otten, pages 71-85, published by VSL Workshop Proceedings.
  4. J. de Nivelle, Theorem Proving for Classical Logic with Partial Functions by Reduction to Kleene Logic, Journal of Logic and Computation, Oxford University Press, 2014.

• Publikacje Zakładu Złożoności Obliczeniowej i Algorytmów w roku 2014

  1. P. Gawrychowski, Ł. Jeż, A. Jeż, Validating the Knuth-Morris-Pratt failure function, fast and online, Theory of Computing Systems. - Vol. 54, iss. 2 (2014), s. 337-372. (http://dx.doi.org/10.1007/s00224-013-9522-8).
  2. A. Jeż, M. Lohrey, Approximation of smallest linear tree grammar, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) / Ernst W. Mayr, Natacha Portier (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. - (LIPIcs - Leibniz International Proceedings in Informatics ; 25). - S. 445-457. (http://dx.doi.org/10.4230/LIPIcs.STACS.2014.445).
  3. A. Jeż, The complexity of compressed membership problems for finite automata, Theory of Computing Systems. - Vol.55, iss. 4 (2014), s. 685-718. (http://dx.doi.org/10.1007/s00224-013-9443-6).
  4. A. Jeż, Context unification is in PSPACE, Automata, languages, and programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings. Part II / Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias (eds.). - Berlin, Heidelberg : Springer, 2014. - (Lecture Notes in Computer Science ; 8573). - S. 244-255. (http://dx.doi.org/10.1007/978-3-662-43951-7_21).
  5. A. Jeż, V. Diekert, W. Plandowski, Finding all solutions of equations in free groups and monoids with involution, Computer science - theory and applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014 : proceedings / Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Eric Pin, Nikolay K. Vereshchagin (eds.). - Cham : Springer, 2014. - (Lecture Notes in Computer Science ; 8476).- S. 1-15. (http://dx.doi.org/10.1007/978-3-319-06686-8_1).
  6. A. Jeż, A really simple approximation of smallest grammar, Combinatorial Pattern Matching : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings / Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner (eds.). - Cham : Springer, 2014. - (Lecture Notes in Computer Science ; 8486).- S. 182-191. (http://dx.doi.org/10.1007/978-3-319-07566-2_19).
  7. W. Bożejko, M. Karpiński, M. Pacut, M. Wodecki, Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem, Parallel Processing and Applied Mathematics : 10th International Conference, PPAM 2013, Warsaw, Poland, September 8-11, 2013, Revised Selected Papers, Part 2 / Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, Jerzy Wasniewski (eds.). - Berlin : Springer Berlin, 2014. - (Lecture Notes in Computer Science ; 8385).- S. 207-214. (http://dx.doi.org/10.1007/978-3-642-55195-6_19).
  8. J. Brzozowski, M. Szykuła, Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals, In Developments in Language Theory (DLT 2014), volume 8633 of LNCS, pages 13-24.
  9. J. Brzozowski, M. Szykuła, Large Aperiodic Semigroups, In Implementation and Application of Automata (CIAA 2014), volume 8587 of LNCS, pages 124-135, 2014.
  10. A. Jeż, A. Okhotin, Computational completeness of equations over sets of natural numbers, Information and Computation 237 (2014), 56-94. (http://www.sciencedirect.com/science/article/pii/S0890540114000637)
  11. J. Kowalski, Embedding a Card Game Language into a General Game Playing Language, Frontiers in Artificial Intelligence and Applications Volume 264: STAIRS 2014, 161 - 170. (http://ebooks.iospress.nl/volumearticle/37205).
  12. W. Bożejko, M. Karpiński, M. Pacut, M. Wodecki, Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem, Lecture Notes in Computer Science No. 8386, Springer (2014), 207-214.
  13. T. Jurdziński, D. Kowalski, M. Różański, G. Stachowiak, On the Impact of Geometry on Ad Hoc Communication in Wireless Networks, 33rd ACM Symposium on Principles of Distributed Computing, PODC 2014, wydane w Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014, st. 357-366. (http://dl.acm.org/citation.cfm?doid=2611462.2611487).

• Publikacje Zakładu Inżynierii Oprogramowania w roku 2014

  1. Z. Płoski, Kontrola wersji z systemem Git: narzędzia i techniki programistów, Jon Loeliger, Matthew McCullough ; [tł. Zdzisław Płoski] Gliwice : Helion, cop. 2014. - 422, [2] s.
  2. W. Bożejko, P. Rajba, M. Wodecki, Scheduling problem with uncertain parameters in Just in Time system, Lecture Notes in Artificial Intelligence No. 8468, Springer (2014), 456-467.
  3. W. Bożejko, P. Rajba, M. Wodecki, Stable scheduling with random processing times, Advanced Methods and Applications in Computational Intelligence (R. Klempous, J. Nikodem, Z. Chaczko, eds.), Topics in Intelligent Engineering and Informatics series Vol. 6 (2014), ISBN 978-3-319-01435-7, Springer, 61-77.

• 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 Teorii Informatyki i Baz Danych w roku 2014

  1. T. Gogacz, K. Krupiński, On regular groups and fields, Journal of Symbolic Logic. - Vol. 79, iss. 3 (2014), s. 826-844. (http://dx.doi.org/10.1017/jsl.2013.17).
  2. E. Kieroński, A. Kuusisto, Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality, MFCS 2014. Budapest, Hungary, August 26-29, 2014. Proceedings, Part I, LNCS 8634, pp. 365--376. (http://link.springer.com/chapter/10.1007%2F978-3-662-44522-8_31).
  3. W. Charatonik, E. Kieroński, F. Mazowiecki, Decidability of Weak Logics with Deterministic Transitive Closure, CSL-LICS 2014. Vienna, Austria, July 14 - 18, 2014. Proceedings, pp. 29:1--29:10. (http://dl.acm.org/citation.cfm?doid=2603088.2603134).
  4. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable First-order Logic with Equivalence Closure, SIAM Journal on Computing, Volume 43, Issue 3, 2014, pp. 1012--1063. (http://epubs.siam.org/doi/abs/10.1137/120900095).
  5. T. Gogacz, M. Bojańczyk, H. Michalewski, M. Skrzypczak, On the decidability of MSO+U on infinite trees, Proceedings - International Colloquium on Automata, Languages, and Programming - 2014, s. 50-61.
  6. T. Gogacz, J. Marcinkowski, All-Instances Termination of Chase is Undecidable, Proceedings - International Colloquium on Automata, Languages, and Programming - 2014, s. 293-304.
  7. T. Gogacz, H. Michalewski, M. Mio, M. Skrzypczak, Measure Properties of Game Tree Languages, Proceedings - Mathematical Foundations of Computer Science - 2014, s. 303-314.
  8. T. A. Henzinger, J. Otop, Model measuring for hybrid systems, 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), HSCC'14, Berlin, Germany, April 15-17, 2014, ACM, 2014, str. 213-222. (http://dl.acm.org/citation.cfm?doid=2562059.2562130).
  9. J. Otop, T. A. Henzinger, S. Roopsha, Lipschitz Robustness of Finite-state Transducers, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, LIPIcs, 2014, str. 431-443. (http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.431).
  10. S. Staworko, P. Wieczorek, Characterizing XML Twig Queries with Examples, 18th International Conference on Database Theory (ICDT'15). Leibniz International Proceedings in Informatics Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. (http://www.ii.uni.wroc.pl/~piotrek/paper.php?p=icdt15)
  11. J. Marcinkowski, J. Michaliszyn, The Undecidability of the Logic of Subintervals, Fundamenta Informaticae. 131(2): 217-240, 2014. (http://dx.doi.org/10.3233/FI-2014-1011).

• Publikacje Zakładu Inteligencji Obliczeniowej w roku 2014

  1. P. Filipiak, P. Wnuk-Lipiński, E. Brzychczy, R. Zimroz, Artificial Immune Systems for Data Classification in Planetary Gearboxes Condition Monitoring, Advances in Condition Monitoring of Machinery in Non-Stationary Operations, Lecture Notes in Mechanical Engineering, Springer, 2014, pp. 235-247. (http://dx.doi.org/10.1007/978-3-642-39348-8_20).
  2. P. Wnuk-Lipiński, Training Complex Decision Support Systems with Differential Evolution Enhanced by Locally Linear Embedding, Applications of Evolutionary Computation, Lecture Notes in Computer Science, vol. 8602, Springer, 2014, pp. 125-137. (http://dx.doi.org/10.1007/978-3-662-45523-4_11).
  3. A. Brabazon, P. Wnuk-Lipiński, Pattern Mining in Ultra-High Frequency Order Books with Self-Organizing Maps, Applications of Evolutionary Computation, Lecture Notes in Computer Science, vol. 8602, Springer, 2014, pp. 288-298. (http://dx.doi.org/10.1007/978-3-662-45523-4_24).
  4. P. Filipiak, P. Wnuk-Lipiński, Infeasibility Driven Evolutionary Algorithm with Feed-Forward Prediction Strategy for Dynamic Constrained Optimization Problems, Applications of Evolutionary Computation, Lecture Notes in Computer Science, vol. 8602, Springer, 2014, pp. 817-828. (http://dx.doi.org/10.1007/978-3-662-45523-4_66).
  5. P. Wnuk-Lipiński, Optimizing Objective Functions with Non-Linearly Correlated Variables Using Evolution Strategies with Kernel-Based Dimensionality Reduction, Hybrid Artificial Intelligence Systems, Lecture Notes in Computer Science, vol. 8480, 2014, Springer, pp. 342-353. (http://dx.doi.org/10.1007/978-3-319-07617-1_31).
  6. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, Multiobjective Dynamic Constrained Evolutionary Algorithm for Control of a Multi-segment Articulated Manipulator, Intelligent Data Engineering and Automated Learning, Lecture Notes in Computer Science, vol. 8669, 2014, pp. 199-206. (http://dx.doi.org/10.1007/978-3-319-10840-7_25).
  7. P. Filipiak, P. Wnuk-Lipiński, Univariate Marginal Distribution Algorithm with Markov Chain Predictor in Continuous Dynamic Environments, Intelligent Data Engineering and Automated Learning, Lecture Notes in Computer Science, vol. 8669, 2014, pp. 404-411. (http://dx.doi.org/10.1007/978-3-319-10840-7_49).
  8. J. Chorowski, P. Filipiak, K. Michalak, P. Wnuk-Lipiński, A. Łańcucki, Continuous Population-Based Incremental Learning with Mixture Probability Modeling for Dynamic Optimization Problems, Intelligent Data Engineering and Automated Learning, Lecture Notes in Computer Science, vol. 8669, 2014, pp. 457-464. (http://dx.doi.org/10.1007/978-3-319-10840-7_55).
  9. J. Chorowski, J. Wang, J.M. Zurada, Review and performance comparison of SVM- and ELM-based classifiers, Neurocomputing 128, 507-516. (http://dx.doi.org/10.1016/j.neucom.2013.08.009).
  10. J. Chorowski, J.M. Zurada, Learning Understandable Neural Networks With Nonnegative Weight Constraints, Transactions on Neural Networks and Learning Systems PP, 1-1. (http://dx.doi.org/doi:10.1109/TNNLS.2014.2310059).
  11. S. Dey, U. Maulik, S. Bhattacharyya, I. Saha, Multi-level Thresholding using Quantum Inspired Meta-heuristics, Knowledge-Based Systems, Vol. 67, pp. 373-400, 2014. (http://dx.doi.org/10.1016/j.knosys.2014.04.006).
  12. A. Faleńska, A. Björkelund, Ö. Cetinoglu, R. Farkas, T. Mueller, W. Seeker, Z. Szántó, Introducing the IMS-Wrocław-Szeged-CIS entry at the SPMRL 2014 Shared Task: Reranking and Morpho-syntax meet Unlabeled, Proceedings of the First Joint Workshop on Statistical Parsing of Morphologically Rich Languages and Syntactic Analysis of Non-Canonical Languages. (http://www.aclweb.org/anthology/W14-6110).

• Publikacje Pracowników niezależnych w roku 2014

  1. A. B. Kwiatkowska, M. M. Sysło, Informatyka w edukacji: informatyka dla wszystkich od najmłodszych lat, Toruń: Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika, 2014. - 344, [9] s.
  2. M. M. Sysło, The First 25 Years of Computers in Education in Poland: 1965-1990, in: A. Tatnall, B. Davey (eds.), History of Comoputers in Education, IFIP AICT 424, Springer-Verlag 2014, 266-290.
  3. A. B. Kwiatkowska, M. M. Sysło, Introducing Students to Recursion: A Multi-facet and Multi-tool Approach, in: Y. Gulbahar, E. Karatas (eds.), ISSEP 2014, LNCS 8730, Springer-Verlag 2014, 124-137.
  4. A. B. Kwiatkowska, M. M. Sysło, Think logarithmically!, in: T. Brinda, N. Reynolds, R. Romeike (eds.), KEYCIT 2014 - Key Competencies in Informatics and ICT, Commentarii informaticae didactisae, 2014, 232-237.
  5. A. B. Kwiatkowska, M. M. Sysło, Learning Mathematics Supported by Computational Thinking, in: G. Futschek, C. Kynigos (eds.), Constructionism and Creativity, Oesterreichische Computer Gesellschaft, Vienna 2014, 258-268.
  6. A. B. Kwiatkowska, M. M. Sysło, Myśl logarytmicznie!, Delta, 12, 2014, 10-13.
  7. A. B. Kwiatkowska, M. M. Sysło, Myślenie komputacyjne. Nowe spojrzenie na kompetencje informatyczne, Informatyka w Edukacji, XI, Wydawnictwo UMK Toruń, 2014, 15-32.

• Publikacje Zakładu Metod Numerycznych w roku 2013

  1. P. Woźny, Construction of dual bases, Journal of Computational and Applied Mathematics 245 (2013), 75-85. (http://dx.doi.org/10.1016/j.cam.2012.12.007).
  2. S. Lewanowicz, R. Nowak, P. Woźny, Structure relations for the bivariate big q-Jacobi polynomials, Applied Mathematics and Computation 219 (2013), 8790-8802. (http://dx.doi.org/10.1016/j.amc.2013.02.059).
  3. A. Bartkowiak, R. Zimroz, Efficacy of some primary discriminant functions in diagnosing planetary gearboxes, Computer Information Systems and Industrial Management : 12th IFIP TC8 International Conference, CISIM 2013, Krakow, Poland, September 25-27, 2013 : Proceedings / Khalid Saeed, Rituparna Chaki, Agostino Cortesi, Sławomir Wierzchoń (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; 8104). - S. 24-35. (http://dx.doi.org/10.1007/978-3-642-40925-7_3).
  4. A. Bartkowiak, R. Zimroz, Two simple multivariate procedures for monitoring planetary gearboxes in non-stationary operating conditions, Mechanical Systems and Signal Processing. - Vol. 38, iss. 1 (2013), s. 237-247. (http://dx.doi.org/10.1016/j.ymssp.2012.03.022).
  5. P. Woźny, A short note on Jacobi-Bernstein connection coefficients, Applied Mathematics and Computation. - Vol.222 (2013), s. 53-57. (http://dx.doi.org/10.1016/j.amc.2013.07.029).
  6. W. Bożejko, M. Uchroński, M. Wodecki, Parallel neuro-tabu search algorithm for the job shop scheduling problem, Proceedings of ICAISC 2013, Springer 2013- (Lecture Notes in Artificial Intelligence Vol. 7895), s. 489-499. (http://dx.doi.org/10.1007/978-3-642-38610-7_45).
  7. W. Bożejko, M. Uchroński, Z. Hejducki, M. Rogalska, M. Wodecki, Harmonogramowanie zintegrowanego systemu transportu i montażu kompozytowych elementów mostowych w systemie Just In Time, Przegląd Budowlany 2/2013, s. 39-44, ISSN 0033-2038.
  8. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, Zintegrowany proces transportu i montażu obiektu, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2013, ISBN 978-83-930399-5-1, 273-285.
  9. W. Bożejko, M. Uchroński, M. Wodecki, Równoległy algorytm neuro-tabu dla problemu gniazdowego szeregowania zadań, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2013, ISBN 978-83-930399-5-1, 537-547.
  10. W. Bożejko, Z. Hajducki, M. Uchroński, M. Wodecki, Scheduling of composite bridge components transportation in Just in Time system, Preprints of the IFAC Conference on Manufacturing Modeling, Management, and Control (MIM2013), 2013, 2146-2150.

• Publikacje Zakładu Języków Programowania w roku 2013

  1. M. Biernacka, D. Biernacki, W. Jedynak, An operational foundation for the tactic language of Coq, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming : Madrid, Spain, September 16-18, 2013. - New York : ACM , 2013.- S. 25-36. (http://dx.doi.org/10.1145/2505879.2505890).
  2. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10).
  3. W. Charatonik, P. Witkowski, Two-variable logic with counting and trees, 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), 2013 : 25 - 28 June 2013, New Orleans, Louisiana. - Piscataway : IEEE Computer Society, 2013. - S. 73-82. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.12).
  4. M. Materzok, Axiomatizing subtyped delimited continuations, Computer Science Logic 2013 (CSL 2013) / Simona Ronchi Della Rocca (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.23).- S. 521-539. (http://dx.doi.org/10.4230/LIPIcs.CSL.2013.521).
  5. M. Biernacka, D. Biernacki, S. Lenglet, M. Materzok, Proving termination of evaluation for System F with control operators, Electronic Proceedings in Theoretical Computer Science. - Vol. 127 (2013), s. 15-29. (http://dx.doi.org/10.4204/EPTCS.127.2).
  6. A. Barecka, W. Charatonik, Parameterized complexity of basic decision problems for tree automata, International Journal of Computer Mathematics. - Vol. 90, iss. 6 (2013), s. 1150-1170. (http://dx.doi.org/10.1080/00207160.2012.762451).
  7. D. Biernacki, S. Lenglet, Environmental Bisimulations for Delimited-Control Operators, Proceedings of the 11th Asian Symposium on Programming Languages and Systems (APLAS 2013), pp., Melbourne, Australia, Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 8301). - S. 333-348. (http://dx.doi.org/ 10.1007/978-3-319-03542-0_24).

• Publikacje Zakładu Złożoności Obliczeniowej i Algorytmów w roku 2013

  1. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, Ł. Jeż, A. Jeż, G. Stachowiak, Collecting Weighted Items from a Dynamic Queue, Algorithmica, January 2013, Volume 65, Issue 1, pp 60-94. (http://dx.doi.org/10.1007/s00453-011-9574-6).
  2. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, Ł. Jeż, G. Stachowiak, A phi-competitive algorithm for collecting items with increasing weights from a dynamic queue, Theoretical Computer Science, Volume 475, 4 March 2013, Pages 92-102. (http://dx.doi.org/10.1016/j.tcs.2012.12.046).
  3. P. Gawrychowski, Alphabetic minimax trees in linear time, Computer Science - Theory and Applications : 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013, Proceedings / Andrei A. Bulatov, Arseny M. Shur (eds.). - Berlin : Springer, 2013. - (Lecture Notes in Computer Science ; 7913). - S. 36-48. (http://dx.doi.org/10.1007/978-3-642-38536-0_4).
  4. A. Jeż, Approximation of grammar-based compression via recompression, Combinatorial pattern matching : 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17 - 19, 2013 / Johannes Fischer, Peter Sanders (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7922). - S. 165-176. (http://dx.doi.org/10.1007/978-3-642-38905-4).
  5. A. Jeż, One-variable word equations in linear time, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7966). - S. 324-335. (http://dx.doi.org/10.1007/978-3-642-39212-2_30).
  6. A. Jeż, Recompression: a simple and powerful technique for word equations, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) / Natacha Portier, Thomas Wilke (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.20). - S. 233-244. (http://dx.doi.org/10.4230/LIPIcs.STACS.2013.233)
  7. A. Jeż, Recompression: word equations and beyond, Developments in language theory : 17th international conference ; proceedings, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013 / Marie-Pierre Béal ; Oliver Carton (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7907). - S. 12-26. (http://dx.doi.org/10.1007/978-3-642-38771- 5_2).
  8. T. Jurdziński, D. R. Kowalski, G. Stachowiak, Distributed deterministic broadcasting in wireless networks of weak devices, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7966). - S. 632-644. (http://dx.doi.org/10.1007/978-3- 642-39212-2_55).
  9. A. Kisielewicz, J. Kowalski, M. Szykuła, A fast algorithm finding the shortest reset words, 19th international conference ; proceedings / COCOON 2013, Hangzhou, China, June 21 - 23, 2013 / Ding-Zhu Du ; Guochuan Zhang (ed.). - Berlin ; Heidelberg : Springer, 2013. - (Lecture notes in computer science ; Vol.7936). - S. 182-196. (http://dx.doi.org/10.1007/978-3-642-38768-5_18).
  10. A. Kisielewicz, M. Szykuła, Generating small automata and the Černý conjecture, Implementation and Application of Automata : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / Stavros Konstantinidis (ed.). - Berlin, Heidelberg : Springer , 2013. - (Lecture Notes in Computer Science ; Vol.7982).- S. 340-348. (http://dx.doi.org/10.1007/978-3-642-39274-0_30).
  11. J. Kowalski, M. Szykuła, Game description language compiler construction, AI 2013: Advances in Artificial Intelligence : 26th Australian Joint Conference, Dunedin, New Zealand, December 1-6, 2013. Proceedings. - Cham : Springer International Publishing, 2013. - (Lecture Notes in Computer Science ; Vol.8272). - S. 234-245. (http://dx.doi.org/10.1007/978-3-319-03680-9_26).
  12. A. Jeż, A. Maletti, Hyper-minimization for deterministic tree automata, International Journal of Foundations of Computer Science. - Vol. 24, iss. 06 (2013), s. 815-830. (http://dx.doi.org/10.1142/S0129054113400200).
  13. T. Jurdziński, G. Stachowiak, Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks, Fundamentals of Computation Theory - 19th International Symposium (FCT 2013) : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.8070). - s. 195-209. (http://dx.doi.org/10.1007/978-3-642-40164-0_20).
  14. T. Jurdziński, D. R. Kowalski, M. Różański, G. Stachowiak, Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. Distributed Computing, 27th International Symposium (DISC 2013), : Springer 2013. - (Lecture Notes in Computer Science Volume 8205). s. 373-387. (http://dx.doi.org/10.1007/978-3-642-41527-2_26).
  15. P. Gawrychowski, D. Straszak, Beating O(nm) in Approximate LZW-Compressed Pattern Matching, 24th International Symposium, ISAAC 2013, Algorithms and Computation - Springer 2013 (Lecture Notes in Computer Science Vol. 8283, s. 78-88. (http://dx.doi.org/10.1007/978-3-642-45030-3_8).
  16. P. Gawrychowski, Optimal pattern matching in LZW compressed strings, ACM Transactions on Algorithms. - Vol. 9, iss.3 (2013), nr art. 25 (17 str.). (http://dx.doi.org/10.1145/2483699.2483705).
  17. A. Jeż, A. Okhotin, Unambiguous conjunctive grammars over a one-letter alphabet, Developments in Language Theory : 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings / Marie-Pierre Béal, Olivier Carton (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture notes in computer science ; 7907). - S. 277-288. ( http://www.dx.doi.org/10.1007/978-3-642-38771-5_25).

• Publikacje Zakładu Inżynierii Oprogramowania w roku 2013

  1. Z. Płoski, Algorytmy bez tajemnic, Thomas H. Cormen ; tł. Zdzisław Płoski. - Gliwice : Helion, 2013. - 224 s.
  2. L. Grocholski, Stymulowanie innowacyjności poprzez politykę podatkową, E-gospodarka Problemy, Metody, Aplikacje, Uniwersytet Szczeciński Zeszyty Naukowe nr 781 Ekonomiczne Problemy Usług nr 106, Szczecin 2013, s. 189-199, ISSN 1640-6818, ISSN 1896-382X.

• 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).

• Publikacje Zakładu Teorii Informatyki i Baz Danych w roku 2013

  1. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10).
  2. P. Guagliardo, P. Wieczorek, Query processing in data integration, Data Exchange, Integration, and Streams / Phokion G. Kolaitis and Maurizio Lenzerini and Nicole Schweikardt (Eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (Dagstuhl Follow-Ups ; Vol. 5).- S. 129-160. (http://dx.doi.org/10.4230/DFU.Vol5.10452.129).
  3. T. Gogacz, J. Marcinkowski, Converging to the Chase - A Tool for Finite Controllability, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, s. 540-549. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.61).
  4. T. Gogacz, J. Marcinkowski, On the BDD/FC conjecture, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June // s. 22 - 27, ACM 2013 ISBN 978-1-4503-2066-5: 127-138.
  5. T. A. Henzinger, J. Otop, From Model Checking to Model Measuring, Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, Springer 2013, (Lecture Notes in Computer Science Vol. ), s. 273-287. (http://dx.doi.org/ 10.1007/978-3-642-40184-8_20).
  6. J. Michaliszyn, J. Otop, Elementary Modal Logics over Transitive Structures, Computer Science Logic 2013 CSL 2013, Torino, Italy, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 23 of LIPIcs s. 563-577. (http://dx.doi.org/10.1007/978-3-642-40184-8_20).
  7. J. Otop, K. Chatterjee, T. A. Henzinger, A. Pavlogiannis, Distributed synthesis for LTL fragments, Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013, IEEE, s. 18-25. (https://repository.ist.ac.at/130/1/Distributed_Synthesis.pdf).

• Publikacje Pracowni Grafiki Komputerowej w roku 2013

  W. Tarnawski, V. Kurtcuoglu, P. Lorek, M. Bodych, J. Rotter, M. Muszkieta, D. Poulikakos, M. Majkowski, A. Ferrari, Ł. Piwowar, A robust algorithm for segmenting and tracking clustered cells in time-lapse fluorescent microscopy, IEEE Journal of Biomedical and Health Informatics. - Vol. 17, iss. 4 (2013), s. 862 - 869. (http://dx.doi.org/10.1109/JBHI.2013.2262233).

• Publikacje Zakładu Inteligencji Obliczeniowej w roku 2013

  P. Filipiak, K. Michalak, P. Wnuk-Lipiński, Usage Patterns of Trading Rules in Stock Market Trading Strategies Optimized with Evolutionary Methods, Applications of Evolutionary Computation, Springer 2013, (Lecture Notes in Computer Science, vol. 7835), s.234-243. (http://dx.doi.org/10.1007/978-3-642-37192-9_24).

• Publikacje Pracowników niezależnych w roku 2013

  1. M. M. Sysło, Learning while we are connected, WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013 Vol. 1, Research Papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagienë, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013.
  2. M. M. Sysło, Uczyć się będąc połączonym, IwE 2013 : X konferencja "Informatyka w Edukacji", 5-7 lipca 2013, UMK Toruń : teksty wystąpień / red. Maciej M. Sysło, Anna Beata Kwiatkowska. - Toruń : Nicolaus Copernicus University Press, 2013.
  3. M. Berndt-Schreiber, A. B. Kwiatkowska, A. Polewczyński, K. Skowronek, M. M. Sysło, Teacher training one the way to e-teacher qualifications, Learning while we are connected : WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013. Vol. 2, Practice papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagienë, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013. - S. 199-207.
  4. A. B. Kwiatkowska, M. M. Sysło, E-teacher standards and certificates, Learning while we are connected : WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013. Vol. 2, Practice papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagiene, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013. - S. 145-151.
  5. A. B. Kwiatkowska, M. M. Sysło, Ocena pracy nauczyciela i wspomaganie jego rozwoju w zakresie technologii informacyjno-komunikacyjnej, Uczyć się będąc połączonym : IwE 2013 : X konferencja "Informatyka w Edukacji", 5-7 lipca 2013, UMK Toruń : teksty wystąpień / red. Maciej M. Sysło, Anna Beata Kwiatkowska. - Toruń : Nicolaus Copernicus University Press, 2013. - S. 164-167.
  6. M. Nowicki, M. Matuszak, A. B. Kwiatkowska, P. Bała, M. M. Sysło, Teaching secondary school students programming using distance learning: a case study, Learning while we are connected : WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013. Vol. 2, Practice papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagiene, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013.- S. 246-254.

• Publikacje Zakładu Metod Numerycznych w roku 2012

  1. P. Keller, S. Lewanowicz, P. Woźny, Polynomial approximation of rational Bezier curves with constraints, Numerical Algorithms 59 (2012), 607-622. (http://dx.doi.org/10.1007/s11075-011-9507-0).
  2. P. Keller, A practical algorithm for computing Cauchy principal value integrals of oscillatory functions, Applied Mathematics and Computation 218 (2012), 4988-5001. (http://dx.doi.org/10.1016/j.amc.2011.10.064).
  3. P. Woźny, Simple algorithms for computing the Bezier coefficients of the constrained dual Bernstein polynomials, Applied Mathematics and Computation 219 (2012), 2521-2525. (http://dx.doi.org/10.1016/j.amc.2012.08.087 ).
  4. R. Nowak, A method of convergence acceleration of some continued fractions II, Numerical Algorithms, 64(4), 2013. (http://link.springer.com/article/10.1007/s11075-012-9642-2).
  5. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, System wspomagania harmonogramowania przedsięwzięć budowlanych, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2012, RK.
  6. W. Bożejko, M. Uchroński, M. Wodecki, Elastyczny problem gniazdowy - równoległy algorytm przeszukiwania z tabu dla multi-GPU, Automatyzacja Procesów Dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), Tom I, Gliwice (2012), 15-22, RK.
  7. W. Bożejko, M. Uchroński, M. Wodecki, Wielomaszynowy problem szeregowania zadań z przezbrojeniami, Automatyzacja Procesów Dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), Tom I, Gliwice (2012), 23-31, RK.
  8. W. Bożejko, Z. Hejducki, M. Wodecki, Harmonogramowanie robót budowlanych, Optymalizacja dyskretna w informatyce, automatyce i robotyce, (red. W.Bożejo, J.Pempera), Wydawnictwo Politechniki Wrocławskiej, Wrocław 2012, 195-219, RK.
  9. M. Uchroński, M. Wodecki, Elastyczne systemy produkcyjne, Optymalizacja dyskretna w informatyce, automatyce i robotyce, (red. W.Bożejo, J.Pempera), Wydawnictwo Politechniki Wrocławskiej, Wrocław 2012, 221-255, RK.
  10. A. Bartkowiak, R. Zimroz, Multidimensional data analysis for condition monitoring: features selection and data classification, CM 2012 / MFPT 2012 - The Ninth International Conference on Condition Monitoring and Machinery Failure Prevention Technologies. Electronic Proceedings, [CD-ROM], Paper 402, pp. 1-12. ISBN 978-1-901892-36-9. Publisher: Coxmoor Publishing Co., Oxfordshire, 2012, RK.
  11. A. Bartkowiak, R. Zimroz, Curvilinear component analysis in search of dimensionality and structure of some gearbox data, Proceedings of the Federated Conference on Computer Science and Information Systems - FedCSIS 2012, September 9 - 12, 2012, Wroclaw, Poland / M. Ganzha, L. Maciaszek, M. Paprzycki, (eds). - Warszawa : Polskie Towarzystwo Informatyczne, 2012.- S. 27-34. (http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6330483).
  12. A. Bartkowiak, R. Zimroz, Data dimension reduction and visualization with application to multi-dimensional gearbox diagnostics data: comparison of several methods, Solid State Phenomena. - Vol. 180 (2012), s. 177-184. (http://www.dx.doi.org/10.4028/www.scientific.net/SSP.180.177).
  13. A. Bartkowiak, R. Zimroz, Curvilinear dimensionality reduction of data for gearbox condition monitoring, Przeglad Elektrotechniczny . - R. 88, nr 10b (2012), s. 268-271. (http://pe.org.pl/issue.php?lang=0).
  14. W. Bożejko, S. Jagiełło, M. Wodecki, A survey of parallel local search methods application in scheduling and logistics, Proceedings of the International Conference on ICT Management for Global Competitiveness and Economic Growth in Emerging Economies ICTM 2012, 214-232, RK.
  15. W. Bożejko, Z. Hejducki, M. Wodecki, Applying metaheuristic strategies in construction projects management, Journal of Civil Engineering and Management, Taylor & Francis, (2012) Volume 18(5), 621-630, RF.
  16. W. Bożejko, M. Uchroński, M. Wodecki, Parallel Cost Function Determination on GPU for the Job Shop Scheduling Problem, Proceedings of PPAM 2011, Lecture Notes in Computer Science No. 7204, Springer (2012), 1-10,RK.
  17. W. Bożejko, M. Uchroński, M. Wodecki, Solving the Flexible Job Shop Problem on Multi-GPU, Proceedings of ICCS 2012, Procedia Computer Science, Elsevier, 9 (2012) 2020 - 2023, RK.
  18. W. Bożejko, M. Uchroński, M. Wodecki, Solving the flexible job shop problem on GPU, Proceedings of ICAISC 2012, Lecture Notes in Artificial Intelligence No. 7268, Springer (2012), 387-394, RK.
  19. W. Bożejko, M. Uchroński, M. Wodecki, Fast parallel cost function calculation for the flow shop scheduling problem, Proceedings of ICAISC 2012, Lecture Notes in Artificial Intelligence No. 7268, Springer (2012), 378-386, RK.
  20. W. Bożejko, M. Uchroński, M. Wodecki, Multi-machine scheduling problem with setup limes, Archives of Control Sciences, Volume 22(LVIII), No. 4, 2012, R.
  21. W. Bożejko, M. Uchroński, M. Wodecki, Flexible job shop problem - parallel tabu serach algorithm for multi-GPU, Archives of Control Sciences, Volume 22(LVIII), No. 4, 2012, R.
  22. W. Bożejko, Z. Hejducki, P. Rajba, M. Wodecki, Algorytm memetyczny dla pewnego problemu potokowego w budownictwie, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2012, 251-262, RK.
  23. W. Bożejko, P. Rajba, M. Wodecki, Arrangement Algorithms Stability with Probabilistic Parameters of Tasks, Proceedings of APCAST 2012, 14th International Asia Pacific Conference on Computer Aided System Theory, 6th to 8th February, 2012, Sydney, Australia (2012) 120-122, RK.
  24. W. Bożejko, P. Rajba, M. Wodecki, Scheduling problem with uncertain parameters, Proceedings of the International Conference on ICT Management for Global Competitiveness and Economic Growth in Emerging Economies ICTM 2012, 262-273, RK.
  25. P. Wnuk-Lipiński, Parallel evolutionary algorithms for stock market trading rule selection on many-core graphics processors, Natural computing in computational finance. Vol. 4 / Anthony Brabazon, Michael O'Neill and Dietmar Maringer (Eds.). - Berlin, Heidelberg : Springer, 2012.- (Studies in Computational Intelligence ; 380).- S. 79-92. (http://dx.doi.org/10.1007/978-3-642-23336-4_5).
  26. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, A predictive evolutionary algorithm for dynamic constrained inverse kinematics problems, Hybrid Artificial Intelligent Systems : 7th International Conference, HAIS 2012, Salamanca, Spain, March 28-30th, 2012. Proceedings, Part I / Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michal Woźniak, Manuel Grana, Sung-Bae Cho (Eds.). - Berlin, Heidelberg : Springer, 2012. - (Lecture Notes in Artificial Intelligence ; nr 7208).- S. 610-621. (http://dx.doi.org/10.1007/978-3-642-28942-2_55).
  27. P. Filipiak, P. Wnuk-Lipiński, Parallel CHC Algorithm for Solving Dynamic Traveling Salesman Problem Using Many-Core GPU, Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science, vol. 7557, Springer, 2012,pp.305-314, RK.
  28. P. Rajba, M. Wodecki, Stability of scheduling with random processing times on one machine, Applicationes Mathematicae. - Vol. 39, nr 2 (2012), s. 169-183.

• Publikacje Zakładu Języków Programowania w roku 2012

  1. J. Otop, E-unification with Constants vs. General E-unification, Journal of Automated Reasoning, Vol. 48 No. 3 (2012), 363-390. (http://dx.doi.org/10.1007/s10817-010-9201-2).
  2. D. Biernacki, S. Lenglet, Applicative bisimulations for delimited-control operators, Foundations of software science and computational structures : 15th international conference FOSSACS 2012, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012 : proceedings / Lars Birkedal (ed.). - Berlin ; Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7213).- S. 119-134. (http://dx.doi.org/10.1007/978-3-642-28729-9).
  3. D. Biernacki, M. Materzok, A Dynamie Interpretation of the CPS Hierarchy, R. Jhala and A. Igarashi, editors, Proceedings of the l0th Asian Symposium on Programming Languages and Systems (APLAS 2012), Kyoto, Japan, December 2012. (http://www.ii.uni.wroc. pl/~dabi/publications/APLAS12/materzok-biernacki-aplasl2.pdf).
  4. D. Biernacki, S. Lenglet, Normal Form Bisimulations for Delimited-Control Operators, T. Shrijvers and P. Thiemann, editors, Proceedings of the 11th International Symposium on Functional and Logic Programming (FLOPS 2012), Kobe, Japan, May 2012. (http: //www.ii.uni.wroc.pl/~dabi/publications/FL0PS12/biernacki-lenglet -flopsl2.pdf.).
  5. L. Grocholski, Specyfikowanie wymagań jako bariera wdrażania systemów klasy B2B, Metody Informatyki Stosowanej. - 2011, nr 5 (2012), s. 35-48.
  6. J. Michaliszyn, J. Otop, Decidable elementary modal logics, 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 25-28 June 2012, Dubrovnik, Croatia : proceedings /Rajeev Alur (ed.). - Los Alamitos : IEEE Computer Society, 2012.- S. 491-500. (http://dx.doi.org/10.1109/LICS.2012.59).
  7. E. Kieroński, J. Michaliszyn, Two-variable universal logic with transitive closure, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France / Patrick Cégielski, Arnaud Durand (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.16).- S. 396-410. (http://dx.doi.org/10.4230/LIPIcs.CSL.2012.396).
  8. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability vs. finite satisfiability in elementary modal logics, Electronic Proceedings in Theoretical Computer Science. - Vol. 96 (2012), s. 141-154. (http://dx.doi.org/10.4204/EPTCS.96.11).
  9. S. Staworko, P. Wieczorek, Learning twig and path queries, EDBT/ICDT 2012 Joint Conference : Electronic Conference Proceedings : March 26-30, 2012, Berlin, Germany / Ismail Ari (ed.). - Berlin : ACM, 2012. (http://www.edbt.org/Proceedings/2012-Berlin/papers/icdt/a20-Staworko.pdf).
  10. E. Kieroński, M. Otto, Small substructures and decidability issues for first-order logic with two variables, Journal of Symbolic Logic. - Vol. 77, iss. 3 (2012), s. 729-765. (http://projecteuclid.org/DPubS?service=UI).
  11. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable first-order logic with equivalence closure, Proceedings of the 27th Annual ACM/IEEE Symposium on Logic in Computer Science ; 25-28 June 2012, Dubrovnik, Croatia. - Los Alamitos : IEEE Computer Society, 2012.- S. 431-440. (http://dx.doi.org/10.1109/LICS.2012.53).
  12. E. Kieroński, J. Michaliszyn, Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames, AIML 2012. 27th Annual Symposium on Advances in Modal Logic. Copenhagen, Denmark, August 25-28, 2012. Proceedings, pages 464-482, RK.
  13. S. Staworko, J. Chomicki, J. Marcinkowski, Prioritized repairing and consistent query answering in relational databases, Annals of Mathematics and Artificial Intelligence . 64(2-3): 209-246 (2012), RF.
  14. J. Michaliszyn, P. Wieczorek, A. Muscholl, S. Staworko, Z. Wu, On Injective Embeddings of Tree Patterns, (http://arxiv.org/pdf/1204.4948).
  15. A. Kościelski, Uwagi o indukcji matematycznej, Matematyka. - R. 65, nr 5 (2012), s. 25-31.

• Publikacje Zakładu Złożoności Obliczeniowej i Algorytmów w roku 2012

  1. P. Gawrychowski, Tying up the loose ends in fully LZW-compressed pattern matching, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol. 14 ).- S. 624- 635. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.624).
  2. A. Jeż, Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P), 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.14). - S. 136- 147. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.136).
  3. P. Gawrychowski, Faster algorithm for computing the edit distance between SLP-compressed strings, String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012, Proceedings / Liliana Calderón- Benavides, Cristina González-Caro, Edgar Chávez,Nivio Ziviani (eds.). - Berlin : Springer Berlin , 2012. - (Lecture Notes in Computer Science ; 7608).- S. 229-236. (http://dx.doi.org/10.1007/978-3-642-34109-024).
  4. P. Gawrychowski, Simple and efficient LZW-compressed multiple pattern matching, Combinatorial pattern matching : 23rd annual symposium ; proceedings / CPM 2012, Helsinki, Finland, July 3 - 5, 2012 / Juha Karkkainen, Jens Stoye (eds.). - Berlin ; Heidelberg : Springer , 2012. - (Lecture Notes in Computer Science ; 7354).- S. 232-242. (http://dx.doi.org/10.1007/978-3-642-31265-619).
  5. A. Jeż, Faster fully compressed pattern matching by recompression, Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I / ed. by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer. - Berlin, Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7391). - S. 533-544. (http://dx.doi.org/10.1007/978-3- 642-31594-7_45).
  6. A. Jeż, A. Okhotin, On the number of nonterminal symbols in unambiguous conjunctive grammars, Descriptional Complexity of Formal Systems : 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012 : proceedings / ed. by Martin Kutrib, Nelma Moreira, Rogério Reis. - Berlin, Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7386). - S. 183-195. (http://dx.doi.org/10.1007/978-3-642-31623-4_14).
  7. A. Jeż, A. Maletti, Hyper-minimization for deterministic tree automata, Implementation and Application of Automata : 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012 : proceedings / ed. by Nelma Moreira, Rogério Reis. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. - (Lecture Notes in Computer Science ; 7381). - S. 217-228. (http://dx.doi.org/10.1007/978-3-642- 31606-7_19).
  8. C. Dürr, Ł. Jeż, N. K. Thang, Online scheduling of bounded length jobs to maximize throughput, Journal of Scheduling October 2012, Volume 15, Issue 5, pp 653-664 (http://dx.doi.org/10.1007/s10951-011-0233-1).
  9. Ł. Jeż, F. Li, J. Sethuraman, C. Stein, Online scheduling of packets with agreeable deadlines, Journal ACM Transactions on Algorithms (TALG) Volume 9 Issue 1, December 2012 Article No. 5, ACM New York, NY, USA (http://doi.acm.org/10.1145/2390176.2390181).
  10. L. Epstein, Ł. Jeż, J. Sgall, R. van Stee, Online Scheduling of Jobs with Fixed Start Times on Related Machines, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science Volume 7408, 2012, pp 134-145 (http://dx.doi.org/10.1007/978-3-642-32512-0_12).
  11. A. Jeż, A. Okhotin, Representing hyper-arithmetical sets by equations over sets of integers, Theory of Computing Systems. - Vol. 51, nr 2 (2012), s. 196-228. (http://dx.doi.org/10.1007/s00224-011-9352-5).
  12. A. Jeż, T. Jurdziński, Length-reducing Automata (almost) without Auxiliary Symbols, Journal of Automata, Languages and Combinatorics, Otto-von-Guericke-Universitat, 16(2-4): 141-164 (2011); RK.
  13. T. Jurdziński, D. R. Kowalski, Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks, Distributed Computing - 26th International Sympodium (DISC 2012), LNCS 7611, Springer, 2012, 106-120; RK.
  14. T. Jurdziński, D. R. Kowalski, On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks, 16th International Conference On Principles Of Distributed Systems (OPODIS 2012), LNCS 7702, Springer, 2012, 209-224;RK.
  15. K. Paluch, K. Elbassioni, A. van Zuylen, Simpler approximation of the maximum asymmetric traveling salesman problem, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; 14).- S. 501-506. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.501).
  16. K. Paluch, Faster and simpler approximation of stable matchings, Approximation and online algorithms : 9th international workshop ; revised selected papers : WAOA 2011, Saarbruecken, Germany, September 8-9, 2011 / (ed.)Roberto Solis-Oba, Giuseppe Persiano. - Berlin ; Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7164). - S. 176-187.
  17. J. Byrka, K. Buchin, M. Buchin, M. Nöllenburg, Y. Okamoto, R. I. Silveira, Drawing (complete) binary tanglegrams : hardness, approximation, fixed-parameter tractability, Algorithmica. - Vol. 62, nr 1-2 (2012), s. 309-332. (http://dx.doi.org/10.1007/s00453-010-9456-3).
  18. M. Bieńkowski, T. Jurdziński, M. Korzeniowski, D. R. Kowalski, Distributed Online and Stochastic Queuing on a Multiple Access Channel, 26 Int. Symposum on DIStributed Computing (DISC), Lecture Notes in Computer Science vol. 7611, 121-135, 2012. (http://www.ii.uni.wroc.pl/~mbi/papers/2012-disc-online-mac.pdf).
  19. M. Bieńkowski, Migrating and Replicating Data in Networks Computer Science, Research and Development, vol. 27, issue 3, 169-179, 2012. Wyd.: Springer. (http://www.ii.uni.wroc.pl/~mbi/papers/2012-csrd-migration-replication-survey.pdf).
  20. M. Bieńkowski, J. Kutyłowski, The k-Resource Problem in Uniform Metric, Spaces, Theoretical Computer Science, vol. 459,42-54,2012. Wyd.: Elsevier. (http://www.sciencedirect.com/science/article/pii/S0304397512006214).