Publikacje

Instytut Informatyki

2017

• Marzena Kryszkiewicz, Annalisa Appice, Dominik Ślęzak, Henryk Rybiński, Andrzej Skowron i Zbigniew Raś (red.), Foundations of Intelligent Systems. 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings, Springer, Cham 2017.zobacz w PBN
• Wei Shi, Therese Vu, Didier Boucher, Anna Biernacka, Jules Nde, Raj K. Pandita, Jasmin Straube, Glen M. Boyle, Fares Al-Ejeh, Purba Nag, Jessie Jeffery, Janelle L. Harris, Amanda L. Bain, Marta Grzelak, Magdalena Skrzypczak, Abhishek Mitra, Norbert Dojer, Nicola Crosetto, Nicole Cloonan, Olivier J. Becherel, John Finnie, Jeffrey R. Skaar, Carl R. Walkley, Tej K. Pandita, Maga Rowicka, Krzysztof Ginalski, Steven W. Lane i Kum Kum Khanna, Ssb1 and Ssb2 cooperate to regulate mouse hematopoietic stem and progenitor cells by resolving replicative stress, Blood 129 (18) 2017, s. 2479–2492.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski i Wojciech Rytter, Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Algorithmica 77 (4) 2017, s. 1194–1215.zobacz w PBN
• Ali Rezaei Divroodi i Anh Linh Nguyen, On directed simulations in description logics, Journal Of Logic And Computation 27 (7) 2017, s. 1955–1986.zobacz w PBN
• Marcin Konrad Dziubiński i Sanjeev Goyal, How do you defend a network?, Theoretical Economics 12 (1) 2017, s. 331–376.zobacz w PBN
• Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartosz Klin i Michał Szynwelski, Learning nominal automata, w: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, ACM, 2017, s. 613–625.zobacz w PBN
• Adam Gudyś, Andrzej Piotr Janusz, Marek Sikora, Tomasz Stęclik, Dominik Ślęzak i Łukasz Wróbel, Moduł analityczny, w: Zintegrowany, szkieletowy system wspomagania decyzji dla systemów monitorowania procesów, urządzeń i zagrożeń, Politechnika Śląska i Instytut technik Innowacyjnych EMAG, Gliwice 2017, r. 5, s. 55–75.zobacz w PBN
• Nathanael Fijalkow, Bartosz Klin i Prakash Panangaden, Expressiveness of Probabilistic Modal Logics, Revisited, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 105, s. 1–12.zobacz w PBN
• Przemysław Przybyszewski, Szymon Dziewiątkowski, Sebastian Jaszczur, Mateusz Śmiech i Marcin Szczuka, Use of Domain Knowledge and Feature Engineering in Helping AI to Play Hearthstone, w: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3-6, 2017., IEEE, 2017, s. 143–148.zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Aleksander Socała i Marcin Wrochna, Tight Lower Bounds for the Complexity of Multicoloring, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 18:1–18:14.zobacz w PBN
• Marek Grzegorowski, Andrzej Piotr Janusz, Dominik Ślęzak i Marcin Szczuka, On the role of feature space granulation in feature selection processes, w: 2017 IEEE International Conference on Big Data (Big Data), 2017, s. 1806–1815.zobacz w PBN
• Lech Polkowski, Yiyu Yao, Piotr Artiemjew, Davide Ciucci, Liu Dun, Dominik Ślęzak i Beata Zielosko (red.), Rough Sets. International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3–7, 2017, Proceedings, Part I, Springer, Cham, Switzerland 2017.zobacz w PBN
• Sławomir Lasota, Equivariant algorithms for constraint satisfaction problems over coset templates, Information Processing Letters 118 2017, s. 44–52.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, String Powers in Trees, Algorithmica 79 (3) 2017, s. 814–834.zobacz w PBN
• Michał Przybyłek, Adam Wierzbicki i Zbigniew Michalewicz, Decomposition Algorithms for a Multi-Hard Problem, Evolutionary Computation 2017, s. 1–27.zobacz w PBN
• Jarosław Andrzej Paszek i Paweł Górecki, New Algorithms for the Genomic Duplication Problem, Lecture Notes In Computer Science 10562 2017, s. 101–115.zobacz w PBN
• Michael B. Cohen, Aleksander Mądry, Piotr Sankowski i Adrian Vladu, Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m^10/7 log W) Time, w: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Society for Industrial and Applied Mathematics, 2017, s. 752–771.zobacz w PBN
• Andrzej Piotr Janusz, Marek Grzegorowski, Michał Kozielski, Zdzisław Krzystanek, Marek Sikora, Dominik Ślęzak i Łukasz Wróbel, Przykłady zastosowania systemu DISESOR w analizie i predykcji zagrożeń, w: Zintegrowany, szkieletowy system wspomagania decyzji dla systemów monitorowania procesów, urządzeń i zagrożeń, Politechnika Śląska i Instytut technik Innowacyjnych EMAG, Gliwice 2017, r. 11, s. 199–213.zobacz w PBN
• Marcin Bieńkowski, Jarosław Byrka i Marcin Ireneusz Mucha, Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 13, s. 1–14.zobacz w PBN
• Andrzej Piotr Janusz, Tomasz Tajmajer i Maciej Świechowski, Helping AI to Play Hearthstone: AAIA'17 Data Mining Challenge, w: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3-6, 2017., IEEE, 2017, s. 121–125.zobacz w PBN
• Jacob Holm, Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Eva Rotenberg i Piotr Sankowski, Contracting a Planar Graph Efficiently, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 50:1–50:15.zobacz w PBN
• Dominik Ślęzak, Agnieszka Chądzyńska-Krasowska, Joel Holland, Piotr Synak, Rick Glick i Marcin Perkowski, Scalable cyber-security analytics with a new summary-based approximate query engine, w: 2017 IEEE International Conference on Big Data (Big Data), 2017, s. 1840–1849.zobacz w PBN
• Lech Polkowski, Yiyu Yao, Piotr Artiemjew, Davide Ciucci, Dun Liu, Dominik Ślęzak i Beata Zielosko (red.), Rough Sets International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3–7, 2017, Proceedings, Part II, Springer, Cham 2017.zobacz w PBN
• Amihood Amir, Costas S. Iliopoulos i Jakub Jan Radoszewski, Two strings at Hamming distance 1 cannot be both quasiperiodic, Information Processing Letters 128 2017, s. 54–57.zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk i Arkadiusz Aleksander Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica 79 (1) 2017, s. 159–188.zobacz w PBN
• Anh Linh Nguyen, Thi Hong Khanh Nguyen, Ngoc Thanh Nguyen i Quang-Thuy Ha, Bisimilarity for paraconsistent description logics, Journal Of Intelligent & Fuzzy Systems 32 (2) 2017, s. 1203–1215.zobacz w PBN
• Paweł Górecki, Alexey Markin, Agnieszka Mykowiecka, Jarosław Andrzej Paszek i Oliver Eulenstein, Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees, Lecture Notes In Computer Science 10330 2017.zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk, Saket Saurabh i Marcin Wrochna, Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, w: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Society for Industrial and Applied Mathematics, 2017, s. 1419–1432.zobacz w PBN
• Loan TT Nguyen, Sinh Hoa Nguyen i Hung Son Nguyen, A Dynamic Packed Approach for Analytic Data Warehouse in Ad-Hoc Queries, w: Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017, Springer International Publishing, 2018, s. 205–213.zobacz w PBN
• Wojciech Czerwiński, Charles Paperman, Lorenzo Clemente i Sławomir Lasota, Regular Separability of Parikh Automata, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, s. 117:1–117:13.zobacz w PBN
• Iwona Szulc, Krzysztof Stencel i Piotr Wiśniewski, Using Genetic Algorithms to Optimize Redundant Data, w: Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation - 13th International Conference, BDAS 2017, Ustroń, Poland, May 30 - June 2, 2017, Proceedings, Springer, 2017, s. 165–176.zobacz w PBN
• Daniel Marx i Marcin Pilipczuk, Subexponential Parameterized Algorithms for Graphs of Polynomial Growth, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 59:1–59:15.zobacz w PBN
• Eryk Kopczyński, Dorota Teresa Celińska i Marek Čtrnáct, HyperRogue: Playing with Hyperbolic Geometry, w: Proceedings of Bridges 2017: Mathematics, Art, Music, Architecture, Education, Culture, Tessellations Publishing, Phoenix, Arizona 2017, s. 9–16.zobacz w PBN
• Amit P. Sheth, Axel Ngonga, Yin Wang, Elizabeth Chang, Dominik Ślęzak, Bogdan Franczyk, Rainer Alt, Xiaohui Tao i Rainer Unland (red.), Proceedings of the International Conference on Web Intelligence, Leipzig, Germany, August 23-26, 2017, ACM, 2017.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski i Wojciech Rytter, Fast algorithms for Abelian periods in words and greatest common divisor queries, Journal Of Computer And System Sciences 84 2017, s. 205–218.zobacz w PBN
• Marcin Pilipczuk, Michał Pilipczuk i Marcin Wrochna, Edge Bipartization Faster than 2^k, Algorithmica 2017.zobacz w PBN
• M. A. Ciach, Mateusz Łącki, Błażej Miasojedow, F. Lermyte, D. Valkenborg, F. Sobott i Anna Gambin, Estimation of Rates of Reactions Triggered by Electron Transfer in Top-Down Mass Spectrometry, Journal Of Computational Biology 2017.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques, Lecture Notes In Computer Science 10167 2017, s. 217–227.zobacz w PBN
• Bart M. P. Jansen i Marcin Pilipczuk, Approximation and Kernelization for Chordal Vertex Deletion, w: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Society for Industrial and Applied Mathematics, 2017, s. 1399–1418.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, Learning in Comparator Networks, w: Advances in Fuzzy Logic and Technology 2017: Proceedings of: EUSFLAT- 2017 -- The 10th Conference of the European Society for Fuzzy Logic and Technology, September 11-15, 2017, Warsaw, Poland IWIFSGN'2017 -- The Sixteenth International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, September 13-15, 2017, Warsaw, Poland, Volume 2, Springer International Publishing, 2018, s. 316–327.zobacz w PBN
• Archontia Giannopoulou, Michał Pilipczuk, Jean-florent Raymond, Dimitrios M. Thilikos i Marcin Wrochna, Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 57, s. 57:1–57:15.zobacz w PBN
• Jacek Sroka, Artur Leśniewski, Mirosław Kowaluk, Krzysztof Stencel i Jerzy Paweł Tyszkiewicz, Towards minimal algorithms for big data analytics with spreadsheets, w: Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2017, Chicago, IL, USA, May 19, 2017, ACM, 2017, s. 1:1–1:4.zobacz w PBN
• Parinya Chalermsook, Marek Adam Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai i Luca Trevisan, From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More, w: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, 2017, s. 743–754.zobacz w PBN
• Dorota Teresa Celińska i Eryk Kopczyński, Programming Languages in GitHub: A Visualization in Hyperbolic Plane, w: Proceedings of the Eleventh International Conference on Web and Social Media, ICWSM 2017, Montreal, Quebec, Canada, May 15-18, 2017, AAAI Press, 2017, s. 727–728.zobacz w PBN
• Piotr Prokopowicz, Jacek Czerniak, Dariusz Mikołajewski, Łukasz Apiecionek i Dominik Ślęzak (red.), Theory and Applications of Ordered Fuzzy Numbers: A Tribute to Professor Witold Kosiński, Springer, 2017.zobacz w PBN
• Wojciech Czerwiński, Claire David, Katja Losemann i Wim Martens, Deciding definability by deterministic regular expressions, Journal Of Computer And System Sciences 88 2017, s. 75–89.zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen i Ngoc Thanh Nguyen, Extending Query-Subquery Nets for Deductive Databases under the Well-Founded Semantics, Cybernetics And Systems 48 (3) 2017, s. 249–266.zobacz w PBN
• Michał Startek, Jakub Nogły, Agnieszka Gromadka, Dariusz Grzebelus i Anna Gambin, Inferring transposons activity chronology by TRANScendence -- TEs database and de-novo mining tool, Bmc Bioinformatics 18 (12) 2017, s. 422.zobacz w PBN
• Grzegorz Skoraczyński, Piotr Dittwald, Błażej Miasojedow, Sara Szymkuć, Ewa Gajewska, Bartosz Grzybowski i Anna Gambin, Predicting the outcomes of organic reactions via machine learning: are current descriptors sufficient?, Scientific Reports Of The Nature Publishing Group 7 (1) 2017.zobacz w PBN
• Oskar Skibski, Tomasz Michalak i Talal Rahwan, Axiomatic Characterization of Game-Theoretic Network Centralities, w: Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-17), 2017, s. 698–705.zobacz w PBN
• Paweł Markowski i Michał Przybyłek, Process mining methods for post-delivery validation, w: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, Polskie Towarzystwo Informatyczne, Warszawa 2017, s. 1199–1202.zobacz w PBN
• Hugo Gimbert, Edon Kelmendi i Mikołaj Bojańczyk, Emptiness of Zero Automata Is Decidable, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, s. 106:1–106:13.zobacz w PBN
• Paweł Parys, Intersection Types and Counting, w: Proceedings Eighth Workshop on Intersection Types and Related Systems, ITRS 2016, Porto, Portugal, 26th June 2016, 2017, s. 48–63.zobacz w PBN
• Henryk Michalewski, Andrzej Nagórko i Jakub Pawlewicz, An upper bound of 84 for Morpion Solitaire 5D, w: Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada, Simon Fraser University, Vancouver, British Columbia, Canada 2017, s. 270–278.zobacz w PBN
• Krzysztof Apt, Eryk Kopczyński i Dominik Wojtczak, On the Computational Complexity of Gossip Protocols, w: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, ijcai.org, 2017, s. 765–771.zobacz w PBN
• Guoyin Wang, Andrzej Skowron, Yiyu Yao, Dominik Ślęzak i Lech Polkowski (red.), Thriving Rough Sets : 10th Anniversary - Honoring Professor Zdzisław Pawlak's Life and Legacy & 35 Years of Rough Sets, Springer, 2017.zobacz w PBN
• Diego Cerdeiro, Marcin Konrad Dziubiński i Sanjeev Goyal, Individual Security, Contagion, and Network Design, Journal Of Economic Theory 2017, s. 182–226.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Covering problems for partial words and for indeterminate strings, Theoretical Computer Science 698 2017, s. 25–39.zobacz w PBN
• Maciej Klimek, Henryk Michalewski i Piotr Miłoś, Hierarchical Reinforcement Learning with Parameters, Journal Of Machine Learning Research 78 2017.zobacz w PBN
• Marcin Peczarski, Comments on the Golden Partition Conjecture, Contributions To Discrete Mathematics 12 (1) 2017, s. 106–109.zobacz w PBN
• Marcin Jan Waniek, Long Tran-Thanh, Tomasz Michalak i Nicholas Jennings, The Dollar Auction with Spiteful Players, w: Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-17), 2017.zobacz w PBN
• Loan TT Nguyen, Bay Vo, Hung Son Nguyen i Sinh Hoa Nguyen, Mining Class Association Rules with Synthesis Constraints, w: Intelligent Information and Database Systems: 9th Asian Conference, ACIIDS 2017, Kanazawa, Japan, April 3--5, 2017, Proceedings, Part II, Springer, Cham, 2017, s. 556–565.zobacz w PBN
• Laure Daviaud, Bruno Guillon, Vincent Penelle i Mikołaj Bojańczyk, Which Classes of Origin Graphs Are Generated by Transducers, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, s. 114:1–114:13.zobacz w PBN
• Andrzej Skowron, Hung Son Nguyen i Andrzej Jankowski, Rough sets in pattern recognition, w: Pattern Recognition and Big Data, World Scientific, Singapore 2017, s. 323–393.zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks, Jean Moussi i Wojciech Rytter, Energy-Optimal Broadcast in a Tree with Mobile Agents, w: Lecture Notes in Computer Science, 2017.zobacz w PBN
• Maciej Piotr Zielenkiewicz i Aleksy Andrzej Schubert, Automata Theory Approach to Predicate Intuitionistic Logic, w: Logic-Based Program Synthesis and Transformation - 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6-8, 2016, Revised Selected Papers, Springer, 2017, s. 345–360.zobacz w PBN
• Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter i Lorenzo ClementeFilip Murlak (red.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.zobacz w PBN
• L. W. Bielczynski, Mateusz Łącki, I. Hoefnagels, Anna Gambin i R. Croce, Leaf and Plant Age Affects Photosynthetic Performance and Photoprotective Capacity, Plant Physiology 175 (4) 2017, s. 1634–1648.zobacz w PBN
• Rafał Archacki, Ruslan Yatusevich, Daniel Buszewicz, Katarzyna Krzyczmonik, Jacek Patryn, Roksana Iwanicka-Nowicka, Przemysław Biecek, Bartek Wilczyński, Marta Koblowska, Andrzej Jerzmanowski i Szymon Świeżewski, Arabidopsis SWI/SNF chromatin remodeling complex binds both promoters and terminators to regulate gene expression., Nucleic Acids Research 45 (7) 2017, s. 3116–3129.zobacz w PBN
• Michał Ciszewski i Konrad Iwanicki, Efficient Automated Code Partitioning for Microcontrollers with Switchable Memory Banks, Acm Transactions On Embedded Computing Systems 16 (4) 2017, s. 114:1–114:26.zobacz w PBN
• Kee Pang Soh, Ewa Szczurek, Thomas Sakoparnig i Niko Beerenwinkel, Predicting cancer type from tumour DNA signatures, Genome Medicine 9 (1) 2017.zobacz w PBN
• Tomasz Michalak, Talal Rahwan i Michael Wooldridge, Strategic Social Network Analysis, w: Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-17), 2017, s. 4841–4845.zobacz w PBN
• Łukasz Białek, Barbara Dunin-Kęplicz i Andrzej Szałas, Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments, w: Intelligent Distributed Computing XI, Springer International Publishing, 2017, s. 49–60.zobacz w PBN
• Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michał Pilipczuk, Roman Rabinovich i Sebastian Siebertz, Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 63, s. 63:1–63:14.zobacz w PBN
• Tomasz Tajmajer, Malwina Spławińska, Piotr Wasilewski i Stanisław Matwin, Predicting annual average daily highway traffic from large data and very few measurements, w: 2016 IEEE International Conference on Big Data (Big Data), IEEE, USA 2017, s. 1493–1501.zobacz w PBN
• Wojciech Czerwiński, Charles Paperman, Lorenzo Clemente i Sławomir Lasota, Separability of Reachability Sets of Vector Addition Systems, w: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, 2017, s. 24:1–24:14.zobacz w PBN
• Jacek Chrząszcz i Aleksy Andrzej Schubert, Function definitions for compound values in object-oriented languages, w: Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09 - 11, 2017, 2017, s. 61–72.zobacz w PBN
• Juha Karkkainen, Jakub Jan Radoszewski i Wojciech Rytter (red.), 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.zobacz w PBN
• Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, Siam Journal On Computing 46 (1) 2017, s. 161–189.zobacz w PBN
• Łukasz Kozłowski, Proteome-pI: proteome isoelectric point database, Nucleic Acids Research 45 (D1) 2017, s. D1112–D1116.zobacz w PBN
• Oskar Skibski i Makoto Yokoo, An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting, Ieee Intelligent Systems 32 (1) 2017, s. 32–39.zobacz w PBN
• Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk i Michał Pilipczuk, Hardness of Approximation for Strip Packing, Acm Transactions On Computation Theory 9 (3) 2017, s. 14:1–14:7.zobacz w PBN
• Łukasz Białek, Barbara Dunin-Kęplicz i Andrzej Szałas, Rule-Based Reasoning with Belief Structures, w: Foundations of Intelligent Systems. 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings, Springer, Cham 2017, s. 229–239.zobacz w PBN
• Dominik Ślęzak, Marek Grzegorowski, Andrzej Piotr Janusz i Sebastian Stawicki, Toward Interactive Attribute Selection with Infolattices - A Position Paper, w: Rough Sets International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3–7, 2017, Proceedings, Part II, Springer, Cham 2017, s. 526–539.zobacz w PBN
• Florian Barbero, Christophe Paul i Michał Pilipczuk, Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 70, s. 70:1–70:13.zobacz w PBN
• Bartosz Klin i Mateusz Łełyk, Modal mu-Calculus with Atoms, w: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, r. 30, s. 1–12.zobacz w PBN
• Mikołaj Bojańczyk i Michał Pilipczuk, Optimizing Tree Decompositions in MSO, w: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, 2017, s. 15:1–15:13.zobacz w PBN
• O-joung Kwon, Michał Pilipczuk i Sebastian Siebertz, On Low Rank-Width Colorings, w: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, 2017, s. 372–385.zobacz w PBN
• Tomasz Idziaszek i Jakub Jan Radoszewski (red.), XXIII Olimpiada Informatyczna 2015/2016, Warszawa 2017.zobacz w PBN
• Wojciech Czerwiński, Wim Martens, Matthias Niewerth i Paweł Parys, Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data, Sigmod Record 46 (1) 2017, s. 15–22.zobacz w PBN
• Henri Niskanen, Irina Tuszyńska, Rafał Zaborowski, Merja Heinäniemi, Seppo Ylä-Herttuala, Bartosz Wilczyński i Minna U Kaikkonen, Endothelial cell differentiation is encompassed by changes in long range interactions between inactive chromatin regions, Nucleic Acids Research 2017.zobacz w PBN
• Piotr Skowron, Krzysztof Rządca i Anwitaman Datta, Cooperation and Competition when Bidding for Complex Projects: Centralized and Decentralized Perspectives, Ieee Intelligent Systems 32 (1) 2017, s. 17–23.zobacz w PBN
• Michał Aleksander Ciach, Anna Muszewska i Paweł Górecki, Detecting Locus Acquisition Events in Gene Trees, Leibniz International Proceedings In Informatics 88 2017, s. 5:1–5:13.zobacz w PBN
• Agnieszka Chądzyńska-Krasowska, Paweł Betliński i Dominik Ślęzak, Scalable Machine Learning with Granulated Data Summaries: A Case of Feature Selection, w: Foundations of Intelligent Systems. 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings, Springer, Cham 2017, s. 519–529.zobacz w PBN
• Marcin Konrad Dziubiński, The Spectrum of Equilibria for the Colonel Blotto and the Colonel Lotto Games, w: Algorithmic Game Theory: 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12--14, 2017, Proceedings, Springer, Cham, 2017, s. 292–306.zobacz w PBN
• Claire David i Filip Murlak, Three Easy Pieces on Schema Mappings for Tree-structured Data, w: Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, Montevideo, Uruguay, June 7-9, 2017, 2017.zobacz w PBN
• Divesh Aggarwal, Tomasz Piotr Kazana i Maciej Obremski, Inception Makes Non-malleable Codes Stronger, w: Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II, 2017, s. 319–343.zobacz w PBN
• Wojciech Czerwiński i Sławomir Lasota, Regular separability of one counter automata, w: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017, s. 1–12.zobacz w PBN
• Maciej Klimek, Henryk Michalewski i Piotr Miłoś, Hierarchical Reinforcement Learning with Parameters, w: 1st Annual Conference on Robot Learning, CoRL 2017, Mountain View, California, USA, November 13-15, 2017, Proceedings, 2017, s. 301–313.zobacz w PBN
• Foto N. Afrati i Jacek Sroka (red.), Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2017, Chicago, IL, USA, May 19, 2017, ACM, 2017.zobacz w PBN
• Foto N. Afrati, Jan Hidders, Christopher R\'e, Jacek Sroka i Jeffrey D. Ullman, Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16), Sigmod Record 46 (2) 2017, s. 43–48.zobacz w PBN
• Sebastian Stawicki, Dominik Ślęzak, Andrzej Piotr Janusz i Sebastian Widz, Decision bireducts and decision reducts - a comparison, International Journal Of Approximate Reasoning 84 2017, s. 75–109.zobacz w PBN
• Fatemeh Jahedpari, Talal Rahwan, Sattar Hashemi, Tomasz Michalak, Marina De Vos, Julian Padget i Wei Lee Woon, Online Prediction via Continuous Artificial Prediction Markets, Ieee Intelligent Systems 32 (1) 2017, s. 61–68.zobacz w PBN
• Krzysztof Gogolewski, Weronika Wronowska, Agnieszka Lech, Bogdan Lesyng i Anna Gambin, Inferring Molecular Processes Heterogeneity from Transcriptional Data, Biomed Research International (journal Of Biomedicine And Biotechnology) 2017 2017, s. 6961786.zobacz w PBN
• Mathurin Ach\'e, Andrzej Piotr Janusz, Kamil Zbikowski, Dominik Ślęzak, Marzena Kryszkiewicz, Henryk Rybiński i Piotr Gawrysiak, ISMIS 2017 Data Mining Competition: Trading Based on Recommendations, w: Foundations of Intelligent Systems. 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings, Springer, Cham 2017, s. 697–707.zobacz w PBN
• Janina Mincer-Daszkiewicz, USOS i OSA, czyli o integracji systemów, w: Wyszukiwanie podobieństw dokumentów, Wydawnictwo Naukowe UKSW w Warszawie, Warszawa 2017, r. 6, s. 131–152.zobacz w PBN
• Marcin Jan Waniek, Tomasz Michalak, Talal Rahwan i Michael Wooldridge, On the Construction of Covert Networks, w: Proceedings of the 16th Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2017), 2017.zobacz w PBN
• Aleksy Andrzej Schubert, Jacek Sroka i Jerzy Paweł Tyszkiewicz, Systematic Programming in a Spreadsheet, w: IS-EUD 2017 6th international symposium on end-user development, Eindhoven University of Technology, Eindhoven 2017, s. 10–17.zobacz w PBN
• Ranko Lazić, Lorenzo Clemente, Filip Mazowiecki i Sławomir Lasota, Timed pushdown automata and branching vector addition systems, w: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017, s. 1–12.zobacz w PBN
• Anna Palczewska, Jan Palczewski, Georgios Aivaliotis i Łukasz Kowalik, RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy, w: 6th IEEE International Conference on Machine Learning and Applications, 2017, s. 344–351.zobacz w PBN
• Piotr Wasilewski (red.), Proceedings of International Workshop on Concurrency, Specification and Programming (CS&P 2017), University of Warsaw, September 25-28, 2017, MIMUW http://csp2017.mimuw.edu.pl/, Warszawa 2017.zobacz w PBN
• Foto N. Afrati, Jan Hidders, Paraschos Koutris, Jacek Sroka i Jeffrey D. Ullman, Report from the Fourth Workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR’17), Sigmod Record 2017.zobacz w PBN
• Marek Adam Cygan, Daniel Marx, Marcin Pilipczuk i Michał Pilipczuk, Hitting forbidden subgraphs in graphs of bounded treewidth, Information And Computation 256 2017, s. 62–82.zobacz w PBN
• Paweł Górecki, Jarosław Andrzej Paszek i Oliver Eulenstein, Unconstrained Diameters for Deep Coalescence, Ieee-acm Transactions On Computational Biology And Bioinformatics 14 (5) 2017, s. 1002–1012.zobacz w PBN
• Bartosz Klin i Beata Nachyła, Some undecidable properties of SOS specifications, Journal Of Logical And Algebraic Methods In Programming 87 2017, s. 94–109.zobacz w PBN
• Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Barbara Dunin-Kęplicz i Andrzej Szałas, Heterogeneous Approximate Reasoning with Graded Truth Values, w: Rough Sets. International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3–7, 2017, Proceedings, Part I, Springer, Cham, Switzerland 2017, s. 61–82.zobacz w PBN
• Piotr Prokopowicz i Dominik Ślęzak, Ordered Fuzzy Numbers: Sources and Intuitions, w: Theory and Applications of Ordered Fuzzy Numbers: A Tribute to Professor Witold Kosiński, Springer, 2017, s. 47–56.zobacz w PBN
• Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Jan Radoszewski i Wing-Kin Sung, Faster Algorithms for 1-Mappability of a Sequence, w: Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, 2017, s. 109–121.zobacz w PBN
• Fanny Pascual i Krzysztof Rządca, Optimizing egalitarian performance in the side-effects model of colocation for data center resource management, w: Euro-Par 2017: Parallel Processing, Springer, 2017, s. 206–219.zobacz w PBN
• Jan van den Heuvel, Stephan Kreutzer, Michał Pilipczuk, Daniel A. Quiroz, Roman Rabinovich i Sebastian Siebertz, Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion, w: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017, s. 1–11.zobacz w PBN
• Bart M. P. Jansen, Marcin Pilipczuk i Marcin Wrochna, Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor, w: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, 2017, s. 23:1–23:13.zobacz w PBN
• Lech Banachowski, Krzysztof Diks i Wojciech Rytter, Algorytmy i struktury danych, Wydawnictwo Naukowe PWN, Warszawa 2017.zobacz w PBN
• Marcin Pilipczuk, A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics 231 2017, s. 211–216.zobacz w PBN
• Tomasz Gogacz, Henryk Michalewski, Matteo Mio i Michał Paweł Skrzypczak, Measure properties of regular sets of trees, Information And Computation 256 2017, s. 108–130.zobacz w PBN
• Marek Adam Cygan, Fabrizio Grandoni i Danny Hermelin, Tight Kernel Bounds for Problems on Graphs with Small Degeneracy, Acm Transactions On Algorithms 13 (3) 2017, s. 43:1–43:22.zobacz w PBN
• Jacek Sroka i Jan Hidders, Finding AND-OR Hierarchies in Workflow Nets, Arxiv abs/1701.02199 2017.zobacz w PBN
• Agnieszka Chądzyńska-Krasowska, Sebastian Stawicki i Dominik Ślęzak, A Metadata Diagnostic Framework for a New Approximate Query Engine Working with Granulated Data Summaries, w: Rough Sets. International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3–7, 2017, Proceedings, Part I, Springer, Cham, Switzerland 2017, s. 623–643.zobacz w PBN
• Piotr Prokopowicz i Dominik Ślęzak, Ordered Fuzzy Numbers: Definitions and Operations, w: Theory and Applications of Ordered Fuzzy Numbers: A Tribute to Professor Witold Kosiński, Springer, 2017, s. 57–79.zobacz w PBN
• Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes, w: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, 2017, s. 99–111.zobacz w PBN
• Pawel Janus i Krzysztof Rządca, SLO-aware Colocation of Data Center Tasks Based on Instantaneous Processor Requirements, w: SoCC '17 Proceedings of the 2017 Symposium on Cloud Computing, ACM New York, NY, USA, 2017, s. 256–268.zobacz w PBN
• Michał Paweł Skrzypczak, Connecting Decidability and Complexity for MSO Logic, w: Developments in Language Theory - 21st International Conference, DLT 2017, Li\`ege, Belgium, August 7-11, 2017, Proceedings, Springer, 2017, s. 75–79.zobacz w PBN
• Nikolai Karpov, Marcin Pilipczuk i Anna Katarzyna Zych, An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, w: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, 2017, s. 24:1–24:11.zobacz w PBN
• Krzysztof Diks, Wojciech Rytter, Jerzy Czyżowicz i Jean Moussi (red.), Lecture Notes in Computer Science, 2017.zobacz w PBN
• Mihai Codescu, Till Mossakowski, Donald Sannella i Andrzej Tarlecki, Specification refinements: Calculi, tools, and applications, Science Of Computer Programming 144 2017, s. 1–49.zobacz w PBN
• Andreas Björklund, Vikram Kamat, Łukasz Kowalik i Meirav Zehavi, Spotting Trees with Few Leaves, Siam Journal On Discrete Mathematics 31 (2) 2017, s. 687–713.zobacz w PBN
• Andreas Björklund, Petteri Kaski i Łukasz Kowalik, Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time, Acm Transactions On Algorithms 13 (4) 2017, s. 48:1–48:26.zobacz w PBN
• Son Thanh Cao i Anh Linh Nguyen, Query-subquery nets for Horn knowledge bases in first-order logic, Journal Of Information And Telecommunication 1 (1) 2017, s. 79–99.zobacz w PBN
• Janina Mincer-Daszkiewicz, EMREX and EWP Offering Complementary Digital Services in the Higher Education Area, w: EUNIS 2017: Shaping the Digital Future of Universities, Raimund Vogl, Münster, Germany 2017, s. 358–367.zobacz w PBN
• Karol Zbigniew Węgrzycki, Piotr Sankowski, Andrzej Krzysztof Pacuk i Piotr Wygocki, Why Do Cascade Sizes Follow a Power-Law?, w: Proceedings of the 26th International Conference on World Wide Web, 2017, s. 569–576.zobacz w PBN
• Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos i Jakub Jan Radoszewski, Palindromic Decompositions with Gaps and Errors, w: Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings, 2017, s. 48–61.zobacz w PBN
• Filippo Cavallari, Henryk Michalewski i Michał Paweł Skrzypczak, A Characterisation of Pi\^0\_2 Regular Tree Languages, w: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, s. 56:1–56:14.zobacz w PBN
• Marcin Pilipczuk, Michał Pilipczuk i Marcin Wrochna, Edge Bipartization Faster Than 2^k, w: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2017, r. 26, s. 26:1–26:13.zobacz w PBN
• Joshua Brody, Stefan Dziembowski, Sebastian Faust i Krzysztof Pietrzak, Position-Based Cryptography and Multiparty Communication Complexity, w: Theory of Cryptography, 2017, s. 56–81.zobacz w PBN
• Mateusz K Łącki, Michał Startek, Dirk Valkenborg i Anna Gambin, IsoSpec: Hyperfast Fine Structure Calculator, Analytical Chemistry 89 (6) 2017, s. 3272–3277.zobacz w PBN
• Mikołaj Bojańczyk, It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton, Fundamenta Informaticae 154 (1-4) 2017, s. 37–46.zobacz w PBN
• Magdalena Pawlak, Agnieszka Kikulska, Tomasz Wrzesinski, Tobias Rausch, Zbigniew Kwias, Bartosz Wilczyński, Vladimir Benes, Joanna Wesoły i Tomasz Wilanowski, Potential protective role of Grainyhead-like genes in the development of clear cell renal cell carcinoma, Molecular Carcinogenesis 56 (11) 2017, s. 2414–2423.zobacz w PBN
• Dariusz Matlak i Ewa Szczurek, Epistasis in genomic and survival data of cancer patients, Plos Computational Biology 2017.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski i Bartłomiej Wiśniewski, Subquadratic-Time Algorithms for Abelian Stringology Problems, Aims Medical Science 4 (3) 2017, s. 332–351.zobacz w PBN
• Janina Mincer-Daszkiewicz, Mats Lindstedt, Anders Bøgebjerg Hansen, Geir Vangen i Pamela Engström, Supporting Student Mobility - Expected and unexpected results from the EMREX Field Trial, w: EUNIS 2017: Shaping the Digital Future of Universities, Raimund Vogl, Münster, Germany 2017, s. 354–357.zobacz w PBN
• Guoyin Wang, Andrzej Skowron, Yiyu Yao, Dominik Ślęzak i Lech Polkowski, Preface, w: Thriving Rough Sets : 10th Anniversary - Honoring Professor Zdzisław Pawlak's Life and Legacy & 35 Years of Rough Sets, Springer, 2017, s. v–viii.zobacz w PBN
• Jakub Jan Radoszewski i Tatiana A. Starikovskaya, Streaming K-Mismatch with Error Correcting and Applications, w: 2017 Data Compression Conference, DCC 2017, 2017, s. 290–299.zobacz w PBN
• Michał Pilipczuk, Erik Jan van Leeuwen i Andreas Wiese, Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking, w: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, s. 42:1–42:13.zobacz w PBN
• Archontia Giannopoulou, Michał Pilipczuk, Jean-florent Raymond, Dimitrios M. Thilikos i Marcin Wrochna, Cutwidth: Obstructions and Algorithmic Aspects, w: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2017, r. 15, s. 15:1–15:13.zobacz w PBN
• Tomasz Gogacz i Szymon Toruńczyk, Entropy Bounds for Conjunctive Queries with Functional Dependencies, w: 20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 15, s. 15:1–15:17.zobacz w PBN
• Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki i Arkadiusz Aleksander Socała, Tight Lower Bounds on Graph Embedding Problems, Journal Of The Acm 64 (3) 2017, s. 18:1–18:22.zobacz w PBN
• Jacek Sroka i Jan Hidders, On Determining the AND-OR Hierarchy in Workflow Nets, Fundamenta Informaticae 156 (1) 2017, s. 95–123.zobacz w PBN
• Loan TT Nguyen, Ngoc-Thanh Nguyen, Bay Vo i Hung Son Nguyen, Efficient method for updating class association rules in dynamic datasets with record deletion, Applied Intelligence 2017, s. 1–15.zobacz w PBN
• Julia Danuta Herman-Iżycka, Michal Wlasnowolski i Bartosz Wilczyński, Taking promoters out of enhancers in sequence based predictions of tissue-specific mammalian enhancers, Bmc Medical Genomics 10 (1) 2017, s. 34.zobacz w PBN
• Jerzy Czyżowicz, Wojciech Rytter i Michał Włodarczyk, Evacuation from a Disc in the Presence of a Faulty Robot., w: Lecture Notes in Computer Science, Springer-Verlag, 2014.zobacz w PBN
• Jadwiga Sosnowska i Oskar Skibski, Attachment Centrality for Weighted Graphs, w: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), 2017, s. 416–422.zobacz w PBN
• Piotr Sankowski i Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, w: 34th Symposium on Theoretical Aspects of Computer Science, 2017, r. 56, s. 1–14.zobacz w PBN
• Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis i Jakub Jan Radoszewski, Longest Common Factor After One Edit Operation, w: String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings, 2017, s. 14–26.zobacz w PBN
• Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała i Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, w: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., 2017, s. 459–465.zobacz w PBN
• Hung Son Nguyen, Ngoc Thuy Nguyen, Hoang Son Nguyen i Long Giang Nguyen, Some observations on representation of dependency degree k, w: 9th International Conference on Knowledge and Systems Engineering (KSE),, 2017, s. 13–17.zobacz w PBN
• Wei Shi, Therese Vu, Didier Boucher, Anna Małgorzata Biernacka, Jules Nde, Raj K. Pandita, Jasmin Straube, Glen M. Boyle, Fares Al-Ejeh, Purba Nag, Jessie Jeffery, Janelle L. Harris, Amanda L. Bain, Marta Monika Grzelak, Magdalena Olga Skrzypczak, Abhishek Mitra, Norbert Dojer, Nicola Crosetto, Nicole Cloonan, Olivier J. Becherel, John Finnie, Jeffrey R. Skaar, Carl R. Walkley, Tej K. Pandita, Maga Rowicka, Krzysztof Flawiusz Ginalski, Steven W. Lane i Kum Kum Khanna, Ssb1 and Ssb2 cooperate to regulate mouse hematopoietic stem and progenitor cells by resolving replicative stress, Blood 129 (18) 2017, s. 2479–2492.zobacz w PBN
• Eryk Kopczyński, Computational Complexity on the Blackboard, Fundamenta Informaticae 152 (4) 2017, s. 323–339.zobacz w PBN
• Marcin Michalak, Andrzej Piotr Janusz, Marek Grzegorowski, Łukasz Wróbel, Marek Sikora i Dominik Ślęzak, Predicting seismic events in coal mines based on underground sensor measurements, Engineering Applications Of Artificial Intelligence Vol. 64 2017, s. 83–94.zobacz w PBN
• Anuj Dawar i Eryk Kopczyński, Bounded degree and planar spectra, Logical Methods In Computer Science Volume 13, Issue 4 2017.zobacz w PBN
• Eryk Kopczyński i Szymon Toruńczyk, LOIS: Syntax and Semantics, w: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, ACM, 2017, s. 586–598.zobacz w PBN
• Marek Sikora, Wojciech Moczulski, Piotr Przystałka i Dominik Ślęzak, Wprowadzenie do systemu DISESOR, w: Zintegrowany, szkieletowy system wspomagania decyzji dla systemów monitorowania procesów, urządzeń i zagrożeń, Politechnika Śląska i Instytut technik Innowacyjnych EMAG, Gliwice 2017, r. 1, s. 1–9.zobacz w PBN
• Marek Adam Cygan, Marcin Ireneusz Mucha, Karol Zbigniew Węgrzycki i Michał Włodarczyk, On Problems Equivalent to (min, +)-Convolution, w: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 22, s. 1–15.zobacz w PBN
• Piotr Sankowski i Piotr Wygocki, Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrtloglogn, w: 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, s. 63:1–63:12.zobacz w PBN
• Marek Adam Cygan, Łukasz Kowalik i Arkadiusz Aleksander Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 30:1–30:14.zobacz w PBN
• Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki i Piotr Sankowski, Decremental Single-source Reachability in Planar Digraphs, w: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, s. 1108–1121.zobacz w PBN