Publikacje

Instytut Informatyki

2018

• Foto Afrati, Jacek Sroka, Ke Yi i Jan Hidders (red.), BeyondMR'18: Proceedings of the 5th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, ACM, New York, NY, USA 2018.zobacz w PBN
• Szymon Grabowski, Tomasz Kociumaka i Jakub Radoszewski, On Abelian Longest Common Factor with and without RLE, Fundamenta Informaticae 163 (3) 2018, s. 225–244.zobacz w PBN
• Dominik Ślęzak, Rick Glick, Paweł Betliński i Piotr Synak, A new approximate query engine based on intelligent capture and fast transformations of granulated data summaries, Journal Of Intelligent Information Systems 50 (2) 2018, s. 385–414.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Bijective Diameters of Gene Tree Parsimony Costs, Ieee-acm Transactions On Computational Biology And Bioinformatics 15 (5) 2018, s. 1723–1727.zobacz w PBN
• Marcin Pilipczuk i Magnus Wahlström, Directed Multicut is W[1]-hard, Even for Four Terminal Pairs, Acm Transactions On Computation Theory 10 (3) 2018, s. 13:1–13:18.zobacz w PBN
• Agnieszka Paszkowska i Konrad Iwanicki, The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) under Network Partitions, w: EWSN 2018: Proceedings of the 2018 International Conference on Embedded Wireless Systems and Networks, Junction Publishing/ACM, 2018, s. 90–101.zobacz w PBN
• Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Sebastian Siebertz i Szymon Toruńczyk, First-Order Interpretations of Bounded Expansion Classes, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, s. 126:1–126:14.zobacz w PBN
• Paweł Parys, Homogeneity Without Loss of Generality, w: 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 27, s. 1–15.zobacz w PBN
• Tomasz Gogacz, Yazmin Angélica Ibáñez-García i Filip Murlak, Finite Query Answering in Expressive Description Logics with Transitive Roles, w: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018., 2018, s. 369–378.zobacz w PBN
• Andrzej Piotr Janusz, Dominik Ślęzak, Sebastian Stawicki i Krzysztof Stencel, SENSEI: An Intelligent Advisory System for the eSport Community and Casual Players, w: 2018 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2018, Santiago, Chile, December 3-6, 2018, 2018, s. 754–757.zobacz w PBN
• Hung Son Nguyen, Quang-Thuy Ha, Tianui Li i Malgorzata Przybyla-Kasperek (red.), Rough Sets - International Joint Conference (IJCRS 2018), Springer, Heidelberg 2018.zobacz w PBN
• Marcin Michalak i Dominik Ślęzak, Boolean Representation for Exact Biclustering, Fundamenta Informaticae 161 (3) 2018, s. 275–297.zobacz w PBN
• Mikołaj Fejzer, Piotr Przymus i Krzysztof Stencel, Profile based recommendation of code reviewers, Journal Of Intelligent Information Systems 50 (3) 2018, s. 597–619.zobacz w PBN
• Jarosław Andrzej Paszek i Paweł Górecki, Efficient algorithms for genomic duplication models, Ieee-acm Transactions On Computational Biology And Bioinformatics 15 (5) 2018, s. 1515–24.zobacz w PBN
• Ivan Bliznets, Marek Cygan, Paweł Komosa i Michał Pilipczuk, Hardness of Approximation for H-free Edge Modification Problems, Acm Transactions On Computation Theory 10 (2) 2018, s. 9:1–9:32.zobacz w PBN
• Inga Rüb, Szymon Acedański i Konrad Iwanicki, Ad Hoc 802.11-802.15.4 Crosstalk-Based Communication in Practice, w: EWSN 2018: Proceedings of the 2018 International Conference on Embedded Wireless Systems and Networks, Junction Publishing/ACM, 2018, s. 239–244.zobacz w PBN
• Paweł Gawrychowski i Adam Karol Karczmarz, Improved Bounds for Shortest Paths in Dense Distance Graphs, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, r. 61, s. 61:1–61:15.zobacz w PBN
• Paweł Parys, The Complexity of the Diagonal Problem for Recursion Schemes, w: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 45, s. 1–14.zobacz w PBN
• Quang-Thuy Ha, Anh Linh Nguyen, Thi Hong Khanh Nguyen i Thanh-Luong Tran, Fuzzy Bisimulations in Fuzzy Description Logics Under the Gödel Semantics, w: Rough Sets - International Joint Conference, IJCRS 2018, Quy Nhon, Vietnam, August 20-24, 2018, Proceedings, Springer, 2018, s. 559–571.zobacz w PBN
• Maciej Świechowski i Dominik Ślęzak, Grail: A Framework for Adaptive and Believable AI in Video Games, w: 2018 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2018, Santiago, Chile, December 3-6, 2018, 2018, s. 762–765.zobacz w PBN
• Wojciech Czerwiński, Wim Martens, Matthias Niewerth i Paweł Parys, Minimization of Tree Patterns, Journal Of The Acm 65 (4) 2018, s. 26:1–26:46.zobacz w PBN
• Barbara Dunin-Kęplicz i Alina Powała, Multi-party persuasion: a paraconsistent approach., Fundamenta Informaticae vol 158 (1) 2018, s. 1–39.zobacz w PBN
• Michał Krzysztoń, Monika Zakrzewska-Płaczek, Aleksandra Kwasnik, Norbert Dojer, Wojciech Karłowski i Joanna Kufel, Defective XRN3-mediated transcription termination in Arabidopsis affects the expression of protein-coding genes, Plant Journal 93 (6) 2018, s. 1017–1031.zobacz w PBN
• Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski i Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, Acm Transactions On Algorithms 14 (4) 2018, s. 53:1–53:73.zobacz w PBN
• Ali Rezaei Divroodi, Quang-Thuy Ha, Anh Linh Nguyen i Hung Son Nguyen, On the possibility of correct concept learning in description logics, Vietnam Journal Of Computer Science 5 (1) 2018, s. 3–14.zobacz w PBN
• Konrad Iwanicki, A Distributed Systems Perspective on Industrial IoT, w: ICDCS 2018: Proceedings of the IEEE 38th International Conference on Distributed Computing Systems, IEEE, 2018, s. 1164–1170.zobacz w PBN
• Sławomir Lasota i Radosław Piórkowski, WQO Dichotomy for 3-Graphs, w: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, 2018, s. 548–564.zobacz w PBN
• Udi Boker, Orna Kupferman i Michał Paweł Skrzypczak, How Deterministic are Good-For-Games Automata?, w: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 18, s. 18:1–18:14.zobacz w PBN
• Dominik Ślęzak i Soma Dutta, Dynamic and Discernibility Characteristics of Different Attribute Reduction Criteria, w: Rough Sets - International Joint Conference, IJCRS 2018, Quy Nhon, Vietnam, August 20-24, 2018, Proceedings, Springer, 2018, s. 628–643.zobacz w PBN
• Andrzej Piotr Janusz i Dominik Ślęzak, Investigating Similarity between Hearthstone Cards: Text Embeddings and Interchangeability Approaches, w: Proceedings of 2018 IEEE International Conference on Systems, Man, and Cybernetics, 2018, s. 3411–3416.zobacz w PBN
• Stefan Dziembowski, Krzysztof Pietrzak i Daniel Wichs, Non-Malleable Codes, Journal Of The Acm 65 (4) 2018, s. 20:1–20:32.zobacz w PBN
• Anna Gambin i Monika Heiner, Advances in Biological processes and Petri nets (BioPPN) Preface, Fundamenta Informaticae 2018.zobacz w PBN
• P. Szafranski, E. Ko?mider, Q. Liu, J. A. Karolak, L. Currie, S. Parkash, S. G. Kahler, E. Roeder, R. O. Littlejohn, T. S. DeNapoli, F. R. Shardonofsky, C. Henderson, G. Powers, V. Poisson, D. Berube, L. Oligny, J. L. Michaud, S. Janssens, K. De Coen, J. Van Dorpe, A. Dheedene, M. T. Harting, M. D. Weaver, A. M. Khan, N. Tatevian, J. Wambach, K. A. Gibbs, E. Popek, Anna Gambin i Paweł Stankiewicz, LINE- and Alu-containing genomic instability hotspot at 16q24.1 associated with recurrent and nonrecurrent CNV deletions causative for ACDMPV, Human Mutation 39 (12) 2018, s. 1916–1925.zobacz w PBN
• Daniel Lokshtanov, Marcin Pilipczuk i Erik Jan van Leeuwen, Independence and Efficient Domination on P_6-free Graphs, Acm Transactions On Algorithms 14 (1) 2018, s. 3:1–3:30.zobacz w PBN
• Dawid Dąbkowski, Paweł Tabaszewski i Paweł Górecki, Minimizing the deep coalescence cost, Journal Of Bioinformatics And Computational Biology 16 (5) 2018, s. 1840021.zobacz w PBN
• Tomasz Janus, Mateusz Skomra i Marcin Konrad Dziubiński, Individual Security and Network Design with Malicious Nodes, w: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and MultiAgent Systems, 2018, s. 1968–1970.zobacz w PBN
• Wojciech Czerwiński, Sławomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar i Prakash Saivasan, Regular Separability of Well-Structured Transition Systems, w: 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018, s. 35:1–35:18.zobacz w PBN
• Janina Mincer-Daszkiewicz, Mobility scenarios supported by the Erasmus Without Paper Network, w: EUNIS 2018: Coming of Age in a Digital World, Raimund Vogl, Sorbonne Université, Paris, France 2018, s. 189–190.zobacz w PBN
• Anh Linh Nguyen, The Influence of the Test Operator on the Expressive Powers of PDL-Like Logics, w: Proceedings of the 27th International Workshop on Concurrency, Specification and Programming, Berlin, Germany, September 24-26, 2018, CEUR-WS.org, 2018.zobacz w PBN
• Andrzej Piotr Janusz, Łukasz Grad i Dominik Ślęzak, Utilizing Hybrid Information Sources to Learn Representations of Cards in Collectible Card Video Games, w: Proceedings of IEEE International Conference on Data Mining Workshops 2018, 2018.zobacz w PBN
• Marek Adam Cygan, Stefan Kratsch i Jesper Nederlof, Fast Hamiltonicity Checking Via Bases of Perfect Matchings, Journal Of The Acm 12 2018, s. 1:46.zobacz w PBN
• Pål Grønås Drange i Michał Pilipczuk, A Polynomial Kernel for Trivially Perfect Editing, Algorithmica 80 (12) 2018, s. 3481–3524.zobacz w PBN
• Oskar Skibski, Tomasz Michalak i Talal Rahwan, Axiomatic Characterization of Game-Theoretic Centrality, Journal Of Artificial Intelligence Research 62 2018, s. 33–68.zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk i Michał Pilipczuk, Subexponential Parameterized Algorithm for Interval Completion, Acm Transactions On Algorithms 14 (3) 2018, s. 35:1–35:62.zobacz w PBN
• Alina Frolova i Bartosz Wilczyński, Distributed Bayesian networks reconstruction on the whole genome scale, Peerj 6 2018, s. e5692.zobacz w PBN
• Marcin Konrad Dziubiński i Jaideep Roy, Hide and Seek Game with Multiple Resources, w: Algorithmic Game Theory, Springer, 2018, s. 82–86.zobacz w PBN
• Piotr Hofman i Sławomir Lasota, Linear Equations with Ordered Data, w: 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018, s. 24:1–24:17.zobacz w PBN
• Marek Adam Cygan, Artur Czumaj, Marcin Ireneusz Mucha i Piotr Sankowski, Online Facility Location with Deletions, w: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 21, s. 1–15.zobacz w PBN
• Mikołaj Bojańczyk, Martin Grohe i Michał Pilipczuk, Definable decompositions for graphs of bounded linear cliquewidth, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 135–144.zobacz w PBN
• Maciej Świechowski i Dominik Ślęzak, Granular Games in Real-Time Environment, w: Proceedings of IEEE International Conference on Data Mining Workshops 2018, 2018, s. 462–469.zobacz w PBN
• Aleksy Andrzej Schubert i Paweł Urzyczyn, Answer set programming in intuitionistic logic, Indagationes Mathematicae-new Series 29 2018, s. 276–292.zobacz w PBN
• Ilona Foik, Irina Tuszyńska, Marcin Feder, Elżbieta Purta, Filip Stefaniak i Janusz Bujnicki, Novel inhibitors of the rRNA ErmC' methyltransferase to block resistance to macrolides, lincosamides, streptogramine B antibiotics, European Journal Of Medicinal Chemistry 2018.zobacz w PBN
• Mateusz Tarkowski, Piotr Szczepański, Tomasz Michalak, Paul Harrenstein i Michael Wooldridge, Efficient Computation of Semivalues for Game-Theoretic Network Centrality, Journal Of Artificial Intelligence Research 63 2018, s. 145–189.zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk i Marcin Wrochna, Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth, Acm Transactions On Algorithms 14 (3) 2018, s. 34:1–34:45.zobacz w PBN
• Tomasz Janus, Mateusz Skomra i Marcin Konrad Dziubiński, Individual Security and Network Design with Malicious Nodes, Information 9 (9) 2018, s. 1–21.zobacz w PBN
• Grzegorz Milka i Krzysztof Rządca, Dfuntest: A Testing Framework for Distributed Applications, w: Parallel Processing and Applied Mathematics. 12th International Conference, PPAM 2017, Lublin, Poland, September 10-13, 2017, Revised Selected Papers, Part I, Springer, Cham 2018.zobacz w PBN
• Francis Bloch, Bhaskar Dutta i Marcin Konrad Dziubiński, How to hide in a network?, w: Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings, Springer, 2018, s. 441–442.zobacz w PBN
• Michał Pilipczuk, Erik Jan van Leeuwen i Andreas Wiese, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, w: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, s. 65:1–65:13.zobacz w PBN
• Michał Pilipczuk, Sebastian Siebertz i Szymon Toruńczyk, Parameterized circuit complexity of model-checking on sparse structures, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 789–798.zobacz w PBN
• Mateusz Przyborowski, Tomasz Tajmajer, Łukasz Grad, Andrzej Piotr Janusz, Piotr Biczyk i Dominik Ślęzak, Toward Machine Learning on Granulated Data – a Case of Compact Autoencoder-based Representations of Satellite Images, w: Proceedings of 2018 IEEE International Conference on Big Data, 2018, s. 2656–2661.zobacz w PBN
• Stefan Dziembowski, Tomasz Kazana i Maciej Zdanowicz, Quasi chain rule for min-entropy, Information Processing Letters 134 2018, s. 62–66.zobacz w PBN
• Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science 710 2018, s. 126–138.zobacz w PBN
• Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała i Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, Journal Of Artificial Intelligence Research 63 2018, s. 495–513.zobacz w PBN
• Florian Barbero, Christophe Paul i Michał Pilipczuk, Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs, Acm Transactions On Algorithms 14 (3) 2018, s. 38:1–38:31.zobacz w PBN
• I De Toma, Ilona Grabowicz, M Fructuoso, D Trujillano, Bartosz Wilczyński i M Dierssen, Overweighed mice show coordinated homeostatic and hedonic transcriptional response across brain, Eneuro 2018, s. ENEURO–0287.zobacz w PBN
• Agnieszka Paszkowska i Konrad Iwanicki, On Designing Provably Correct DODAG Formation Criteria for the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), w: 14th International Conference on Distributed Computing in Sensor Systems, DCOSS 2018, New York, NY, USA, June 18-20, 2018., IEEE, 2018, s. 43–52.zobacz w PBN
• Łukasz Kowalik i Arkadiusz Aleksander Socała, Tight Lower Bounds for List Edge Coloring, w: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, 2018, June 18-20, 2018, Malmo, Sweden, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, s. 28:1––28:12.zobacz w PBN
• Jacob Holm, Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki i Eva Rotenberg, Decremental SPQR-trees for Planar Graphs, w: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 46, s. 46:1–46:16.zobacz w PBN
• Michał Pilipczuk, Sebastian Siebertz i Szymon Toruńczyk, On the number of types in sparse graphs, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 799–808.zobacz w PBN
• Łukasz Sosnowski, Wojciech Chaber, Łukasz Miłobędzki, Tomasz Penza, Jadwiga Sosnowska, Karol Zaleski, Joanna Fedorowicz, Iwona Szymusik i Dominik Ślęzak, Similarity-based Detection of Fertile Days at OvuFriend, w: Proceedings of 2018 IEEE International Conference on Big Data, 2018, s. 2662–2667.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, Are unique subgraphs not easier to find?, Information Processing Letters 134 2018, s. 57–61.zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science 710 2018, s. 139–147.zobacz w PBN
• Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel i Marcin Pilipczuk, Excluding Hooks and their Complements, Electronic Journal Of Combinatorics 25 (3) 2018, s. P3.27.zobacz w PBN
• Francesco Luca De Angelis, Giovanna Di Marzo Serugendo i Andrzej Szałas, Paraconsistent Rule-Based Reasoning with Graded Truth Values, Journal Of Applied Logic 5 (1) 2018, s. 185–220.zobacz w PBN
• Marcin Jan Waniek, Tomasz Michalak, Michael Wooldridge i Talal Rahwan, Hiding individuals and communities in a social network, Nature Human Behaviour 2 (2) 2018, s. 139–147.zobacz w PBN
• Dominik Ślęzak, Janusz Borkowski i Agnieszka Chądzyńska-Krasowska, Ranking mutual information dependencies in a summary-based approximate analytics framework, w: 2018 International Conference on High Performance Computing & Simulation (HPCS), IEEE, 2018, s. 852–859.zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Aleksander Socała i Marcin Wrochna, On Directed Feedback Vertex Set Parameterized by Treewidth, w: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, Springer, 2018, s. 65–78.zobacz w PBN
• Michał Paweł Skrzypczak, B\üchi VASS Recognise \(\sum\)\(^\mbox1\)\(_\mbox1\)-complete \(ω\)-languages, w: Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings, Springer, 2018, s. 133–145.zobacz w PBN
• Mikołaj Bojańczyk i Szymon Toruńczyk, On computability and tractability for infinite sets, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 145–154.zobacz w PBN
• Dominik Ślęzak, Toward Approximate Intelligence: Approximate Query Engines & Approximate Data Exploration, w: Companion of the The Web Conference 2018 on The Web Conference 2018, WWW 2018, Lyon , France, April 23-27, 2018, 2018, s. 1687–1687.zobacz w PBN
• M. José Benítez-Caballero, Jesús Medina, Eloísa Ramírez-Poussa i Dominik Ślęzak, Bireducts with tolerance relations, Information Sciences 435 2018, s. 26–39.zobacz w PBN
• Wojciech Plandowski i Aleksy Andrzej Schubert, On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note), Theoretical Computer Science 2018.zobacz w PBN
• Thomas Clouaire, Vincent Rocher, Anahita Lashgari, Coline Arnould, Marion Aguirrebengoa, Anna Biernacka, Magdalena Skrzypczak, Franćcois Aymard, Bernard Fongang, Norbert Dojer, Jason Iacovoni, Maga Rowicka, Krzysztof Ginalski, Jacques Côté i Gaëlle Legube, Comprehensive mapping of histone modifications at DNA double-strand breaks deciphers repair pathway chromatin signatures, Molecular Cell 72 (2) 2018, s. 250–262.zobacz w PBN
• Bartosz Klin i Julian Salamanca, Iterated Covariant Powerset is not a Monad, Electronic Notes In Theoretical Computer Science 341 2018, s. 261–276.zobacz w PBN
• Tomasz Klucznik, Barbara Mikulak-Klucznik, Michael P. McCormack, Heather Lima, Sara Szymkuc, Manishabrata Bhowmick, Karol Molga, Yubai Zhou, Lindsey Rickershauser, Ewa P. Gajewska, Alexei Toutchkine, Piotr Dittwald, Michał Startek, Gregory J. Kirkovits, Rafal Roszak, Ariel Adamski, Bianka Sieredzinska, Milan Mrksich, Sarah L. J. Trice i Bartosz A. Grzybowski, Efficient Syntheses of Diverse, Medicinally Relevant Targets Planned by Computer and Executed in the Laboratory, Chem 4 (3) 2018, s. 522–532.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, Signed Dual Tableaux for Kleene Answer Set Programs, w: Ewa Orłowska on Relational Methods in Logic and Computer Science, Springer Nature Switzerland AG, 2018, r. 9, s. 233–252.zobacz w PBN
• Shaohua Li i Marcin Pilipczuk, An Improved FPT Algorithm for Independent Feedback Vertex Set, w: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, Springer, 2018, s. 344–355.zobacz w PBN
• Michał Ziobro i Marcin Pilipczuk, Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation, w: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, 2018, s. 29:1–29:14.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On Periodicity Lemma for Partial Words, w: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, Springer, 2018, s. 232–244.zobacz w PBN
• Łukasz Kidziński, Sharada Mohanty, Carmichael Ong, Zhewei Huang, Shuchang Zhou, Anton Pechenko, Adam Stelmaszczyk, Piotr Jarosik, Mikhail Pavlov, Sergey Kolesnikov, Sergey Plis, Zhibo Chen, Zhizheng Zhang, Jiale Chen, Jun Shi, Zhuobin Zheng, Chun Yuan, Zhihui Lin, Henryk Michalewski, Piotr Miłoś, Błażej Osiński, Andrew Melnik, Malte Schilling, Helge Ritter, Sean Carroll, Jennifer Hicks, Sergey Levine, Marcel Salathé i Scott Delp, Learning to Run Challenge Solutions: Adapting Reinforcement Learning Methods for Neuromusculoskeletal Environments, w: The NIPS '17 Competition: Building Intelligent Systems, USA 2018, s. 121–153.zobacz w PBN
• Dominik Ślęzak, Marek Grzegorowski, Andrzej Piotr Janusz, Michał Kozielski, Sinh Hoa Nguyen, Marek Sikora, Sebastian Stawicki i Łukasz Wróbel, A framework for learning and embedding multi-sensor forecasting models into a decision support system: A case study of methane concentration in coal mines, Information Sciences 451-452 (July) 2018, s. 112–133.zobacz w PBN
• Damian Repke i Wojciech Rytter, On Semi-perfect de Bruijn words, Theoretical Computer Science 720 2018, s. 55–63.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, Journal Of Combinatorial Optimization 2018.zobacz w PBN
• Michał Ciach, Anna Muszewska i Paweł Górecki, Locus-aware decomposition of gene trees with respect to polytomous species trees, Algorithms For Molecular Biology 13 (11) 2018, s. 1–18.zobacz w PBN
• Krzysztof Gogolewski, Maciej Sykulski, Neo Christopher Chung i Anna Gambin, Truncated Robust Principal Component Analysis and Noise Reduction for Single Cell RNA-seq Data, w: International Symposium on Bioinformatics Research and Applications (ISBRA), 2018, s. 335–346.zobacz w PBN
• Łukasz Sosnowski i Marcin Szczuka, Defuzzyfication in Interpretation of Comparator Networks, w: Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations. 17th International Conference, IPMU 2018, Cádiz, Spain, June 11-15, 2018, Proceedings, Part II, Springer Nature, Cham 2018, s. 467–479.zobacz w PBN
• Patryk Czarnik, Jacek Chrząszcz i Aleksy Andrzej Schubert, A Java Bytecode Formalisation, w: Verified Software. Theories, Tools, and Experiments - 10th International Conference, VSTTE 2018, Oxford, UK, July 18-19, 2018, Revised Selected Papers, Springer, 2018.zobacz w PBN
• Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl i Sebastian Siebertz, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness, w: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, 2018, s. 14:1–14:16.zobacz w PBN
• Fanny Pascual, Krzysztof Rządca i Piotr Skowron, Collective Schedules: Scheduling Meets Computational Social Choice, w: Proceedings AAMAS '18 Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018, s. 667–675.zobacz w PBN
• Eryk Kopczyński i Dorota Teresa Celińska, Virtual Crocheting of Euclidean Planes in a 3-Sphere, w: Proceedings of Bridges 2018: Mathematics, Art, Music, Architecture, Education, Culture, Tesselations Publishing, Phoenix, Arizona 2018, s. 551–554.zobacz w PBN
• Anita Liebenau, Marcin Pilipczuk, Paul Seymour i Sophie Spirkl, Caterpillars in Erdős–Hajnal, Journal Of Combinatorial Theory Series B 2018.zobacz w PBN
• Wojciech Plandowski, On PSPACE generation of a solution set of a word equation and its applications, Theoretical Computer Science 2018.zobacz w PBN
• Wojciech Czerwiński, Claire David, Filip Murlak i Paweł Parys, Reasoning About Integrity Constraints for Tree-Structured Data, Theory Of Computing Systems 62 (4) 2018, s. 941–976.zobacz w PBN
• Matteo Mio, Michał Paweł Skrzypczak i Henryk Michalewski, Monadic Second Order Logic with Measure and Category Quantifiers, Logical Methods In Computer Science 14 (2) 2018.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Powała i Andrzej Szałas, Variations on Jaśkowski’s Discursive Logic, w: The Lvov-Warsaw School. Past and Present, Birkhäuser, Cham, Birkhäuser Basel 2018, s. 485–497.zobacz w PBN
• Andrzej Piotr Janusz, Sebastian Stawicki, Michal Drewniak, Krzysztof Ciebiera, Dominik Ślęzak i Krzysztof Stencel, How to Match Jobs and Candidates - A Recruitment Support System Based on Feature Engineering and Advanced Analytics, w: Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations. 17th International Conference, IPMU 2018, Cádiz, Spain, June 11-15, 2018, Proceedings, Part II, Springer Nature, Cham 2018, s. 503–514.zobacz w PBN
• Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Łącki i Piotr 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, SIAM, 2018, s. 1509–1528.zobacz w PBN
• Krzysztof Kiljan i Marcin Pilipczuk, Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set, w: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, 2018, s. 12:1–12:12.zobacz w PBN
• Milosz Pacholczyk i Krzysztof Rządca, Fair non-monetary scheduling in federated clouds, w: CrossCloud'18 Proceedings of the 5th Workshop on CrossCloud Infrastructures & Platforms, 2018, s. 3:1–3:6.zobacz w PBN
• Rafał Bocian, Dominika Pawłowska, Krzysztof Stencel i Piotr Wiśniewski, OpenMP as an Efficient Method to Parallelize Code with Dense Synchronization, w: Beyond Databases, Architectures and Structures. Facing the Challenges of Data Proliferation and Growing Variety - 14th International Conference, BDAS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 18-20, 2018, Proceedings, Springer, Poznań 2018, s. 120–127.zobacz w PBN
• Henryk Michalewski i Michał Paweł Skrzypczak, On the Strength of Unambiguous Tree Automata, International Journal Of Foundations Of Computer Science 29 (5) 2018.zobacz w PBN
• Florian Barbero, Christophe Paul i Michał Pilipczuk, Strong immersion is a well-quasi-ordering for semicomplete digraphs, Journal Of Graph Theory 2018.zobacz w PBN
• Piotr Sankowski i Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, Theory Of Computing Systems 2018.zobacz w PBN
• Eryk Kopczyński i Tony Tan, A note on first-order spectra with binary relations, Logical Methods In Computer Science 14 (2) 2018.zobacz w PBN
• Oskar Skibski i Jadwiga Sosnowska, Axioms for Distance-Based Centralities, w: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI-18), 2018, s. 1218–1225.zobacz w PBN
• P. Theron, A. Kott, M. Drasar, Krzysztof Rządca, B. LeBlanc, M. Pihelgas, L. Mancini i A. Panico, Towards an active, autonomous and intelligent cyber defense of military systems: The NATO AICA reference architecture, w: 2018 International Conference on Military Communications and Information Systems (ICMCIS), IEEE, 2018, s. 1–9.zobacz w PBN
• Adam Karol Karczmarz, Decremental Transitive Closure and Shortest Paths for Planar Digraphs and Beyond, w: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, SIAM, 2018, s. 73–92.zobacz w PBN
• Daniel Marx, Marcin Pilipczuk i Michał Pilipczuk, On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs, w: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, 2018, s. 474–484.zobacz w PBN
• Stefan Dziembowski, Lisa Eckey i Sebastian Faust, FairSwap: How To Fairly Exchange Digital Goods, w: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, s. 967–984.zobacz w PBN
• Barbara Poszewiecka, Paweł Stankiewicz, Tomasz Gambin i Anna Gambin, TADeus-a tool for clinical interpretation of structural variants modifying chromatin organization, w: 2018 IEEE International Conference on Bioinformatics and Biomedicine, 2018, s. 84–87.zobacz w PBN
• Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos i Jakub Jan Radoszewski, Palindromic Decompositions with Gaps and Errors, International Journal Of Foundations Of Computer Science 29 (08) 2018, s. 1311–1329.zobacz w PBN
• Fanny Pascual i Krzysztof Rządca, Colocating tasks in data centers using a side-effects performance model, European Journal Of Operational Research (2) 2018, s. 450–462.zobacz w PBN
• Aleksy Andrzej Schubert i Paweł Urzyczyn, First-order Answer Set Programming as Constructive Proof Search, Theory And Practice Of Logic Programming 18 (3-4) 2018, s. 673–690.zobacz w PBN
• Paweł Górecki, Alexey Markin i Oliver Eulenstein, Cophenetic Distances: A Near-Linear Time Algorithmic Framework, Lecture Notes In Computer Science 10976 (11) 2018, s. 168–179.zobacz w PBN
• Tomasz Wąs i Oskar Skibski, An Axiomatization of the Eigenvector and Katz Centralities, w: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI-18), 2018, s. 1258–1265.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, On Normal Forms for Structured Specifications with Generating Constraints, w: Graph Transformation, Specifications, and Nets, Springer, 2018, s. 266–284.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń i Wiktor Zuba, Faster Recovery of Approximate Periods over Edit Distance, w: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, 2018, s. 233–240.zobacz w PBN
• Szymon Majewski, Michał Ciach, Michał Startek, Wanda Niemyska, Błażej Miasojedow i Anna Gambin, The Wasserstein Distance as a Dissimilarity Measure for Mass Spectra with Application to Spectral Deconvolution, w: 18th International Workshop on Algorithms in Bioinformatics (WABI 2018), 2018, s. 25:1–25:21.zobacz w PBN
• Stefan Dziembowski, Sebastian Faust i Kristina Host\'akov\'a, General State Channel Networks, w: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, s. 949–966.zobacz w PBN
• Krzysztof Gogolewski, Marcin Kostecki i Anna Gambin, Renal cell carcinoma classification: a case study of pitfalls associated with metabolic landscape analysis, w: 2018 IEEE International Conference on Bioinformatics and Biomedicine, 2018, s. 96–101.zobacz w PBN
• Kamil Kedzia, Wojtek Ptak, Jacek Sroka i Andrzej M. Kierzek, Simulation of multicellular populations with Petri nets and genome scale intracellular networks, Science Of Computer Programming 157 2018, s. 3–16.zobacz w PBN
• Łukasz Kowalik, Juho Lauri i Arkadiusz Aleksander Socała, On the Fine-Grained Complexity of Rainbow Coloring, Siam Journal On Discrete Mathematics 32 (3) 2018, s. 1672–1705.zobacz w PBN
• Jarosław Andrzej Paszek i Paweł Górecki, Inferring duplication episodes from unrooted gene trees, Bmc Genomics 19 (5) 2018, s. 288.zobacz w PBN
• Krzysztof Diks, Jerzy Czyżowicz, Jean Moussi i Wojciech Rytter, Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO 2018: 209-225, Lecture Notes In Computer Science 2018, s. 209–225.zobacz w PBN
• Jadwiga Sosnowska i Oskar Skibski, Path Evaluation and Centralities in Weighted Graphs - An Axiomatic Approach, w: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), 2018, s. 3856–3862.zobacz w PBN
• Lorenzo Clemente i Sławomir Lasota, Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, s. 118:1–118:14.zobacz w PBN
• Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski i Juliusz Straszyński, Efficient Computation of Sequence Mappability, w: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, 2018, s. 12–26.zobacz w PBN
• Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Algorithm for Long LCF with k Mismatches, w: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 23, s. 23:1–23:16.zobacz w PBN
• Maciej Świechowski, Tomasz Tajmajer i Andrzej Piotr Janusz, Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithms, w: 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018, Maastricht, The Netherlands, August 14-17, 2018, 2018, s. 1–8.zobacz w PBN
• Krzysztof Gogolewski i Anna Gambin, PCA-like Methods for the Integration of Single Cell RNA-seq Data with Metabolic Networks, w: 2018 IEEE 8th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS), 2018, s. 1–1.zobacz w PBN
• Anh Linh Nguyen, Computing Bisimulation-Based Comparisons, Fundamenta Informaticae 157 (4) 2018, s. 385–401.zobacz w PBN
• Daniel Lokshtanov, Michał Pilipczuk i Saket Saurabh, Below All Subsets for Minimal Connected Dominating Set, Siam Journal On Discrete Mathematics 32 (3) 2018, s. 2332–2345.zobacz w PBN
• Agnieszka Kikulska, Tobias Rausch, Ewa Krzywinska, Magdalena Pawlak, Bartosz Wilczyński, Vladimir Benes, Piotr Rutkowski i Tomasz Wilanowski, Coordinated expression and genetic polymorphisms in Grainyhead-like genes in human non-melanoma skin cancers, Bmc Cancer 18 (1) 2018, s. 23.zobacz w PBN
• Anna Papierniak, Katarzyna Kozak, Maria Kendziorek, Anna Barabasz, Anna Palusińska, Jerzy Tiuryn, Bohdan Paterczyk, Lorraine Elisabeth Williams i Danuta Maria Antosiewicz, Contribution of NtZIP1-Like to the regulation of Zn-homeostasis, Frontiers In Plant Science 9 (185) 2018.zobacz w PBN
• Tomasz Wąs i Oskar Skibski, Axiomatization of the PageRank Centrality, w: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), 2018, s. 3898–3904.zobacz w PBN
• Wojciech Czerwiński, Piotr Hofman i Georg Zetzsche, Unboundedness Problems for Languages of Vector Addition Systems, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, s. 119:1–119:15.zobacz w PBN
• Paweł Parys, Recursion Schemes and the WMSO+U Logic, w: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 53, s. 1–16.zobacz w PBN
• Paweł Tabaszewski, Paweł Górecki i Oliver Eulenstein, Phylogenetic Consensus for Exact Median Trees, w: BCB '18 Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, New York 2018, s. 366–375.zobacz w PBN
• Andrzej Piotr Janusz, Tomasz Tajmajer, Maciej Świechowski, Lukasz Grad, Jacek Puczniewski i Dominik Ślęzak, Toward an Intelligent HS Deck Advisor: Lessons Learned from AAIA'18 Data Mining Competition, w: Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, FedCSIS 2018, Poznań, Poland, September 9-12, 2018., 2018, s. 189–192.zobacz w PBN
• Marek Grabowski, Grzegorz Bokota, Jacek Sroka i Andrzej M. Kierzek, Verification of Dynamic Behaviour in Qualitative Molecular Networks Describing Gene Regulation, Signalling and Whole-cell Metabolism, Fundamenta Informaticae 160 (1-2) 2018, s. 199–219.zobacz w PBN
• Oskar Skibski, Tomasz Michalak i Michael Wooldridge, The Stochastic Shapley Value for coalitional games with externalities, Games And Economic Behavior 108 2018, s. 65–80.zobacz w PBN
• Agnieszka Mykowiecka, Paweł Szczęsny i Paweł Górecki, Inferring gene-species assignments in the presence of horizontal gene transfer, Ieee-acm Transactions On Computational Biology And Bioinformatics 15 (5) 2018, s. 1571–1578.zobacz w PBN
• Michał Pilipczuk i Marcin Wrochna, On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, Acm Transactions On Computation Theory 9 (4) 2018, s. 18:1–18:36.zobacz w PBN
• Lars Kotthoff, Alexandre Frechette, Tomasz Michalak, Talal Rahwan, Holger Hoos i Kevin Leyton-Brown, Quantifying Algorithmic Improvements over Time, w: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), 2018, s. 5165–5171.zobacz w PBN
• Michał Paweł Skrzypczak, Unambiguous Languages Exhaust the Index Hierarchy, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, r. 140, s. 140:1–140:14.zobacz w PBN
• Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur i Tomasz Waleń, String Periods in the Order-Preserving Model, w: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 38, s. 38:1–38:16.zobacz w PBN
• Dawid Dąbkowski i Paweł Górecki, Minimising the Deep Coalescence, w: Proceedings of the 10th International Conference on Bioinformatics and Computational Biology, Las Vegas 2018, s. 168–174.zobacz w PBN
• Tomasz Tajmajer, Modular Multi-Objective Deep Reinforcement Learning with Decision Values, w: Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, FedCSIS 2018, Poznań, Poland, September 9-12, 2018., 2018, s. 85–93.zobacz w PBN