Publikacje

Instytut Informatyki

2019

• Magdalena Plotka, Enea Sancho-Vaello, Sebastian Dorawa, Anna-Karina Kaczorowska, Łukasz Kozłowski, Tadeusz Kaczorowski i Kornelius Zeth, Structure and function of the Ts2631 endolysin of Thermus scotoductus phage vB\_Tsc2631 with unique N-terminal extension used for peptidoglycan binding, Scientific Reports Of The Nature Publishing Group 9 (1) 2019, s. 1261.zobacz w PBN
• Oskar Skibski, Talal Rahwan, Tomasz Michalak i Michael Wooldridge, Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-restricted Games, Acm Transactions On Intelligent Systems And Technology 10 (2) 2019, s. 15:1–15:25.zobacz w PBN
• Marcin Ireneusz Mucha, Karol Zbigniew Węgrzycki i Michał Włodarczyk, A Subquadratic Approximation Scheme for Partition, w: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, SIAM, 2019, s. 70–88.zobacz w PBN
• Wojciech Jaworski, Sara Szymkuć, Barbara Mikulak-Klucznik, Krzysztof Piecuch, Tomasz Klucznik, Michal Kazmierowski, Jan Rydzewski, Anna Gambin i Bartosz Grzybowski, Automatic mapping of atoms across both simple and complex chemical reactions, Nature Communications 10 (1) 2019, s. 1434.zobacz w PBN
• Oskar Skibski, Talal Rahwan, Tomasz Michalak i Makoto Yokoo, Attachment Centrality: Measure for Connectivity in Networks, Artificial Intelligence 274 2019, s. 151–179.zobacz w PBN
• Jacek Szklarski, Łukasz Sebastian Białek i Andrzej Szałas, Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis, International Journal Of Uncertainty Fuzziness And Knowledge-based Systems 27 (3) 2019, s. 429–455.zobacz w PBN
• Łukasz Sebastian Białek, Barbara Dunin-Kęplicz i Andrzej Szałas, A paraconsistent approach to actions in informationally complex environments, Annals Of Mathematics And Artificial Intelligence 2019, s. 1–25.zobacz w PBN
• Grzegorz Dudziuk, Weronika Wronowska, Anna Gambin, Zuzanna Szymańska i Mikołaj Jakub Rybiński, Biologically sound formal model of Hsp70 heat induction, Journal Of Theoretical Biology 478 (7) 2019, s. 74–101.zobacz w PBN
• Mateusz Krzysztof Łącki, Frederik Lermyte, Błażej Miasojedow, Michał Startek, Frank Sobott, Dirk Valkenborg i Anna Gambin, masstodon: A tool for assigning peaks and modeling electron transfer reactions in top-down mass spectrometry, Analytical Chemistry 0 (ja) 2019, s. null.zobacz w PBN
• Łukasz Sebastian Białek, Barbara Dunin-Kęplicz i Andrzej Szałas, Belief Shadowing, w: EMAS 2018: Engineering Multi-Agent Systems, Springer, Cham 2019, s. 158–180.zobacz w PBN
• Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdziński, Ranko Lazić i Paweł Parys, Universal Trees Grow Inside Separating Automata: Quasi-Polynomial Lower Bounds for Parity Games, w: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, SIAM, 2019, s. 2333–2349.zobacz w PBN
• Andrzej Szałas, Decision-Making Support Using Nonmonotonic Probabilistic Reasoning, w: Intelligent Decision Technologies 2019 Proceedings of the 11th KES International Conference on Intelligent Decision Technologies (KES-IDT 2019), Volume 1, Springer, Singapore 2019, r. 4, s. 39–51.zobacz w PBN
• Bedoor K. Alshebli, Tomasz Michalak, Oskar Skibski, Michael Wooldridge i Talal Rahwan, A Measure of Added Value in Groups, Acm Transactions On Autonomous And Adaptive Systems 13 (4) 2019, s. 18:1–18:46.zobacz w PBN
• Victor Murcia Pienkowski, Marzena Kucharczyk, Marlena Młynek, Krzysztof Szczałuba, Małgorzata Rydzanicz, Barbara Poszewiecka, Agata Skórka, Maciej Sykulski, Anna Biernacka, Agnieszka Koppolu, Renata Posmyk, Anna Walczak, Joanna Kosińska, Paweł Krajewski, Jennifer Castaneda, Ewa Obersztyn, Elżbieta Jurkiewicz, Robert Śmigiel, Anna Gambin, Krystyna Chrzanowska, Małgorzata Krajewska-Walasek i Rafał Płoski, Mapping of breakpoints in balanced chromosomal translocations by shallow whole genome sequencing points to EFNA5, BAHD1 and PPP2R5E as novel candidates for genes causing human Mendelian disorders, Journal Of Medical Genetics 2019.zobacz w PBN
• Tomasz Wąs, Talal Rahwan i Oskar Skibski, Random Walk Decay Centrality, w: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-19), 2019, s. 2197–2204.zobacz w PBN
• Jerzy Tiuryn i Ewa Szczurek, Learning signaling networks from combinatorial perturbations by exploiting siRNA off-target effects, Bioinformatics 35 (14) 2019, s. i605–i614.zobacz w PBN

2018

• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Wojciech Plandowski, On PSPACE generation of a solution set of a word equation and its applications, Theoretical Computer Science 2018.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Anna Gambin i Monika Heiner, Advances in Biological processes and Petri nets (BioPPN) Preface, Fundamenta Informaticae 2018.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
• 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
• 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
• Ł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
• 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
• 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 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Stefan Dziembowski, Tomasz Kazana i Maciej Zdanowicz, Quasi chain rule for min-entropy, Information Processing Letters 134 2018, s. 62–66.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
• 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 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
• 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
• 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
• 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
• 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
• Damian Repke i Wojciech Rytter, On Semi-perfect de Bruijn words, Theoretical Computer Science 720 2018, s. 55–63.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
• 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
• 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
• 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
• 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
• 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
• Ł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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Ł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
• 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
• 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
• 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
• Alina Frolova i Bartosz Wilczyński, Distributed Bayesian networks reconstruction on the whole genome scale, Peerj 6 2018, s. e5692.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
• 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
• Anita Liebenau, Marcin Pilipczuk, Paul Seymour i Sophie Spirkl, Caterpillars in Erdős–Hajnal, Journal Of Combinatorial Theory Series B 2018.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
• Mirosław Kowaluk i Andrzej Lingas, Are unique subgraphs not easier to find?, Information Processing Letters 134 2018, s. 57–61.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Aleksy Andrzej Schubert i Paweł Urzyczyn, Answer set programming in intuitionistic logic, Indagationes Mathematicae-new Series 29 2018, s. 276–292.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Anh Linh Nguyen, Computing Bisimulation-Based Comparisons, Fundamenta Informaticae 157 (4) 2018, s. 385–401.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
• 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
• 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
• 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ł 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
• 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
• 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
• 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
• Ł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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Marcin Michalak i Dominik Ślęzak, Boolean Representation for Exact Biclustering, Fundamenta Informaticae 161 (3) 2018, s. 275–297.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

2017

• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Łukasz Kozłowski, Proteome-pI: proteome isoelectric point database, Nucleic Acids Research 45 (D1) 2017, s. D1112–D1116.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
• 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
• 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
• Lech Banachowski, Krzysztof Diks i Wojciech Rytter, Algorytmy i struktury danych, Wydawnictwo Naukowe PWN, Warszawa 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
• 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
• 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
• 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
• 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
• Eryk Kopczyński, Computational Complexity on the Blackboard, Fundamenta Informaticae 152 (4) 2017, s. 323–339.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, String Powers in Trees, Algorithmica 79 (3) 2017, s. 814–834.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
• Tomasz Idziaszek i Jakub Jan Radoszewski (red.), XXIII Olimpiada Informatyczna 2015/2016, Warszawa 2017.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Dariusz Matlak i Ewa Szczurek, Epistasis in genomic and survival data of cancer patients, Plos Computational Biology 2017.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Marcin Pilipczuk, Michał Pilipczuk i Marcin Wrochna, Edge Bipartization Faster than 2^k, Algorithmica 2017.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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ł 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
• 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
• 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
• 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
• 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
• 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
• Michał Przybyłek, Adam Wierzbicki i Zbigniew Michalewicz, Decomposition Algorithms for a Multi-Hard Problem, Evolutionary Computation 2017, s. 1–27.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
• Marcin Konrad Dziubiński i Sanjeev Goyal, How do you defend a network?, Theoretical Economics 12 (1) 2017, s. 331–376.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
• 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
• 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
• 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
• 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
• 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
• 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
• Krzysztof Diks, Wojciech Rytter, Jerzy Czyżowicz i Jean Moussi (red.), Lecture Notes in Computer Science, 2017.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
• 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
• 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
• 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
• Sławomir Lasota, Equivariant algorithms for constraint satisfaction problems over coset templates, Information Processing Letters 118 2017, s. 44–52.zobacz w PBN
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Anuj Dawar i Eryk Kopczyński, Bounded degree and planar spectra, Logical Methods In Computer Science Volume 13, Issue 4 2017.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
• Ł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
• 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
• 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
• Ł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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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: 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
• Maciej Klimek, Henryk Michalewski i Piotr Miłoś, Hierarchical Reinforcement Learning with Parameters, Journal Of Machine Learning Research 78 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
• 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
• 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
• 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
• 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
• 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
• 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
• Ł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
• 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 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Marcin Peczarski, Comments on the Golden Partition Conjecture, Contributions To Discrete Mathematics 12 (1) 2017, s. 106–109.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
• 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
• 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
• Jacek Sroka i Jan Hidders, Finding AND-OR Hierarchies in Workflow Nets, Arxiv abs/1701.02199 2017.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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

2016

• Piotr Szczepański, Tomasz Michalak i Talal Rahwan, Efficient algorithms for game-theoretic betweenness centrality, Artificial Intelligence 231 2016, s. 39–63.zobacz w PBN
• Mikołaj Bojańczyk, Paweł Parys i Szymon Toruńczyk, The MSO+U Theory of (N,<) Is Undecidable, w: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 21, s. 21:1–21:8.zobacz w PBN
• Marcin Konrad Dziubiński, Piotr Sankowski i Qiang Zhang, Network elicitation in adversarial environment, w: Proceedings of the 7th International Conference on Decision and Game Theory for Security, GameSec 2016, Springer, New York 2016, s. 397–414.zobacz w PBN
• Oskar Skibski, Talal Rahwan, Tomasz Michalak i Makoto Yokoo, Attachment Centrality: An Axiomatic Approach to Connectivity in Networks, w: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), 2016, s. 168–176.zobacz w PBN
• Jacek Chrząszcz i Aleksy Andrzej Schubert, The role of polymorphism in the characterisation of complexity by soft types, Information And Computation 248 2016, s. 130–149.zobacz w PBN
• Marthe Bonamy i Łukasz Kowalik, A 13k-kernel for planar feedback vertex set via region decomposition, Theoretical Computer Science 645 2016, s. 25–40.zobacz w PBN
• Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen i Marcin Wrochna, Polynomial Kernelization for Removing Induced Claws and Diamonds, w: Graph-Theoretic Concepts in Computer Science - 41st International Workshop, Springer, 2016, s. 440–455.zobacz w PBN
• Henryk Michalewski i Michał Paweł Skrzypczak, Unambiguous Büchi Is Weak, w: Developments in Language Theory - 20th International Conference, DLT 2016, Montr\'eal, Canada, July 25-28, 2016, Proceedings, 2016, s. 319–331.zobacz w PBN
• Chris Cornelis, Hung Son Nguyen, Sankar K. Pal, Wei-Zhi Wu i Andrzej Skowron, Preface: Special issue on rough sets and fuzzy sets, Fundamenta Informaticae 142 (1-4) 2016, s. v–viii.zobacz w PBN
• Filip Aleksander Mazowiecki, Filip Murlak i Adam Wojciech Witkowski, Monadic Datalog and Regular Tree Pattern Queries, Acm Transactions On Database Systems 41 (3) 2016, s. 20:1–20:43.zobacz w PBN
• Wacław Banasik, Stefan Dziembowski i Daniel Malinowski, Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts, w: Computer Security – ESORICS 2016, 2016, s. 261–280.zobacz w PBN
• Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi i Piotr Sankowski, Online Network Design with Outliers, Algorithmica 76 (1) 2016, s. 88–109.zobacz w PBN
• Łukasz Kowalik i Arkadiusz Aleksander Socała, Assigning Channels Via the Meet-in-the-Middle Approach, Algorithmica 74 (4) 2016, s. 1435–1452.zobacz w PBN
• Tomasz Michalak, Talal Rahwan, Edith Elkind, Michael Wooldridge i Nicholas R. Jennings, A hybrid exact algorithm for complete set partitioning, Artificial Intelligence 230 2016, s. 14–50.zobacz w PBN
• Jerzy Sikora, Jacek Sroka i Jerzy Paweł Tyszkiewicz, Strati5 - Open Mobile Software for Harris Matrix, w: NEW: CAA2015. Keep The Revolution Going Proceedings of the 43rd Annual Conference on Computer Applications and Quantitative Methods in Archaeology, Archaeopress, Oxford, Wielka Brytania 2016, s. 1005–1014.zobacz w PBN
• Victor Flores, Fernando Gomide, Andrzej Piotr Janusz, Claudio Meneses, Duoqian Miao, Georg Peters, Dominik Ślęzak, Guoyin Wang, Richard Weber i Yiyu Yao (red.), Rough Sets. International Joint Conference, IJCRS 2016, Santiago de Chile, Chile, October 7–11, 2016, Proceedings, Springer, 2016.zobacz w PBN
• Oskar Skibski, Szymon Matejczyk, Tomasz Michalak, Michael Wooldridge i Makoto Yokoo, k-Coalitional Cooperative Games, w: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), 2016, s. 177–185.zobacz w PBN
• Janina Mincer-Daszkiewicz i Wojciech Rygielski, EMREX in Poland supporting internal mobility, w: EUNIS 2016: Crossroads where the past meets the future, Book of Proceedings, Yiannis Salmatzidis, Thessaloniki, Greece 2016, s. 254–262.zobacz w PBN
• Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki i Piotr Wygocki, There is Something Beyond the Twitter Network, w: Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016, s. 279–284.zobacz w PBN
• Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen i Marcin Wrochna, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory Of Computing Systems 2016, s. 1–22.zobacz w PBN
• Michał Paweł Skrzypczak i Igor Walukiewicz, Deciding the Topological Complexity of Büchi Languages, w: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 2016, s. 99:1–99:13.zobacz w PBN
• Aleksandra Boniewicz, Piotr Wiśniewski i Krzysztof Stencel, Estimating Costs of Materialization Methods for SQL: 1999 Recursive Queries, w: Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery - 12th International Conference, BDAS 2016, Ustroń, Poland, May 31 - June 3, 2016, Proceedings, Springer, 2016, s. 225–235.zobacz w PBN
• Stephan Kreutzer, Michał Pilipczuk, Roman Rabinovich i Sebastian Siebertz, The Generalised Colouring Numbers on Classes of Bounded Expansion, w: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, r. 85, s. 85:1–85:13.zobacz w PBN
• Volker Diekert, Artur Jeż i Wojciech Plandowski, Finding all solutions of equations in free groups and monoids with involution, Information And Computation (251) 2016, s. 263–286.zobacz w PBN
• Anh Linh Nguyen, Thi Hong Khanh Nguyen, Ngoc Thanh Nguyen i Quang-Thuy Ha, Bisimilarity for paraconsistent description logics, w: 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016, Budapest, Hungary, October 9-12, 2016, IEEE, 2016, s. 4694–4699.zobacz w PBN
• Łukasz Kozłowski, IPC – Isoelectric Point Calculator, Biology Direct 11 (1) 2016, s. 55.zobacz w PBN
• Sara Szymkuć, Ewa P. Gajewska, Tomasz Klucznik, Karol Molga, Piotr Dittwald, Michał Startek, Michał Bajczyk i Bartosz A. Grzybowski, Computer-Assisted Synthetic Planning: The End of the Beginning, Angewandte Chemie-international Edition 55 (20) 2016, s. 5904–5937.zobacz w PBN
• Michał Przybyłek, Logical systems I: Internal calculi, Journal Of Pure And Applied Algebra 221 (2) 2016, s. 449–489.zobacz w PBN
• Oskar Skibski, Henryk Michalewski, Andrzej Nagórko, Tomasz Michalak, Andrew Dowell, Talal Rahwan i Michael Wooldridge, Non-Utilitarian Coalition Structure Generation, w: Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), 2016, s. 1738–1739.zobacz w PBN
• Janina Mincer-Daszkiewicz, Mats Lindsted, Anders Bøgebjerg Hansen, Stefano Russo, Geir Magne Vangen i Mattias Holmlund, Supporting Student Mobility with EMREX - a field trial on exchanging student achievement records, w: EUNIS 2016: Crossroads where the past meets the future, Book of Proceedings, Yiannis Salmatzidis, Thessaloniki, Greece 2016, s. 74–76.zobacz w PBN
• Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki i Piotr Wygocki, Locality-Sensitive Hashing Without False Negatives for \$\$l\_p\$\$, w: Computing and Combinatorics : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, 2016, s. 105–118.zobacz w PBN
• Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Michał Pilipczuk i Michael Wehar, Shortest Paths in One-Counter Systems, w: Foundations of Software Science and Computation Structures 19th International Conference, FOSSACS 2016, Springer, 2016, s. 462–478.zobacz w PBN
• Alessandro Facchini, Filip Murlak i Michał Paweł Skrzypczak, Index Problems for Game Automata, Acm Transactions On Computational Logic 17 (4) 2016, s. 24:1–24:38.zobacz w PBN
• Krzysztof Rykaczewski, Piotr Wiśniewski i Krzysztof Stencel, An Algorithmic Way to Generate Simplexes for Topological Data Analysis, w: Proceedings of the 25th International Workshop on Concurrency, Specification and Programming, Rostock, Germany, September 28-30, 2016., 2016, s. 180–188.zobacz w PBN
• Michał Pilipczuk i Szymon Toruńczyk, On Ultralimits of Sparse Graph Classes, Electronic Journal Of Combinatorics 23 (2) 2016, s. P2.32.zobacz w PBN
• Konrad Durnoga, Stefan Dziembowski, Maciej Zdanowicz, Michał Paweł Zając i Tomasz Piotr Kazana, Bounded-Retrieval Model with Keys Derived from Private Data, Lecture Notes In Computer Science 2016.zobacz w PBN
• Marcin Andrychowicz, Stefan Dziembowski i Sebastian Faust, Circuit Compilers with O(1/log(n)) Leakage Rate, w: Advances in Cryptology -- EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, 2017, s. 586–615.zobacz w PBN
• Marek Sikora, Wojciech Moczulski, Piotr Przystałka, Dominik Ślęzak i Anna Timofiejczuk, A new decision support tool for fault diagnosis, hazard prediction and analysis in mining industry, w: Mining in a world of innovation. Innovation in mining., IBRAM, Brazylia 2016, s. 28–37.zobacz w PBN
• Henryk Michalewski, Andrzej Nagórko i Jakub Pawlewicz, 485 – A New Upper Bound for Morpion Solitaire, w: Computer Games, Springer International Publishing, 2016, s. 44–59.zobacz w PBN
• Michał Przybyłek, Adam Wierzbicki i Zbigniew Michalewicz, Multi-hard Problems in Uncertain Environment, w: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016, ACM, New York 2016, s. 381–388.zobacz w PBN
• Oskar Skibski, Rozbijanie sieci terrorystycznych za pomocą teorii gier, Delta 2016.zobacz w PBN
• Janina Mincer-Daszkiewicz i Wojciech Rygielski, Erasmus Without Paper - from the technical perspective, w: EUNIS 2016: Crossroads where the past meets the future, Book of Proceedings, Yiannis Salmatzidis, Thessaloniki, Greece 2016, s. 70–73.zobacz w PBN
• Paweł Urzyczyn, Intuitionistic Games: Determinacy, Completeness, and Normalization, Studia Logica 104 (5) 2016, s. 957–1001.zobacz w PBN
• Wojciech Ptak, Andrzej M. Kierzek i Jacek Sroka, AB-QSSPN: Integration of Agent-Based Simulation of Cellular Populations with Quasi-Steady State Simulation of Genome Scale Intracellular Networks, w: Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS 2016, Toruń, Poland, June 19-24, 2016. Proceedings, Springer, 2016, s. 113–122.zobacz w PBN
• Michał Paweł Skrzypczak, Descriptive Set Theoretic Methods in Automata Theory - Decidability and Topological Complexity, Springer, 2016.zobacz w PBN
• Ludwik Czaja, Wojciech Penczek i Krzysztof Stencel, Preface, Fundamenta Informaticae 147 (2-3) 2016, s. i–iii.zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk i Yngve Villanger, Largest Chordal and Interval Subgraphs Faster than 2^n, Algorithmica 76 (2) 2016, s. 569–594.zobacz w PBN
• Andrzej Piotr Janusz, Dominik Ślęzak, Marek Sikora i Łukasz Wróbel, Predicting Dangerous Seismic Events: AAIA'16 Data Mining Challenge, w: Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, FedCSIS 2016, Gdańsk, Poland, September 11-14, 2016., 2016, s. 205–211.zobacz w PBN
• Stefan Dziembowski, Sebastian Faust i Maciej Skórski, Optimal Amplification of Noisy Leakages, w: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II, Springer, 2016, s. 291–318.zobacz w PBN
• Jacek Cyranka i Piotr Zgliczynski, Stabilizing effect of large average initial velocity in forced dissipative PDEs invariant with respect to Galilean transformations, Journal Of Differential Equations 261 (8) 2016, s. 4648–4708.zobacz w PBN
• Davide Ciucci, Dominik Ślęzak i Marcin Wolski, Preface, Fundamenta Informaticae 148 (1-2) 2016, s. v–vi.zobacz w PBN
• Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu i Ke Yi, Research Directions for Principles of Data Management (Abridged), Sigmod Record 45 (4) 2016, s. 5–17.zobacz w PBN
• Marcin Jan Waniek, Long Tran-Thahn i Tomasz Michalak, Repeated Dollar Auctions: A Multi-Armed Bandit Approach, w: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), 2016, s. 579–587.zobacz w PBN
• Michał Chlebiej, Piotr Habela, Andrzej Rutkowski, Iwona Szulc, Piotr Wiśniewski i Krzysztof Stencel, Architectural Challenges of Genotype-Phenotype Data Management, w: Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery - 12th International Conference, BDAS 2016, Ustroń, Poland, May 31 - June 3, 2016, Proceedings, Springer, 2016, s. 475–484.zobacz w PBN
• Łukasz Sosnowski i Marcin Szczuka, Recognition of Compound Objects Based on Network of Comparators, w: Position Papers of the 2016 Federated Conference on Computer Science and Information Systems, FedCSIS 2016, Gdańsk, Poland, September 11-14, 2016., IEEE, 2016, s. 33–40.zobacz w PBN
• Bartosz Klin i Michał Szynwelski, SMT Solving for Functional Programming over Infinite Structures, w: Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016, s. 57–75.zobacz w PBN
• Marek Rogala, Jan Hidders i Jacek Sroka, DatalogRA: datalog with recursive aggregation in the spark RDD model, w: Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems, Redwood Shores, CA, USA, June 24 - 24, 2016, ACM, 2016, s. 3.zobacz w PBN
• Marcin Przybyłko i Michał Paweł Skrzypczak, On the Complexity of Branching Games with Regular Conditions, w: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. 78:1–78:14.zobacz w PBN
• Ewa Maria Szczurek i Niko Beerenwinkel, Linear effects models of signaling pathways from combinatorial perturbation data., Bioinformatics 12 (32) 2016.zobacz w PBN
• Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach i Michał Pilipczuk, How to hunt an invisible rabbit on a graph, European Journal Of Combinatorics 52 (A) 2016, s. 12–26.zobacz w PBN
• Wu Huihai, Axel von Kamp, Vytautas Leoncikas, Wataru Mori, Nilgun Sahin, Albert Gevorgyan, Catherine Linley, Marek Grabowski, Ahmad A Mannan, Nicholas Stoy, Graham R Stewart, Lara T Ward, David J M Lewis, Jacek Sroka, Hiroshi Matsuno, Steffen Klamt, Hans V Westerhoff, Johnjoe McFadden, Nicholas J Plant i Andrzej M Kierzek, MUFINS: multi-formalism interaction network simulator, Npj Systems Biology And Applications 2 2016.zobacz w PBN
• Adam Karol Karczmarz, A Simple Mergeable Dictionary, w: 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2016, s. 7:1–7:13.zobacz w PBN
• Paweł Markowski i Michał Przybyłek, Process Mining Methodology in Industrial Environment: Document Flow Analysis, w: Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, FedCSIS 2016, Gdańsk, Poland, September 11-14, 2016., 2016, s. 1175–1178.zobacz w PBN
• Charles C Guo, Vipulkumar Dadhania, Li Zhang, Jolanta Bondaruk, Tadeusz Majewski, Maciej Sykulski, Weronika Wronowska, Anna Gambin, Ashish Kamat i Colin Dinney, Molecular Characterization of Clinically Aggressive Micropapillary Bladder Cancer, w: LABORATORY INVESTIGATION, 2016, s. 235A–235A.zobacz w PBN
• Bartosz Klin, Sławomir Lasota, Joanna Ochremiak i Szymon Toruńczyk, Homomorphism Problems for First-Order Definable Structures, w: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), 2016, r. 14, s. 14:1–14:15.zobacz w PBN
• Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, s. 38–48.zobacz w PBN
• Foto N. Afrati, Jacek Sroka i Jan Hidders (red.), Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2016, San Francisco, CA, USA, July 1, 2016, ACM, 2016.zobacz w PBN
• Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Adam Polak, Jakub Jan Radoszewski i Jakub Wojtaszczyk, Distributed Tasks: Introducing Distributed Computing to Programming Competitions, Olympiads In Informatics 10 2016, s. 177–194.zobacz w PBN
• Alina Ene, Matthias Mnich, Marcin Pilipczuk i Andrej Risteski, On Routing Disjoint Paths in Bounded Treewidth Graphs, w: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016, s. 15:1–15:15.zobacz w PBN
• Hans L. Bodlaender, Pål Grønås Drange Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov i Michał Pilipczuk, A c^k n 5-Approximation Algorithm for Treewidth, Siam Journal On Computing 45 (2) 2016, s. 317–378.zobacz w PBN
• Stefan Dziembowski, Sebastian Faust i Franćcois-Xavier Standaert, Private Circuits III: Hardware Trojan-Resilience via Testing Amplification, w: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016, s. 142–153.zobacz w PBN
• Ryan Hayward, Jakub Pawlewicz, Kei Takada i Tony van der Valk, Mohex Wins 2015 Hex 11x11 and Hex 13x13 Tournaments, Icga Journal preprint (preprint) 2016, s. 1–6.zobacz w PBN
• Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski i Łukasz Paweł Mazurek, Secure Multiparty Computations on Bitcoin, Communications Of The Acm 59 (4) 2016, s. 76–84.zobacz w PBN
• Patrick Doherty, Jonas Kvarnström i Andrzej Szałas, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, w: Logics in Artificial Intelligence: 15th European Conference, JELIA 2016, Springer International Publishing, 2016, s. 536–542.zobacz w PBN
• Miao Zhang, Charles Guo, Tadeusz Majewski, Vipulkumar Dadhania, Maciej Sykulski, Weronika Wronowska, Woonyoung Choi, David McConkey, Colin Dinney i Anna Gambin, Immunohistochemical Profiles of Molecular Subtypes of Bladder Cancer, w: LABORATORY INVESTIGATION, 2016, s. 270A–270A.zobacz w PBN
• Leszek Aleksander Kołodziejczyk i Henryk Michalewski, How unprovable is Rabin's decidability theorem?, w: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, s. 788–797.zobacz w PBN
• Jakub Jan Radoszewski i Tomasz Radzik, 2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW), Journal Of Discrete Algorithms 37 2016, s. 1–2.zobacz w PBN
• Marcin Ireneusz Mucha i Maxim Sviridenko, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, Mathematics Of Operations Research 41 (1) 2016, s. 247–254.zobacz w PBN
• Tomasz Idziaszek i Jakub Jan Radoszewski (red.), XXII Olimpiada Informatyczna 2014/2015, Komitet Główny Olimpiady Informatycznej, Warszawa 2016.zobacz w PBN
• Paal Gronaas Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Felix Reidl, Fernando S\'anchez Villaamil, Saket Saurabh, Sebastian Siebertz i Somnath Sikdar, Kernelization and Sparseness: the Case of Dominating Set, w: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, s. 31:1–31:14.zobacz w PBN
• Filip Murlak, Charles Paperman i Michał Pilipczuk, Schema Validation via Streaming Circuits, w: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, ACM, New York 2016, s. 237–249.zobacz w PBN
• Stefan Dziembowski, Sebastian Faust, Gottfried Herold, Anthony Journault, Daniel Masny i François-Xavier Standaert, Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems, w: Advances in Cryptology -- CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, 2016, s. 272–301.zobacz w PBN
• Sławomir Lasota i Marcin Poturalski, Undecidability of performance equivalence of Petri nets, Theoretical Computer Science 655 2016, s. 109–119.zobacz w PBN
• Michał Pilipczuk i Marcin Wrochna, On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, w: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 57, s. 57:1–57:15.zobacz w PBN
• Damian Niwiński, Contribution of Warsaw Logicians to Computational Logic, Axioms 5 (2) 2016.zobacz w PBN
• Sinh Hoa Nguyen i Marcin Szczuka, Feature Selection in Decision Systems with Constraints, w: Rough Sets. International Joint Conference, IJCRS 2016, Santiago de Chile, Chile, October 7–11, 2016, Proceedings, Springer, 2016, s. 537–547.zobacz w PBN
• Leszek Aleksander Kołodziejczyk, Henryk Michalewski, Pierre Pradic i Michał Paweł Skrzypczak, The logical strength of Büchi's decidability theorem, w: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), Schloss Dagstuhl 2016, s. 36:1–36:16.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science 648 2016, s. 84–95.zobacz w PBN
• Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski i Qiang Zhang, Online Pricing with Impatient Bidders, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 190–201.zobacz w PBN
• Paweł Jarosław Brach, Marek Adam Cygan, Jakub Włodzimierz Łącki i Piotr Sankowski, Algorithmic Complexity of Power Law Networks, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1306–1325.zobacz w PBN
• Chandra Chekuri, Alina Ene i Marcin Pilipczuk, Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs, w: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 2016, s. 7:1–7:14.zobacz w PBN
• Henryk Michalewski, Matteo Mio i Mikołaj Bojańczyk, On the Regular Emptiness Problem of Subzero Automata, w: Proceedings 9th Interaction and Concurrency Experience, ICE 2016, Heraklion, Greece, 8-9 June 2016., 2016, s. 1–23.zobacz w PBN
• Krzysztof Krejtz, Izabela Krejtz, Andrew Duchowski, Agata Kopacz i Piotr Chrząstowski-Wachtel, Gaze Transitions when Learning with Multimedia, Journal Of Eye Movement Research 2016.zobacz w PBN
• Piotr Sankowski i Zaroliagis Christos (red.), 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.zobacz w PBN
• Jarosław Domaszewicz, S. Lalis, Aleksander Pruszkowski, M. Koutsoubelias, Tomasz Tajmajer, N. Grigoropoulos, M. Nati i A. Gluhak, Soft Actuation: Smart Home and Office with Human-in-the-Loop, Ieee Pervasive Computing 15 (1) 2016, s. 48–56.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Order-preserving indexing, Theoretical Computer Science 638 2016, s. 122–135.zobacz w PBN
• Marcin Ireneusz Mucha i Piotr Sankowski, Maximum Matching, w: Encyclopedia of Algorithms, Springer, 2016, s. 1238–1240.zobacz w PBN
• Ivan Bliznets, Marek Adam Cygan, Paweł Komosa i Michał Pilipczuk, Hardness of Approximation for H-Free Edge Modification Problems, w: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, 2016, s. 3:1–3:17.zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, w: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, IEEE, 2016, s. 515–524.zobacz w PBN
• Wojciech Rytter, Two fast constructions of compact representations of binary words with given set of periods, Theoretical Computer Science 656, Part B 2016, s. 180–187.zobacz w PBN
• Eryk Kopczyński i Szymon Toruńczyk, LOIS: an Application of SMT Solvers, w: Proceedings of the 14th International Workshop on Satisfiability Modulo Theories affiliated with the International Joint Conference on Automated Reasoning, SMT@IJCAR 2016, Coimbra, Portugal, July 1-2, 2016, CEUR-WS.org, 2016, s. 51–60.zobacz w PBN
• Marcin Szczuka, Andrzej Jankowski, Andrzej Skowron i Dominik Ślęzak, Granular Systems, w: Wiley Encyclopedia of Electrical and Electronics Engineering, John Wiley & Sons, Inc., New York 2016, s. 1–9.zobacz w PBN
• Marcin Konrad Dziubiński, Sanjeev Goyal i David E.N. Minarsch, Dynamic Conflict on a Network, w: Proceedings of the 2016 ACM Conference on Economics and Computation, ACM, New York 2016, s. 655–656.zobacz w PBN
• Łukasz Kowalik, Juho Lauri i Arkadiusz Aleksander Socała, On the Fine-Grained Complexity of Rainbow Coloring, w: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. 58:1–58:16.zobacz w PBN
• Tomasz Tajmajer, Spyros Lalis, Manos Koutsoubelias, Aleksander Pruszkowski, Jarosław Domaszewicz, Michele Nati i Alexander Gluhak, Node/Proxy portability: Designing for the two lives of your next WSAN middleware, Journal Of Systems And Software 117 2016, s. 366–383.zobacz w PBN
• Wojciech Czerwiński, Wim Martens, Matthias Niewerth i Paweł Parys, Minimization of Tree Pattern Queries, w: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, ACM, New York 2016, s. 43–54.zobacz w PBN
• Costas S. Iliopoulos i Jakub Jan Radoszewski, Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties, w: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, s. 8:1–8:12.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski i Wojciech Rytter, Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence, Siam Journal On Discrete Mathematics 30 (4) 2016, s. 2027–2046.zobacz w PBN
• Ivan Bliznets, Marek Adam Cygan, Paweł Komosa, Lukas Mach i Michał Pilipczuk, Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1132–1151.zobacz w PBN
• Barbara Dunin-Kęplicz i Alina Powała, Paraconsistent argumentation schemes, Web Intelligence And Agent Systems: An International Journal 14 (1) 2016, s. 43–65.zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks, Jean Mussi i Wojciech Rytter, Communication Problems for Mobile Agents Exchanging Energy, Lecture Notes In Computer Science 9988 2016, s. 275–288.zobacz w PBN
• Henryk Michalewski i Matteo Mio, Measure Quantifier in Monadic Second Order Logic, w: Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings, 2016, s. 267–282.zobacz w PBN
• Daniel Lokshtanov, Marcin Pilipczuk i Erik Jan van Leeuwen, Independence and Efficient Domination on P6-free Graphs, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1784–1803.zobacz w PBN
• Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki i Arkadiusz Aleksander Socała, Tight Bounds for Graph Homomorphism and Subgraph Isomorphism, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1643–1649.zobacz w PBN
• Marcin Benke, Daria Monika Walukiewicz-Chrząszcz i Aleksy Andrzej Schubert, Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic, w: 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal, Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Niemcy 2016, s. 12:1–12:16.zobacz w PBN
• Lorenzo Clemente, Paweł Parys, Sylvain Salvati i Igor Walukiewicz, The Diagonal Problem for Higher-Order Recursion Schemes is Decidable, w: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, s. 96–105.zobacz w PBN
• Carl Barton, Tomasz Kociumaka, Solon P. Pissis i Jakub Jan Radoszewski, Efficient Index for Weighted Sequences, w: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, s. 4:1–4:13.zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter i Tomasz Waleń, Faster longest common extension queries in strings over general alphabets, w: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, r. 5, s. 5:1–5:13.zobacz w PBN
• Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, Lower Bounds for Approximation Schemes for Closest String, w: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016, s. 12:1–12:10.zobacz w PBN
• Agnieszka Mykowiecka i Paweł Górecki, Bootstrapping Algorithms for Gene Duplication and Speciation Events, Lecture Notes In Computer Science 9702 2016, s. 106–118.zobacz w PBN
• Eryk Kopczyński, Invisible Pushdown Languages, w: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, s. 867–872.zobacz w PBN
• Marcin Pilipczuk i Magnus Wahlström, Directed multicut is W[1]-hard, even for four terminal pairs, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1167–1178.zobacz w PBN
• Konrad Iwanicki, RNFD: Routing-Layer Detection of DODAG (Root) Node Failures in Low-Power Wireless Networks, w: 15th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2016, Vienna, Austria, April 11-14, 2016, IEEE, 2016, s. 1–12.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, An Entailment Procedure for Kleene Answer Set Programs, w: Multi-disciplinary Trends in Artificial Intelligence, Springer International Publishing, 2016, s. 24–37.zobacz w PBN
• Mikołaj Bojańczyk, Thin MSO with a Probabilistic Path Quantifier, w: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 2016, s. 96:1–96:13.zobacz w PBN
• Wojciech Czerwiński, Claire David, Filip Murlak i Paweł Parys, Reasoning About Integrity Constraints for Tree-Structured Data, w: 19th International Conference on Database Theory (ICDT 2016), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, r. 20, s. 20:1–20:18.zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis i Jakub Jan Radoszewski, Pattern Matching and Consensus Problems on Weighted Sequences and Profiles, w: 27th International Symposium on Algorithms and Computation, 2016, s. 46:1–46:12.zobacz w PBN
• Marek Adam Cygan, Lukasz Jez i Jiri Sgall, Online Knapsack Revisited, Theory Of Computing Systems 58 (1) 2016, s. 153–190.zobacz w PBN
• Jakub Pawlewicz i Ryan B. Hayward, Conspiracy number search with relative sibling scores, Theoretical Computer Science 644 2016, s. 127–142.zobacz w PBN
• Piotr Hofman, Sławomir Lasota, Richard Mayr i Patrick Totzke, Simulation Problems Over One-Counter Nets, Logical Methods In Computer Science 12 (1) 2016.zobacz w PBN
• Piotr Szczepański, Tomasz Michalak, Talal Rahwan i Michael Wooldridge, An Extension of the Owen-Value Interaction Index and Its Application to Inter-Links Prediction, w: Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), 2016, r. 285, s. 90–98.zobacz w PBN
• Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters 116 (3) 2016, s. 245–251.zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk i Michał Pilipczuk, Subexponential parameterized algorithm for Interval Completion, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1116–1131.zobacz w PBN
• Piotr Jaszkowski, Paweł Sienkowski i Konrad Iwanicki, Decentralized Slicing in Mobile Low-Power Wireless Networks, w: International Conference on Distributed Computing in Sensor Systems, DCOSS 2016, Washington, DC, USA, May 26-28, 2016, IEEE, 2016, s. 177–186.zobacz w PBN
• Jerzy Sikora, Jacek Sroka i Jerzy Paweł Tyszkiewicz, Programming Communication with the User in Multiplatform Spreadsheet Applications, w: Software Technologies: Applications and Foundations, Springer International Publishing, 2016, s. 356–371.zobacz w PBN
• Mikołaj Bojańczyk i Michał Pilipczuk, Definability equals recognizability for graphs of bounded treewidth, w: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, s. 407–416.zobacz w PBN
• Paweł Parys i Szymon Toruńczyk, Models of Lambda-Calculus and the Weak MSO Logic, w: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), Schloss Dagstuhl 2016, r. 11, s. 11:1–11:12.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries, w: String Processing and Information Retrieval - 23rd International Symposium, 2016, s. 22–34.zobacz w PBN
• Anh Linh Nguyen, Computing Bisimulation-Based Comparisons, w: Proceedings of the 25th International Workshop on Concurrency, Specification and Programming, Berlin, Germany 2016, s. 245–256.zobacz w PBN
• Marek Adam Cygan, Marcin Pilipczuk i Michał Pilipczuk, Known Algorithms for Edge Clique Cover are Probably Optimal, Siam Journal On Computing 45 (1) 2016, s. 67–83.zobacz w PBN
• Jakub Pawlewicz, Myszy, Delta 2016.zobacz w PBN
• Diego Figueira, Piotr Hofman i Sławomir Lasota, Relating timed and register automata, Mathematical Structures In Computer Science 26 (6) 2016, s. 993–1021.zobacz w PBN
• Alexandre Fr\'echette, Lars Kotthoff, Tomasz Michalak, Talal Rahwan, Holger H Hoos i Kevin Leyton-Brown, Using the Shapley Value to Analyze Algorithm Portfolios., w: Proceedings of the 30th Conference on Artificial Intelligence, AAAI 2016, USA 2016, s. 3397–3403.zobacz w PBN
• Bartosz Klin i Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, Logical Methods In Computer Science 12 (4) 2016, s. 1–34.zobacz w PBN
• Karol Pąk i Aleksy Andrzej Schubert, The impact of proof steps sequence on proof readability - experimental setting, w: Joint Proceedings of the FM4M, MathUI, and ThEdu Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2016 co-located with the 9th Conference on Intelligent Computer Mathematics (CICM 2016), Bialystok, Poland, July 25-29, 2016., 2016, s. 172–186.zobacz w PBN
• Paweł Parys, Weak Containment for Partial Words is coNP-Complete, Information Processing Letters 116 (2) 2016, s. 125–127.zobacz w PBN
• Anudhyan Boral, Marek Adam Cygan, Tomasz Kociumaka i Marcin Pilipczuk, A Fast Branching Algorithm for Cluster Vertex Deletion, Theory Of Computing Systems 58 (2) 2016, s. 357–376.zobacz w PBN
• Aleksander Jankowski, Paulina Obara, Utsav Mathur i Jerzy Tiuryn, Enhanceosome transcription factors preferentially dimerize with high mobility group proteins, Bmc Systems Biology 10 2016, s. 14.zobacz w PBN
• A. V. Dharmadhikari, J. J. Sun, Krzysztof Gogolewski, B. L. Carofino, V. Ustiyan, M. Hill, T. Majewski, P. Szafranski, M. J. Justice, R. S. Ray, M. E. Dickinson, V. V. Kalinichenko, Anna Gambin i P. Stankiewicz, Lethal lung hypoplasia and vascular defects in mice with conditional Foxf1 overexpression, Biology Open 5 (11) 2016, s. 1595–1606.zobacz w PBN
• Bartosz Wilczyński i Jerzy Tiuryn, FastBill: An Improved Tool for Prediction of Cis-Regulatory Modules, Journal Of Computational Biology 2016.zobacz w PBN
• Paweł Parys, A Characterization of Lambda-Terms Transforming Numerals, Journal Of Functional Programming 26 2016, s. e12.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski i Bartłomiej Wiśniewski, Subquadratic-Time Algorithms for Abelian Stringology Problems, w: Mathematical Aspects of Computer and Information Sciences - 6th International Conference, 2016, s. 320–334.zobacz w PBN
• Anh Linh Nguyen, A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic, Fundamenta Informaticae 143 (1-2) 2016, s. 113–139.zobacz w PBN
• Rajesh Chitnis, Marek Adam Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk i Michał Pilipczuk, Designing FPT Algorithms for Cut Problems Using Randomized Contractions, Siam Journal On Computing 45 (4) 2016, s. 1171–1229.zobacz w PBN
• Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods In Computer Science 12 (4) 2016, s. 1–25.zobacz w PBN
• Sławomir Lasota, Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, w: Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS 2016, Toruń, Poland, June 19-24, 2016. Proceedings, Springer, 2016, s. 20–36.zobacz w PBN
• Mateusz Tarkowski, Piotr Szczepański, Talal Rahwan, Tomasz Michalak i Michael Wooldridge, Closeness Centrality for Networks with Overlapping Community Structure, w: Proceedings of the 30th Conference on Artificial Intelligence, AAAI 2016, USA 2016.zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks, Jean Moussi i Wojciech Rytter, Communication Problems for Mobile Agents Exchanging Energy, w: Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, Springer International Publishing, 2016, s. 275–288.zobacz w PBN
• Jakub Sygnowski i Henryk Michalewski, Learning from the Memory of Atari 2600, w: Computer Games, Springer International Publishing, 2016.zobacz w PBN
• Marek Adam Cygan, Marcin Pilipczuk i Michał Pilipczuk, On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Algorithmica 74 (2) 2016, s. 630–642.zobacz w PBN
• Aleksander Jankowski, Jerzy Tiuryn i Shyam Prabhakar, Romulus: robust multi-state identification of transcription factor binding sites from DNase-seq data, Bioinformatics 32 (16) 2016, s. 2419–2426.zobacz w PBN
• F. Lermyte, M. K. ??cki, D. Valkenborg, Anna Gambin i F. Sobott, Conformational Space and Stability of ETD Charge Reduction Products of Ubiquitin, Journal Of The American Society For Mass Spectrometry 2016.zobacz w PBN
• Andreas Bjorklund, Petteri Kaski i Łukasz Kowalik, Constrained Multilinear Detection and Generalized Graph Motifs, Algorithmica 74 (2) 2016, s. 947–967.zobacz w PBN
• Jarosław Andrzej Paszek i Paweł Górecki, Genomic duplication problems for unrooted gene trees, Bmc Genomics 17 (1) 2016.zobacz w PBN
• Anh Linh Nguyen, ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic, Fundamenta Informaticae 147 (2-3) 2016, s. 261–288.zobacz w PBN
• Marek Adam Cygan, Holger Dell, Daniel Lokshtanov, D\'aniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh i Magnus Wahlstr\öm, On Problems as Hard as CNF-SAT, Acm Transactions On Algorithms 12 (3) 2016, s. 41:1–41:24.zobacz w PBN
• Norbert Dojer, Learning Bayesian networks from datasets joining continuous and discrete variables, International Journal Of Approximate Reasoning 78 2016, s. 116–124.zobacz w PBN
• Filip Murlak i Grzegorz Zielinski, Vertically Acyclic Conjunctive Queries over Trees, w: Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016, 2016.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Shapes of Concurrency, w: Proceedings of the 25th International Workshop on Concurrency, Specification and Programming, Rostock, Germany, September 28-30, 2016., 2016, s. 269–273.zobacz w PBN
• Achim Blumensath, Thomas Colcombet i Paweł Parys, On a Fragment of AMSO and Tiling Systems, w: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 19, s. 19:1–19:14.zobacz w PBN
• C. C. Guo, V. Dadhania, L. Zhang, T. Majewski, J. Bondaruk, M. Sykulski, W. Wronowska, Anna Gambin, Y. Wang, S. Zhang, E. Fuentes-Mattei, A. M. Kamat, C. Dinney, A. Siefker-Radtke, W. Choi, K. A. Baggerly, D. McConkey, J. N. Weinstein i B. Czerniak, Gene Expression Profile of the Clinically Aggressive Micropapillary Variant of Bladder Cancer, European Urology 70 (4) 2016, s. 611–620.zobacz w PBN
• Aleksy Andrzej Schubert, Paweł Urzyczyn i Daria Monika Walukiewicz-Chrząszcz, How Hard Is Positive Quantification?, Acm Transactions On Computational Logic 17 (4) 2016, s. 30.zobacz w PBN
• Łukasz Kowalik i Juho Lauri, On finding rainbow and colorful paths, Theoretical Computer Science 628 2016, s. 110–114.zobacz w PBN
• Paweł Górecki, Jarosław Andrzej Paszek i Agnieszka Mykowiecka, Mean Values of Gene Duplication and Loss Cost Functions, Lecture Notes In Computer Science 9683 2016, s. 189–199.zobacz w PBN
• Anh Linh Nguyen, Design of the Tableau Reasoner TGC2 for Description Logics, International Journal Of Software Engineering And Knowledge Engineering 26 (8) 2016, s. 1315–1333.zobacz w PBN
• Andrzej Jankowski, Andrzej Skowron i Piotr Wasilewski, Rough Sets and Sorites Paradox, w: Rough Set Flow Graphs and Ant Based Clustering in Classification of Distributed Periodic Biosignals, CEUR-WS.org, Berlin 2016, s. 49–60.zobacz w PBN
• Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki, Adam Wojciech Witkowski i Piotr Wygocki, RecSys Challenge 2016: Job Recommendations Based on Preselection of Offers and Gradient Boosting, w: Proceedings of the Recommender Systems Challenge, ACM, 2016, s. 10:1–10:4.zobacz w PBN
• Thomas Colcombet, Denis Kuperberg, Amaldev Manuel i Szymon Toruńczyk, Cost Functions Definable by Min/Max Automata, w: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 29, s. 29:1–29:13.zobacz w PBN
• Piotr Hofman, Sławomir Lasota, Ranko Lazic, J\'er\^ome Leroux, Sylvain Schmitz i Patrick Totzke, Coverability Trees for Petri Nets with Unordered Data, w: Foundations of Software Science and Computation Structures 19th International Conference, FOSSACS 2016, Springer, 2016, s. 445–461.zobacz w PBN

2015

• Michał Startek, Przemyslaw Szafranski, Tomasz Gambin, Ian M. Campbell, Patricia Hixson, Chad A. Shaw, Paweł Stankiewicz i Anna Gambin, Genome-wide analyses of LINE–LINE-mediated nonallelic homologous recombination, Nucleic Acids Research 2015.zobacz w PBN
• Krzysztof Stawujak, Michał Startek, Anna Gambin i Dariusz Grzebelus, MuTAnT: a family of Mutator-like transposable elements targeting TA microsatellites in Medicago truncatula, Genetica 143 (4) 2015, s. 433–440.zobacz w PBN
• Grzegorz Marczyński, Donald Sannella i Andrzej Tarlecki, Algebraic Constructions: A Simple Framework for Complex Dependencies and Parameterisation, International Journal Of Software And Informatics 9 (2) 2015, s. 117–139.zobacz w PBN
• Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto i Tomasz Waleń, Efficient Algorithms for Longest Closed Factor Array, w: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, s. 95–102.zobacz w PBN
• Marcin Peczarski i Gerold Jäger, Playing several variants of mastermind with constant-size memory is not harder than with unbounded memory, Lecture Notes In Computer Science 8986 2015, s. 188–199.zobacz w PBN
• Piotr Skowron i Krzysztof Rządca, Flexible replica placement for optimized P2P backup on heterogeneous, unreliable machines, Concurrency And Computation-practice & Experience 2015.zobacz w PBN
• Rajesh Hemant Chitnis, Marek Adam Cygan, Mohammad Taghi Hajiaghayi i D\'aniel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Acm Transactions On Algorithms 11 (4) 2015, s. 28.zobacz w PBN
• Mirosław Kowaluk i Gabriela Majewska, New sequential and parallel algorithms for computing the β-spectrum, Theoretical Computer Science 590 2015, s. 73–85.zobacz w PBN
• Mikolaj Fejzer, Michal Wojtyna, Marta Burzańska, Piotr Wiśniewski i Krzysztof Stencel, Supporting Code Review by Automatic Detection of Potentially Buggy Changes, w: Beyond Databases, Architectures and Structures. Series: Communications in Computer and Information Science, Vol. 521, Kozielski S., Mrozek D, Kasprowski P., Małysiak-Mrozek B., Kostrzewa D. (Eds), Springer International Publishing 2015, Springer International Publishing, Springer Cham Heidelberg New York Dordrecht London 2015, s. 473–482.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, Fuzzy Set Interpretation of Comparator Networks, w: Pattern Recognition and Machine Intelligence - 6th International Conference, PReMI 2015, Warsaw, Poland, June 30 - July 3, 2015, Proceedings, 2015, s. 345–353.zobacz w PBN
• Bartek Klin i Beata Nachyła, Presenting Morphisms of Distributive Laws, w: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, s. 190–204.zobacz w PBN
• Ali Rezaei Divroodi i Anh Linh Nguyen, On bisimulations for description logics, Information Sciences 295 2015, s. 465–493.zobacz w PBN
• Mateusz Grabowski, Michał Marschall, Wojciech Sirko, Maciej Dębski, Marcin Ziombski, Przemysław Jan Horban, Szymon Acedański, Marcin Peczarski, Dominik Batorski i Konrad Iwanicki, An Experimental Platform for Quantified Crowd, w: Computer Communication and Networks (ICCCN), 2015 24th International Conference on, IEEE, 2015, s. 1–6.zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter i Tomasz Waleń, Tight Bound for the Number of Distinct Palindromes in a Tree, w: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, s. 270–276.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Gene Tree Diameter for Deep Coalescence, Ieee-acm Transactions On Computational Biology And Bioinformatics 12 (1) 2015, s. 155–165.zobacz w PBN
• Ivan Bliznets, Marek Adam Cygan, Paweł Komosa i Luk\'as Mach, Kernelization lower bound for Permutation Pattern Matching, Information Processing Letters 115 (5) 2015, s. 527–531.zobacz w PBN
• Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Siam Journal On Discrete Mathematics 29 (3) 2015, s. 1322–1339.zobacz w PBN
• Jakub Pawlewicz i Ryan B. Hayward, Sibling Conspiracy Number Search, w: Proceedings of the Eighth International Symposium on Combinatorial Search, AAAI Press, Palo Alto, California 2015.zobacz w PBN
• Piotr Szczepanski, Mateusz Tarkowski, Tomasz Michalak, Paul Harrenstein i Michael Wooldridge, Efficient Computation of Semivalues for Game-Theoretic Network Centrality, w: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015, s. 461–469.zobacz w PBN
• Divesh Aggarwal, Stefan Dziembowski, Maciej Obremski i Tomasz Piotr Kazana, Leakage-Resilient Non-malleable Codes Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, w: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, 2015, s. 398–426.zobacz w PBN
• Jan Hidders, Paolo Missier i Jacek Sroka, Recent advances in Scalable Workflow Enactment Engines and Technologies, Future Generation Computer Systems-the International Journal Of Grid Computing And Escience 46 2015, s. 1–2.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, A New Perspective on Goals, w: The Facts Matter: Essays on Logic and Cognition in Honour of Rineke Verbrugge, College Publicatons, UK 2015, s. 50–66.zobacz w PBN
• Kinga Rutowicz, Marcin Puzio, Joanna Halibart-Puzio, Maciej Lirski, Maciej Kotliński, Magdalena Kroteń, Łukasz Kniżewski, Bartosz Lange, Anna Muszewska, Katarzyna Śniegowska-Świerk, Janusz Kościelak, Roksana Iwanicka-Nowicka, Krisztian Buza, Franciszek Janowiak, Katarzyna Żmuda, Jõesaar Indrek, Katarzyna Laskowska-Kaszub, Anna Fogtman, Hannes Kollist, Piotr Zielenkiewicz, Jerzy Tiuryn, Paweł Siedlecki, Szymon Świeżewski, Krzysztof Ginalski, Marta Koblowska, Rafał Archacki, Bartosz Wilczyński, Marcin Rapacz i Andrzej Jerzmanowski, A Specialized Histone H1 Variant Is Required for Adaptive Responses to Complex Abiotic Stress and Related DNA Methylation in Arabidopsis., Plant Physiology 169 (3) 2015, s. 2080–2101.zobacz w PBN
• Krisztián Buza, Bartosz Wilczyński i Norbert Dojer, RECORD: Reference-Assisted Genome Assembly for Closely Related Genomes, International Journal Of Genomics 2015 (2015) 2015, s. 1–10.zobacz w PBN
• Arkadiusz Betkier, Paweł Szczęsny i Paweł Górecki, Fast Algorithms for Inferring Gene-Species Associations, Lecture Notes In Computer Science 9096 2015, s. 36–47.zobacz w PBN
• Arseny Shur i Wojciech Rytter, Searching for Zimin patterns, Theoretical Computer Science 571 2015, s. 50–57.zobacz w PBN
• Aleksy Andrzej Schubert, Paweł Urzyczyn i Daria Monika Walukiewicz-Chrząszcz, Restricted Positive Quantification Is Not Elementary, w: 20th International Conference on Types for Proofs and Programs, TYPES 2014, May 12-15, 2014, Paris, France, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, s. 251–273.zobacz w PBN
• Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Induced subgraph isomorphism: Are some patterns substantially easier than others?, Theoretical Computer Science 605 2015, s. 119–128.zobacz w PBN
• Andrzej Piotr Janusz i Dominik Ślęzak, Computation of Approximate Reducts with Dynamically Adjusted Approximation Threshold, w: Foundations of Intelligent Systems - 22nd International Symposium, ISMIS 2015, Lyon, France, October 21-23, 2015, Proceedings, Springer, 2015, s. 19–28.zobacz w PBN
• Jakub Pawlewicz i Ryan B. Hayward, Feature Strength and Parallelization of Sibling Conspiracy Number Search, w: Advances in Computer Games, Springer International Publishing, 2015, s. 198–209.zobacz w PBN
• Piotr Szczepanski, Aleksy Barcz, Tomasz Michalak i Talal Rahwan, The Game-Theoretic Interaction Index on Social Networks With Applications to Link Prediction and Community Detection, w: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, AAAI Press, 2015.zobacz w PBN
• Stefan Dziembowski, Sebastian Faust i Maciej Skórski, Noisy Leakage Revisited, w: Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II, 2015, s. 159–188.zobacz w PBN
• Mateusz Grabowski, Michal Marschall, Wojciech Sirko, Maciej Debski, Marcin Ziombski, Przemyslaw Horban, Szymon Acedański, Marcin Peczarski, Dominik Batorski i Konrad Iwanicki (red.), WiMAN-2015: Proceedings of the 7th International Workshop on Wireless Mesh and Ad Hoc Networks, 2015.zobacz w PBN
• Barbara Dunin-Kęplicz i Alina Strachocka, Paraconsistent Multi-party Persuasion in TalkLOG, w: PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Bertinoro, Italy, October 26-30, 2015, Proceedings, Springer, 2015, s. 265–283.zobacz w PBN
• Marcin Jan Waniek, Agata Nieścieruk, Tomasz Michalak i Talal Rahwan, Spiteful Bidding in the Dollar Auction, w: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, AAAI Press, 2015, s. 667–673.zobacz w PBN
• Alessandro Facchini, Filip Murlak i Michał Paweł Skrzypczak, On the Weak Index Problem for Game Automata, w: Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings, Springer, 2015, s. 93–108.zobacz w PBN
• Lukasz Mikulski, Marcin Piątkowski i Wojciech Rytter, Square-Free Words over Partially Commutative Alphabets, Lecture Notes In Computer Science 8977 2015, s. 424–435.zobacz w PBN
• Marcin Benke, Viviana Bono i Aleksy Andrzej Schubert, Lucretia - intersection type polymorphism for scripting languages, Electronic Proceedings In Theoretical Computer Science 177 2015, s. 65–78.zobacz w PBN
• Dániel Marx i Michał Pilipczuk, Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, w: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Springer, 2015, s. 865–877.zobacz w PBN
• Shaheen Fatima, Tomasz Michalak i Michael Wooldridge, Power and welfare in bargaining for coalition structure formation, Autonomous Agents And Multi-agent Systems 2015.zobacz w PBN
• Tomasz Michalak, Talal Rahwan, Oskar Skibski i Michael Wooldridge, Defeating Terrorist Networks with Game Theory, Ieee Intelligent Systems 30 (1) 2015, s. 53–61.zobacz w PBN
• Michał Meina i Hung Son Nguyen, Search Result Clustering Based on Query Context., Fundamenta Informaticae 137 (2) 2015, s. 273–290.zobacz w PBN
• Marcin Andrychowicz, Ivan Damgaard, Stefan Dziembowski, Sebastian Faust i Antigoni Polychroniadou, Efficient Leakage Resilient Circuit Compilers, w: Topics in Cryptology - CT-RSA 2015, The Cryptographer's Track at the RSA Conference 2015, San Francisco, CA, USA, April 20-24, 2015. Proceedings, 2015, s. 311–329.zobacz w PBN
• Janina Mincer-Daszkiewicz, Responsive, resilient, elastic and message driven system solving scalability problems of course registrations, w: EUNIS 2015, The 21st International Conference of European University Information Systems, Abertay University, Dundee 2015, s. 225–235.zobacz w PBN
• James Peters, Andrzej Skowron, Dominik Ślęzak, Hung Son Nguyen i Jan Bazan (red.), Transactions on Rough Sets XIX, Heidelberg 2015.zobacz w PBN
• Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, w: Foundations of Software Science and Computation Structures 18th International Conference, FOSSACS 2015, Springer, 2015, s. 451–465.zobacz w PBN
• Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen i Marc Zeitoun, A Note on Decidable Separability by Piecewise Testable Languages, w: Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, s. 173–185.zobacz w PBN
• Erik Poll, Joeri de Ruiter i Aleksy Andrzej Schubert, Protocol State Machines and Session Languages: Specification, implementation, and Security Flaws, w: 2015 IEEE Symposium on Security and Privacy Workshops, SPW 2015, San Jose, CA, USA, May 21-22, 2015, IEEE, 2015, s. 125–133.zobacz w PBN
• Pål Grønås Drange i Michał Pilipczuk, A Polynomial Kernel for Trivially Perfect Editing, w: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Springer, 2015, s. 424–436.zobacz w PBN
• Andrzej Piotr Janusz, Marek Sikora, Łukasz Wróbel, Sebastian Stawicki, Marek Grzegorowski, Piotr Wojtas i Dominik Ślęzak, Mining Data from Coal Mines: IJCRS'15 Data Challenge, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings, Springer, Berlin/Heidelberg 2015, s. 429–438.zobacz w PBN
• Tomasz Michalak, Talal Rahwan, Stefano Moretti, Ramasuri Narayanam, Oskar Skibski, Piotr Szczepański i Michael Wooldridge, A New Approach to Measure Social Capital using Game-Theoretic Techniques, Acm Sigecom Exchanges 14 (1) 2015, s. 95–100.zobacz w PBN
• Long Giang Nguyen i Hung Son Nguyen, Searching for Reductive Attributes in Decision Tables., Lecture Notes In Computer Science Transactions On Rough Sets 19 2015, s. 51–64.zobacz w PBN
• Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov i Krzysztof Pietrzak, Proofs of Space, w: Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II, 2015, s. 585–605.zobacz w PBN
• Jacek Cyranka i Piotr Zgliczynski, Existence of Globally Attracting Solutions for One-Dimensional Viscous Burgers Equation with Nonautonomous Forcing-A Computer Assisted Proof, Siam Journal On Applied Dynamical Systems 14 (2) 2015, s. 787–821.zobacz w PBN
• Marcin Pawłowski, Łukasz Kozłowski i Andrzej Kloczkowski, MQAPsingle: A quasi single‐model approach for estimation of the quality of individual protein structure models, Proteins-structure Function And Bioinformatics 2015.zobacz w PBN
• Mats Lindstedt, Anders Bøgebjerg Hansen, Simone Ravaioli, Geir Vangen, Agnethe Sidselrud, Pamela Henriksson i Janina Mincer-Daszkiewicz, Field trial on the impact of enabling easy mobility on recognition of external studies (EMREX), w: EUNIS 2015, The 21st International Conference of European University Information Systems, Abertay University, Dundee 2015, s. 69–71.zobacz w PBN
• Jerzy Sikora, Jacek Sroka i Jerzy Paweł Tyszkiewicz, Spreadsheet As a Multi-platform Mobile Application, w: Proceedings of the Second ACM International Conference on Mobile Software Engineering and Systems, IEEE, 2015, s. 140–141.zobacz w PBN
• Dominik Ślęzak, Jan Bazan, Hung Son Nguyen, James Peters i Andrzej Skowron, Preface, w: Transactions on Rough Sets XIX, Heidelberg 2015, s. v–vi.zobacz w PBN
• Wojciech Czerwiński i Petr Jancar, Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME, w: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, s. 168–179.zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk i Michał Pilipczuk, A Subexponential Parameterized Algorithm for Proper Interval Completion, Siam Journal On Discrete Mathematics 29 (4) 2015, s. 1961–1987.zobacz w PBN
• Ariel Gabizon, Daniel Lokshtanov i Michał Pilipczuk, Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints, w: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Springer, 2015, s. 545–556.zobacz w PBN
• Andrzej Piotr Janusz, Dominik Ślęzak, Sebastian Stawicki i Mariusz Rosiak, Knowledge Pit - A Data Challenge Platform, w: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming, Rzeszow, Poland, September 28-30, 2015., CEUR-WS.org, 2015, s. 191–195.zobacz w PBN
• Oskar Skibski, Tomasz Michalak, Yuko Sakurai i Makoto Yokoo, A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games, w: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, AAAI Press, 2015, s. 631–637.zobacz w PBN
• Gloria Virginia i Hung Son Nguyen, A Semantic Text Retrieval for Indonesian Using Tolerance Rough Sets Models, Lecture Notes In Computer Science Transactions On Rough Sets 19 2015, s. 138–224.zobacz w PBN
• Marcin Andrychowicz i Stefan Dziembowski, PoW-Based Distributed Cryptography with No Trusted Setup, w: Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II, 2015, s. 379–399.zobacz w PBN
• Dawid Głów, Dariusz Pianka, Agata A. Sulej, Łukasz Kozłowski, Justyna Czarnecka, Grzegorz Chojnowski, Krzysztof J. Skowronek i Janusz M. Bujnicki, Sequence-specific cleavage of dsRNA by Mini-III RNase, Nucleic Acids Research 2015.zobacz w PBN
• Anh Linh Nguyen, Thi-Bich-Loc Nguyen i Andrzej Szałas, Towards richer rule languages with polynomial data complexity for the Semantic Web, Data & Knowledge Engineering 96-97 2015, s. 57–77.zobacz w PBN
• Mikołaj Bojańczyk, Filip Murlak i Adam Wojciech Witkowski, Containment of Monadic Datalog Programs via Bounded Clique-Width, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 427–439.zobacz w PBN
• Marcin Szczuka, Andrzej Jankowski, Andrzej Skowron i Dominik Ślęzak, Building Granular Systems - from Concepts to Applications, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings, Springer, Berlin/Heidelberg 2015, s. 245–255.zobacz w PBN
• Dominik Ślęzak i Andrzej Skowron, Preface: special issue on Information Granulation in Natural Computing, Natural Computing 142 2015, s. 567––568.zobacz w PBN
• Eryk Kopczyński i Tony Tan, On the variable hierarchy of first-order spectra, Acm Transactions On Computational Logic 16 (2) 2015, s. 17:1––17:12.zobacz w PBN
• Talal Rahwan, Tomasz Michalak, Michael Wooldridge i Nick R. Jennings, Coalition structure generation: A survey, Artificial Intelligence 229 2015, s. 139–174.zobacz w PBN
• Jakub Włodzimierz Łącki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski i Anna Katarzyna Zych, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, w: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, 2015, s. 11–20.zobacz w PBN
• Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk i Yngve Villanger, Exploring the Subexponential Complexity of Completion Problems, Acm Transactions On Computation Theory 7 (4) 2015, s. 14.zobacz w PBN
• Denis Kuperberg i Michał Paweł Skrzypczak, On Determinisation of Good-For-Games Automata, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 299–310.zobacz w PBN
• Oskar Skibski, Tomasz Michalak, Yuko Sakurai, Michael Wooldridge i Makoto Yokoo, A Graphical Representation for Games in Partition Function Form, w: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015, s. 1036–1042.zobacz w PBN
• Piotr Jaroszyński i Norbert Dojer, Efficient and Error-Tolerant Sequencing Read Mapping, Current Bioinformatics 10 (2) 2015, s. 191–198.zobacz w PBN
• Magdalena Plotka, Anna-Karina Kaczorowska, Agnieszka Morzywolek, Joanna Makowska, Łukasz Kozłowski, Audur Thorisdottir, Sigurlaug Skírnisdottir, Sigridur Hjörleifsdottir, Olafur H. Fridjonsson, Gudmundur O. Hreggvidsson, Jakob K. Kristjansson, Slawomir Dabrowski, Janusz M. Bujnicki i Tadeusz Kaczorowski, Biochemical Characterization and Validation of a Catalytic Site of a Highly Thermostable Ts2631 Endolysin from the Thermus scotoductus Phage vB_Tsc2631, Plos One 10 (9) 2015, s. e0137374.zobacz w PBN
• Thanh-Luong Tran, Anh Linh Nguyen i Thi-Lan-Giao Hoang, Bisimulation-based concept learning for information systems in description logics, Vietnam Journal Of Computer Science 2 (3) 2015, s. 149–167.zobacz w PBN
• Jacek Sroka, Adrian Panasiuk, Krzysztof Stencel i Jerzy Paweł Tyszkiewicz, Translating Relational Queries into Spreadsheets, Ieee Transactions On Knowledge And Data Engineering 27 (8) 2015, s. 2291–2303.zobacz w PBN
• Andrzej Janusz, Sebastian Stawicki, Marcin Szczuka i Dominik Ślęzak, Rough Set Tools for Practical Data Exploration, w: Rough Sets and Knowledge Technology - 10th International Conference, RSKT 2015, Tianjin, China, November 20-23, 2015, Proceedings, Springer, Berlin/Heidelberg 2015, s. 77–86.zobacz w PBN
• Chris Cornelis, Hung Son Nguyen, Sankar Kumar Pal, Andrzej Skowron i Wei-Zhi Wu (red.), Special issue of Fundamenta Informaticae on Rough Sets and Fuzzy Sets, IOS Press, Amsterdam 2015.zobacz w PBN
• Eryk Kopczyński i Tony Tan, Regular Graphs and the Spectra of Two-Variable Logic with Counting, Siam Journal On Computing 44 (3) 2015, s. 786–818.zobacz w PBN
• Aleksy Andrzej Schubert, Wil Dekkers i Hendrik Pieter Barendregt, Automata Theoretic Account of Proof Search, w: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, s. 128–143.zobacz w PBN
• Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma i Michał Pilipczuk, Modifying a Graph Using Vertex Elimination, Algorithmica 72 (1) 2015, s. 99–125.zobacz w PBN
• Nathanael Fijalkow, Florian Horn, Denis Kuperberg i Michał Paweł Skrzypczak, Trading bounds for memory in games with counters, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 197–208.zobacz w PBN
• Simona Constantinescu, Ewa Maria Szczurek, Pejman Mohammadi1, Jörg Rahnenführer i Niko Beerenwinkel, TiMEx: a waiting time model for mutually exclusive cancer alterations, Bioinformatics 2015.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, Stability, Supportedness, Minimality and Kleene Answer Set Programs, w: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015, s. 125–140.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Strachocka, Andrzej Szałas i Rineke Verbrugge, Paraconsistent semantics of speech acts, Neurocomputing 151 (2) 2015, s. 943–952.zobacz w PBN
• Anh Linh Nguyen, Designing a Tableau Reasoner for Description Logics, w: Advanced Computational Methods for Knowledge Engineering, Springer, Switzerland 2015, s. 321–333.zobacz w PBN
• Michał Meina, Andrzej Janusz, Krzysztof Rykaczewski, Dominik Ślęzak, Bartosz Celmer i Adam Krasuski, Tagging Firefighter Activities at the Emergency Scene: Summary of AAIA'15 Data Mining Competition at Knowledge Pit, w: 2015 Federated Conference on Computer Science and Information Systems, FedCSIS 2015, \Lódź, Poland, September 13--16, 2015, 2015, s. 367–373.zobacz w PBN
• Łukasz Sosnowski, Marcin Szczuka i Dominik Ślęzak, Granular Modeling with Fuzzy Comparators, w: 2015 IEEE International Conference on Big Data, Proceedings, Danver, MA 2015, s. 1550–1555.zobacz w PBN
• Chris Cornelis, Hung Son Nguyen, Andrzej Skowron, Sankar Kumar Pal i Wei-Zhi Wu, Preface: special issue on Rough Sets and Fuzzy Sets, w: Special issue of Fundamenta Informaticae on Rough Sets and Fuzzy Sets, IOS Press, Amsterdam 2015, s. v–viii.zobacz w PBN
• Bartosz Klin, Eryk Kopczyński, Joanna Ochremiak i Szymon Toruńczyk, Locally Finite Constraint Satisfaction Problems, w: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, s. 475–486.zobacz w PBN
• Wojciech Michał Świeboda i Hung Son Nguyen, Reduct Calculation and Discretization of Numeric Attributes in Sparse Decision Systems, w: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming (CS&P 2015), Uniwersytet Rzeszowski, University of Rzeszow 2015, s. 207–210.zobacz w PBN
• Henryk Michalewski i Matteo Mio, On the Problem of Computing the Probability of Regular Sets of Trees, w: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India, 2015, s. 489–502.zobacz w PBN
• Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof i Michał Pilipczuk, Minimizing Rosenthal Potential in Multicast Games, Theory Of Computing Systems 57 (1) 2015, s. 81–96.zobacz w PBN
• Jakub Pawlewicz, Ryan Hayward, Philip Henderson i Broderick Arneson, Stronger Virtual Connections in Hex, Ieee Transactions On Computational Intelligence And Ai In Games 7 (2) 2015, s. 156–166.zobacz w PBN
• Fabian Schmich, Ewa Maria Szczurek, Saskia Kreibich, Sabrina Dilling, Daniel Andritschke, Alain Casanova, Shyan Huey Low, Simone Eicher, Simone Muntweiler, Mario Emmenlauer, Pauli Rämö, Raquel Conde-Alvarez, Christian von Mering, Wolf-Dietrich Hardt, Christoph Dehio i Niko Beerenwinkel, gespeR: a statistical model for deconvoluting off-target-confounded RNA interference screens, Genome Biology 2015.zobacz w PBN
• Marcin Konrad Dziubiński, Sanjeev Goyal i Adrien Vigier, Conflict and Networks, w: The Oxford Handbook of the Economics of Networks, Oxford University Press, Oxford 2015, r. 10, s. 215–243.zobacz w PBN
• Marek Sikora, Wojciech Moczulski, Piotr Przystałka, Dominik Ślęzak i Anna Timofiejczuk, DISESOR: zintegrowany, szkieletowy system wspomagania decyzji dla systemów monitorowania procesów, urządzeń i zagrożeń., w: Mechanizacja, Automatyzacja i Robotyzacja w Górnictwie 2015, CBiDGP Lędziny, Lędziny 2015, r. 4.zobacz w PBN
• MICHAŁ DĄBROWSKI, Norbert Dojer, Izabella Krystkowiak, Bożena Kamińska i Bartosz Wilczyński, Optimally choosing PWM motif databases and sequence scanning approaches based on ChIP-seq data, Bmc Bioinformatics 16 2015, s. art.nr140.zobacz w PBN
• Marek Adam Cygan, Fedor Fomin, Łukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, Parameterized Algorithms, Springer, 2015.zobacz w PBN
• Marthe Bonamy, Łukasz Kowalik, Arkadiusz Aleksander Socała i Michał Pilipczuk, Linear Kernels for Outbranching Problems in Sparse Digraphs, w: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 2015, s. 199–211.zobacz w PBN
• Eryk Kopczyński, Complexity of Problems of Commutative Grammars, Logical Methods In Computer Science 11 (1) 2015.zobacz w PBN
• Henryk Michalewski i Matteo Mio, Baire Category Quantifier in Monadic Second Order Logic, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 362–374.zobacz w PBN
• Fedor V. Fomin, Archontia C. Giannopoulou i Michał Pilipczuk, Computing Tree-Depth Faster Than 2^n, Algorithmica 73 (1) 2015, s. 202–216.zobacz w PBN
• Mikołaj Bojańczyk, Sławomir Lasota i Igor Potapov (red.), Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, Springer, Warsaw 2015.zobacz w PBN
• Bartosz Ziembinski i Barbara Dunin-Kęplicz, Strategies for Resolving Conflicts in Multiagent Environments, w: Selected Problems in Information Technologies, Copyright by Institute of Computer Science, Polish Academy of Sciences, 2015, Warsaw 2015, s. 173–197.zobacz w PBN
• Yiliang Wei, Shamba S. Mondal, Rima Mouawad, Bartek Wilczyński, R. William Henry i David N. Arnosti, Genome-Wide Analysis of Drosophila RBf2 Protein Highlights the Diversity of RB Family Targets and Possible Role in Regulation of Ribosome Biosynthesis, G3-genes Genomes Genetics 5 (7) 2015, s. 1503–1515.zobacz w PBN
• Andreas Björklund, Vikram Kamat, Łukasz Kowalik i Meirav Zehavi, Spotting Trees with Few Leaves, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Springer, 2015.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science 602 2015, s. 7–21.zobacz w PBN
• Grzegorz Chojnowski, Tomasz Waleń, Paweł Piątkowski, Wojciech Marek Potrzebowski i Janusz Bujnicki, Brickworx builds recurrent RNA and DNA structural motifs into medium- and low-resolution electron-density maps, Acta Crystallographica Section D: Biological Crystallography 71 (3) 2015, s. 697–705.zobacz w PBN
• Wojciech Czerwiński, Tomasz Gogacz i Eryk Kopczyński, Non-dominating Sequences of Vectors Using only Resets and Increments, Fundamenta Informaticae 140 (2) 2015, s. 123–127.zobacz w PBN
• Grzegorz Anielak, Grzegorz Jakacki i Sławomir Lasota, Incremental Test Case Generation Using Bounded Model Checking: an Application to Automatic Rating, International Journal On Software Tools For Technology Transfer 17 (3) 2015, s. 339–349.zobacz w PBN
• Nathanael Fijalkow i Michał Paweł Skrzypczak, Irregular Behaviours for Probabilistic Automata, w: Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, Springer, Warsaw 2015, s. 33–36.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, Complete characterization of zero-expressible functions, Fundamenta Informaticae 138 (3) 2015, s. 339–350.zobacz w PBN
• Tomasz Tajmajer, Tomasz Sadkowski i Wieslaw Winiecki, CoAP and database integration for sleeping and non-routable nodes, w: Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), 2015 IEEE 8th International Conference on, 2015, s. 646–651.zobacz w PBN
• Maciej Zielenkiewicz, Jacek Chrząszcz i Aleksy Schubert, Java Loops Are Mainly Polynomial, w: SOFSEM 2015: Theory and Practice of Computer Science, 2015, s. 603–614.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, A note on the longest common compatible prefix problem for partial words, Journal Of Discrete Algorithms 34 2015, s. 49–53.zobacz w PBN
• Wojciech Czerwiński, Wim Martens, Paweł Parys i Marcin Przybyłko, The (Almost) Complete Guide to Tree Pattern Containment, w: Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015, ACM, 2015, s. 117–130.zobacz w PBN
• Irina Tuszyńska, Marcin Magnus, Katarzyna Maria Jonak i Janusz Bujnicki, NPDock – a web server for protein-nucleic acid docking, Nucleic Acids Research 2015, s. 6714–29.zobacz w PBN
• Marek Adam Cygan i Marcin Pilipczuk, Faster exponential-time algorithms in graphs of bounded average degree, Information And Computation 243 2015, s. 75–85.zobacz w PBN
• Jacek Sroka, Piotr Chrząstowski-Wachtel i Jan Hidders, On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality, Fundamenta Informaticae 141 (4) 2015, s. 367–398.zobacz w PBN
• Sławomir Lasota i Lorenzo Clemente, Timed pushdown automata revisited, w: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, s. 738––749.zobacz w PBN
• Divesh Aggarwal, Yevgeniy Dodis, Maciej Obremski i Tomasz Piotr Kazana, Non-malleable Reductions and Applications, w: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, 2015, s. 459–468.zobacz w PBN
• Soma Dutta i Piotr Wasilewski, Dialogue in Hierarchical Learning of a Concept Using Prototypes and Counterexamples., w: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming (CS&P 2015), Uniwersytet Rzeszowski, University of Rzeszow 2015, s. 126–133.zobacz w PBN
• Anh Linh Nguyen, ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic, w: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming, Volume II, University of Rzeszow, Rzeszów 2015, s. 44–56.zobacz w PBN
• Michal J. Pietal, Janusz Bujnicki i Łukasz Kozłowski, GDFuzz3D: a method for protein 3D structure reconstruction from contact maps, based on a non-Euclidean distance function, Bioinformatics 2015.zobacz w PBN
• Marcin Andrychowicz, Stefan Dziembowski, Łukasz Paweł Mazurek i Daniel Malinowski, On the Malleability of Bitcoin Transactions, w: FC 2015 International Workshops, BITCOIN, WAHC, and Wearable, San Juan, Puerto Rico, January 30, 2015, Revised Selected Papers, 2015, s. 1–18.zobacz w PBN
• Paweł Parys, Sylvain Salvati, Igor Walukiewicz i Lorenzo Clemente, Ordered Tree-Pushdown Systems, w: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, s. 163–177.zobacz w PBN
• Krzysztof Rządca, Anwitaman Datta, Gunnar Kreitz i Sonja Buchegger, Game-Theoretic Mechanisms to Increase Data Availability in Decentralized Storage Systems, Acm Transactions On Autonomous And Adaptive Systems 10 (3) 2015.zobacz w PBN
• Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk i Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, Siam Journal On Discrete Mathematics 29 (1) 2015, s. 122–144.zobacz w PBN
• Piotr Dittwald, D. Valkenborg, J. Claesen, A. L. Rockwood i Anna Gambin, On the Fine Isotopic Distribution and Limits to Resolution in Mass Spectrometry, Journal Of The American Society For Mass Spectrometry 26 (10) 2015, s. 1732–1745.zobacz w PBN
• Sławomir Lasota i Lorenzo Clemente, Reachability analysis of first-order definable pushdown systems, w: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, s. 244––259.zobacz w PBN
• Divesh Aggarwal, Stefan Dziembowski, Maciej Obremski i Tomasz Piotr Kazana, Leakage-Resilient Non-malleable Codes, w: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, 2015, s. 398–426.zobacz w PBN
• Piotr Wasilewski, From Free Will Debate to Embodiment of Fuzzy Logic into Washing Machines: On Fuzzy and Rough Sets Approaches to Vagueness Modeling - Extended Abstract, w: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming (CS&P 2015), Uniwersytet Rzeszowski, University of Rzeszow 2015, s. 1–3.zobacz w PBN
• Dominik Ślęzak, On Generalized Decision Functions: Reducts, Networks and Ensembles, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings, Springer, Berlin/Heidelberg 2015, s. 13–23.zobacz w PBN
• Glencora Borradaile, Piotr Sankowski i Christian Wulff-Nilsen, Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, Acm Transactions On Algorithms 2015.zobacz w PBN
• Barbara Dunin-Kęplicz i Alina Strachocka, Tractable Inquiry in Information-Rich Environments, w: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, AAAI Press, 2015, s. 53–60.zobacz w PBN
• Mirosław Kowaluk i Gabriela Majewska, β-skeletons for a Set of Line Segments in R2, Lecture Notes In Computer Science 9210 2015, s. 65–78.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, String Powers in Trees, w: Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, Springer, 2015, s. 284–294.zobacz w PBN
• Yiannis Georgiou, David Glesser, Krzysztof Rządca i Denis Trystram, A Scheduler-Level Incentive Mechanism for Energy Efficiency in HPC, w: CCGrid 2015, 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, IEEE CS, 2015, s. 617–626.zobacz w PBN
• Hans L. Bodlaender, Marek Adam Cygan, Stefan Kratsch i Jesper Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information And Computation 243 2015, s. 86–111.zobacz w PBN
• Frederik Lermyte, Mateusz Krzysztof Łącki, Dirk Valkenborg, Geert Baggerman, Anna Gambin i Frank Sobott, Understanding reaction pathways in top-down ETD by dissecting isotope distributions: A mammoth task, International Journal Of Mass Spectrometry 390 2015, s. 146–154.zobacz w PBN
• Wojciech Michał Świeboda, Maja Nguyen i Hung Son Nguyen, Granular Floor Plan Representation for Evacuation Modeling, w: Advanced Computational Methods for Knowledge Engineering, Springer, Switzerland 2015, s. 335–344.zobacz w PBN
• Tomasz Idziaszek, Michał Paweł Skrzypczak i Mikołaj Bojańczyk, Regular languages of thin trees, Theory Of Computing Systems 2015, s. 1–50.zobacz w PBN
• Dominik Ślęzak, Benjamin C. M. Fung i William Kwok-Wai Cheung, Preface, Fundamenta Informaticae 137 (2) 2015.zobacz w PBN
• Soma Dutta i Piotr Wasilewski, Concept Synthesis Using Logic of Prototypes and Counterexamples: A Graded Consequence Approach, Lecture Notes In Computer Science 2015.zobacz w PBN
• Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik i Juho Lauri, Engineering Motif Search for Large Graphs, w: Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, 2015.zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Algorithmica 73 (1) 2015, s. 217–233.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, The Foundational Legacy of ASL., w: Software, Services, and Systems - Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering., Springer, 2015, s. 253–272.zobacz w PBN
• Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Universal Reconstruction of a String, w: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Springer, 2015, s. 386–397.zobacz w PBN
• Marcin Peczarski i Gerold Jäger, The worst case number of questions in generalized AB game with and without white-peg answers, Discrete Applied Mathematics (184) 2015, s. 20–31.zobacz w PBN
• Piotr Skowron i Krzysztof Rządca, Geographically Distributed Load Balancing with (Almost) Arbitrary Load Functions, w: HiPC 2015, 22nd IEEE/ACM International Conference on High Performance Computing, IEEE CS, 2015.zobacz w PBN
• Marek Adam Cygan, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, Journal Of The Acm 62 (4) 2015, s. 28.zobacz w PBN
• Agata Charzyńska i Anna Gambin, Improvement of the k-nn Entropy Estimator with Applications in Systems Biology, Entropy 18 (1) 2015, s. 13.zobacz w PBN
• Marcin Benke, Specifying Functional Programs with Intuitionistic First Order Logic, w: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming (CS&P 2015), Uniwersytet Rzeszowski, University of Rzeszow 2015, s. 57–63.zobacz w PBN
• Michał Piotr Chromiak, Piotr Wiśniewski i Krzysztof Stencel, A Universal Cuboid-Based Integration Architecture for Polyglotic Querying of Heterogeneous Datasources, w: Beyond Databases, Architectures and Structures. Series: Communications in Computer and Information Science, Vol. 521, Kozielski S., Mrozek D, Kasprowski P., Małysiak-Mrozek B., Kostrzewa D. (Eds), Springer International Publishing 2015, Springer International Publishing, Springer Cham Heidelberg New York Dordrecht London 2015, s. 170–179.zobacz w PBN
• Mo Jose Benitez, Jesus Medina i Dominik Ślęzak, Delta-information reducts and bireducts, w: 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology (IFSA-EUSFLAT-15), Gijón, Spain., June 30, 2015., 2015.zobacz w PBN
• Jerzy Paweł Tyszkiewicz, Analiza relacji struktury wieku i elementów wyposażenia grobowego, w: Struktura społeczna ludności kultury wielbarskiej, Instytut Archeologii i Etnologii Polskiej Akademii Nauk, Łódź 2015, s. 283–286.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Internal Pattern Matching Queries in a Text and Applications, w: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2015, s. 532–551.zobacz w PBN
• Weronika Wronowska, Agata Charzynska, Karol Nienałtowski i Anna Gambin, Computational modeling of sphingolipid metabolism, Bmc Systems Biology 9 2015, s. 47.zobacz w PBN
• Yazmin Angélica Ibáñez-García, Till Mossakowski, Donald Sannella i Andrzej Tarlecki, Modularity of Ontologies in an Arbitrary Institution., w: Logic, Rewriting, and Concurrency - Essays dedicated to José Meseguer on the Occasion of His 65th Birthday., Springer, 2015, s. 361–379.zobacz w PBN
• Marek Cygan i Tomasz Kociumaka, Approximating Upper Degree-Constrained Partial Orientations, w: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, s. 212–224.zobacz w PBN
• Marcin Peczarski i Gerold Jäger, Bounding memory for mastermind might not make it harder, Theoretical Computer Science (596) 2015, s. 55–66.zobacz w PBN
• Fanny Pascual i Krzysztof Rządca, Partition with Side Effects, w: HiPC 2015, 22nd IEEE/ACM International Conference on High Performance Computing, IEEE CS, 2015.zobacz w PBN
• Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Onufry Wojtaszczyk, Sitting Closer to Friends than Enemies, Revisited, Theory Of Computing Systems 56 (2) 2015, s. 394–405.zobacz w PBN
• Adam Karol Karczmarz i Jakub Włodzimierz Łącki, Fast and Simple Connectivity in Graph Timelines, w: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Springer, 2015, s. 458–469.zobacz w PBN
• Karol Kreński, Adam Krasuski, Marcin Szczuka i Stanisław Łazowy, Granular knowledge discovery framework for fire and rescue reporting system, Intelligent Decision Technologies 9 (4) 2015, s. 379–389.zobacz w PBN
• Heng-Ru Zhang, Fan Min, Dominik Ślęzak i Bing Shi, Cost-sensitive regression-based recommender system, w: 2015 International Conference on Machine Learning and Cybernetics, ICMLC 2015, Guangzhou, China, July 12-15, 2015, 2015, s. 253–258.zobacz w PBN
• Bartek Klin i Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, w: Foundations of Software Science and Computation Structures 18th International Conference, FOSSACS 2015, Springer, 2015, s. 151–166.zobacz w PBN
• Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele i Piotr Sankowski, Stochastic Query Covering for Fast Approximate Document Retrieval, Acm Transactions On Information Systems 33 (3) 2015, s. 11:1–11:35.zobacz w PBN

2014

• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Extracting powers and periods in a word from its runs structure, Theoretical Computer Science 521 (Complete) 2014, s. 29–41.zobacz w PBN
• Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen i Hung Son Nguyen, Bisimulation-Based Concept Learning in Description Logics, Fundamenta Informaticae 133 (2-3) 2014, s. 287–303.zobacz w PBN
• Marek Adam Cygan, Marcin Pilipczuk, Michał Paweł Pilipczuk i Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n, Algorithmica 70 (2) 2014, s. 195–207.zobacz w PBN
• Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, w: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, s. 186–195.zobacz w PBN
• Shih-Chieh Huang, Broderic Arneson, Ryan B. Hayward, Martin Müller i Jakub Pawlewicz, MoHex 2.0: A Pattern-Based MCTS Hex Player, Lecture Notes In Computer Science 8427 2014, s. 60–71.zobacz w PBN
• Chi Mai Luong, Piuri Vincenzo i Hung Son Nguyen, Preface: Special Issue in Computing and Communication Technologies., Fundamenta Informaticae 130 (2) 2014, s. xv.zobacz w PBN
• Paweł Jarosław Brach, Alessandro Epasto, Alessandro Panconesi i Piotr Sankowski, Spreading Rumours Without the Network, w: Proceedings of the Second ACM Conference on Online Social Networks, 2014, s. 107–118.zobacz w PBN
• Andrzej Piotr Janusz, Adam Krasuski, Sebastian Stawicki, Mariusz Rosiak, Dominik Ślęzak i Hung Son Nguyen, Key Risk Factors for Polish State Fire Service: a Data Mining Competition at Knowledge Pit, w: Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, Warsaw, Poland, September 7-10, 2014., 2014, s. 345–354.zobacz w PBN
• Tomasz Kociumaka i Marcin Pilipczuk, Faster deterministic Feedback Vertex Set, Information Processing Letters 114 (10) 2014, s. 556–560.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, w: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, s. 276–285.zobacz w PBN
• Jakub Pawlewicz i Ryan B. Hayward, Scalable Parallel DFPN Search, Lecture Notes In Computer Science 8427 2014, s. 138–150.zobacz w PBN
• Tianrui Li, Hongmei Chen, Jingtao Yao i Hung Son Nguyen, Preface: Special Issue in Advances on Rough Sets and Knowledge Technology, Fundamenta Informaticae 132 (3) 2014, s. i–iii.zobacz w PBN
• Dominik Ślęzak, Ah-Hwee Tan, James F. Peters i Lars Schwabe (red.), Brain Informatics and Health - International Conference, BIH 2014, Warsaw, Poland, August 11-14, 2014, Proceedings, Springer, 2014.zobacz w PBN
• M. Plotka, A. K. Kaczorowska, A. Stefanska, A. Morzywolek, O. H. Fridjonsson, S. Dunin-Horkawicz, Łukasz Paweł KOZŁOWSKI, G. O. Hreggvidsson, J. K. Kristjansson, S. Dabrowski, J. M. Bujnicki i T. Kaczorowski, Novel highly thermostable endolysin from Thermus scotoductus MAT2119 bacteriophage Ph2119 with amino acid sequence similarity to eukaryotic peptidoglycan recognition proteins, Applied And Environmental Microbiology 80 (3) 2014, s. 886–95.zobacz w PBN
• Anh Linh Nguyen, Thi-Bich-Loc Nguyen i Andrzej Szałas, A Horn Fragment with PTime Data Complexity of Regular Description Logic with Inverse, Vnu Journal Of Science: Computer Science And Communication Engineering 30 (4) 2014, s. 14–28.zobacz w PBN
• Marek Adam Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk i Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, Acm Transactions On Computation Theory 6 (2) 2014, s. 6.zobacz w PBN
• Andrzej Tarlecki, Władysław Marek Turski (1938-2013), Information Processing Letters 114 (8) 2014, s. 397–398.zobacz w PBN
• Mikołaj Bojańczyk, Bartosz Klin i Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, DrML: Probabilistic Modeling of Gene Duplications, Journal Of Computational Biology 21 (1) 2014, s. 89–98.zobacz w PBN
• Sinh Hoa Nguyen, Wojciech Swieboda i Hung Son Nguyen, On semantic evaluation of text clustering algorithms, w: 2014 IEEE International Conference on Granular Computing, Proceedings, IEEE, 2014, s. 224–229.zobacz w PBN
• Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zajac i Tomasz Piotr Kazana, One-Time Programs with Limited Memory, w: Information Security and Cryptology - 9th International Conference, Inscrypt 2013, Guangzhou, China, November 27-30, 2013, Revised Selected Papers, 2014, s. 377–394.zobacz w PBN
• Marek Cygan i Tomasz Kociumaka, Constant Factor Approximation for Capacitated k-Center with Outliers, Leibniz International Proceedings In Informatics 25 2014, s. 251–262.zobacz w PBN
• Claire David, Piotr Hofman, Filip Murlak i Michal Pilipczuk, Synthesizing transformations from XML schema mappings, w: Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014, OpenProceedings.org, 2014, s. 61–71.zobacz w PBN
• Andrzej Piotr Janusz i Dominik Ślęzak, Random Probes in Computation and Assessment of Approximate Reducts, w: Rough Sets and Intelligent Systems Paradigms - Second International Conference, RSEISP 2014, Held as Part of JRS 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings, 2014, s. 53–64.zobacz w PBN
• Grzegorz Chojnowski, Tomasz Waleń i Janusz Bujnicki, RNA Bricks - a database of RNA 3D motifs and their interactions, Nucleic Acids Research 42 (Database-Issue) 2014, s. 123–131.zobacz w PBN
• Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk i Yngve Villanger, Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, Journal Of Computer And System Sciences 80 (7) 2014, s. 1430–1447.zobacz w PBN
• Razvan Diaconescu, Till Mossakowski i Andrzej Tarlecki, The Institution-Theoretic Scope of Logic Theorems, Logica Universalis 8 (3-4) 2014, s. 393–406.zobacz w PBN
• Wojciech Czerwiński, Piotr Hofman i Sławomir Lasota, Decidability of branching bisimulation on normed commutative context-free processes, Theory Of Computing Systems 55 (1) 2014, s. 136–169.zobacz w PBN
• Filip Mazowiecki, Filip Murlak i Adam Wojciech Witkowski, Monadic Datalog and Regular Tree Pattern Queries, w: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, 2014, s. 426–437.zobacz w PBN
• Sinh Hoa Nguyen, Wojciech Świeboda i Hung Son Nguyen, Semantic Evaluation of Text Clustering, w: Advanced Computational Methods for Knowledge Engineering, Springer, 2014, s. 269–280.zobacz w PBN
• Dominik Ślęzak, Hung Son Nguyen, Marek Reformat i Eugene Santos Jr (red.), The 2014 IEEE/WIC/ACM International Conference on Web Intelligence, Part I, IEEE Computer Society, Washington 2014.zobacz w PBN
• Tomasz Piotr Kazana, Programy jednorazowe: krótkie wprowadzenie, Studia Bezpieczeństwa Narodowego (6) 2014, s. 317–324.zobacz w PBN
• Shun'ichi Amano, Claire David, Leonid Libkin i Filip Murlak, XML Schema Mappings: Data Exchange and Metadata Management, Journal Of The Acm 61 (2) 2014, s. 12.zobacz w PBN
• Dominik Ślęzak, Gerald Schaefer, Son T. Vuong i Yoo-Sung Kim (red.), Active Media Technology - 10th International Conference, AMT 2014, Warsaw, Poland, August 11-14, 2014. Proceedings, 2014.zobacz w PBN
• Tomasz Pazurkiewicz, Michal Gregorczyk i Konrad Iwanicki, NarrowCast: A New Link-Layer Primitive for Gossip-Based Sensornet Protocols, w: Wireless Sensor Networks: 11th European Conference, EWSN 2014, Oxford, UK, February 17-19, 2014, Proceedings, Springer International Publishing, 2014, s. 1–16.zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient counting of square substrings in a tree, Theoretical Computer Science 544 2014, s. 60–73.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, Property-oriented semantics of structured specifications, Mathematical Structures In Computer Science 24 (2) 2014.zobacz w PBN
• Bartosz Klin, Sławomir Lasota, Joanna Ochremiak i Szymon Toruńczyk, Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, w: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014.zobacz w PBN
• Claire David, Nadime Francis i Filip Murlak, Consistency of Injective Tree Patterns, w: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014, s. 279–290.zobacz w PBN
• Marcin Andrychowicz, Stefan Dziembowski, Daniel Szymon Malinowski i Łukasz Paweł Mazurek, Secure Multiparty Computations on Bitcoin, w: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, May 18-21, 2014, 2014, s. 443–458.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Applications of Boolean Kernels in Rough Sets, w: Rough Sets and Intelligent Systems Paradigms - Second International Conference, RSEISP 2014, Held as Part of JRS 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings, 2014, s. 65–76.zobacz w PBN
• Chris Cornelis, Marzena KRYSZKIEWICZ, Dominik Ślęzak, Ernestina Menasalvas Ruiz, Rafael Bello i Lin Shang (red.), Rough Sets and Current Trends in Computing - 9th International Conference, RSCTC 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings, Springer, 2014.zobacz w PBN
• Dominik Ślęzak, Barbara Dunin-Kęplicz, Mike Lewis i Takao Terano (red.), Proceedings - 2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2014, Institute of Electrical and Electronics Engineers, 2014.zobacz w PBN
• Ewa Szczurek i Niko Beerenwinkel, Modeling mutual exclusivity of cancer mutations, Plos Computational Biology 3 (10) 2014.zobacz w PBN
• Marcelo Arenas, Pablo Barceló, Leonid Libkin i Filip Murlak, Foundations of Data Exchange, Cambridge University Press, 2014.zobacz w PBN
• Cezary Bartoszuk, Grzegorz Timoszuk, Robert Dąbrowski i Krzysztof Stencel, On Visual Assessment of Software Quality, E-informatica Software Engineering Journal 8 (1) 2014, s. 7–26.zobacz w PBN
• Łukasz Sosnowski, Andrzej Pietruszka, Adam Krasuski i Andrzej Piotr Janusz, A Resemblance Based Approach for Recognition of Risks at a Fire Ground, w: Active Media Technology - 10th International Conference, AMT 2014, Warsaw, Poland, August 11-14, 2014. Proceedings, 2014, s. 559–570.zobacz w PBN
• Konrad Iwanicki, Beyond replicated storage: eventually-consistent distributed data structures, w: Proceedings of the First Workshop on the Principles and Practice of Eventual Consistency, PaPEC@EuroSys 2014, April 13, 2014, Amsterdam, The Netherlands, ACM, 2014.zobacz w PBN
• Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Paweł Parys i Michael Vanden Boom, Two-Way Cost Automata and Cost Logics Over Infinite Trees, w: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014, r. 16.zobacz w PBN
• James F. Peters, Andrzej Skowron, Tianrui Li, Yan Yang, Jin Tao Yao i Hung Son Nguyen (red.), Transcations on Rough Sets XVIII, Springer, Heidelberg 2014.zobacz w PBN
• Andrzej Tarlecki, R\uazvan Diaconescu, Institution-independent Model Theory, Studia Logica 102 (1) 2014, s. 225–229.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Maximizing Deep Coalescence Cost, Ieee-acm Transactions On Computational Biology And Bioinformatics 11 (1) 2014, s. 231–242.zobacz w PBN
• Ryszard Rudnicki i Jerzy Tiuryn, Size distribution of gene families in a genome, Mathematical Models & Methods In Applied Sciences 24 (4) 2014, s. 697–717.zobacz w PBN
• Marcin Andrychowicz, Stefan Dziembowski, Daniel Szymon Malinowski i Łukasz Paweł Mazurek, Modeling Bitcoin Contracts by Timed Automata, w: Formal Modeling and Analysis of Timed Systems - 12th International Conference, FORMATS 2014, Florence, Italy, September 8-10, 2014. Proceedings, 2014, s. 7–22.zobacz w PBN
• Tomasz Michalak, Piotr Szczepański, Talal Rahwan, Agata Chrobak, Simina Branzei, Michael Wooldridge i Nicholas Jennings, Implementation and Computation of a Value for Generalized Characteristic Function Games, Acm Transactions On Economics And Computation 2 (4) 2014.zobacz w PBN
• Duoqian Miao, Witold Pedrycz, Dominik Ślęzak, Georg Peters, Qinghua Hu i Ruizhi Wang (red.), Rough Sets and Knowledge Technology - 9th International Conference, RSKT 2014, Shanghai, China, October 24-26, 2014, Proceedings, Springer, 2014.zobacz w PBN
• Andrzej Piotr Janusz i Dominik Ślęzak, Rough Set Methods for Attribute Clustering and Selection, Applied Artificial Intelligence 28 (3) 2014, s. 220–242.zobacz w PBN
• Michal Gregorczyk, Tomasz Pazurkiewicz i Konrad Iwanicki, On Decentralized In-network Aggregation in Real-World Scenarios with Crowd Mobility, w: IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014, Marina Del Rey, CA, USA, May 26-28, 2014, IEEE, 2014.zobacz w PBN
• Paweł Parys, How Many Numbers Can a Lambda-Term Contain?, w: Functional and Logic Programming - 12th International Symposium, FLOPS 2014, Kanazawa, Japan, June 4-6, 2014. Proceedings, 2014, s. 302–318.zobacz w PBN
• A. V. Dharmadhikari, Tomasz Gambin, P. Szafranski, W. Cao, F. J. Probst, W. Jin, P. Fang, K. Gogolewski, Anna Gambin, J. K. George-Abraham, S. Golla, F. Boidein, B. Duban-Bedu, B. Delobel, J. Andrieux, K. Becker, E. Holinski-Feder, S. Cheung i P. Stankiewicz, Molecular and clinical analyses of 16q24.1 duplications involving FOXF1 identify an evolutionarily unstable large minisatellite, Bmc Medical Genetics 15 (1) 2014, s. 128.zobacz w PBN
• Till Mossakowski, Wiesław Pawłowski, Donald Sannella i Andrzej Tarlecki, Parchments for CafeOBJ Logics, w: Specification, Algebra, and Software - Essays Dedicated to Kokichi Futatsugi, Springer, 2014, s. 66––91.zobacz w PBN
• Paweł Górecki, Jarosław PASZEK i Oliver Eulenstein, Unconstrained Gene Tree Diameters for Deep Coalescence, w: Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, New York 2014.zobacz w PBN
• Michał Woźniak, Jerzy Tiuryn i Limsoon Wong, GWAMAR: Genome-wide assessment of mutations associated with drug resistance in bacteria, Bmc Genomics 15 (Suppl 10) 2014, s. S10.zobacz w PBN
• Marcin Andrychowicz, Stefan Dziembowski, Daniel Szymon Malinowski i Łukasz Paweł Mazurek, Fair Two-Party Computations via Bitcoin Deposits, w: Financial Cryptography and Data Security - FC 2014 Workshops, BITCOIN and WAHC 2014, Christ Church, Barbados, March 7, 2014, Revised Selected Papers, 2014, s. 105–121.zobacz w PBN
• Jacob Engwerda i Tomasz Michalak, Economic Growth and Choice of Energy: A Simplistic Strategic Approach, Environmental Modeling & Assessment 2014.zobacz w PBN
• Stefan Dziembowski i Maciej Zdanowicz, Position-Based Cryptography from Noisy Channels, w: Progress in Cryptology - AFRICACRYPT 2014 - 7th International Conference on Cryptology in Africa, Marrakesh, Morocco, May 28-30, 2014. Proceedings, 2014, s. 300–317.zobacz w PBN
• Pauli Rämö, Anna Drewek, Cécile Arrieumerlou, Niko Beerenwinkel, Houchaima Ben-Tekaya, Bettina Cardel, Alain Casanova, Raquel Conde-Alvarez, Pascale Cossart, Gábor Csúcs, Simone Eicher, Mario Emmenlauer, Urs Greber, Wolf-Dietrich Hardt, Ari Helenius, Christoph Kasper, Andreas Kaufmann, Saskia Kreibich, Andreas Kühbacher, Peter Kunszt, Shyan Huey Low, Jason Mercer, Daria Mudrak, Simone Muntwiler, Lucas Pelkmans, Javier Pizarro-Cerdá, Michael Podvinec, Eva Pujadas, Bernd Rinn, Vincent Rouilly, Fabian Schmich, Juliane Siebourg-Polster, Berend Snijder, Michael Stebler, Gabriel Studer, Ewa Szczurek, Matthias Truttmann, Christian von Mering, Andreas Vonderheit, Artur Yakimovich, Peter Bühlmann i Christoph Dehio, Simultaneous analysis of large-scale RNAi screens for pathogen entry, Bmc Genomics 2014.zobacz w PBN
• Aleksander Jankowski, Shyam Prabhakar i Jerzy Tiuryn, TACO: a general-purpose tool for predicting cell-type–specific transcription factor dimers, Bmc Genomics 15 (1) 2014, s. 208.zobacz w PBN
• Marek Adam Cygan, Dániel Marx, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Ildikó Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Algorithmica 68 (1) 2014, s. 41–61.zobacz w PBN
• Marcin Szczuka, Łukasz Sosnowski, Adam Krasuski i Karol Kreński, Using Domain Knowledge in Initial Stages of KDD: Optimization of Compound Object Processing, Fundamenta Informaticae 129 (4) 2014, s. 341–364.zobacz w PBN
• Dominik Ślęzak, Special section on applications of intelligent data and knowledge processing technologies—Preface, Future Generation Computer Systems-the International Journal Of Grid Computing And Escience 33 2014, s. 19–20.zobacz w PBN
• Konrad Iwanicki, Przemysław Jan Horban, Piotr Glazar i Karol Strzelecki, Bringing Modern Unit Testing Techniques to Sensornets, Acm Transactions On Sensor Networks 11 (2) 2014, s. 25:1–25:41.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Krzysztof Stencel i Tomasz Waleń, New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics 163 2014, s. 258–267.zobacz w PBN
• Paweł Parys, First-Order Logic on CPDA Graphs, w: Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, 2014, s. 300–313.zobacz w PBN
• Piotr Dittwald, V. T. Nghia, G. A. Harris, R. M. Caprioli, R. Van de Plas, K. Laukens, Anna Gambin i D. Valkenborg, Towards automated discrimination of lipids versus peptides from full scan mass spectra, Eupa Open Proteomics 4 2014, s. 87–100.zobacz w PBN
• Till Mossawkoski i Andrzej Tarlecki, A Relatively Complete Calculus for Structured Heterogeneous Specifications, w: Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Springer, 2014, s. 441––456.zobacz w PBN
• Paweł Górecki, Jarosław Paszek i Eulenstein Oliver, Duplication Cost Diameters, Lecture Notes In Computer Science 8492 2014, s. 221–223.zobacz w PBN
• Alexandre Duc, Stefan Dziembowski i Sebastian Faust, Unifying Leakage Models: From Probing Attacks to Noisy Leakage, w: Advances in Cryptology - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings, 2014, s. 423–440.zobacz w PBN
• Krzysztof Pawłowski, Karol Kurach, Kim Svensson, Sarvapali Ramchurn, Tomasz Michalak i Talal Rahwan, Coalition Structure Generation with the Graphics Processing Unit, w: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, 2014.zobacz w PBN
• Mohammad Reza Bonyadi, Adam Wierzbicki, Michał Przybyłek i Zbigniew Michalewicz, Socially inspired algorithms for the travelling thief problem, w: GECCO '14 Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, ACM New York, New York 2014, s. 421–428.zobacz w PBN
• Eryk Kopczyński i Damian Niwiński, A simple indeterminate infinite game, w: Logic, Computation, Hierarchies, De Gruyter, Berlin, Germany 2014, s. 205–2012.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Jakub Onufry Wojtaszczyk, Scheduling Partially Ordered Jobs Faster than 2^n, Algorithmica 68 (3) 2014, s. 692–714.zobacz w PBN
• Łukasz Kowalik i Marcin Ireneusz Mucha, A 9k kernel for nonseparating independent set in planar graphs, Theoretical Computer Science 2014.zobacz w PBN
• Piotr Skowron i Krzysztof Rządca, Fair Share Is Not Enough: Measuring Fairness in Scheduling with Cooperative Game Theory, w: PPAM 2013, International Conference on Parallel Processing and Applied Mathematics, 2014, s. 38–48.zobacz w PBN
• Dominik Ślęzak, Barbara Dunin-Kęplicz, Mike Lewis i Takao Terano (red.), 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Vol. 3, IEEE, Los Alamitos, California 2014.zobacz w PBN
• Wojciech Michał Świeboda, Andrzej Krauze i Hung Son Nguyen, A Granular Evacuation Modeling Framework, w: Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, Warsaw, Poland, September 7-10, 2014., 2014, s. 337–342.zobacz w PBN
• Tomasz Waleń, Grzegorz Chojnowski, Przemysław Gierski i Janusz Bujnicki, ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes, Nucleic Acids Research 42 (19) 2014, s. e151.zobacz w PBN
• I. M. Campbell, Tomasz Gambin, Piotr Dittwald, C. R. Beck, A. Shuvarikov, P. Hixson, A. Patel, Anna Gambin, C. A. Shaw, J. A. Rosenfeld i P. Stankiewicz, Human endogenous retroviral elements promote genome instability via non-allelic homologous recombination, Bmc Biology 12 2014, s. 74.zobacz w PBN
• Andrzej Tarlecki, Władysław Marek Turski (1938 - 2013), Formal Aspects Of Computing 26 (5) 2014, s. 863––864.zobacz w PBN
• Barbara Dunin-Kęplicz i Alina Strachocka, Computationally-Friendly Argumentation Schemes, w: 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Vol. 3, IEEE, Los Alamitos, California 2014, s. 167–174.zobacz w PBN
• Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski i Qiang Zhang, Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets, Lecture Notes In Computer Science 2014.zobacz w PBN
• Oskar Skibski, Tomasz Michalak, Talal Rahwan i Michael Wooldridge, Algorithms for the Shapley and Myerson Values in Graph-restricted Games, w: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, 2014.zobacz w PBN
• MAGDALENA KACPRZAK, Anna Sawicka, KATARZYNA BUDZYŃSKA i Marcin Konrad Dziubiński, Verifying Strategies in Dialogue Games, w: Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, CEUR-WS.org, 2014, s. 92–100.zobacz w PBN
• Navodit Misra, Ewa Szczurek i Martin Vingron, Inferring the paths of somatic evolution in cancer, Bioinformatics 2014.zobacz w PBN
• Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, On Cutwidth Parameterized by Vertex Cover, Algorithmica 68 (4) 2014, s. 940–953.zobacz w PBN
• Jacek Sroka i Jan Hidders, On generating *-sound nets with substitution, Information Systems 40 2014, s. 32–46.zobacz w PBN
• Andreas Bjorklund, Petteri Kaski i Łukasz Kowalik, Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time, w: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 2014.zobacz w PBN
• Joseph Emeras, Vinicius Pinheiro, Krzysztof Rządca i Denis Trystram, OStrich: Fair Scheduling for Multiple Submissions, w: PPAM 2013, International Conference on Parallel Processing and Applied Mathematics, 2014, s. 26–37.zobacz w PBN
• Łukasz Kowalik i Arkadiusz Aleksander Socała, Assigning Channels via the Meet-in-the-Middle Approach, w: Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, 2014.zobacz w PBN
• Łukasz Białek i Andrzej Szałas, Lightweight Reasoning with Incomplete and Inconsistent Information: a Case Study, w: 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Vol. 3, IEEE, Los Alamitos, California 2014, s. 325–332.zobacz w PBN
• Volker Diekert, Artur Jeż i Wojciech Plandowski, Finding All Solutions of Equations in Free Groups and Monoids with Involuton, Lecture Notes In Computer Science 8476 2014, s. 1–15.zobacz w PBN
• Tomasz Kociumaka, Solon Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes In Computer Science 8486 2014, s. 192–201.zobacz w PBN
• P. Sen, A. V. Dharmadhikari, T. Majewski, M. A. Mohammad, T. V. Kalin, J. Zabielska, X. Ren, M. Bray, H. M. Brown, S. Welty, S. Thevananther, C. Langston, P. Szafranski, M. J. Justice, V. V. Kalinichenko, Anna Gambin, J. Belmont i Paweł Stankiewicz, Comparative analyses of lung transcriptomes in patients with alveolar capillary dysplasia with misalignment of pulmonary veins and in foxf1 heterozygous knockout mice, Plos One 9 (4) 2014, s. e94390.zobacz w PBN
• Wojciech Michał Świeboda, Van Mai Nguyen Thi i Hung Son Nguyen, Granular Floor Plan Representation for Evacuation Modeling, w: Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29 - October 1, 2014, 2014, s. 308–310.zobacz w PBN
• Mikołaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski i Michał Paweł Skrzypczak, On the Decidability of MSO+U on Infinite Trees, w: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, s. 50–61.zobacz w PBN
• Paweł Urzyczyn, Games for Intuitionistic Logic, w: Trends in Logic XIII, Wydawnictwo Uniwersytetu Łódzkiego, Łódź 2014, s. 247–269.zobacz w PBN
• Piotr Wiśniewski i Krzysztof Stencel, Universal Query Language for Unified State Model, Fundamenta Informaticae 129 (1-2) 2014, s. 177–192.zobacz w PBN
• Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski i Piotr Sankowski, Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., Lecture Notes In Computer Science 2014.zobacz w PBN
• Ramasuri Narayanam, Oskar Skibski, Hemank Lamba i Tomasz Michalak, A Shapley Value-based Approach to Determine Gatekeepers in Social Networks with Applications, w: 21st European Conference on Artificial Intelligence, IOS Press, 2014.zobacz w PBN
• Paweł Gora i Piotr Wasilewski, Adaptive System for Intelligent Traffic Management in Smart Cities., Lecture Notes In Computer Science 8610 2014, s. 525–536.zobacz w PBN
• Marek Adam Cygan, Daniel Lokshtanov, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Saket Saurabh, On the Hardness of Losing Width, Theory Of Computing Systems 54 (1) 2014, s. 73–82.zobacz w PBN
• Piotr Skowron, Krzysztof Rzadca i Anwitaman Datta, People Are Processors: Coalitional Auctions for Complex Projects, w: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, s. 1525–1526.zobacz w PBN
• Paweł Bednarz i Bartosz Wilczyński, Supervised learning method for predicting chromatin boundary associated insulator elements, Journal Of Bioinformatics And Computational Biology 2014.zobacz w PBN
• Marek Adam Cygan i Pinar Heggernes (red.), 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), 2014.zobacz w PBN
• Andrzej Szałas, Symbolic Explanations of Generalized Fuzzy Reasoning., w: Smart Digital Futures 2014, IOS PRESS, 2014, s. 7–16.zobacz w PBN
• Thanh-Luong Tran, Anh Linh Nguyen i Thi-Lan-Giao Hoang, A Domain Partitioning Method for Bisimulation-Based Concept Learning in Description Logics, w: Advanced Computational Methods for Knowledge Engineering, Springer, 2014, s. 297–312.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes In Computer Science 8633 2014, s. 215–226.zobacz w PBN
• Magdalena Bartnik, Beata Nowakowska, Katarzyna Derwińska, Barbara Wiśniowiecka-Kowalnik, Marta Kędzior, Joanna Bernaciak, Kamila Ziemkiewicz, Anna Gambin, Maciej Sykulski, Natalia Bezniakow, Lech Korniszewski, Anna Dorota Kutkowska-Kaźmierczak, Jakub Klapecki, Krzysztof Szczałuba, C. A. Shaw, Tadeusz Mazurczak, Anna Gambin, Ewa Obersztyn, Ewa Bocian i Paweł Stankiewicz, Application of array comparative genomic hybridization in 256 patients with developmental delay or intellectual disability, Journal Of Applied Genetics 55 (1) 2014, s. 125–144.zobacz w PBN
• Marcin Ireneusz Mucha, 13/9 -Approximation for Graphic TSP, Theory Of Computing Systems 55 (4) 2014, s. 640–657.zobacz w PBN
• Alessandro Facchini i Henryk Michalewski, Deciding the Borel Complexity of Regular Tree Languages, w: Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings, Springer, 2014, s. 163–172.zobacz w PBN
• Piotr Przymus, Krzysztof Kaczmarski i Krzysztof Stencel, A Bi-objective Optimization Framework for Heterogeneous CPU/GPU Query Plans, Fundamenta Informaticae 135 (4) 2014, s. 483–501.zobacz w PBN
• Marek Adamczyk, Piotr Sankowski i Qiang Zhang, Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching, Lecture Notes In Computer Science 2014.zobacz w PBN
• Piotr Szczepański, Tomasz Michalak i Michael Wooldridge, A Centrality Measure for NetworksWith Community Structure Based on a Generalization of the Owen Value, w: 21st European Conference on Artificial Intelligence, IOS Press, 2014.zobacz w PBN
• Piotr Wasilewski i Paweł Gora, Traffic-related Knowledge Acquired by Interaction with Experts, w: Concurrency, Specification and Programming. CS&P'2014, 2014.zobacz w PBN
• Katarzyna Budzynska, Michal Araszkiewicz, Barbara Bogołȩbska, Piotr Cap, Tadeusz Ciecierski, Kamila Debowska-Kozlowska, Barbara Dunin-Kęplicz, Marcin Dziubiński, Michał Federowicz, Anna Gomolińska, Andrzej Grabowski, Teresa Hołówka, Łukasz Jochemczyk, Magdalena Kacprzak, Paweł Kawalec, Maciej Kielar, Andrzej Kisielewicz, Marcin Koszowy, Robert Kublikowski, Piotr Kulicki, Anna Kuzio, Piotr Lewiński, Jakub Z. Lichański, Jacek Malinowski, Witold Marciszewski, Edward Nieznański, Janina Pietrzak, Jerzy Pogonowski, Tomasz Puczyłowski, Jolanta Rytel, Anna Sawicka, Marcin Selinger, Andrzej Skowron, Joanna Skulska, Marek Smolak, Małgorzata Sokół, Agnieszka Sowińska, Piotr Stalmaszczyk, Tomasz Stawecki, Jarosław Stepaniuk, Alina Strachocka, Wojciech Suchoń, Krzysztof Szymanek, Justyna Tomczyk, Robert Trypuz, Kazimierz Trzȩsicki, Mariusz Urbański, Ewa Wasilewska-Kamińska, Krzysztof a. Wieczorek, Maciej Witek, Urszula Wybraniec-Skardowska, Olena Yaskorska, Maria Załęska, Konrad Zdanowski i Tomasz Żurek, The Polish School of Argumentation: A Manifesto, Argumentation 28 (3) 2014, s. 267–282.zobacz w PBN
• Lucia Ciglar, Charles Girardot, Bartosz Wilczyński, Martina Braun i Eileen EM Furlong, Coordinated repression and activation of two transcriptional programs stabilizes cell fate during myogenesis, Development 141 (13) 2014, s. 2633–2643.zobacz w PBN
• Marthe Bonamy i Łukasz Kowalik, A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition, w: 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), 2014.zobacz w PBN
• Barbara Dunin-Kęplicz, Andrzej Szałas i Rineke Verbrugge, Tractable Reasoning about Group Beliefs, w: Engineering Multi-Agent Systems, Springer-Verlag, 2014, s. 328–350.zobacz w PBN
• Son Thanh Cao i Anh Linh Nguyen, An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases, w: Advanced Computational Methods for Knowledge Engineering, Springer, 2014, s. 281–295.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski i Wojciech Rytter, Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence, Lecture Notes In Computer Science 8486 2014, s. 202–211.zobacz w PBN
• T. Jetka, A. Charzyńska, Anna Gambin, M. P. Stumpf i Michał Komorowski, StochDecomp--Matlab package for noise decomposition in stochastic biochemical systems, Bioinformatics 30 (1) 2014, s. 137–138.zobacz w PBN
• Marcin Ireneusz Mucha, Matthias Englert i Nicolaos Matsakis, New Bounds for Online Packing LPs, w: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 2014, s. 318–329.zobacz w PBN
• Tomasz Gogacz, Henryk Michalewski, Matteo Mio i Michał Paweł Skrzypczak, Measure Properties of Game Tree Languages, w: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, Springer, 2014, s. 303–314.zobacz w PBN
• Mikołaj Bojańczyk, Christoph Dittmann i Stephan Kreutzer, Decomposition theorems and model-checking for the modal \emph\(\mu\)-calculus, w: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014, s. 17.zobacz w PBN
• Piotr Wiśniewski i Krzysztof Stencel, Query Rewriting Based on Meta-Granular Aggregation, Fundamenta Informaticae 135 (4) 2014, s. 537–551.zobacz w PBN
• Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski i Anna Katarzyna Zych, Online Bipartite Matching in Offline Time, w: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, s. 384–393.zobacz w PBN
• Shaheen Fatima, Tomasz Michalak i Michael Wooldridge, Bargaining for Coalition Structure Formation, w: 21st European Conference on Artificial Intelligence, IOS Press, 2014.zobacz w PBN
• Olivier Finkel i Michał Paweł Skrzypczak, On the Topological Complexity of w-Languages of Non-Deterministic Petri Nets, Information Processing Letters 114 (5) 2014, s. 229–233.zobacz w PBN
• Cristina Bazgan, Morgan Chopin, Marek Adam Cygan, Michael R. Fellows, Fedor V. Fomin i Erik Jan van Leeuwen, Parameterized complexity of firefighting, Journal Of Computer And System Sciences 80 (7) 2014, s. 1285–1297.zobacz w PBN
• Aleksy Andrzej Schubert i Ken-etsu Fujita, A note on subject reduction in (→, ∃)-curry with respect to complete developments, Information Processing Letters 114 (1-2) 2014.zobacz w PBN
• Ken-etsu Fujita i Aleksy Andrzej Schubert, Existential type systems between Church and Curry style (type-free style), Theoretical Computer Science 549 2014, s. 17–35.zobacz w PBN
• Lala Septem Riza, Andrzej Piotr Janusz, Christoph Bergmeir, Chris Cornelis, Francisco Herrera, Dominik Ślęzak i José Manuel Benítez, Implementing algorithms of rough set theory and fuzzy rough set theory in the R package “RoughSets”, Information Sciences 287 2014, s. 68–89.zobacz w PBN
• Andreas Bjorklund, Petteri Kaski i Łukasz Kowalik, Fast Witness Extraction Using a Decision Oracle, w: Algorithms - ESA 2014 - 22th Annual European Symposium, 2014.zobacz w PBN
• Łukasz Białek, Marta Borkowska, Adam Borkowski, Barbara Dunin-Kęplicz, Michał Gnatowski, Andrzej Szałas i Jacek Szklarski, Coordinating multiple rescue robots, Prace Naukowe Politechniki Warszawskiej. Elektronika (194) 2014, s. 185–196.zobacz w PBN
• Anh Linh Nguyen, A Tractable Rule Language in the Modal and Description Logics that Combine CPDL with Regular Grammar Logic, w: Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, CEUR-WS.org, 2014, s. 150–163.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes In Computer Science 8889 2014, s. 220––232.zobacz w PBN
• Anudhyan Boral, Marek Adam Cygan, Tomasz Kociumaka i Marcin Pilipczuk, A Fast Branching Algorithm for Cluster Vertex Deletion, w: Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, 2014, s. 111–124.zobacz w PBN
• Wojciech Michał Świeboda, Michał Meina i Hung Son Nguyen, Weight Learning in TRSM-based Information Retrieval, w: Intelligent Tools for Building a Scientific Information Platform: From Research to Implementation, Springer International Publishing, Berlin, Heidelberg 2014, s. 394–414.zobacz w PBN
• Mikołaj Bojańczyk, Transducers with Origin Information, w: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, s. 26–37.zobacz w PBN
• Mikolaj Fejzer, Michal Wojtyna, Marta Burzańska, Piotr Wiśniewski i Krzysztof Stencel, Open Source Is a Continual Bugfixing by a Few, w: Advances in Databases and Information Systems - 18th East European Conference, ADBIS 2014, Ohrid, Macedonia, September 7-10, 2014. Proceedings, Springer, 2014, s. 153–162.zobacz w PBN
• Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco i Piotr Sankowski, The ring design game with fair cost allocation, Theoretical Computer Science 2014.zobacz w PBN
• Jerzy Stefanowski, Alfredo Cuzzocrea i Dominik Ślęzak, Processing and mining complex data streams, Information Sciences 285 2014, s. 63–65.zobacz w PBN
• Michał Paweł Skrzypczak, Separation Property for wB- and wS-regular Languages, Logical Methods In Computer Science 10 (1:8) 2014, s. 1–20.zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen i Andrzej Szałas, The Web Ontology Rule Language OWL 2 RL+ and Its Extensions, Lncs Transactions On Computational Collective Intelligence 13 2014, s. 152–175.zobacz w PBN
• Andrzej Piotr Janusz, Algorithms for Similarity Relation Learning from High Dimensional Data, Transactions On Rough Sets Xvii 17 2014, s. 174–292.zobacz w PBN
• Tadeusz Sznuk i Aleksy Andrzej Schubert, Tool Support for Teaching Hoare Logic, w: Software Engineering and Formal Methods - 12th International Conference, SEFM 2014, Grenoble, France, September 1-5, 2014. Proceedings, Springer, 2014, s. 332–346.zobacz w PBN
• Wojciech Michał Świeboda, Adam Krasuski, Hung Son Nguyen i Andrzej Piotr Janusz, Interactive Method for Semantic Document Indexing Based on Explicit Semantic Analysis, Fundamenta Informaticae 132 (3) 2014, s. 423–438.zobacz w PBN
• Marcin Kamiński i Łukasz Kowalik, Beyond the Vizing's Bound for at Most Seven Colors, Siam Journal On Discrete Mathematics 28 (3) 2014, s. 1334–1362.zobacz w PBN
• Son Thanh Cao i Anh Linh Nguyen, An Empirical Approach to Query-Subquery Nets with Tail-Recursion Elimination, w: New Trends in Database and Information Systems II - Selected papers of the 18th East European Conference on Advances in Databases and Information Systems and Associated Satellite Events, Springer, 2014, s. 109–120.zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes In Computer Science 8799 2014, s. 244–255.zobacz w PBN
• Ivan Bliznets, Fedor Fomin, Marcin Pilipczuk i Michał Pilipczuk, A Subexponential Parameterized Algorithm for Proper Interval Completion, w: Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings, Springer, 2014, s. 173–184.zobacz w PBN
• MAGDALENA KACPRZAK, Marcin Konrad Dziubiński i KATARZYNA BUDZYŃSKA, Strategies in Dialogues: A Game-Theoretic Approach, w: Computational Models of Argument. Proceedings of COMMA 2014, IOS Press, 2014, s. 333–344.zobacz w PBN
• Mikołaj Bojańczyk, Weak MSO+U with Path Quantifiers over Infinite Trees, w: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, s. 38–49.zobacz w PBN
• Michal Gawarkiewicz, Piotr Wiśniewski i Krzysztof Stencel, Granular Indices for HQL Analytic Queries, w: Beyond Databases, Architectures, and Structures - 10th International Conference, BDAS 2014, Ustron, Poland, May 27-30, 2014. Proceedings, Springer, Switzerland 2014, s. 30–39.zobacz w PBN
• Piotr Synak i Dominik Ślęzak, Complexity aspects of multi-machine aggregations in a rough-granular computation framework, w: 2014 IEEE International Conference on Granular Computing, GrC 2014, Noboribetsu, Japan, October 22-24, 2014, 2014, s. 275–280.zobacz w PBN
• MICHAŁ WOŹNIAK, Limsoon Wong i Jerzy Tiuryn, eCAMBer: efficient support for large-scale comparative analysis of multiple bacterial strains, Bmc Bioinformatics 15 (65) 2014.zobacz w PBN
• Mikołaj Bojańczyk, Stanisław Konrad Szawiel i Marek Witold Zawadowski, Rigidity is undecidable, Mathematical Structures In Computer Science 2014.zobacz w PBN
• Izabela Sierocka, Łukasz Kozłowski, Janusz Bujnicki, Artur Jarmołowski i Zofia Szweykowska-kulińska, Female-specific gene expression in dioecious liverwort Pellia endiviifolia is developmentally regulated and connected to archegonia production, Bmc Plant Biology 14 2014, s. 168.zobacz w PBN
• Andrzej Piotr Janusz i Marcin Szczuka, Assessment of data granulations in context of feature extraction problem, w: 2014 IEEE International Conference on Granular Computing, Proceedings, IEEE, 2014, s. 116–120.zobacz w PBN
• Janina Mincer-Daszkiewicz, We Publish, You Subscribe - Hubbub as a Natural Habitat for Students and Academic Teachers, w: EUNIS 2014, The 20th International Conference of European University Information Systems, Umeå University, Umeå 2014.zobacz w PBN
• Anh Linh Nguyen, ExpTime tableaux with global state caching for the description logic SHIO, Neurocomputing 146 2014, s. 249–263.zobacz w PBN
• Jakub Jan Radoszewski, More Algorithms Without Programming, Olympiads In Informatics 8 2014, s. 157–168.zobacz w PBN
• Marek Adam Cygan, Dániel Marx, Marcin Pilipczuk i Michał Pilipczuk, Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth, w: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, Springer, 2014, s. 189–200.zobacz w PBN
• Diego Cerdeiro, Marcin Konrad Dziubiński i Sanjeev Goyal, Individual security and network design, w: EC '14: Proceedings of the Fifteenth ACM Conference on Economics and Computation, ACM, New York, NY, USA 2014, s. 205–206.zobacz w PBN
• Michal Modzelewski i Norbert Dojer, MSARC: Multiple sequence alignment by residue clustering, Algorithms For Molecular Biology 9 (1) 2014, s. 12.zobacz w PBN
• Michal Chromiak i Krzysztof Stencel, A Data Model for Heterogeneous Data Integration Architecture, w: Beyond Databases, Architectures, and Structures - 10th International Conference, BDAS 2014, Ustron, Poland, May 27-30, 2014. Proceedings, Springer, Switzerland 2014, s. 547–556.zobacz w PBN
• Sebastian Widz i Dominik Ślęzak, Attribute Subset Quality Functions over a Universe of Weighted Objects, Lecture Notes In Computer Science 8537 2014, s. 99–110.zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen i Andrzej Szałas, WORL: a nonmonotonic rule language for the semantic web, Vietnam Journal Of Computer Science 1 (1) 2014, s. 57–69.zobacz w PBN
• Anh Linh Nguyen, Thi-Bich-Loc Nguyen i Andrzej Szałas, On Horn Knowledge Bases in Regular Description Logic with Inverse, w: Knowledge and Systems Engineering - Proceedings of the Fifth International Conference, KSE 2013, Volume 1, Hanoi, Vietnam, 17-19 October, 2013, Springer, 2014, s. 37–49.zobacz w PBN
• Andrzej Piotr Janusz, Sebastian Stawicki i Hung Son Nguyen, Adaptive Learning for Improving Semantic Tagging of Scientific Articles, w: Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, Warsaw, Poland, September 7-10, 2014., 2014, s. 27–34.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Indeterministic Belief Structures, w: KES-AMSTA-14, Springer-Verlag, 2014, s. 57–66.zobacz w PBN
• Anh Linh Nguyen i Joanna Golińska-Pilarek, An ExpTime Tableau Method for Dealing with Nominals and Qualified Number Restrictions in Deciding the Description Logic SHOQ, Fundamenta Informaticae 135 (4) 2014, s. 433–449.zobacz w PBN
• Marek Adam Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk i Saket Saurabh, Minimum bisection is fixed parameter tractable, w: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, ACM, 2014, s. 323–332.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Refining Discordant Gene Trees, Bmc Bioinformatics 15(Suppl 13) (S3) 2014.zobacz w PBN
• Michal Chromiak, Piotr Wiśniewski i Krzysztof Stencel, Exploiting Order Dependencies on Primary Keys for Optimization, w: Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29 - October 1, 2014, 2014, s. 58–68.zobacz w PBN
• Bartosz Klin i Beata Nachyła, Distributive Laws and Decidable Properties of SOS Specifications, w: Proceedings Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, EXPRESS 2014, and 11th Workshop on Structural Operational Semantics, SOS 2014, Rome, Italy, 1st September 2014., 2014, s. 79–93.zobacz w PBN

2013

• Piotr Jaroszynski i Norbert Dojer, Efficient and Error-Tolerant Sequencing Read Mapping, w: PROCEEDINGS IWBBIO 2013: INTERNATIONAL WORK-CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING, 2013, s. 353–364.zobacz w PBN
• Mikołaj Bojańczyk, Bartosz Klin, Sławomir Lasota i Szymon Toruńczyk, Turing machines with atoms, w: Proceedings of LICS 2013, 2013, s. 183–192.zobacz w PBN
• Dominik Ślęzak i Marcin Kowalski, Intelligent Granulation of Machine-generated Data, w: Proceedings of Joint IFSA World Congress and NAFIPS Annual Meeting 2013, IEEE, Piscataway, NJ, USA 2013, s. 68–73.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, On the Horn Fragments of Serial Regular Grammar Logics with Converse, w: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013, s. 225–234.zobacz w PBN
• Anh Linh Nguyen, A Tableau Method with Optimal Complexity for Deciding the Description Logic SHIQ, w: Advanced Computational Methods for Knowledge Engineering, Springer, 2013, s. 331–342.zobacz w PBN
• Paweł Urzyczyn, Undecidability of inhabitation, w: Lambda Calculus with Types, Association for Symbolic Logic - Cambridge University Press, Cambridge 2013, r. 175, s. 762–786.zobacz w PBN
• Alessandro Facchini, Filip Murlak i Michał Paweł Skrzypczak, Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata, w: Proceedings of LICS 2013, 2013, s. 499–508.zobacz w PBN
• Udi Boker, Denis Kuperberg, Orna Kupferman i Michał Paweł Skrzypczak, Nondeterminism in the Presence of a Diverse or Unknown Future, w: ICALP (2), 2013, 2013, s. 89–100.zobacz w PBN
• Long Giang Nguyen i Hung Son Nguyen, Metric Based Attribute Reduction in Incomplete Decision Tables, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 14th International Conference, RSFDGrC 2013, Halifax, NS, Canada, October 11-14, 2013. Proceedings, Springer, Berlin, Heidelberg 2013, s. 99–110.zobacz w PBN
• Ryan B. Hayward, Broderic Arneson, Shih-Chieh Huang i Jakub Pawlewicz, MoHex Wins Hex Tournament, Icga Journal 36 (3) 2013, s. 180–183.zobacz w PBN
• Mikołaj Bojańczyk, Tomasz Idziaszek i Michał Paweł Skrzypczak, Regular languages of thin trees, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, s. 562–573.zobacz w PBN
• Michał Modzelewski i Norbert Dojer, MSARC: Multiple Sequence Alignment by Residue Clustering, w: Algorithms in Bioinformatics, 2013, s. 259–272.zobacz w PBN
• Paweł Parys, Some Results on Complexity of µ-Calculus Evaluation in the Black-Box Model, Rairo-theoretical Informatics And Applications 47 (1) 2013, s. 97–109.zobacz w PBN
• Tomasz Michalak, Talal Rahwan, Piotr L. Szczepański, Oskar Skibski, Ramasuri Narayanam, Michael J. Wooldridge i Nicholas R. Jennings, Computational Analysis of Connectivity Games with Applications to Terrorist Networks, w: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI, 2013, s. 293–301.zobacz w PBN
• Tsau Young Lin, Guilong Liu, M.K. Chakraborty i Dominik Ślęzak, From Topology to Anti-reflexive Topology, w: 2013 IEEE International Conference on Fuzzy Systems (FUZZ), 2013.zobacz w PBN
• Jan Małuszyński i Andrzej Szałas, Partiality and Inconsistency in Agents' Belief Bases, w: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013.zobacz w PBN
• Marta Smyk, Przemyslaw Szafranski, Michał Startek, Anna Gambin i Paweł Stankiewicz, Chromosome conformation capture-on-chip analysis of long-range cis-interactions of the SOX9 promoter, Chromosome Research 21 (8) 2013, s. 781–788.zobacz w PBN
• Mikołaj Bojańczyk, Luc Segoufin i Szymon Toruńczyk, Verification of database-driven systems via amalgamation, w: Proceedings of PODS 2013, 2013.zobacz w PBN
• Wojciech Świeboda, Michał Meina i Hung Son Nguyen, Weight Learning for Document Tolerance Rough Set Model, w: Rough Sets and Knowledge Technology - 8th International Conference, RSKT 2013, Halifax, NS, Canada, October 11-14, 2013, Proceedings, Springer, Berlin, Heidelberg 2013, s. 385–396.zobacz w PBN
• Mikołaj Bojańczyk, Leszek Aleksander Kołodziejczyk i Filip Murlak, Solutions in XML data exchange, Journal Of Computer And System Sciences 79 (6) 2013, s. 785–815.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk i Riste Skrekovski, A bound on the number of perfect matchings in Klee-graphs, Discrete Mathematics And Theoretical Computer Science 15 (1) 2013, s. 37–54.zobacz w PBN
• Gabriela Majewska i Mirosław Kowaluk, New Sequential and Parallel Algorithms for Computing the β-Spectrum, Lecture Notes In Computer Science 2013, s. 210–224.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, Networks of Compound Object Comparators, w: 2013 IEEE International Conference on Fuzzy Systems (FUZZ), 2013.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity, w: 5th International Conference on Computational Collective Intelligence - Technologies and Applications ICCCI 2013., 2013, s. 143–153.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Taming Complex Beliefs, Lncs Transactions On Computational Collective Intelligence 2013.zobacz w PBN
• Jakub Pachocki i Jakub Jan Radoszewski, Where to Use and How not to Use Polynomial String Hashing, Olympiads In Informatics 7 2013, s. 90–100.zobacz w PBN
• Bartosz Klin i V. Sassone, Structural operational semantics for stochastic and weighted transition systems, Information And Computation 227 (Complete) 2013, s. 58–83.zobacz w PBN
• Karol Kurach, Krzysztof Pawlowski, Lukasz Romaszko, Marcin Tatjewski, Andrzej Janusz i Hung Son Nguyen, Multi-label Classification of Biomedical Articles, w: Intelligent Tools for Building a Scientific Information Platform. Advanced Architectures and Solutions, SPRINGER-VERLAG, Berlin, Heidelberg 2013, s. 199–214.zobacz w PBN
• Adam Krasuski i Piotr Wasilewski, Outlier Detection by Interaction with Domain Experts, Fundamenta Informaticae 127 (1-4) 2013, s. 529–544.zobacz w PBN
• Piotr Dittwald, Jurgen Claesen, Tomasz Burzykowski, Dirk Valkenborg i Anna Gambin, BRAIN: A Universal Tool for High-Throughput Calculations of the Isotopic Distribution for Mass Spectrometry, Analytical Chemistry 2013, s. 1991–1994.zobacz w PBN
• Janina Mincer-Daszkiewicz, Skąd USOS mnie zna i jakie są moje prawa, czyli o zarządzaniu tożsamością, Delta 2013, s. 4–6.zobacz w PBN
• Marek Adam Cygan i Marcin Łukasz Pilipczuk, Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms, Information Processing Letters 113 (5-6) 2013, s. 179–182.zobacz w PBN
• Marek Adam Cygan, Dániel Marx, Marcin Łukasz Pilipczuk i Michał Pilipczuk, The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable, w: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, IEEE Computer Society, 2013, s. 197–206.zobacz w PBN
• Sergei Kuznetsov i Dominik Ślęzak, Data mining and soft computing, International Journal Of General Systems 42 (6) 2013, s. 543–545.zobacz w PBN
• Anh Linh Nguyen, Thi-Bich-Loc Nguyen i Andrzej Szałas, Horn-DL: An Expressive Horn Description Logic with PTime Data Complexity, w: Web Reasoning and Rule Systems - 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings, Springer, 2013, s. 259–264.zobacz w PBN
• Barbara Dunin-Kęplicz, Andrzej Szałas, Alina Strachocka i Rineke Verbrugge, Perceiving Speech Acts under Incomplete and Inconsistent Information, w: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013.zobacz w PBN
• Stefan Dziembowski, Tomasz Piotr Kazana i Maciej Obremski, Non-malleable Codes from Two-Source Extractors, Lecture Notes In Computer Science 2013.zobacz w PBN
• Hung Son Nguyen, Sinh Hoa Nguyen i Wojciech Swieboda, Semantic Explorative Evaluation of Document Clustering Algorithms, w: 2013 Federated Conference on Computer Science and Information Systems, FedCSIS, Polskie Towarzystwo Informatyczne, Warszawa 2013, s. 115–122.zobacz w PBN
• Mirosława Miłkowska, Book review of 'Thinking as Computation: a first course' by Hector J. Levesque, Theory And Practice Of Logic Programming 13 (01) 2013, s. 143–145.zobacz w PBN
• Janina Mincer-Daszkiewicz, Każdy student nosi w kieszeni ... komputer, czyli o Elektronicznej Legitymacji Studenckiej, Delta 2013, s. 20–21.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Jakub Onufry Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Siam Journal On Discrete Mathematics 27 (1) 2013, s. 290–309.zobacz w PBN
• Marcin Łukasz Pilipczuk, Michał Pilipczuk, Piotr Sankowski i Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, s. 353–364.zobacz w PBN
• Marcin Kowalski, Dominik Ślęzak i Piotr Synak, Enhanced Rough SQL for Correlated Subqueries, w: Proceedings of the 2013 Federated Conference on Computer Science and Information Systems (FedCSIS), Polskie Towarzystwo Informatyczne, Warszawa 2013, s. 1455–1462.zobacz w PBN
• Zbigniew Adamczyk i Wojciech Rytter, A note on a simple computation of the maximal suffix of a string, Journal Of Discrete Algorithms 20 (Complete) 2013, s. 61–64.zobacz w PBN
• Jingtao Yao, Andrzej Skowron, Guoyin Wang i Hung Son Nguyen, Preface, Fundamenta Informaticae 126 (4) 2013, s. i–iii.zobacz w PBN
• Michał Startek, Jarosław Paszek, Tomasz Gambin, Krzysztof Walczak, Dariusz Grzebelus i Anna Gambin, TIRfinder: A Web Tool for Mining Class II Transposons Carrying Terminal Inverted Repeats, Evolutionary Bioinformatics 9 2013, s. 17–27.zobacz w PBN
• Agnieszka Podsiadlo, Mariusz Wrzesień, Wiesław Paja, Witold Rudnicki i Bartosz Wilczyński, Active enhancer positions can be accurately predicted from chromatin marks and collective sequence motif data, Bmc Systems Biology 7 (Supplement 6) 2013, s. 1–7.zobacz w PBN
• Marek Adam Cygan, Guy Kortsarz i Zeev Nutov, Steiner Forest Orientation Problems, Siam Journal On Discrete Mathematics 27 (3) 2013, s. 1503–1513.zobacz w PBN
• Marcin Szczuka i Andrzej Piotr Janusz, Semantic Clustering of Scientific Articles Using Explicit Semantic Analysis, Lecture Notes In Computer Science Transactions On Rough Sets 7736 (XVI) 2013, s. 83–102.zobacz w PBN
• Fedor V. Fomin, Stefan Kratsch, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Yngve Villanger, Tight bounds for Parameterized Complexity of Cluster Editing, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, s. 32–43.zobacz w PBN
• Adam Krasuski, Andrzej Jankowski, Andrzej Skowron i Dominik Ślęzak, From Sensory Data to Decision Making: A Perspective on Supporting a Fire Commander, w: Proceedings of the 2013 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 2013.zobacz w PBN
• Paweł Baturo, Marcin Piątkowski i Wojciech Rytter, The Maximal Number of Runs in Standard Sturmian Words, Electronic Journal Of Combinatorics 2013.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Counting and Detecting Small Subgraphs via Equations, Siam Journal On Discrete Mathematics 27 (2) 2013, s. 892–909.zobacz w PBN
• Marcin Ireneusz Mucha, Lyndon Words and Short Superstrings, w: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 2013, s. 958–972.zobacz w PBN
• Claudia Carvalho, Piotr Dittwald, Tomasz Gambin, Claudia Gonzaga-Jauregui, James Lupski, Paweł Stankiewicz i Anna Gambin, Inverted Low-Copy Repeats and Genome Instability, Human Mutation 34 (1) 2013, s. 210–220.zobacz w PBN
• Marcin Konrad Dziubiński i Jaideep Roy, Hotelling-Downs Competition With Free Entry When Voters Have An Option To Contest, Journal Of Public Economic Theory 15 (4) 2013, s. 620–653.zobacz w PBN
• Aleksander Jankowski, Ewa Szczurek, Ralf Jauch, Jerzy Tiuryn i Shyam Prabhakar, Comprehensive prediction in 78 human cell lines reveals rigidity and compactness of transcription factor dimers, Genome Research 23 (8) 2013, s. 1307–1318.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Jakub Onufry Wojtaszczyk, On multiway cut parameterized above lower bounds, Acm Transactions On Computation Theory 5 (1) 2013, s. 3.zobacz w PBN
• Sinh Hoa Nguyen, Tuan Trung Nguyen, Marcin Szczuka i Hung Son Nguyen, An Approach to Pattern Recognition Based on Hierarchical Granular Computing, Fundamenta Informaticae 127 (1-4) 2013, s. 369–384.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk i Michał Pilipczuk, Known algorithms for EDGE CLIQUE COVER are probably optimal, w: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 2013, s. 1044–1053.zobacz w PBN
• Rajeev Goré i Anh Linh Nguyen, ExpTime Tableaux for ALC Using Sound Global Caching, Journal Of Automated Reasoning 50 (4) 2013, s. 355–381.zobacz w PBN
• Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Computing the Longest Previous Factor, European Journal Of Combinatorics 34 (1) 2013, s. 15–26.zobacz w PBN
• Bartłomiej Gajewski, Tomasz Idziaszek, Marcin Kubica i Jakub Jan Radoszewski (red.), XX Olimpiada Informatyczna 2012/2013, Komitet Główny Olimpiady Informatycznej, Warszawa 2013.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, International Journal Of Computer Mathematics 90 (6) 2013, s. 1247–1253.zobacz w PBN
• Marek Grabowski, Jan Hidders i Jacek Sroka, Representing MapReduce Optimisations in the Nested Relational Calculus, w: BNCOD, 2013, s. 175–188.zobacz w PBN
• Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski, Matthias Englert i Anupam Gupta, Catch them if you can: how to serve impatient users, w: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013.zobacz w PBN
• Andrzej Skowron, Mihir Kr. Chakraborty, Victor Marek, Jerzy Grzymała-Busse, Sankar K. Pal, Dominik Ślęzak, James F. Peters, Grzegorz Rozenberg, Roman Słowiński, Shusaku Tsumoto, Alicja Wakulicz-Deja, Guoyin Wang i Wojciech Ziarko, Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence, w: Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, Springer, Berlin 2012, r. 1, s. 1–56.zobacz w PBN
• Marcin Drozd, Michał Bleja, Krzysztof Stencel i Kazimierz Subieta, Optimization of Object-Oriented Queries through Pushing Selections, w: Advances in Databases and Information Systems, Springer, Berlin Heidelberg 2013, s. 57–68.zobacz w PBN
• Anna Gambin, J. Li, R.A. Harris, S.W. Cheung, C. Coarfa, M. Jeong, M.A. Goodell, L.D. White, A. Patel, S. H. Kang, C. Shaw, A.C. Chinault, Tomasz Gambin, J.R. Lupski i A. Milosavlevic, Confounding by Repetitive Elements and CpG Islands Does Not Explain the Association between Hypomethylation and Genomic Instability, Plos Genetics 9 (2) 2013.zobacz w PBN
• Marek Adam Cygan i Marcin Łukasz Pilipczuk, Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree, w: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Part I, 2013, s. 364–375.zobacz w PBN
• Anh Linh Nguyen, Cut-Free ExpTime Tableaux for Converse-PDL Extended with Regular Inclusion Axioms, w: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013, s. 235–244.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski i Wojciech Rytter, Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, s. 245–256.zobacz w PBN
• Talal Rahwan, Tri-Dung Nguyen, Tomasz Michalak, Maria Polukarov, Madalina Croitoru i Nicholas Jennings, Coalitional Games via Network Flows, w: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI, 2013.zobacz w PBN
• Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Lecture Notes In Computer Science 8283 2013, s. 547–557.zobacz w PBN
• Jan Hidders, Paolo Missier, Jacek Sroka i Jan Van den Bussche, Preface, Fundamenta Informaticae 128 (3) 2013.zobacz w PBN
• Marcin Ireneusz Mucha i Maxim Sviridenko, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, w: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Part I, 2013.zobacz w PBN
• Mikołaj Bojańczyk, Nominal Monoids, Theory Of Computing Systems 53 (2) 2013, s. 194–222.zobacz w PBN
• Marcin Kowalski, Dominik Ślęzak i Piotr Synak, Approximate Assistance for Correlated Subqueries, w: Proceedings of the 2013 Federated Conference on Computer Science and Information Systems (FedCSIS), Polskie Towarzystwo Informatyczne, Warszawa 2013, s. 1455–1462.zobacz w PBN
• Hung Son Nguyen i Andrzej Skowron, Rough Sets: From rudiments to challenges, w: Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, Springer, Berlin 2012.zobacz w PBN
• Andreas Bjorklund, Petteri Kaski i Łukasz Kowalik, Probably Optimal Graph Motifs, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013.zobacz w PBN
• Łukasz Kowalik, Marcin Pilipczuk i Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics 161 2013, s. 1154–1161.zobacz w PBN
• Marcin Szczuka, MAGDALENA KACPRZAK i Ludwik Czaja (red.), Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming, Warsaw, Poland, CEUR-WS.org, 2013.zobacz w PBN
• Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen i Hung Son Nguyen, Bisimulation-Based Concept Learning in Description Logics, w: Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming, Warsaw, Poland, CEUR-WS.org, 2013, s. 421–433.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes In Computer Science 8214 2013, s. 84–95.zobacz w PBN
• Simina Branzei, Tomasz Michalak, Talal Rahwan, Kate Larson i Nicholas Jennings, Matchings with Externalities and Attitudes, w: AAMAS'13: 12th International Conference on Autonomous Agents and Multiagent Systems, 2013.zobacz w PBN
• Cezary Bartoszuk, Robert Dąbrowski, Krzysztof Stencel i Grzegorz Timoszuk, On quick comprehension and assessment of software, w: CompSysTech '13, 2013, s. 161–168.zobacz w PBN
• Jacek Sroka, Jan Hidders i Paolo Missier, Report from the second workshop on scalable workflow enactment engines and technology (SWEET'13), Sigmod Record 42 (4) 2013, s. 73–77.zobacz w PBN
• Janina Mincer-Daszkiewicz, Framework for rapid in-house development of web applications for higher education institutions in Poland, w: EUNIS 2013, The 19th International Conference of European University Information Systems, Riga Technical University, Riga, Latvia 2013.zobacz w PBN
• Dominik Ślęzak, Hung Son Nguyen i Marcin Szczuka, Preface, Fundamenta Informaticae 127 (1-4) 2013.zobacz w PBN
• Tomasz Gambin, Paweł Stankiewicz, Maciej Sykulski i Anna Gambin, Functional performance of aCGH design for clinical cytogenetics, Computers In Biology And Medicine 43 2013, s. 775–785.zobacz w PBN
• Kamil Bąk, Adam Krasuski i Marcin Szczuka, Searching for Concepts in Natural Language Part of Fire Service Reports, w: Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming, Warsaw, Poland, CEUR-WS.org, 2013, s. 39–48.zobacz w PBN
• Agata Janowska, Wojciech Penczek, Agata Półrola i Andrzej Zbrzezny, Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets, Lncs Transactions On Petri Nets And Other Models Of Concurrency 8100 2013, s. 89–105.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination, Fundamenta Informaticae 127 (1-4) 2013, s. 135–149.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes In Computer Science 7810 2013, s. 383–394.zobacz w PBN
• Robert Dąbrowski, Grzegorz Timoszuk i Krzysztof Stencel, One Graph to Rule Them All Software Measurement and Management, Fundamenta Informaticae Vol. 128, nr 1-2 2013, s. 67––63.zobacz w PBN
• P. Meyer, G. Siwo, D. Zeevi, E. Sharon, R. Norel, E. Segal, G. Stolovitzky, A. K. Rider, A. Tan, R. S. Pinapati, S. Emrich, N. Chawla, M. T. Ferdig, Y. A. Tung, Y. S. Chen, M. J. Chen, C. Y. Chen, J. M. Knight, S. M. Sahraeian, M. S. Esfahani, R. Dreos, P. Bucher, E. Maier, Y. Saeys, Ewa Szczurek, A. Mysickova, M. Vingron, H. Klein, S. M. Kielbasa, J. Knisley, J. Bonnell, D. Knisley, M. B. Kursa, W. R. Rudnicki, M. Bhattacharjee, M. J. Sillanpaa, J. Yeung, P. Meysman, A. S. Rodriguez, K. Engelen, K. Marchal, Y. Huang, F. Mordelet, A. Hartemink, L. Pinello i G. C. Yuan, Inferring gene expression from ribosomal promoter sequences, a crowdsourcing approach, Genome Research 23 (11) 2013, s. 1928–1937.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Introduction to Perception Based Computing, w: Emerging Paradigms in Machine Learning, Springer, Heidelberg 2013, r. 10, s. 249–275.zobacz w PBN
• Dominik Ślęzak, Hung Son Nguyen i Marcin Szczuka (red.), Logic, Data and Wisdom. To Andrzej Skowron on his 70th birthday., IOS Press, Amsterdam 2013.zobacz w PBN
• Michał Przybyłek, Algebraic pattern recognition, Proceedings Of Spie 9069 2013.zobacz w PBN
• Andrzej Szałas, How an Agent Might Think, Logic Journal Of The Igpl 21 (3) 2013, s. 515–535.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski i Wojciech Rytter, Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Lecture Notes In Computer Science 8125 2013, s. 625–636.zobacz w PBN
• Vladimir Markovets, Robert Dąbrowski, Grzegorz Timoszuk i Krzysztof Stencel, Know Thy Source Code. Is it mostly dead or alive?, Ceur Workshop Proceedings 1036 2013, s. 128–131.zobacz w PBN
• Wen-Chieh Chang, Ande Wehe, Paweł Górecki i Oliver Eulenstein, Exact Solutions for Classical Gene Tree Parsimony Problems, 2013.zobacz w PBN
• André Arnold, Henryk Michalewski i Damian Niwiński, On the Separation Question for Tree Languages, Theory Of Computing Systems 2013, s. 1–23.zobacz w PBN
• Ewa Szczurek, Navodit Misra i Martin Vingron, Synthetic sickness or lethality points at candidate combination therapy targets in glioblastoma, International Journal Of Cancer 2013.zobacz w PBN
• Piotr Dittwald, Tomasz Gambin, P. Szafranski, J. Li, S. Amato, M. Y. Divon, L. X. Rodriguez Rojas, L. E. Elton, D. A. Scott, C. P. Schaaf, W. Torres-Martinez, A. K. Stevens, J. A. Rosenfeld, S. Agadi, D. Francis, S. H. Kang, A. Breman, S. R. Lalani, C. A. Bacino, W. Bi, A. Milosavljevic, A. L. Beaudet, A. Patel, C. A. Shaw, J. R. Lupski, Anna Gambin, S. W. Cheung i Paweł Stankiewicz, NAHR-mediated copy-number variants in a clinical population: mechanistic insights into both genomic disorders and Mendelizing traits, Genome Research 23 (9) 2013, s. 1395–1409.zobacz w PBN
• Davide Ciucci, Masahiro Inuiguchi, Yiyu Yao, Dominik Ślęzak i Guoyin Wang (red.), Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 14th International Conference, RSFDGrC 2013, Halifax, NS, Canada, October 11-14, 2013. Proceedings, Springer, Berlin, Heidelberg 2013.zobacz w PBN
• Piotr Skowron i Krzysztof Rządca, Exploring heterogeneity of unreliable machines for p2p backup, w: HPCS 2013, International Conference on High Performance Computing & Simulation, 2013, s. 91–98.zobacz w PBN
• Ali Rezaei Divroodi i Anh Linh Nguyen, Bisimulation-Based Comparisons for Interpretations in Description Logics, w: Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013, CEUR-WS.org, 2013, s. 652–669.zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Lecture Notes In Computer Science 7922 2013, s. 177–188.zobacz w PBN
• Tomasz Michalak, Karthik Aadithya, Piotr Szczepański, Balaraman Ravindran i Nicholas Jennings, Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality, Journal Of Artificial Intelligence Research 2013.zobacz w PBN
• Cezary Bartoszuk, Grzegorz Timoszuk, Robert Dąbrowski i Krzysztof Stencel, Magnify - a new tool for software visualization, w: Proceedings of the 2013 Federated Conference on Computer Science and Information Systems (FedCSIS), Polskie Towarzystwo Informatyczne, Warszawa 2013.zobacz w PBN
• Paweł Górecki i Oliver Eulentsein, Algorithms for Unrooted Gene Trees with Polytomies, 2013.zobacz w PBN
• Anna Gambin, Agata Charzyńska, Aleksandra Ellert-Miklaszewska i Mikołaj Rybiński, Computational models of the JAK1/2-STAT1 signaling., Jak-stat 2 (3) 2013, s. e24672.zobacz w PBN
• Marcin Konrad Dziubiński i Sanjeev Goyal, Network design and defence, Games And Economic Behavior 79 (1) 2013, s. 30–43.zobacz w PBN
• Xin Liu, Anwitaman Datta i Krzysztof Rządca, Trust beyond reputation: A computational trust model based on stereotypes, Electronic Commerce Research And Applications 12 (1) 2013, s. 24–39.zobacz w PBN
• Jakub Włodzimierz Łącki i Piotr Sankowski, Reachability in graph timelines, w: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013, s. 257–268.zobacz w PBN
• Andrzej Piotr Janusz, Adam Krasuski i Marcin Szczuka, Improving Semantic Clustering of EWID Reports by Using Heterogeneous Data Types, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 14th International Conference, RSFDGrC 2013, Halifax, NS, Canada, October 11-14, 2013. Proceedings, Springer, Berlin, Heidelberg 2013, s. 304–314.zobacz w PBN
• Sebastian Stawicki i Dominik Ślęzak, Recent Advances in Decision Bireducts: Complexity, Heuristics and Streams, w: Rough Sets and Knowledge Technology - 8th International Conference, RSKT 2013, Halifax, NS, Canada, October 11-14, 2013, Proceedings, Springer, Berlin, Heidelberg 2013, s. 200–212.zobacz w PBN
• Piotr Skowron i Krzysztof Rządca, Non-monetary fair scheduling --- a cooperative game theory approach, w: SPAA 2013, 25th ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2013, s. 288–297.zobacz w PBN
• Anh Linh Nguyen i Joanna Golińska-Pilarek, An ExpTime Tableau Method for Dealing with Nominals and Quantified Number Restrictions in Deciding the Description Logic SHOQ, w: Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming, Warsaw, Poland, CEUR-WS.org, 2013, s. 296–308.zobacz w PBN
• Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient seed computation revisited, Theoretical Computer Science 483 (Complete) 2013, s. 171–181.zobacz w PBN
• Paweł Górecki, Oliver Eulenstein i Jerzy Tiuryn, Unrooted Tree Reconciliation: A Unified Approach, Ieee-acm Transactions On Computational Biology And Bioinformatics 10 (2) 2013, s. 522–536.zobacz w PBN
• Janusz Bujnicki i Jerzy Tiuryn, Bioinformatics and computational biology in Poland, Plos Computational Biology 2013.zobacz w PBN
• Adam Krasuski i Andrzej Piotr Janusz, Semantic tagging of heterogeneous data: Labeling Fire&Rescue incidents with threats, w: Proceedings of the 2013 Federated Conference on Computer Science and Information Systems (FedCSIS), Polskie Towarzystwo Informatyczne, Warszawa 2013, s. 77–82.zobacz w PBN
• Michał Łukasik, Tomasz Kuśmierczyk, Łukasz Bolikowski i Hung Son Nguyen, Hierarchical, Multi-label Classification of Scholarly Publications: Modifications of ML-KNN Algorithm, w: Intelligent Tools for Building a Scientific Information Platform - Advanced Architectures and Solutions, Springer-Verlag Berlin Heidelberg, Berlin - Heidelberg - New York - Dordrecht - London 2013, s. 343–363.zobacz w PBN
• Jun Yang, Abhishek Mitra, Norbert Dojer, Shuhua Fu, Maga Rowicka i Allan R. Brasier, A probabilistic approach to learn chromatin architecture and accurate inference of the NF-kappa B/RelA regulatory network using ChIP-Seq, Nucleic Acids Research 41 (15) 2013, s. 7240–7259.zobacz w PBN
• Wojciech Czerwiński, Piotr Hofman i Sławomir Lasota, Reachability problem for weak multi-pushdown automata, Logical Methods In Computer Science 9 (3:13) 2013.zobacz w PBN
• Pawan Lingras, Marcin Wolski, Chris Cornelis, Sushmita Mitra i Piotr Wasilewski (red.), Rough Sets and Knowledge Technology - 8th International Conference, RSKT 2013, Halifax, NS, Canada, October 11-14, 2013, Proceedings, Springer, Berlin, Heidelberg 2013.zobacz w PBN
• Dominik Ślęzak, Piotr Synak, A. Wojna i Jakub Wróblewski, Two Database Related Interpretations of Rough Approximations: Data Organization and Query Execution, Fundamenta Informaticae 127 (1-4) 2013, s. 445––459.zobacz w PBN
• Marcin Kubica, Tomasz Kulczyński, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters 113 (12) 2013, s. 430–433.zobacz w PBN
• Chang Wen-Chien, Paweł Górecki i Oliver Eulenstein, Exact Solutions for Species Tree Inference from Discordant Gene Trees, Journal Of Bioinformatics And Computational Biology 11 (5) 2013, s. 1342005.zobacz w PBN
• Janusz Józef Dutkowski i Jerzy Tiuryn, A probabilistic model of neutral and selective dynamics of protein network evolution, Journal Of Computational Biology 20 (9) 2013, s. 631–642.zobacz w PBN
• Ken-etsu Fujita i Aleksy Andrzej Schubert, Decidable structures between Church-style and Curry-style, Leibniz International Proceedings In Informatics 21 2013, s. 190–205.zobacz w PBN
• Igor Chikalov, Vadim Lozin, Irina Lozina, Andrzej Skowron, Hung Son Nguyen, Mikhail Moshkov i Beata Zielosko, Three Approaches to Data Analysis. Test Theory, Rough Sets and Logical Analysis of Data, Springer, Berlin 2013.zobacz w PBN
• Tomasz Kuśmierczyk, Michał Łukasik, Łukasz Bolikowski i Hung Son Nguyen, Comparing Hierarchical Mathematical Document Clustering against the Mathematics Subject Classification Tree, w: Intelligent Tools for Building a Scientific Information Platform - Advanced Architectures and Solutions, Springer-Verlag Berlin Heidelberg, Berlin - Heidelberg - New York - Dordrecht - London 2013, s. 365–392.zobacz w PBN
• Norbert Dojer, Paweł Bednarz, Agnieszka Podsiadlo i Bartosz Wilczyński, BNFinder2: Faster Bayesian network learning and Bayesian classification, Bioinformatics 29 (16) 2013, s. 2068–2070.zobacz w PBN
• Mikołaj Jakub Rybiński, Zuzanna Szymańska, Sławomir Lasota i Anna Gambin, Modelling the efficacy of hyperthermia treatment, Journal Of The Royal Society Interface 10 (88) 2013, s. 1–10.zobacz w PBN
• Marcin Szczuka, Using Domain Knowledge in Initial Stages of Knowledge Discovery in Databases - Tutorial Description, w: Rough Sets and Knowledge Technology - 8th International Conference, RSKT 2013, Halifax, NS, Canada, October 11-14, 2013, Proceedings, Springer, Berlin, Heidelberg 2013, s. 1–6.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, How to Design a Network of Comparators, w: Brain and Health Informatics, 2013, s. 389–398.zobacz w PBN
• Marcin Peczarski, USB dla niewtajemniczonych w przykładach na mikrokontrolery STM32, Wydawnictwo BTC, Legionowo 2013.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Paraconsistent Distributed Belief Fusion, w: IDC: 6th International Symposium on Intelligent Distributed Computing, 2013, r. 2013, s. 59–69.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński i Tomasz Waleń, A note on efficient computation of all Abelian periods in a string, Information Processing Letters 113 (3) 2013, s. 74–77.zobacz w PBN
• Michał Startek, Arnaud Le Rouzic, Pierre Capy, Dariusz Grzebelus i Anna Gambin, Genomic parasites or symbionts? Modeling the effects of environmental pressure on transposition activity in asexual populations, Theoretical Population Biology 90 (Complete) 2013, s. 145–151.zobacz w PBN
• Michał Paweł Skrzypczak, Topological extension of parity automata, Information And Computation 228 2013, s. 16–27.zobacz w PBN
• Hung Son Nguyen i Gloria Virginia, Lexicon-based Document Representation,, Fundamenta Informaticae 124 (1,2) 2013, s. 27–46.zobacz w PBN
• Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski i Mohit Singh, Set Covering with Our Eyes Closed, Siam Journal On Computing 42 (3) 2013, s. 808–830.zobacz w PBN
• Marcin Konrad Dziubiński, Complexity of logics for multi-agent systems with restricted modal context, Logic Journal Of The Igpl 21 (3) 2013, s. 355–379.zobacz w PBN
• Marcin Konrad Dziubiński, Non-symmetric discrete General Lotto games, International Journal Of Game Theory 42 (4) 2013, s. 801–833.zobacz w PBN
• Piotr Skowron i Krzysztof Rządca, Network delay-aware load balancing in selfish and cooperative distributed systems, w: 2013 27th IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2013.zobacz w PBN
• Nicola Crosetto, Abhishek Mitra, Maria Joao Silva, Magda Bienko, Norbert Dojer, Qi Wang, Elif Karaca, Roberto Chiarle, Magdalena Olga Skrzypczak, Krzysztof Flawiusz Ginalski, Philippe Pasero, Maga Rowicka i Ivan Dikic, Nucleotide-resolution DNA double-strand break mapping by next-generation sequencing, Nature Methods 10 (4) 2013, s. 361–365.zobacz w PBN
• Piotr Hofman, Sławomir Lasota, Richard Mayr i Patrick Totzke, Simulation Over One-counter Nets is PSPACE-Complete, w: Proc. FSTTCS'13, 2013.zobacz w PBN
• Marcin Szczuka i Dominik Ślęzak, How Deep Data Becomes Big Data, w: Proceedings of Joint IFSA World Congress and NAFIPS Annual Meeting 2013, IEEE, Piscataway, NJ, USA 2013, s. 579–584.zobacz w PBN
• Sebastian Widz i Dominik Ślęzak, Granular Attribute Selection: A Case Study of Rough Set Approach to MRI Segmentation, w: Pattern Recognition and Machine Intelligence, 2013, s. 47–52.zobacz w PBN
• Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the maximum number of cubic subwords in a word, European Journal Of Combinatorics 34 (1) 2013, s. 27–37.zobacz w PBN
• Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof i Paweł Urzyczyn, Using Inhabitation in Bounded Combinatory Logic with Intersection Typesfor Composition Synthesis, Electronic Proceedings In Theoretical Computer Science 121 2013, s. 18–34.zobacz w PBN
• Patryk Czarnik, Jacek Ludwik Chrząszcz i Aleksy Andrzej Schubert, CoJaq: a hierarchical view on the Java bytecode formalised in Coq, w: Advances in Software Development, 2013, r. 11, s. 147–157.zobacz w PBN
• Barbara Dunin-Keplicz i Alina Strachocka, Perceiving Rules under Incomplete and Inconsistent Information, w: Computational Logic in Multi-Agent Systems - 14th International Workshop, CLIMA XIV, Corunna, Spain, September 16-18, 2013. Proceedings, 2013, s. 256–272.zobacz w PBN
• Marcin Bilkowski, Michał Skrzypczak i Simona Ronchi Della Rocca, Unambiguity and uniformization problems on infinite trees, w: Computer Science Logic 2013 (CSL 2013), 2013, s. 81–100.zobacz w PBN
• Tomasz Puton, Łukasz Paweł KOZŁOWSKI, Kristian M. Rother i Janusz Bujnicki, CompaRNA: a server for continuous benchmarking of automated methods for RNA secondary structure prediction, Nucleic Acids Research 41 (7) 2013, s. 4307–23.zobacz w PBN
• Hung Son Nguyen, Tolerance Rough Set Model and Its Applications in Web Intelligence, w: 2013 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology, Atlanta, Georgia, USA, 17-20 November 2013, Workshop Proceedings, 2013, s. 237–244.zobacz w PBN
• Michał Jastrzębski i Stefan Dziembowski, International Conference on Information Theoretic Security (ICITS 2013), 2013.zobacz w PBN
• Anuj Dawar, Eryk Kopczyński, Bjarki Holm, Erich Graedel i Wied Pakusa, Definability of linear equation systems over groups and rings, Logical Methods In Computer Science 9 (4) 2013, s. 12.zobacz w PBN

2012

• Henryk Michalewski i Damian Niwiński, On Topological Completeness of Regular Tree Languages, Lecture Notes In Computer Science 2012, s. 165–179.zobacz w PBN
• Marcin Szczuka, Paweł Betliński i Kamil Herba, Named entity matching in publication databases, w: Rough Sets and Current Trends in Computing. 8th International Conference, RSCTC 2012, Chengdu, China, August 17-20, 2012. Proceedings, Springer, Berlin 2012.zobacz w PBN
• Marek Cygan, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings, w: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.zobacz w PBN
• Andrzej Piotr Janusz, Combining multiple predictive models using genetic algorithms, Intelligent Data Analysis 16 (5) 2012, s. 763–776.zobacz w PBN
• Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk i Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, w: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012, s. 581–593.zobacz w PBN
• Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai i Venkatesh Raman, Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs, w: Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Springer, 2012, s. 364–375.zobacz w PBN
• Stefan Bonn, Robert P Zinzen, Charles Girardot, E Hilary Gustafson, Alexis Perez-Gonzalez, Nicolas Delhomme, Yad Ghavi-Helm, Bartek Wilczynski, Andrew Riddell i Eileen E M Furlong, Tissue-specific analysis of chromatin state identifies temporal signatures of enhancer activity during embryonic development, Nature Genetics 44 (2) 2012, s. 148–156.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Place, Toward Model Theory with Data Values, w: ICALP (2), 2012.zobacz w PBN
• Krzysztof Stencel, Obiektowe i półstrukturalne bazy danych, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 2012.zobacz w PBN
• Michał Feldman, Amos Fiat, Stefano Leonardi i Piotr Sankowski, Revenue maximizing envy-free multi-unit auctions with budgets, w: ACM Conference on Electronic Commerce, 2012.zobacz w PBN
• M. Bukała, Piotr Sankowski, R. Buczko i P. Kacman, Structural and electronic properties of Pb$_1$-$x$Cd$_x$Te and Pb$_1$-$x$Mn$_x$Te ternary alloys, Physical Review B 86 2012, s. 085205.zobacz w PBN
• Albana Gaba, Spyros Voulgaris, Konrad Iwanicki i Maarten van Steen, Revisiting Gossip-based Ad-Hoc Routing, w: 21st IEEE International Conference on Computer Communications and Networks (ICCCN), IEEE, 2012.zobacz w PBN
• Tomasz Puton, Łukasz Paweł KOZŁOWSKI, Irina Tuszynska, Kristian Rother i Janusz M. Bujnicki, Computational methods for prediction of protein–RNA interactions, Journal Of Structural Biology 179 (3) 2012, s. 261–268.zobacz w PBN
• Dominik Ślęzak, Piotr Synak, Jakub Wróblewski, Janusz Borkowski i Graham Toppin, Rough optimizations of complex expressions in Infobright's RDBMS, w: Rough Sets and Current Trends in Computing. 8th International Conference, RSCTC 2012, Chengdu, China, August 17-20, 2012. Proceedings, Springer, Berlin 2012.zobacz w PBN
• Mikołaj Bojańczyk, Algorithms for regular languages that use algebra, Siam Journal On Computing 41 (2) 2012, s. 5–14.zobacz w PBN
• Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen, Hung Son Nguyen i Andrzej Szałas, Concept learning for description logic-based information systems, w: KSE 2012 - International Conference on Knowledge and Systems Engineering, Institute of Electrical and Electronics Engineers, USA 2012.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, Foundations of Algebraic Specification and Formal Software Development, Springer, Berlin 2012.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Discrete Applied Mathematics 160 (15) 2012, s. 2131–2141.zobacz w PBN
• Dominik Ślęzak, Krzysztof Stencel i Hung Son Nguyen, (No)SQL platform for scalable semantic processing of fast growing document repositories, Ercim News 90 2012, s. 50–51.zobacz w PBN
• Andrzej Janusz i Dominik Ślęzak, Utilization of attribute Clustering methods for scalable computation of reducts from high-dimensional data, Computer Science And Information Systems 2012, s. 295–302.zobacz w PBN
• Mikołaj Bojańczyk, Laurent Braud, Bartosz Klin i Sławomir Lasota, Towards nominal computation, w: POPL, 2012.zobacz w PBN
• Ali Rezaei Divroodi, Quang-Thuy Ha, Anh Linh Nguyen i Hung Son Nguyen, On C-learnability in description logics, w: Computational Collective Intelligence - Technologies and Applications, Springer, Berlin 2012.zobacz w PBN
• Andrzej Skowron, Andrzej Jankowski i Piotr Wasilewski, Risk management and interactive computational systems, Journal Of Advanced Mathematics And Applications 1 2012, s. 61–73.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Logic-Based Roughification, w: Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, Volume 1, Springer, 2012, s. 517–543.zobacz w PBN
• Krzysztof Diks, Tomasz Idziaszek, Jakub Włodzimierz Łącki i Jakub Jan Radoszewski (red.), W poszukiwaniu wyzwań. Wybór zadań z konkursów programistycznych Uniwersytetu Warszawskiego, Uniwersytet Warszawski, Warszawa 2012.zobacz w PBN
• Łukasz Paweł KOZŁOWSKI i Janusz Bujnicki, MetaDisorder: a meta-server for the prediction of intrinsic disorder in proteins, Bmc Bioinformatics 13 2012, s. 111.zobacz w PBN
• Sandro Brusco, Marcin Konrad Dziubiński i Jaideep Roy, The Hotelling-Downs model with runoff voting, Games And Economic Behavior 74 (2) 2012, s. 447–469.zobacz w PBN
• Dominik Ślęzak, Rough sets and FCA - scalability challenges, w: Formal Concept Analysis, Springer, Berlin 2012.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Algorithms: Simultaneous Error-Correction and Rooting for Gene Tree Reconciliation and the Gene Duplication Problem, Bmc Bioinformatics 13 (Suppl 10) 2012.zobacz w PBN
• Vince Bárány, Mikołaj Bojańczyk, Diego Figueira i Paweł Parys, Decidable Classes of Documents for XPath, w: FSTTCS, LIPICS, Dagstuhl 2012.zobacz w PBN
• Mikołaj Bojańczyk i Sławomir Lasota, Fraenkel-Mostowski Sets with Non-homogeneous Atoms, w: RP, 2012.zobacz w PBN
• Szymon Toruńczyk, Languages of Profinite Words and the Limitedness Problem, w: ICALP (2), 2012.zobacz w PBN
• Paweł Parys i Igor Walukiewicz, Weak Alternating Timed Automata, Logical Methods In Computer Science 8 (3) 2012.zobacz w PBN
• Dominik Ślęzak i Paweł Betliński, A Role of (Not) Crisp Discernibility in Rough Set Approach to Numeric Feature Selection, Communications In Computer And Information Science 2012.zobacz w PBN
• Marcin Mucha, 13/9-approximation for Graphic TSP, w: STACS, 2012.zobacz w PBN
• Hung Son Nguyen i Long Giang Nguyen, On elimination of redundant attributes from decision table, Computer Science And Information Systems 2012, s. 317–322.zobacz w PBN
• Piotr Wiśniewski i Krzysztof Stencel, Universal Query Language, w: CS&P, 2012.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk i Michał Pilipczuk, On Group Feedback Vertex Set Parameterized by the Size of the Cutset, w: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Springer, 2012, s. 194–205.zobacz w PBN
• Hung Son Nguyen i Wojciech Swieboda, Rough set methods for large and spare data in EAV format, w: 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, Vision for the Future (RIVF), IEEE, Taiwan 2012.zobacz w PBN
• Mikołaj Bojańczyk, Eryk Kopczyński i Szymon Toruńczyk, Ramsey’s theorem for colors from a metric space, Semigroup Forum 85 (1) 2012, s. 182–184.zobacz w PBN
• Anh Linh Nguyen i Hung Son Nguyen, On designing the SONCA system, Artificial Intelligence 2012, s. 9–36.zobacz w PBN
• P. Wiśniewski, M. Burzańska i K. Stencel, The Impedance Mismatch in Light of the Unified State Model, Fundamenta Informaticae Vol. 120, nr 3/4 2012, s. 359–374.zobacz w PBN
• Marcin Szczuka i Andrzej Janusz, Semantic clustering of scientific articles using explicit semantic analysis, w: Transactions on Rough Sets XVI, Springer, Berlin 2012.zobacz w PBN
• Gloria Virginia i Hung Son Nguyen, An algorithm for tolerance value generator in tolerance rough sets model, w: Advances in Knowledge-Based and Intelligent Information and Engineering Systems, IOS Press, North Holland 2012.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms, Lecture Notes In Computer Science 7434 2012, s. 531–542.zobacz w PBN
• Anna Gambin, J. Li, R.A. Harris, S.W. Cheung, C. Coarfa, R.A. Lupski, M. Jeong, L. D. White, M.A. Goodell, S. H. Kang, C. Shaw, A. Patel, T. Gambin, A.C. Chinault i A. Milosavljevic, Genomic hypomethylation in the human germline associates with selective structural mutability in the human genome, Plos Genetics 8 (5) 2012.zobacz w PBN
• Stefan Dziembowski i Sebastian Faust, Leakage-Resilient Circuits without Computational Assumptions, w: TCC, 2012.zobacz w PBN
• Paweł Parys, Variants of Collapsible Pushdown Systems, w: CSL, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011, s. 500–515.zobacz w PBN
• Łukasz Kowalik i Marcin Ireneusz Mucha, A 9k Kernel for Nonseparating Independent Set in Planar Graphs, w: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Springer, 2012.zobacz w PBN
• Dominik Ślęzak i Paweł Betliński, A role of (not) crisp discernibility in rough set approach to numeric feature selection, Computer Science 2012, s. 13–23.zobacz w PBN
• Paweł Leszczyński i Krzysztof Stencel, Update Propagator for Joint Scalable Storage, Fundamenta Informaticae 119 (3-4) 2012, s. 337–355.zobacz w PBN
• Andre Arnold, Henryk Michalewski i Damian Niwiński, On the separation question for tree languages, w: Symposium on Theoretical Aspects of Computer Science (STACS), Dagstuhl Publishing, Paris 2012.zobacz w PBN
• Hung Son Nguyen i Wojciech Swieboda, Rough set methods, submodular functions, w: Proceedings of the 21th International Workshop on Concurrency, Specification and Programming, Humboldt Universitaet zu Berlin, Berlin 2012.zobacz w PBN
• S. Nakagome, S. Mano, Łukasz Paweł KOZŁOWSKI, J. M. Bujnicki, H. Shibata, Y. Fukumaki, J. R. Kidd, K. K. Kidd, S. Kawamura i H. Oota, Crohn's disease risk alleles on the NOD2 locus have been maintained by natural selection on standing variation, Molecular Biology And Evolution 29 (6) 2012, s. 1569–85.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Sitting Closer to Friends Than Enemies, Revisited, w: Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Springer, Berlin 2012, s. 296–307.zobacz w PBN
• Michał Woźniak, Jerzy Tiuryn i Limsoon Wong, An approach to identifying drug resistance associated mutations in bacterial strains, Bmc Genomics 13 (Suppl. 7):S2 2012.zobacz w PBN
• Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczyński i Wied Pakusa, Definability of linear equation systems over groups and rings, w: CSL, 2012.zobacz w PBN
• Adam Krasuski, Dominik Ślęzak, Karol Kreński i Stanisław Łazowy, Granular Knowledge Discovery Framework, w: New Trends in Databases and Information Systems, Springer, 2012, s. 109–118.zobacz w PBN
• Paweł Parys, On the Significance of the Collapse Operation, w: LICS, 2008, s. 521–530.zobacz w PBN
• Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen, Hung Son Nguyen, Andrzej Szałas i Thanh-Luong Tran, A bisimulation-based method of concept learning for knowledge bases in description logics, w: SoICT 2012 - Proceedings of the Third International Symposium on Information and Communication Technology, Association of Computing Machinery, Vietnam 2012.zobacz w PBN
• Patrick Doherty, Jonas Kvarnström i Andrzej Szałas, Temporal Composite Actions with Constraints, w: KR: International Conference on the Principles of Knowledge Representation and Reasoning, AAAI Press, 2012.zobacz w PBN
• Agata Janowska, Wojciech Penczek, Agata Pólrola i Andrzej Zbrzezny, Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets, w: International Workshop on Petri Nets and Software Engineering, Hamburg, Germany, 2012.zobacz w PBN
• Jakub Radoszewski i Wojciech Rytter, On the structure of compacted subword graphs of Thue-Morse words and their applications, Journal Of Discrete Algorithms 11 2012, s. 15–24.zobacz w PBN
• Tian-rui Li, Guoyin Wang, Hung Son Nguyen, Ryszard Janicki i Jerzy W. Grzymala-Busse (red.), Rough Sets, Knowledge Technology - 7th International Conference, RSKT 2012, Springer, Berlin 2012.zobacz w PBN
• Agata Charzyńska, Anna Nałęcz, Mikołaj Jakub Rybiński i Anna Gambin, Sensitivity analysis of mathematical models of signaling pathways, Biotechnologia 93 (3) 2012, s. 291–308.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Journal Of Computer And System Sciences 78 (6) 2012, s. 1828–1836.zobacz w PBN
• M. Al-Haggar, A. Madej-Pilarczyk, Łukasz Kozłowski, Janusz Bujnicki, S. Yahia, D. Abdel-Hadi, A. Shams, N. Ahmad, S. Hamed i Monika Puzianowska-kuźnicka, A novel homozygous p.Arg527Leu LMNA mutation in two unrelated Egyptian families causes overlapping mandibuloacral dysplasia and progeria syndrome, European Journal Of Human Genetics 20 (11) 2012, s. 1134–40.zobacz w PBN
• A. Charzynska, A. Nalecz, M. Rybinski i A. Gambin, Sensitivity analysis of mathematical models of signalling pathways, Biotechnologia 93 2012, s. Array.zobacz w PBN
• Paweł Betliński i Dominik Ślęzak, The problem of finding the sparsest Bayesian network for an input data set is NP-hard, w: Foundations of Intelligent Systems, Springer, Berlin 2012.zobacz w PBN
• Mikołaj Bojańczyk i Sławomir Lasota, An extension of data automata that captures XPath, Logical Methods In Computer Science 8 (1) 2012.zobacz w PBN
• Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk i Michał Pilipczuk, Designing FPT Algorithms for Cut Problems Using Randomized Contractions, w: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012, s. 460–469.zobacz w PBN
• Paweł Górecki, Gordon J. Burleigh i Oliver Eulenstein, GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches, Lecture Notes In Computer Science 7292 2012, s. 102–114.zobacz w PBN
• Marcin Peczarski, Towards optimal sorting of 16 elements, Acta Universitatis Sapientiae, Informatica 4 (2) 2012, s. 215––224.zobacz w PBN
• Alexander Kartzow i Paweł Parys, Strictness of the Collapsible Pushdown Hierarchy, w: MFCS, 2010, s. 566–577.zobacz w PBN
• Konrad Iwanicki i Maarten van Steen, A case for hierarchical routing in low-power wireless embedded networks, Acm Transactions On Sensor Networks 8 (3) 2012, s. 25.zobacz w PBN
• Jacek Ludwik Chrząszcz, Patryk Czarnik, Aleksy Andrzej Schubert i Andrzej Tarlecki, Testing of Evolving Protocols, w: ICST, 2012, s. 901–906.zobacz w PBN
• Anna Gambin i Anna Marciniak-Czochra (red.), Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics, IOS PRESS, NIEUWE HEMWEG 6B, AMSTERDAM, NETHERLANDS, 1013 BG 2012.zobacz w PBN
• Adam Bouland, Anuj Dawar i Eryk Kopczyński, On Tractable Parameterizations of Graph Isomorphism, w: 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), Springer, 2012.zobacz w PBN
• Georg Peters, Pawan Lingras, Dominik Ślęzak i Yiyu Yao (red.), Rough sets: Selected methods and applications in management and engineering, Springer, Berlin 2012.zobacz w PBN
• Janina Mincer-Daszkiewicz, Núria Cuni i Joan Ferrer, Incorporating services of the Mobility Network into the SIGMA Student Information System - from idea to action, w: EUNIS 2012, The 18th International Conference of European University Information Systems, Universidade de Tras-os-Montes e Alto Douro, Alto Douro. Portugalia 2012, s. 117–118(extendedabstract).zobacz w PBN
• Dominik Ślęzak, Piotr Synak, Janusz Borkowski, Jakub Wróblewski i Graham Toppin, A Rough-Columnar RDBMS Engine - A Case Study of Correlated Subqueries, Ieee Transactions On Knowledge And Data Engineering 35 (1) 2012, s. 34–39.zobacz w PBN
• Tomasz Idziaszek, Marcin Kubica i Jakub Jan Radoszewski (red.), XIX Olimpiada Informatyczna 2011/2012, Komitet Główny Olimpiady Informatycznej, Warszawa 2012.zobacz w PBN
• Adam Krasuski, Hung Son Nguyen, Wojciech Świeboda i Andrzej Janusz, Rough Sets and Current Trends in Computing, w: Rough Sets and Current Trends in Computing. 8th International Conference, RSCTC 2012, Chengdu, China, August 17-20, 2012. Proceedings, Springer, Berlin 2012.zobacz w PBN
• You Sik Hong, Geuk Lee, Dominik Ślęzak i Daniel Howard (red.), Convergence and Hybrid Information Technology, 6th International Conference, ICHIT 2012, Daejeon, Korea, August 23-25, 2012. Proceedings, Springer, Berlin 2012.zobacz w PBN
• Adam Krasuski, Hung Son Nguyen, Wojciech Świeboda i Andrzej Janusz, Interactive document indexing method based on explicit semantic analysis, w: Rough Sets and Current Trends in Computing. 8th International Conference, RSCTC 2012, Chengdu, China, August 17-20, 2012. Proceedings, Springer, Berlin 2012.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion, Algorithmica 64 (1) 2012, s. 170–188.zobacz w PBN
• Marek Cygan, Deterministic Parameterized Connected Vertex Cover, w: Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Springer, 2012.zobacz w PBN
• Paweł Parys, Higher-Order Pushdown Systems With Data, w: GandALF, 2012.zobacz w PBN
• Dimitrios Floudas, Manfred Binder, Robert Riley, Kerrie Barry, Robert A. Blanchette, Bernard Henrissat, Angel T. Martínez, Robert Otillar, Joseph W. Spatafora, Jagjit S. Yadav, Andrea Aerts, Isabelle Benoit, Alex Boyd, Alexis Carlson, Alex Copeland, Pedro M. Coutinho, Ronald P. de Vries, Patricia Ferreira, Keisha Findley, Brian Foster, Jill Gaskell, Dylan Glotzer, Paweł Górecki, Joseph Heitman, Cedar Hesse, Chiaki Hori, Kiyohiko Igarashi, Joel A. Jurgens, Nathan Kallen, Phil Kersten, Annegret Kohler, Ursula Kües, T. K. Arun Kumar, Alan Kuo, Kurt LaButti, Luis F. Larrondo, Erika Lindquist, Albee Ling, Vincent Lombard, Susan Lucas, Taina Lundell, Rachael Martin, David J. McLaughlin, Ingo Morgenstern, Emanuelle Morin, Claude Murat, Laszlo G. Nagy, Matt Nolan, Robin A. Ohm, Aleksandrina Patyshakuliyeva, Antonis Rokas, Francisco J. Ruiz-Dueñas, Grzegorz Sabat, Asaf Salamov, Masahiro Samejima, Jeremy Schmutz, Jason C. Slot, Franz St. John, Jan Stenlid, Hui Sun, Sheng Sun, Khajamohiddin Syed, Adrian Tsang, Ad Wiebenga, Darcy Young, Antonio Pisabarro, Daniel C. Eastwood, Francis Martin, Dan Cullen, Igor V. Grigoriev i David S. Hibbett, The Paleozoic Origin of Enzymatic Lignin Decomposition Reconstructed from 31 Fungal Genomes, Science 336 (6089) 2012, s. 1715–1719.zobacz w PBN
• Ewa Madalińska-Bugaj i Anh Linh Nguyen, A Generalized QSQR Evaluation Method for Horn Knowledge Bases, Acm Transactions On Computational Logic 13 (4) 2012, s. 1–37.zobacz w PBN
• Thierry Coquand, Anuj Dawar i Damian Niwiński, The Ackermann Award 2012, w: CSL, 2012.zobacz w PBN
• Mikołaj Bojańczyk i Szymon Toruńczyk, Weak MSO+U over infinite trees, w: STACS, 2012.zobacz w PBN
• Robert Dąbrowski, Krzysztof Stencel i Grzegorz Timoszuk, One Graph to Rule Them All - Software Measurment and Management, w: CS&P, 2012.zobacz w PBN
• Dominik Ślęzak, Piotr Synak, Graham Toppin, Jakub Wróblewski i Janusz Borkowski, Rough SQL - semantics and execution, w: Advances on Computational Intelligence, Springer, Berlin 2012.zobacz w PBN
• Szczepan Hummel i Michał Skrzypczak, Topological Complexity of MSO+U and Related Automata Models, Lecture Notes In Computer Science 2012.zobacz w PBN
• Marek Cygan, Jian-Feng Hou, Łukasz Kowalik, Borut Luzar i Jian-Liang Wu, A Planar linear arboricity conjecture, Journal Of Graph Theory 69 (4) 2012, s. 403–425.zobacz w PBN
• Yiyu Yao i Dominik Ślęzak, An Introduction to Rough Sets, w: Rough Sets: Selected Methods and Applications in Management and Engineering, Springer, Berlin 2012.zobacz w PBN
• Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi i Dániel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, w: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012.zobacz w PBN
• Mikołaj Bojańczyk i Szymon Toruńczyk, Imperative Programming in Sets with Atoms, w: FSTTCS, LIPICS, Dagstuhl 2012.zobacz w PBN
• Bartosz Wilczyński, Ya-Hsin Liu, Zhen-Xuan Yeo i Eileen EM Furlong, Predicting Spatial and Temporal Gene Expression Using an Integrative Model of Transcription Factor Occupancy and Chromatin State, Plos Computational Biology 8 (12) 2012, s. e1002798.zobacz w PBN
• Andrzej Piotr Janusz, Dominik Ślęzak i Hung Son Nguyen, Unsupervised Similarity Learning from Textual Data, Fundamenta Informaticae 119 (3) 2012.zobacz w PBN
• Talal Rahwan, Tomasz Michalak i Nicholas R. Jennings, A Hybrid Algorithm for Coalition Structure Generation., w: AAAI, 2012.zobacz w PBN
• Jakob Rehof i Paweł Urzyczyn, The Complexity of Inhabitation with Explicit Intersection, w: Logic and Program Semantics, Springer, Berlin 2012.zobacz w PBN
• Mikołaj Bojańczyk, Howard Straubing i Igor Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, Logical Methods In Computer Science 8 (3) 2012, s. 1–39.zobacz w PBN
• Jakub Łącki, Yahav Nussbaum, Piotr Sankowski i Christian Wulff-Nilsen, Single Source - All Sinks Max Flows in Planar Digraphs, w: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.zobacz w PBN
• Georg Peters, Lingars Pawan, Dominik Ślęzak i Yiyo Yao (red.), Advanced Information and Knowledge Processing, Springer London, Londyn 2012.zobacz w PBN
• Anh Linh Nguyen i Hung Son Nguyen, On designing the SONCA system, w: Semantic Recognition of Digital Documents. In: Intelligent Tools for Building a Scientific Information Platform, Studies in Computational Intelligence, Berlin 2012.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More), Siam Journal On Computing 41 (4) 2012, s. 815–828.zobacz w PBN
• Talal Rahwan, Tomasz Michalak, Michael Wooldridge i Nicholas R. Jennings, Anytime coalition structure generation in multi-agent systems with positive or negative externalities., Artificial Intelligence 186 2012, s. 95–122.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient algorithms for three variants of the LPF table, Journal Of Discrete Algorithms 11 2012, s. 51–61.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler i Tomasz Waleń, Improved algorithms for the range next value problem and applications, Theoretical Computer Science 434 2012, s. 23–34.zobacz w PBN
• Mikołaj Bojańczyk, Laurent Braud, Bartek Klin i Sławomir Lasota, Towards nominal computation, Acm Sigplan Notices 47 (1) 2012, s. 401–412.zobacz w PBN
• Jan Hidders, Jacek Sroka i Paolo Missier, Report from the first workshop on scalable workflow enactment engines and technology (SWEET'12), Sigmod Record 41 (4) 2012, s. 60–64.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge, A Logical View on Teamwork, w: Games, Actions and Social Software, Springer-Verlag, 2012.zobacz w PBN
• Piotr Wiśniewski, Marta Burzańska i Krzysztof Stencel, The Impedance Mismatch in Light of the Unified State Model, Fundamenta Informaticae 120 (3-4) 2012, s. 359–374.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Paraconsistent Reasoning for Semantic Web Agents, Lncs Transactions On Computational Collective Intelligence 7190 2012, s. 36–55.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n, w: LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Springer, Berlin 2012, s. 195–206.zobacz w PBN
• Katarzyna Derwińska, Magdalena Bartnik, Barbara Wiśniowiecka-Kowalnik, M. Jagła, A. Rudziński, Jacek Pietrzyk, Wanda Kawalec, L. Ziółkowska, Anna Dorota Kutkowska-Kaźmierczak, Anna Gambin, Tomasz Gambin, Maciej Sykulski, Tadeusz Mazurczak, Ewa Obersztyn, Ewa Bocian i Paweł Stankiewicz, Assessment of the role of copy-number variants in 150 patients with congenital heart defects, Developmental Period Medicine 16 (3) 2012, s. 175–182.zobacz w PBN
• Sebastian Widz i Dominik Ślęzak, Rough set based decision support - Models easy to interpret, w: Rough Sets: Selected Methods and Applications in Management and Engineering, Springer, Berlin 2012.zobacz w PBN
• Paweł Parys, A Pumping Lemma for Pushdown Graphs of Any Level, w: STACS, 2012.zobacz w PBN
• Anna Gambin, Magdalena Bartnik, Elżbieta Szczepanik, Katarzyna Derwińska, Barbara Wiśniowiecka-Kowalnik, T. Gambin, Maciej Sykulski, K. Ziemkiewicz, Paweł Stankiewicz, Ewa Obersztyn, Ewa Bocian, Tadeusz Mazurczak, Hanna Mierzejewska, C.A. Shaw, M. Sobirajewicz, Iwona Terczyńska, Marta Kędzior, Monika Gos, Dorota Hoffman-Zacharska, A. Jeziorek, Dorota Antczak-Marach, M. Rudzka-Dybała, H. Mazurkiewicz, A. Goszczańska-Ciuchta i T. Zalewska-Miszkurka, Application of array comparative genomic hybridization in 102 patients with epilepsy and additional neurodevelopmental disorders, American Journal Of Medical Genetics Part B-neuropsychiatric Genetics 159B (6) 2012.zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Data Structures for the Factor Periodicity Problem, w: SPIRE, 2012.zobacz w PBN
• Robert Dąbrowski, Krzysztof Stencel i Grzegorz Timoszuk, Improving software quality by improving architecture management, w: CompSysTech, 2012.zobacz w PBN
• Wojciech Czerwiński i Sławomir Lasota, Partially-commutative context-free languages, Electronic Proceedings In Theoretical Computer Science 89 2012, s. 35–48.zobacz w PBN
• Mikołaj Bojańczyk i Sławomir Lasota, A Machine-Independent Characterization of Timed Languages, w: ICALP (2), 2012.zobacz w PBN
• Michał Chromiak i Krzysztof Stencel, The Linkup Data Structure for Heterogeneous Data Integration Platform, w: FGIT, 2012.zobacz w PBN
• Łukasz Kowalik, Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging, w: 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), Springer, 2012, s. 61–72.zobacz w PBN
• Wojciech Czerwiński i Sławomir Lasota, Partially-commutative context-free languages, w: DCM, 2012.zobacz w PBN
• Marcin Pilipczuk, Michał Pilipczuk i Riste Skrekovski, Some results on Vizing's conjecture and related problems, Discrete Applied Mathematics 160 (16-17) 2012, s. 2484–2490.zobacz w PBN
• Janina Mincer-Daszkiewicz, USOS API — how to open universities to Web 2.0 community by data sharing, w: EUNIS 2012, The 18th International Conference of European University Information Systems, Universidade de Tras-os-Montes e Alto Douro, Alto Douro. Portugalia 2012, s. 43–52.zobacz w PBN
• Przemysław Biecek, Ewa Szczurek, Martin Vingron i Jerzy Tiuryn, The R Package bgmm: Mixture Modeling with Uncertain Knowledge, Journal Of Statistical Software 47 (3) 2012, s. 1–31.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees, Lecture Notes In Computer Science 7292 2012, s. 115–126.zobacz w PBN
• Barbara Wiśniowiecka-Kowalnik, Monika Kastory-Bronowska, Magdalena Bartnik, Katarzyna Derwińska, Wanda Dymczak-Domini, Dorota Szumbarska, Ewa Ziemka, Krzysztof Szczałuba, Maciej Sykulski, Tomasz Gambin, Anna Gambin, Chad Shaw, Tadeusz Mazurczak, Ewa Obersztyn, Ewa Bocian i Paweł Stankiewicz, Application of custom-designed oligonucleotide array CGH in 145 patients with autistic spectrum disorders, European Journal Of Human Genetics 1 (6) 2012, s. 620–625.zobacz w PBN
• Hung Son Nguyen, Sinh Hoa Nguyen, Grzegorz Jaśkiewicz i Wojciech Świeboda, Enhancing search result clustering with semantic indexing, w: SoICT '12: Proceedings of the Third Symposium on Information and Communication Technology, Association of Computing Machinery, Vietnam 2012.zobacz w PBN
• Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?, w: COCOON, 2012.zobacz w PBN
• Mikołaj Bojańczyk i Sławomir Lasota, A machine-independent characterization of timed languages, Lecture Notes In Computer Science 7392 2012, s. 92–103.zobacz w PBN
• Andrzej Piotr Janusz i Dominik Ślęzak, Utilization of Attribute Clustering Methods for Scalable Computation of Reducts from High-Dimensional Data, w: Federated Conference on Computer Science and Information Systems - FedCSIS 2012, Wrocław, Poland, 9-12 September 2012, Proceedings, 2012, s. 295–302.zobacz w PBN
• Piotr L. Szczepanski, Tomasz Michalak i Talal Rahwan, A new approach to betweenness centrality based on the Shapley Value., w: AAMAS, 2012.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, The maximal number of cubic runs in a word, Journal Of Computer And System Sciences 78 (6) 2012, s. 1828–1836.zobacz w PBN
• Krzysztof Diks, Tomasz Idziaszek, Jakub Łącki i Jakub Jan Radoszewski (red.), Looking for a Challenge? The Ultimate Problem Set from the University of Warsaw Programming Competitions, Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego, Warszawa 2012.zobacz w PBN
• Mikołaj Bojańczyk, Luc Segoufin i Howard Straubing, Piecewise testable tree languages, Logical Methods In Computer Science 8 (3) 2012.zobacz w PBN
• Marek Kosma Grzegorowski, Przemysław Pardel, Sebastian Stawicki i Krzysztof Stencel, SONCA: Scalable Semantic Processing of Rapidly Growing Document Stores, w: New Trends in Databases and Information Systems, Springer, 2012.zobacz w PBN
• Michał Startek, Sławomir Lasota, Maciej Sykulski, A. Bułak, L. Noé, G. Kucherov i Anna Gambin, Efficient alternatives to PSI-BLAST, Bulletin Of The Polish Academy Of Sciences-technical Sciences Vol. 60, nr 3 2012, s. 495–505.zobacz w PBN
• Son Thanh Cao i Anh Linh Nguyen, Query-Subquery Nets, Lecture Notes In Computer Science 7653 (1) 2012, s. 239–248.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, A rough set approach to knowledge discovery by relation approximation, w: Advances in Computational Intelligence, Springer, Berlin 2012.zobacz w PBN
• Marcin Piatkowski i Wojciech Rytter, Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words, International Journal Of Foundations Of Computer Science 23 (2) 2012, s. 303–321.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Epistemic Profiles and Belief Structures, w: KES-AMSTA, Springer-Verlag, 2012, s. 360–369.zobacz w PBN
• Paweł Górecki i Jerzy Tiuryn, Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model, Lecture Notes In Computer Science 7230 2012, s. 83–105.zobacz w PBN
• Paweł Banasik, Anna Gambin, Sławomir Lasota, Michał Lula i Mikołaj Rybiński, Tav4SB: integrating tools for analysis of kinetic models of biological systems, Bmc Systems Biology 6 (25) 2012.zobacz w PBN
• Karol Kurach, Krzysztof Pawłowski, Łukasz Romaszko, Marcin Tatjewski, Andrzej Janusz i Hung Son Nguyen, An Ensemble Approach to Multi-label Classification of Textual Data, w: Advanced Data Mining and Applications, Springer, Berlin 2012, s. 306–317.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Strachocka, Andrzej Szałas i Rineke Verbrugge, A Paraconsistent Approach to Speech Acts, w: ArgMAS'2012: 9th International Workshop on Argumentation in Multi-Agent Systems, 2012.zobacz w PBN
• Michał Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz i Jan Van den Bussche, The Navigational Power of Web Browsers, Theory Of Computing Systems 50 (2) 2012, s. 213–240.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, Management of information incompleteness in rough non-deterministic information analysis, w: Advances on Computational Intelligence, Springer, Berlin 2012.zobacz w PBN
• Paweł Leszczyński i Krzysztof Stencel, PropScale: An Update Propagator for Joint Scalable Storage, w: Advances in Databases and Information Systems, Springer, Berlin Heidelberg 2013.zobacz w PBN
• Vinicious Pinheiro, Krzysztof Rządca i Denis Trystram, Campaign Scheduling, w: IEEE International Conference on High Performance Computing (HiPC), Proceedings, 2012.zobacz w PBN
• Piotr Wasilewski i Andrzej Skowron, A characterization of rough separability, w: Rough Sets and Knowledge Technology, Springer, Berlin 2012.zobacz w PBN
• J. Engwerda, O. Boldea, Tomasz Michalak i J. Plasmans and Salmah, A simulation study of an ASEAN monetary union, Economic Modelling 29 2012, s. 1870–1890.zobacz w PBN
• Marek Cygan i Marcin Pilipczuk, Bandwidth and distortion revisited, Discrete Applied Mathematics 160 (4-5) 2012, s. 494–504.zobacz w PBN
• Marek Cygan i Marcin Pilipczuk, Even Faster Exact Bandwidth, Acm Transactions On Algorithms 8 (1) 2012.zobacz w PBN
• Anna Gambin, Piotr Dittwald, Jerzy Ostrowski i Jakub Karczmarski, Inferring serum proteolytic activity from LC-MS/MS data, Bmc Bioinformatics 13 (5) 2012.zobacz w PBN
• Michał Startek, Sławomir Lasota, Maciej Sykulski, Adam Bułak, Laurent Noe, Gregory Kucherov i Anna Gambin, Efficient alternatives to PSI-BLAST, Bulletin Of The Polish Academy Of Sciences-technical Sciences 2012.zobacz w PBN
• Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, A linear time algorithm for seeds computation, w: SODA, 2012, s. 1095–1112.zobacz w PBN
• Marcin Kowalski, Dominik Ślęzak, Krzysztof Stencel, Przemysław Pardel i Marek Kosma Grzegorowski, RDBMS model for scientific articles analytics, Computational Intelligence (390) 2012, s. 49–60.zobacz w PBN
• Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk i Piotr Sankowski, A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, w: Algorithms - ESA 2012 - 20th Annual European Symposium, Springer, 2012, s. 349–360.zobacz w PBN
• Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco i Piotr Sankowski, The Ring Design Game with Fair Cost Allocation - [Extended Abstract], w: WINE, 2012.zobacz w PBN
• Jacek Chrząszcz i Aleksy Schubert, ML with PTIME complexity guarantees, w: CSL, 2012.zobacz w PBN
• Wojciech Czerwiński, Piotr Hofman i Sławomir Lasota, Reachability Problem for Weak Multi-Pushdown Automata, w: CONCUR 2012 – Concurrency Theory, Springer Berlin Heidelberg, 2012, s. 53–68.zobacz w PBN
• Hung Son Nguyen, Krzysztof Pawłowski, Łukasz Romaszko i Marcin Tatjewski, An ensemble approach to multi-label classification of textual data, w: Advanced Data Mining and Applications, Springer, Berlin 2012.zobacz w PBN
• Eryk Kopczyński, Igor Pak i Piotr Przytycki, Acute triangulations of polyhedra and R^N, Combinatorica 32 (1) 2012, s. 85–110.zobacz w PBN
• Filip Murlak, Michał Ogiński i Marcin Przybyłko, Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?, w: MFCS, 2012.zobacz w PBN
• Aneta Szumowska, Marta Burzańska, Piotr Wiśniewski i Krzysztof Stencel, Extending HQL with Plain Recursive Facilities, w: Advances in Databases and Information Systems, Springer, Berlin Heidelberg 2013.zobacz w PBN
• Andrzej Skowron, Andrzej Jankowski i Piotr Wasilewski, Interactive computational systems: Rough Granular Approach, w: Concurrency, Specification and Programming, Humboldt Universitaet zu Berlin, Berlin 2012.zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Counting of Square Substrings in a Tree, w: Lecture Notes in Computer Science, Springer, Heidelberg 2012, r. 7676, s. 207–216.zobacz w PBN
• Dominik Ślęzak, Hiroshi Sakai i Michinori Nakata, Rough sets-based machine learning over non-deterministic data: A brief survey, Computer Science And Information Systems (322) 2012, s. 3–12.zobacz w PBN
• Ken-etsu Fujita i Aleksy Schubert, The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types, Information And Computation 218 2012, s. 69–87.zobacz w PBN
• Anna Gambin i Mikołaj Rybiński, Model-based selection of the robust JAK-STAT activation mechanism, Journal Of Theoretical Biology 309 2012, s. 34–46.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Place, Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets, w: ICALP (2), 2012.zobacz w PBN
• Krzysztof Diks i Wojciech Śmietanka, Kubełkowe struktury danych, w: HOMO INFORMATICUS czyli człowiek w zinformatyzowanym świecie, Warszawska Wyższa Szkoła Informatyki, Warszawa 2012, r. 3, s. 77–94.zobacz w PBN
• Marcin Konrad Dziubiński i Jaideep Roy, Popularity of reinforcement-based and belief-based learning models: An evolutionary approach, Journal Of Economic Dynamics & Control 36 (3) 2012, s. 433–454.zobacz w PBN
• Andrzej Janusz, Dynamic rule-based similarity model for DNA microarray data, w: Transactions on Rough Sets XV, Springer, Berlin 2012.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Agents in Approximate Environments, w: Games, Actions and Social Software, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2012.zobacz w PBN
• Boris Düdder, Moritz Martens, Jakob Rehof i Paweł Urzyczyn, Bounded Combinatory Logic, w: CSL, 2012.zobacz w PBN
• Marcin Pilipczuk i Michał Pilipczuk, Finding a Maximum Induced Degenerate Subgraph Faster Than 2^n, w: 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), Springer, 2012, s. 3–12.zobacz w PBN
• Piotr Wasilewski i Andrzej Skowron, Interactive grammars: Toward perception based computing, w: Intelligent Decision Technologies, Springer, Berlin 2012.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński i Tomasz Waleń, The Maximum Number of Squares in a Tree, w: Computer Vision and Graphics. International Conference, ICCVG 2012, Warsaw, Poland, September 24-26, 2012. Proceedings, Springer, Berlin 2012, r. 7354, s. 27–40.zobacz w PBN
• Marcin Szczuka, Andrzej Janusz i Kamil Herba, Semantic clustering of scientific articles with use of DBpedia Knowledge Base, Computer Science (390) 2012, s. 61–76.zobacz w PBN
• Paweł Bednarz i Bartosz Wilczyński, Modeling Cell Populations in Development using Individual Stochastic Regulatory Networks, w: SIMULTECH, 2012.zobacz w PBN
• Jan Hidders, Paolo Missier i Jacek Sroka, Report from the first workshop on scalable workflow enactment engines and technology (SWEET'12), Siam Journal On Computing 41 (4) 2012, s. 60–64.zobacz w PBN
• Andrzej Janusz, Hung Son Nguyen, Dominik Ślęzak, Sebastian Stawicki i Adam Krasuski, JRS’2012 Data Mining Competition: Topical Classification of Biomedical Research Papers, w: Rough Sets and Current Trends in Computing. 8th International Conference, RSCTC 2012, Chengdu, China, August 17-20, 2012. Proceedings, Springer, Berlin 2012.zobacz w PBN
• Anna Gambin, Anna Marciniak-Czochra i Damian Niwiński, Alan Turing and Systems Biology, Ercim News 2012 (91) 2012.zobacz w PBN
• Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk i Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, w: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Part I, 2012, s. 254–265.zobacz w PBN
• Vince Bárány i Mikołaj Bojańczyk, Finite satisfiability for guarded fixpoint logic, Information Processing Letters 112 (10) 2012, s. 371–375.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Interactive information systems: Toward perception based computing, Theoretical Computer Science 454 2012, s. 240–260.zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the maximal sum of exponents of runs in a string, Journal Of Discrete Algorithms 14 2012, s. 29–36.zobacz w PBN
• Hung Son Nguyen, Dominik Ślęzak, Andrzej Skowron i Jan Bazan, Semantic search and analytics over large repository of scientific articles, Computer Science 2012, s. 1–9.zobacz w PBN
• Marcin Szczuka i Dominik Ślęzak, Representation and evaluation of granular systems, w: Intelligent Decision Technologies, Springer, Berlin 2012.zobacz w PBN

2011

• Anh Linh Nguyen, Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALCI, Lecture Notes In Computer Science 6804 2011, s. 465–475.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse, Studia Logica 98 (3) 2011, s. 387–428.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, A linear time algorithm for error-corrected reconciliation of unrooted gene trees, Lecture Notes In Computer Science 6674 2011, s. 148–159.zobacz w PBN
• Marcin Konrad Dziubiński, Complexity of Multiagent BDI Logics with Restricted Modal Context, w: AAMAS'11: 10th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, 2011, s. 1171–1172.zobacz w PBN
• Anna Gambin, Maciej Sykulski, Sławomir Lasota, Michał Startek, Gregory Kucherov i Laurent Noe, Subset seed extension to protein BLAST, w: Proc. Int. Conf. on Bioinformatics Models, Methods and Algorithms Bioinformatics'11., 2011.zobacz w PBN
• Andrzej Janusz i Dominik Ślęzak, Ensembles of bireducts: towards robust classification and simple representation, Lecture Notes In Computer Science 7105 2011, s. 64–77.zobacz w PBN
• Marcin Szczuka, The use of rough set methods in knowledge discovery in databases - Tutorial Abstract, Lecture Notes In Computer Science 6743 2011, s. 28–30.zobacz w PBN
• Andrzej Zbrzezny i Agata Janowska, Towards Discrete-Time Verification of Time Petri Nets with Dense-Time Semantics, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Tomasz Kulczyński, Jakub Łącki i Jakub Jan Radoszewski, Stimulating Students' Creativity with Tasks Solved Using Precomputation and Visualization, Olympiads In Informatics 5 2011, s. 71–81.zobacz w PBN
• Stefan Dziembowski, Tomasz Kazana, Daniel Wichs i Tomasz Piotr Kazana, Key-Evolution Schemes Resilient to Space-Bounded Leakage, w: Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings, 2011, s. 335–353.zobacz w PBN
• Anh Linh Nguyen, A Cut-Free ExpTime Tableau Decision Procedure for the Description Logic SHI, Lecture Notes In Computer Science 6922 2011, s. 572–581.zobacz w PBN
• Jakub Łącki i Piotr Sankowski, Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time, Lecture Notes In Computer Science 6942 2011, s. 155–166.zobacz w PBN
• Paweł Górecki, Gordon Burleigh i Oliver Eulenstein, Maximum likelihood models and algorithms for gene tree evolution with duplications and losses, Bmc Bioinformatics 12 (S15) 2011, s. 1–9.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Counting and detecting small subgraphs via equations and matrix multiplication, w: SODA, SIAM, San Francisco 2011.zobacz w PBN
• Anna Gambin, Sławomir Lasota, Michał Lula i Mikołaj Rybiński, Tav4SB: grid environment for analysis of kinetic models of biological systems, w: International Symposium on Bioinformatics Research and Applications (ISBRA), 2018.zobacz w PBN
• Dominik Ślęzak i Marcin Szczuka, Feedforward neural networks for compound signals, Theoretical Computer Science 412 (42) 2011, s. 5960–5973.zobacz w PBN
• James F. Peters, Andrzej Skowron, Hiroshi Sakai, Mihir Kumar Chakraborty, Dominik Ślęzak, Aboul Ella Hassanien i William Zhu (red.), Transactions on Rough Sets XIV, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2011.zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen i Andrzej Szałas, On the Web Ontology Rule Language OWL 2 RL, Lecture Notes In Computer Science 6922 2011, s. 254–264.zobacz w PBN
• Wojciech Czerwiński, Piotr Hofman i Sławomir Lasota, Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes In Computer Science 6901 2011, s. 528–542.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, Lecture Notes In Computer Science 6638 2011, s. 336–341.zobacz w PBN
• Mikołaj Bojańczyk, Data Monoids, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Marcin Szczuka, Andrzej Skowron i Jarosław Stepaniuk, Function approximation and quality measures in rough-granular systems, Fundamenta Informaticae 109 (3) 2011, s. 339–354.zobacz w PBN
• Mikołaj Bojańczyk, Leszek Aleksander Kołodziejczyk i Filip Murlak, Solutions in XML data exchange, w: Proceedings of the 14th International Conference on Database Theory. ICDT'11, ACM, Uppsala, Sweden 2011.zobacz w PBN
• Michal R. Przybyłek, Skeletal Algorithms, w: International Conference on Evolutionary Computation Theory and Applications, SciTePress, Paris 2011.zobacz w PBN
• Menachem Kojman i Henryk Michalewski, Borel extensions of Baire measures in ZFC, Fundamenta Mathematicae 211 2011, s. 197–223.zobacz w PBN
• Marcin Konrad Dziubiński i Jaideep Roy, Electoral competition in 2-dimensional ideology space with unidimensional commitment, Social Choice And Welfare 36 (1) 2011, s. 1–24.zobacz w PBN
• Jacek Sroka, Łukasz Bieniasz-Krzywiec, Szymon Gwozdz, Dariusz Leniowski, Jakub Łącki, Mateusz Markowski, Claudio Avignone-Rossa, Michael Bushell, Johnjoe McFadden i Andrzej Kierzek, Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface, Bmc Bioinformatics 12 2011, s. 196.zobacz w PBN
• Oskar Skibski, Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities, Lecture Notes In Computer Science 6982 2011, s. 130–142.zobacz w PBN
• Jacques Duparc, Alessandro Facchini i Filip Murlak, Definable Operations On Weakly Recognizable Sets of Trees, w: FSTTCS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Patrick Doherty, Barbara Dunin-Kęplicz i Andrzej Szałas, Tractable Model Checking for Fragments of Higher-Order Coalition Logic, w: AAMAS'11: 10th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, 2011, s. 743–750.zobacz w PBN
• Tai-Hoon Kim, Hojjat Adeli, Dominik Ślęzak, Frode Eika Sandnes i Xiaofeng Song (red.), Future Generation Information Technology, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2011.zobacz w PBN
• J. Engwerda, Tomasz Michalak i J. Plasmans, A Numerical Toolbox to Solve N-Player Affine LQ Open-Loop Differential Games, Computational Economics 37 (4) 2011, s. 375–410.zobacz w PBN
• Jakub Radoszewski i Wojciech Rytter, Hamiltonian Paths in the Square of a Tree, Lecture Notes In Computer Science 7074 2011, s. 90–99.zobacz w PBN
• Maciej Jończyk, Alicja Sobkowiak, Paweł Siedlecki, Przemysław Biecek, Joanna Trzcińska-Danielewicz, Jerzy Tiuryn, Jan Fronk i Paweł Sowiński, Rhythmic diel pattern of gene expression in juvenile maize leaf, Plos One 2011, s. 1.zobacz w PBN
• Grzegorz Jakacki, Marcin Kubica i Tomasz Waleń, Codility. Application of Olympiad-Style Code Assessment to Pre-Hire Screening of Programmers, Olympiads In Informatics 5 2011, s. 32–43.zobacz w PBN
• Patrick Doherty, Jacek Sroka, Andrzej Szałas i Tomasz Michalak, Contextual Coalitional Games, Lecture Notes In Computer Science 6521 2011, s. 65–78.zobacz w PBN
• Mikołaj Bojańczyk, Bartosz Klin i Sławomir Lasota, Automata with group actions, w: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Society, Toronto 2011.zobacz w PBN
• Patryk Czarnik, Jacek Chrząszcz i Aleksy Schubert, A Dozen Instructions Make Java Bytecode, Electronic Notes In Theoretical Computer Science 264 (4) 2011, s. 19–34.zobacz w PBN
• Mikołaj Bojańczyk i Diego Figueira, Efficient evaluation for a temporal logic on changing XML documents, w: PODS, ACM, Athens 2011.zobacz w PBN
• Eryk Kopczyński, Trees in Trees: Is the Incomplete Information about a Tree Consistent?, w: CSL, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Hung Son Nguyen i Gloria Virginia, Investigating the Effectiveness of Thesaurus Generated Using Tolerance Rough Set Model. In: Marzena Kryszkiewicz, Henryk Rybiński, Andrzej Skowron, Zbigniew W. Raś (Eds.), Lecture Notes In Computer Science 6804 2011, s. 705–714.zobacz w PBN
• Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Dominating set is fixed parameter tractable in claw-free graphs, Theoretical Computer Science 412 (50) 2011, s. 6982–7000.zobacz w PBN
• Marcin Kowalski, Dominik Ślęzak, Graham Toppin i Arkadiusz Wojna, Injecting Domain Knowledge into RDBMS - Compression of Alphanumeric Data Attributes, Lecture Notes In Computer Science 6804 2011, s. 386–395.zobacz w PBN
• Tomasz Kociumaka, Marcin Kubica i Jakub Jan Radoszewski (red.), XVIII Olimpiada Informatyczna 2010/2011, Komitet Główny Olimpiady Informatycznej, Warszawa 2011.zobacz w PBN
• Marek Cygan i Łukasz Kowalik, Channel Assignment via Fast Zeta Transform, Information Processing Letters 111 (15) 2011, s. 727–730.zobacz w PBN
• Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk i Piotr Sankowski, Approximation Algorithms for Union and Intersection Covering Problems, w: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2011, Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, s. 28–40.zobacz w PBN
• Alexander Kurz i Andrzej Tarlecki (red.), Special issue on Algebra and Coalgebra in Computer Science (CALCO 2009), Braunschweig 2011.zobacz w PBN
• Anna Gambin, Maciej Sykulski, Tomasz Gambin, Magdalena Bartnik i Katarzyna Derwińska, Efficient multiple samples aCGH analysis for rare CNVs detection, w: IEEE International Conference Bioinformatics and Biomedicine, 2011.zobacz w PBN
• Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick i Luc Segoufin, Two-variable logic on data words, Acm Transactions On Computational Logic 12 (4) 2011.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Perception, Actions and Plans in Interactive Computing,, w: Systemy Wspomagania Decyzji. Alicja Wakulicz (Ed.),, Instytut Informatyki, Uniwersytet Śląski, 2011.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Jakub Onufry Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Lecture Notes In Computer Science 6755 2011, s. 449–461.zobacz w PBN
• Jacek Sroka, Piotr Chrząstowski-Wachtel i Jan Hidders, On generating *-sound nets with substitution, w: Proceedings ot the International Conference on Application of Concurrency to System Design (ACSD) 2011, IEEE Computer Society, Los Alamitos 2011.zobacz w PBN
• Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, s. 455–466.zobacz w PBN
• Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith i Jakub Wojtaszczyk, Breaking the 2^n-barrier for Irredundance: Two lines of attack, Journal Of Discrete Algorithms 9 (3) 2011, s. 214–230.zobacz w PBN
• Gudmund Frandsen i Piotr Sankowski, Dynamic normal forms and dynamic characteristic polynomial, Theoretical Computer Science 412 (16) 2011, s. 1470–1483.zobacz w PBN
• Michałis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, w: CPM, 2011.zobacz w PBN
• Mikołaj Bojańczyk, Weak MSO with the Unbounding Quantifier, Theory Of Computing Systems 48 (3) 2011, s. 554–576.zobacz w PBN
• Wei-Zhi Wu, Dominik Ślęzak i Hung Son Nguyen (red.), Preface, IOS PRESS, NIEUWE HEMWEG 6B, AMSTERDAM, NETHERLANDS, 1013 BG 2011.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster Than 2n, Lecture Notes In Computer Science 6942 2011, s. 299–310.zobacz w PBN
• Marcin Kubica i Jakub Radoszewski (red.), CEOI 2011. Tasks and Solutions, Komitet Główny Olimpiady Informatycznej, Gdynia 2011.zobacz w PBN
• Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, Lecture Notes In Computer Science 6661 2011, s. 350–363.zobacz w PBN
• Norbert Dojer, Przemysław Biecek i Jerzy Tiuryn, Bi-Billboard: Symmetrization and Careful Choice of Informant Species Results in Higher Accuracy of Regulatory Element Prediction, Journal Of Computational Biology 18 (6) 2011, s. 809–819.zobacz w PBN
• Gerold Jäger i Marcin Peczarski, The number of pessimistic guesses in Generalized Black-peg Mastermind, Information Processing Letters 111 (19) 2011, s. 933–940.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Ildiko Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Lecture Notes In Computer Science 6986 2011, s. 131–142.zobacz w PBN
• Talal Rahwan, Tomasz Michalak i Nicholas Jennings, Minimum Search To Establish Worst-Case Guarantees in Coalition Structure Generation, w: Proceedings of International Conferences on Artificial Inteligence,(IJCAI 2011), IJCAI/AAAI, Barcelona 2011.zobacz w PBN
• Albert Atserias, Mikołaj Bojańczyk, Balder ten Cate, Ronald Fagin, Floris Geerts i Kenneth Ross, Foreword, Theory Of Computing Systems 49 (2) 2011, s. 365–366.zobacz w PBN
• Son Thanh Cao, Linh Anh Nguyen i Andrzej Szałas, WORL: a Web Ontology Rule Language, w: KSE 2011 - International Conference on Knowledge and Systems Engineering, 2011.zobacz w PBN
• Hitomi Okuma, Michinori Nakata, Dominik Ślęzak i Hiroshi Sakai, Properties on inclusion relations and division charts in non, w: 2011 IEEE International Conference On Granular Computing (GrC). Tzung-Pei Hong, Yasuo Kudo, Mineichi Kudo, Tsau-Young Lin, Been-Chian Chien, Shyue-Liang Wang, Masahiro Inuiguchi, GuiLong Liu (eds.), IEEE, Advancing Technology for Humanity, Taiwan 2011.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem), w: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, ACM, San Francisco 2011, s. 1666–1674.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Strachocka i Rineke Verbrugge, Deliberation Dialogues during Multi-agent Planning, Lecture Notes In Computer Science 6804 2011, s. 170–181.zobacz w PBN
• Wojciech Czerwiński, Sibylle Froeschle i Sławomir Lasota, Partially-commutative context-free processes: expressibility and tractability, Information And Computation 209 (5) 2011, s. 782–798.zobacz w PBN
• Paweł Parys i Mikołaj Bojańczyk, XPath Evaluation in Linear Time, Journal Of The Acm 58 (4) 2011, s. 17.zobacz w PBN
• Jacek Sroka, Łukasz Krupa, Andrzej Kierzek i Jerzy Tyszkiewicz, CalcTav - Integration of a Spreadsheet and Taverna Workbench, Bioinformatics 27 (18) 2011, s. 2618–2619.zobacz w PBN
• Andrea Corradini, Bartosz Klin i Corina Cirstea (red.), Proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), Springer, Berlin 2011.zobacz w PBN
• Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski i Christian Wulff-Nilsen, Improved algorithms for min cut and max flow in undirected planar graphs, w: STOC, ACM, San Jose 2011.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, A NIS-apriori based rule generator in prolog and its functionality for table data, Lecture Notes In Computer Science 6954 2011, s. 226–231.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, RDBMS framework for contour identification, w: Proceedings of the International Workshop CS&P'2011, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan van Rooij i Jakub Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, w: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, IEEE, Palm Springs 2011, s. 150–159.zobacz w PBN
• Ludwik Czaja, MAGDALENA KACPRZAK, Andrzej Skowron i Marcin Szczuka (red.), Cuncurrency, Specification and Programming CS&P 2011, 2011.zobacz w PBN
• Bartosz Klin, Bialgebras for structural operational semantics: an introduction, Theoretical Computer Science 412 (38) 2011, s. 5043–5069.zobacz w PBN
• Marcin Kubica, Romeo Rizzi, Stephane Vialette i Tomasz Waleń, Approximation of RNA multiple structural alignment, Journal Of Discrete Algorithms 9 (4) 2011, s. 365–376.zobacz w PBN
• Robert Dąbrowski, Krzysztof Stencel i Grzegorz Timoszuk, Software Is a Directed Multigraph, Lecture Notes In Computer Science 6903 2011, s. 360–369.zobacz w PBN
• Andrzej Tarlecki, Some Nuances of Many-sorted Universal Algebra: A Review, w: Bulletin of the EATCS, Amsterdam 2011, s. 89–111.zobacz w PBN
• Anna Gambin, Piotr Dittwald, Jerzy Ostrowski i Jakub Karczmarski, Inferring serum proteolytic activity from LC, w: Proc. IEEE 1st International Conference on Computational Advances in Bio and medical Sciences (ICCABS), 2011.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, A prototype system for rule generation in Lipski's incomplete information databases, Lecture Notes In Computer Science 6743 2011, s. 175–182.zobacz w PBN
• Marcin Szczuka, Risk assessment in granular environments, Lecture Notes In Computer Science 6499 2011, s. 121–134.zobacz w PBN
• Marcin Szczuka, Ludwik Czaja, Andrzej Skowron i Magdalena Kacprzak (red.), CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Hung Son Nguyen, Sankar K. Pal i Andrzej Skowron (red.), Rough set and fuzzy sets in natural computing/Preface. Special issue of Theoretical Computer Science 412, 2011.zobacz w PBN
• H. Hansen i Bartosz Klin, Pointwise extensions of GSOS-defined operations, Mathematical Structures In Computer Science 21 (2) 2011, s. 321–361.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, On Word Equations in One Variable, Algorithmica 60 (4) 2011, s. 819–828.zobacz w PBN
• Aneta Szumowska, Marta Burzańska, Piotr Wiśniewski i Krzysztof Stencel, Efficient Implementation of Recursive Queries in Major Object Relational Mapping Systems, Lecture Notes In Computer Science 7105 2011, s. 78–89.zobacz w PBN
• Joerg Kreiker, Andrzej Tarlecki, Moshe Vardi i Reinhard Wilhelm, Modeling, Analysis, and Verification: The Formal Methods Manifesto 2010, w: Dagstuhl Manifestos, Dagstuhl Publishing, Dagstuhl 2011, s. 21–40.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Information systems in modeling interactive computations on granules, Theoretical Computer Science 412 (42) 2011, s. 5939–5959.zobacz w PBN
• Daryl H. Hepting, Richard Spring i Dominik Ślęzak, A rough set exploration of facial similarity judgements, Lecture Notes In Computer Science 6600 2011, s. 81–99.zobacz w PBN
• Sergei O. Kuznetsov, Dominik Ślęzak, Daryl H. Hepting i Boris Mirkin (red.), Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2011.zobacz w PBN
• Ali Rezaei Divroodi i Anh Linh Nguyen, On Bisimulations for Description Logics, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Marcin Peczarski, Mikrokontrolery STM32 w sieci Ethernet w przykładach, Wydawnictwo BTC, Legionowo 2011.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica 59 (2) 2011, s. 240–255.zobacz w PBN
• Jakob Rehof i Paweł Urzyczyn, Finite Combinatory Logic with Intersection Types, Lecture Notes In Computer Science 6690 2011, s. 169–183.zobacz w PBN
• Jan Małuszyński i Andrzej Szałas, Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation, Journal Of Applied Non-classical Logics 21 (2) 2011, s. 211–232.zobacz w PBN
• Paweł Brach, Jacek Chrząszcz, Janusz Jabłonowski i Jakub Swiatły, A distributed service oriented system for GUI map generation, w: CompSysTech, 2011.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Strachocka i Rineke Verbrugge, Modeling Deliberation in Teamwork, w: Commonsense, AAAI Press, 2011.zobacz w PBN
• Andrzej Janusz i Dominik Ślęzak, An unsupervised model for rule-based similarity learning from textual data, w: Proceedings of International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok, 2011.zobacz w PBN
• Dominik Ślęzak i Sebastian Widz, Rough-set-inspired feature subset selection, classifier construction, and rule aggregation, Lecture Notes In Computer Science 6954 2011, s. 81–88.zobacz w PBN
• Talal Rahwan, Tomasz Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge i Nicolas Jennings, Constrained Coalition Formation, w: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, AAAI Press, San Francisco 2011.zobacz w PBN
• Anna Gambin, Tomasz Gambin i Paweł Stankiewicz, A stable density approach to probe selection for a custom aCGH design, Biotechnologia 92 (3) 2011, s. 283–295.zobacz w PBN
• Marcin Konrad Dziubiński, Location game on disjoint line segments, International Journal Of Game Theory 40 (2) 2011, s. 231–262.zobacz w PBN
• Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk i Riste Skrekovski, On the Zagreb index inequality of graphs with prescribed vertex degrees, Discrete Applied Mathematics 159 (8) 2011, s. 852–858.zobacz w PBN
• Jakub Pawlewicz, Towards Optimal Play in Multi-Player Yahtzee, Icga Journal 34 (1) 2011, s. 7–21.zobacz w PBN
• Jan Małuszyński i Andrzej Szałas, Living with Inconsistency and Taming Nonmonotonicity. Datalog Reloaded, Lecture Notes In Computer Science 6702 2011, s. 334–398.zobacz w PBN
• Andrzej Janusz i Sebastian Stawicki, Applications of approximate reducts to the feature selection problem, Lecture Notes In Computer Science 6954 2011, s. 45–50.zobacz w PBN
• Piotr Wasilewski, James F. Peters i Sheela Ramanna, Perceptual Tolerance Intersection, Lecture Notes In Computer Science Transactions On Rough Sets 13 2011, s. 159–174.zobacz w PBN
• Marcin Szczuka, Andrzej Janusz i Kamil Herba, Clustering of rough set related documents with use of knowledge from DBpedia, Lecture Notes In Computer Science 6954 2011, s. 394–403.zobacz w PBN
• Dominik Ślęzak, Andrzej Janusz, Wojciech Świeboda, Hung Son Nguyen i Jan G. Bazan, Semantic analytics of PubMed content, Lecture Notes In Computer Science 7058 2011, s. 63–74.zobacz w PBN
• Michał Woźniak, L. Wong i Jerzy Tiuryn, CAMBer: an approach to support comparative analysis of multiple bacterial strains, Bmc Genomics 12 (2) 2011, s. 6.zobacz w PBN
• Anna Gambin i Michał Kistowski, Optimization algorithm for de novo analysis of tandem mass spectrometry data, Biotechnologia 92 (3) 2011, s. 296–300.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk i Jakub Onufry Wojtaszczyk, Capacitated domination faster than O(2^n), Information Processing Letters 111 (23) 2011, s. 1099–1103.zobacz w PBN
• Markku Laine i Wojciech Plandowski, Word Equations with One Unknown, International Journal Of Foundations Of Computer Science 22 (2) 2011, s. 345–375.zobacz w PBN
• Stefan Dziembowski i Sebastian Faust, Leakage-Resilient Cryptography from the Inner-Product Extractor., Lecture Notes In Computer Science 7073 2011, s. 702–721.zobacz w PBN
• Luc Segoufin i Szymon Toruńczyk, Automata based verification over linearly ordered data domains, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Anna Gambin, Tomasz Gambin, Maciej Sykulski i Paweł Stankiewicz, Robustness of exon CGH array designs, w: Proc. Int Conf. on Bioinformatics Models, Methods and Algorithms Bioinformatics'11., 2011.zobacz w PBN
• Marcin Szczuka, Andrzej Janusz i Kamil Herba, Clustering of Rough Set Related Documents with Use of Knowledge from DBpedia. Jingtao Yao, Sheela Ramanna, Guoyin Wang, Zbigniew Suraj (eds.), Lecture Notes In Computer Science 6954 2011, s. 394–403.zobacz w PBN
• Hung Son Nguyen i Adam Koper, Sequential Pattern Mining from Stream Data, Lecture Notes In Computer Science 7121 2011, s. 278–291.zobacz w PBN
• Piotr Wiśniewski, Marta Burzańska i Krzysztof Stencel, The Impedance Mismatch in Light of the Unified State Model, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Hiroshi Sakai, Hitomi Okuma, Michinori Nakata i Dominik Ślęzak, Stable rule extraction and decision making in rough non-deterministic information analysis, International Journal Of Hybrid Intelligent Systems 8 (1) 2011, s. 41–57.zobacz w PBN
• Hiroshi Sakai, Kohei Hayashi, Michinori Nakata i Dominik Ślęzak, A mathematical extension of rough set based issues toward uncertain information analysis, New Mathematics And Natural Computation 7 (3) 2011, s. 543–570.zobacz w PBN
• Marcin Pilipczuk, Characterization of compact subsets of curves with omega-continuous derivatives, Fundamenta Mathematicae 211 (2) 2011, s. 175–195.zobacz w PBN
• Jacek Chrząszcz i Aleksy Schubert, The role of polymorphism in the characterisation of complexity by soft types, Lecture Notes In Computer Science 6907 2011, s. 219–230.zobacz w PBN
• Michał Woźniak, L. Wong i Jerzy Tiuryn, CAMBerVis: visualization software to support comparative analysis of multiple bacterial strains, Bioinformatics 27 (23) 2011, s. 3313–3314.zobacz w PBN
• Paweł Parys, Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Amos Fiat, Stefano Leonardi, Jared Saia i Piotr Sankowski, Single valued combinatorial auctions with budgets, w: ACM Conference on Electronic Commerce, 2011.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, Comparators for compound object identification, Lecture Notes In Computer Science 6743 2011, s. 342–349.zobacz w PBN
• Emilio Corchado, Václav Snásel, Javier Sedano, Aboul Ella Hassanien i Dominik Ślęzak (red.), Soft Computing Models in Industrial and Environmental Applications, 6th International Conference SOCO 2011, 2011.zobacz w PBN
• Paweł Leszczyński i Krzysztof Stencel, Update Propagator for Joint Scalable Storage, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics, Journal Of Applied Non-classical Logics 21 (1) 2011, s. 61–81.zobacz w PBN
• Ewa Szczurek, Florian Markowetz, Irit Gat-Viks, Przemysław Biecek, Jerzy Tiuryn i Martin Vingron, Deregulation upon DNA damage revealed by joint analysis of context-specific perturbation data, Bmc Bioinformatics 12 2011, s. 1–19.zobacz w PBN
• Filip Murlak i Piotr Sankowski (red.), Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011., Springer, Berlin 2011.zobacz w PBN
• Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele i Piotr Sankowski, Stochastic query covering, w: WSDM, ACM, Hong Kong 2011.zobacz w PBN
• Geuk Lee, Daniel Howard i Dominik Ślęzak (red.), Convergence and Hybrid Information Technology, 2011.zobacz w PBN
• Aboul Ella Hassanien, Hiroshi Sakai, Dominik Ślęzak, Mihir K. Chakraborty i William Zhu (red.), Special issue: Rough and Fuzzy Methods for Data Mining (1-2)., 2011.zobacz w PBN
• Paweł Brach, Jacek Chrząszcz, Janusz Jabłonowski i Jakub Światly, Cartographer: Architecture of a Distributed System for Automated GUI Map Generation, w: Proceedings of The International Multi-Conference of Engineers and Computer Scientists 2011, Hong Kong 2011.zobacz w PBN
• Maciej Sysło, Wojciech Cellary, Krzysztof Diks, Andrzej Szałas, Jan Madey, Marcin Engel, Ryszard Tadeusiewicz, Jerzy Gawinecki, Piotr Sienkiewicz i Zenon Gniazdowski (red.), Podstawy algorytmiki. Zastosowania informatyki, Warszawska Wyższa Szkoła Informatyki, Warszawa 2011.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Toward interactive rough-granular computing, Control And Cybernetics 40 (2) 2011, s. 1–23.zobacz w PBN
• Małgorzata Bukała, Piotr Sankowski, Ryszard Buczko i Perła Kacman, Crystal and electronic structure of PbTe/CdTe nanostructures, Nanoscale Research Letters 6 (1) 2011, s. 1–7.zobacz w PBN
• Stefan Dziembowski, Tomasz Kazana, Daniel Wichs i Tomasz Piotr Kazana, One-Time Computable Self-erasing Functions, w: Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings, 2011, s. 125–143.zobacz w PBN

2010

• Andrzej Skowron i Piotr Wasilewski, Approximations and classifiers. Proceedings of the 7th International Conference Rough Sets and Current Trends in Computing (RSCTC 2010), Warsaw, Poland, June 28-30, 2010, Lecture Notes In Computer Science 6086 2010, s. 730–739.zobacz w PBN
• Tai-Hoon Kim, Young-Hoon Lee, Byeong Ho Kang i Dominik Ślęzak (red.), Future Generation Information Technology, 2nd International Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, Jeju Island, Korea 2010.zobacz w PBN
• Marcin Szczuka, On quality measures for granular environments, w: Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P 2010),, Humboldt Universitaet zu Berlin, Berlin 2010.zobacz w PBN
• Tai-hoon Kim, Stephen S. Yau, Osvaldo Gervasi, Byeong-Ho Kang i Dominik Ślęzak, Grid and Distributed Computing, Control and Automation, International Conferences, GDC and CA 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, 2010.zobacz w PBN
• Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi i Piotr Sankowski, Online Network Design with Outliers, Lecture Notes In Computer Science 6198 2010, s. 114–126.zobacz w PBN
• Mikołaj Bojańczyk, Beyond omega-Regular Languages, w: STACS, 2010.zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Tomasz Waleń, Costas S. Iliopoulos i M. Sohel Rahman, Finding Patterns In Given Intervals, Fundamenta Informaticae 101 (3) 2010, s. 173–186.zobacz w PBN
• Jacek Chrząszcz, Patryk Czarnik i Aleksy Schubert, A dozen instructions make Java bytecode, w: Bytecode, 2010.zobacz w PBN
• Krzysztof Stencel i Piotr Tabor, Stream Execution of Object Queries, w: GDC and CA, 2010.zobacz w PBN
• Hung Son Nguyen, Andrzej Jankowski, James F. Peters, Andrzej Skowron, Jarosław Stepaniuk i Marcin Szczuka, Discovery of process models from data and domain knowledge: A rough-granular approach, w: Novel Developments in Granular Computing: Applications for Advanced Human Reasoning and Soft Computation, Hershey, New York 2010.zobacz w PBN
• Tai-Hoon Kim, Stephen S. Yau, Osvaldo Gervasi, Byeong-Ho Kang i Dominik Ślęzak (red.), FGIT, Grid and Distributed Computing, Control and Automation, International Conferences, GDC and CA 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Springer, Jeju Island, Korea 2010.zobacz w PBN
• Marcin Szczuka (red.), Rough Sets and Current Trends in Computing, w: 7-th International Conference, RSCTC 2010, Warsaw, Poland, June 28-30, 2010, Springer, Heidelber 2010.zobacz w PBN
• Tai-hoon Kim, Wai-chi Fang, Muhammad Khurram Khan, P. Arnett i Dominik Ślęzak (red.), Security Technology, Disaster Recovery and Business Continuity, International Conferences, SecTech and DRBC 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, 2010.zobacz w PBN
• Marcin Wojnarski, Paweł Gora, Marcin Szczuka, Hung Son Nguyen, Joanna Świetlicka i Demetris Zeinalipour-Yazti, IEEE ICDM 2010 Contest: TomTom traffic prediction for intelligent GPS navigation, w: 2010 IEEE International Conference on Data Mining Workshops, 2010, s. 1372–1376.zobacz w PBN
• Marcin Kamiński i Łukasz Kowalik, Approximating the Maximum 3- and 4-Edge-Colorable Subgraph, Lecture Notes In Computer Science 6139 2010, s. 395–407.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, Fundamenta Informaticae 102 (1) 2010, s. 97–113.zobacz w PBN
• Norbert Dojer, Michał Dąbrowski, Małgorzata Zawadzka, Jakub Mieczkowski i Bożena Kamińska, Comparative analysis of cis-regulation following stroke and seizures in subspaces of conserved eigensystems, Bmc Systems Biology 4 2010.zobacz w PBN
• Anh Linh Nguyen, Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity, Fundamenta Informaticae 104 (4) 2010, s. 349–384.zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Sum of Exponents of Runs in a String, Lecture Notes In Computer Science 6460 2010, s. 10–19.zobacz w PBN
• Marcin Wojnarski, Andrzej Janusz, Hung Son Nguyen, Jan G. Bazan, Chuan Jiang Luo, Ze Chen, Feng Hu, Guoyin Wang, Lihe Guan, Huan Luo, Juan Gao, Yuanxia Shen, Nikulin Vladimir, Tian-Hsiang Huang, McLachlan Geoffrey J., Matko Bošnjak i Gamberger Dragan, RSCTC'2010 Discovery Challenge: Mining DNA Microarray Data for Medical Diagnosis and Treatment, w: RSCTC 2010, Rough Sets and Current Trends in Computing, Springer, Heidelberg 2010, s. 4–19.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Information systems in interactive computing, w: Systemy Wspomagania Decyzji, Uniwersytet Śląski, Katowice 2010.zobacz w PBN
• Aijun An i Dominik Ślęzak, Introduction to the special issue on advanced information retrieval and databases, Journal Of Intelligent Information Systems 34 (2) 2010, s. 223–225.zobacz w PBN
• Dominik Ślęzak, SQL-based compound object comparators: A case study of images stored in ICE, w: International Conference on CCIS 2010, Springer-Verlag, Heidelberg, Berlin 2010.zobacz w PBN
• Tai-hoon Kim, Sankar K. Pal, William I. Grosky, Niki Pissinou i Dominik Ślęzak (red.), Signal Processing and Multimedia, International Conferences, SIP and MulGraB 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, 2010.zobacz w PBN
• Konrad Iwanicki i Tahir Azim, Experimentally Studying the Sensornet Point-to-Point Routing Techniques Spectrum, w: IEEE Int. Conf. on Networked Sensing Systems, 2010, s. 6–13.zobacz w PBN
• Grzegorz Fałda, Wiktor Filipowicz, Piotr Habela, Krzysztof Stencel, Kazimierz Subieta i Krzysztof Kaczmarski, Applying Query by Example in OCL for Platform-independent Programming, w: WEBIST 2010 - Proceedings of the 6th International Conference on Web Information Systems and Technology, 2010, s. 179–182.zobacz w PBN
• Paweł Górecki, H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer, Fundamenta Informaticae 103 (1-4) 2010, s. 105–128.zobacz w PBN
• Bartosz Klin, Structural operational semantics and modal logic, revisited, w: CMCS, 2010.zobacz w PBN
• Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean Raskin i Szymon Toruńczyk, Energy and Mean-Payoff Games with Imperfect Information, Lecture Notes In Computer Science 6247 2010, s. 260–274.zobacz w PBN
• Dominik Ślęzak, Piotr Synak, Jakub Wróblewski i Graham Toppin, Infobright analytic database engine using rough sets and granular computing, Ieee Computational Intelligence Magazine 2010, s. 432–437.zobacz w PBN
• Dominik Ślęzak i Sebastian Widz, Is it important which rough-set-based classifier extraction and voting criteria are applied together?, w: RSCTC 2010, Rough Sets and Current Trends in Computing, Springer, Heidelberg 2010.zobacz w PBN
• Tai-hoon Kim, Jianhua Ma, Wai-chi Fang, Byungjoo Park i Dominik Ślęzak, U- and E-Service, Science and Technology, International Conference, UNESST 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, 2010.zobacz w PBN
• Shun'ichi Amano, Claire David, Leonid Libkin i Filip Murlak, On the tradeoff between mapping and querying power in XML data exchange, w: ICDT, 2010.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Three-Valued Paraconsistent Reasoning for Semantic Web Agents, Lecture Notes In Computer Science 6070 2010, s. 152–162.zobacz w PBN
• Anna Gambin i Bogusław Kluge, Modeling Proteolysis from Mass Spectrometry Proteomic Data, Fundamenta Informaticae 103 (1-4) 2010, s. 89–104.zobacz w PBN
• Marcin Kubica, Wojciech Rytter, Tomasz Waleń, Krzysztof Stencel, Jakub Radoszewski, Maxime Crochemore i Costas Iliopoulos, New Simple Efficient Algorithms Computing Powers and Runs in Strings, w: PSC, 2010, s. 138–149.zobacz w PBN
• Anh Linh Nguyen, Paraconsistent and Approximate Semantics for the OWL 2 Web Ontology Language, Lecture Notes In Computer Science 6086 2010, s. 710–720.zobacz w PBN
• Tomasz Kociumaka, Marcin Kubica i Jakub Jan Radoszewski (red.), XVII Olimpiada Informatyczna 2009/2010, Komitet Główny Olimpiady Informatycznej, Warszawa 2010.zobacz w PBN
• Dominik Ślęzak i Sebastian Widz, Rough-Set-based classifier extraction and voting criteria are Applied together?, Lecture Notes In Computer Science 6086 2010, s. 187–196.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, Rule generation in Lipski's incomplete information databases, w: RSCTC 2010, Rough Sets and Current Trends in Computing, Springer, Heidelberg 2010.zobacz w PBN
• Andrzej Skowron i Marcin Szczuka, Toward interactive computations: A Rough-granular approach, w: Advances in Machine Learning II, Dedicated to the memory of professor Ryszard S.Michaleski, Studies in Computational Intelligence, Heidelberg 2010.zobacz w PBN
• Ewa Szczurek, Przemysław Biecek, Jerzy Tiuryn i Martin Vingron, Introducing Knowledge into Differential Expression Analysis, Journal Of Computational Biology 17 (8) 2010, s. 953–967.zobacz w PBN
• Paweł Leszczynski i Krzysztof Stencel, Consistent Cache Maintenance for Database Driven Websites, w: ICWE Workshops, 2010.zobacz w PBN
• Magdalena Dukielska i Jacek Sroka, JavaSpaces NetBeans: a linda workbench for distributed programming course, w: ITiCSE, 2010.zobacz w PBN
• Anna Gambin, Damian Niwiński i Paweł Urzyczyn, Preface, Fundamenta Informaticae 103 (1-4) 2010.zobacz w PBN
• Leszek Rudak, Krzysztof Diks i Jan Madey (red.), University Information Systems. Selected Problems, Difin SA, Warszawa 2010.zobacz w PBN
• Jakub Pawlewicz, Nearly Optimal Computer Play in Multi-player Yahtzee, Lecture Notes In Computer Science 6515 2010, s. 250–262.zobacz w PBN
• Jakub Onufry Wojtaszczyk, Marek Adam Cygan, Marcin Łukasz Pilipczuk i Michał Pilipczuk, An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion, Lecture Notes In Computer Science (6478) 2010, s. 95–106.zobacz w PBN
• Jerzy Paweł Tyszkiewicz, Spreadsheet as a relational database engine, w: Proceedings of the 2010 International Conference on Management of Data, ACM, New York, NY, USA 2010, s. 195–206.zobacz w PBN
• Chris Cornelis, Richard Jensen, Germán Hurtado Martín i Dominik Ślęzak, Attribute selection with fuzzy decision reducts, Information Sciences 180 (2) 2010, s. 209–224.zobacz w PBN
• Tai-Hoon Kim, Sankar K. Pal, William I. Grosky, Niki Pissinou i Dominik Ślęzak (red.), FGIT, Signal Processing and Multimedia, International Conferences, SIP and MulGraB 2010, w: SIP and MulGraB 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Springer, Heidelberg 2010.zobacz w PBN
• Marcin Szczuka, Marzena KRYSZKIEWICZ, Sheela Ramanna, Richard Jensen i Qinghua Hu (red.), RSCTC 2010, Rough Sets and Current Trends in Computing, Springer, Heidelberg 2010.zobacz w PBN
• Paweł Leszczynski i Krzysztof Stencel, Consistent Caching of Data Objects in Database Driven Websites, w: ADBIS, 2010.zobacz w PBN
• Eryk Kopczyński i Anthony Widjaja To, Parikh Images of Grammars: Complexity and Applications, w: LICS, 2010.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Lecture Notes In Computer Science 6031 2010, s. 227–238.zobacz w PBN
• Jerzy Tyszkiewicz, Complexity of Type Inference, Fundamenta Informaticae 103 (1-4) 2010, s. 289–301.zobacz w PBN
• Janina Mincer-Daszkiewicz, Exchange of Data on Mobility Between Higher Education Intitutions and the National Agency for Coordination of EU Programmes in Poland, w: University Information Systems. Selected Problems, Difin SA, Warszawa 2010, s. 332–341.zobacz w PBN
• Stefan Dziembowski, How to Pair with a Human, Lecture Notes In Computer Science 6280 2010, s. 200–218.zobacz w PBN
• Jacek Sroka i J. Hidders, Systemy informatyczne zarządzania treścią, w: Informatyka Gospodarcza, Warszawa 2010.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk i Jakub Wojtaszczyk, Irredundant set faster than O(2^n), w: Algorithms and Complexity, 7th International Conference, CIAC 2010, Springer, Berlin, Heidelberg 2010, s. 288–298.zobacz w PBN
• Marcin Kubica i Jakub Jan Radoszewski, Algorithms without Programming, Olympiads In Informatics 4 2010, s. 52–66.zobacz w PBN
• Paweł Urzyczyn, The Logic of Persistent Intersection, Fundamenta Informaticae 103 (1-4) 2010, s. 303–322.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk i Jakub Wojtaszczyk, Capacitated domination faster than O(2^n), w: Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Springer, Heidelberg 2010, s. 74–80.zobacz w PBN
• Tai-Hoon Kim, Wai-Chi Fang, Muhammad Khurram Khan, P. Arnett i Dominik Ślęzak (red.), FGIT, Security Technology, Disaster Recovery and Business Continuity, International Conferences, SecTech and DRBC 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, p.1-298, Springer, Heidelberg 2010.zobacz w PBN
• Barbara Dunin-Kęplicz, Rineke Verbrugge i Michał Ślizak, TeamLog in Action: a Case Study in Teamwork, Computer Science And Information Systems 7 (3) 2010, s. 569–595.zobacz w PBN
• Tomasz P. Michałak, Jacek Sroka, Talal Rahwan, Michael Wooldridge, Peter McBurney i Nicholas R. Jennings, A distributed algorithm for anytime coalition structure generation, w: AAMAS, 2010.zobacz w PBN
• Mikołaj Bojańczyk i Sławomir Lasota, An Extension of Data Automata that Captures XPath, w: LICS, 2010.zobacz w PBN
• Barbara Klunder i Wojciech Rytter, Post Correspondence Problem with Partially Commutative Alphabets, Lecture Notes In Computer Science 6031 2010, s. 356–367.zobacz w PBN
• Norbert Dojer, An Efficient Algorithm for Learning Bayesian Networks from Data, Fundamenta Informaticae 103 (1-4) 2010, s. 53–67.zobacz w PBN
• Janina Mincer-Daszkiewicz, The Mobility Project - Building Network of Web-servers for Exchange of Data on Student Mobility, w: University Information Systems. Selected Problems, Difin SA, Warszawa 2010, s. 342–355.zobacz w PBN
• Stefan Dziembowski, Leakage-Resilient Storage, Lecture Notes In Computer Science 6280 2010, s. 121–137.zobacz w PBN
• Arnaud Carayol, Christof Loding, Damian Niwiński i Igor Walukiewicz, Choice functions and well-orderings over the infinite binary tree, Central European Journal Of Mathematics 8 (4) 2010, s. 662–682.zobacz w PBN
• Diego Figueira, Piotr Hofman i Sławomir Lasota, Relating timed and register automata, w: Proc. Express'2010, 2010.zobacz w PBN
• Andrzej Piotr Janusz, Combining Multiple Classification or Regression Models Using Genetic Algorithms, w: Proceedings of RSCTC 2010, 2010, s. 130–137.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, w: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Springer, 2010, s. 147–158.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, The lower and the upper systems of rules in tables with missing values, w: Database Theory and Application, Bio-Science and Bio-Technology (DTA/BSBT) 2010, Springer, Heidelberg 2010.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, Tractable Approximate Knowledge Fusion Using the Horn Fragment of Serial Propositional Dynamic Logic, International Journal Of Approximate Reasoning 51 (3) 2010, s. 346–362.zobacz w PBN
• Marek Cygan, Łukasz Kowalik i Borut Luzar, A Planar Linear Arboricity Conjecture, Lecture Notes In Computer Science 6078 2010, s. 204–216.zobacz w PBN
• Daria Walukiewicz-Chrząszcz i Jacek Chrząszcz, Inductive Consequences in the Calculus of Constructions, Lecture Notes In Computer Science 6172 2010, s. 450–465.zobacz w PBN
• Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota i Zdenek Sawa, Non-interleaving bisimulation equivalences on Basic Parallel Processes, Information And Computation 208 (1) 2010, s. 42–62.zobacz w PBN
• Krzysztof Rządca, Adam Wierzbicki, Anwaitaman Datta i Łukasz Żaczek, Supporting Collaboration and Creativity Through Mobile P2P Computing, w: Handbook of Peer-to-Peer Networking, 2010, s. 1367–1400.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, On the Correctness of Rough-Set Based Approximate Reasoning, Lecture Notes In Computer Science 6086 2010, s. 327–336.zobacz w PBN
• Andrzej Piotr Janusz, Discovering Rules-based Similarity in Microarray Data, w: Proc. of Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2010), 2010, s. 49–58.zobacz w PBN
• Tai-hoon Kim, Haeng-kon Kim, Muhammad Khurram Khan, Akingbehin Kiumi i Dominik Ślęzak (red.), ASEA, Advances in Software Engineering, International Conference, ASEA 2010, Held as Part of the Future Generation Information Technology Conference. Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010. p. 1-336., Springer, Heidelberg 2010.zobacz w PBN
• Dominik Ślęzak i Marcin Kowalski, Towards approximate SQL - Infobright's approach, w: RSCTC 2010, Rough Sets and Current Trends in Computing, Springer, Heidelberg 2010.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge, Teamwork in Multi-Agent Systems: A Formal Approach, Wiley and Sons, 2010.zobacz w PBN
• Eryk Kopczyński, Igor Pak i Piotr Przytycki, Acute triangulations of polyhedra and the Euclidean space, w: Symposium on Computational Geometry, 2010.zobacz w PBN
• Claire David, Leonid Libkin i Filip Murlak, Certain answers for XML queries, w: PODS, 2010.zobacz w PBN
• Piotr Sankowski i Marcin Mucha, Fast Dynamic Transitive Closure with Lookahead, Algorithmica 56 (2) 2010, s. 180–197.zobacz w PBN
• Marcin Balcerzak i Damian Niwiński, Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal, Information Processing Letters 110 (10) 2010, s. 396–398.zobacz w PBN
• Jacek Sroka, P. Włodarczyk, L. Krupa i J. Hidders, DFL designer: collection-oriented scientific workflows with Petri nets and nested relational calculus, w: WANDS, 2010.zobacz w PBN
• Hitomi Okuma, Michinori Nakata, Dominik Ślęzak i Hiroshi Sakai, An overview of decision making in rough non-deterministic information analysis., w: Nature and Biologically Inspired Computing (NaBIC) 2010, Kitakyushu, Japan. 2010.zobacz w PBN
• Tai-Hoon Kim, Jianhua Ma, Wai-Chi Fang, Byungjoo Park i Dominik Ślęzak (red.), FGIT, U- and E-Service, Science and Technology, International Conference, UNESST 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, p.1-232, Springer, Heidelberg 2010.zobacz w PBN
• Bartosz Klin i Paweł Sobociński (red.), Proc. 6th Int. Workshop on Structural Operational Semantics, EPTCS, Australia 2010.zobacz w PBN
• Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, s. 299–309.zobacz w PBN
• Mikołaj Bojańczyk, Automata for Data Words and Data Trees, w: RTA, 2010.zobacz w PBN
• Łukasz Kowalik, Fast 3-coloring Triangle-Free Planar Graphs, Algorithmica 58 (3) 2010, s. 770–789.zobacz w PBN
• Jacek Sroka, Jan Hidders, Paolo Missier i Carole A. Goble, A formal semantics for the Taverna 2 workflow model, Journal Of Computer And System Sciences 76 (6) 2010, s. 490–508.zobacz w PBN
• Bartosz Wilczyński i Eileen EM Furlong, Dynamic CRM occupancy reflects a temporal map of developmental progression, Molecular Systems Biology 6 2010.zobacz w PBN
• Marcin S. Szczuka (red.), Proceedings of RSCTC 2010, 2010.zobacz w PBN
• B. Wilczyński i T.R. Hvidste, A Computer Scientist's Guide to the Regulatory Genome, Fundamenta Informaticae Vol. 103, nr 1-4 2010, s. 323–332.zobacz w PBN
• Gloria Virginia i Hung Son Nguyen, Automatic ontology constructor for indonesian language, w: Proc. 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2010), IEEE Press, USA, Canada 2010.zobacz w PBN
• Daryl Hepting, Dominik Ślęzak i Richard Spring, Validation of classifiers for facial photograph sorting performance, w: Signal Processing and Multimedia (SIP/MulGraB) 2010, Springer, Heidelberg 2010.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, Graded Beliefs, Goals and Intentions, w: LAMAS, 2010.zobacz w PBN
• Talal Rahwan, Tomasz P. Michałak, Madalina Croitoru, Jacek Sroka i Nicholas R. Jennings, A Network Flow Approach to Coalitional Games, w: ECAI, 2010.zobacz w PBN
• Ken-etsu Fujita i Aleksy Schubert, The Undecidability of Type Related Problems in Type-free Style System F, w: RTA, 2010.zobacz w PBN
• Michał Woźniak, Jerzy Tiuryn i Janusz Dutkowski, MODEVO: exploring modularity and evolution of protein interaction networks, Bioinformatics 26 (14) 2010, s. 1790–1791.zobacz w PBN
• Morten Heine Sorensen i Paweł Urzyczyn, A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic, Notre Dame Journal Of Formal Logic 51 (4) 2010, s. 457–473.zobacz w PBN
• Krzysztof Stencel, Wiktor Filipowicz, Piotr Habela i Krzysztof Kaczmarski, Code generation and transformation for visual queries in UML, w: Object Systems, 2010.zobacz w PBN
• Dominik Ślęzak i Graham Toppin, Injecting domain knowledge into a granular database engine: a position paper, Acm Computing Reviews 2010, s. 1913–1916.zobacz w PBN
• Daryl H. Hepting, Richard Spring, Timothy Maciag, Katherine Arbuthnott i Dominik Ślęzak, Classification of facial photograph sorting performance based on verbal descriptions, w: RSCTC 2010, Rough Sets and Current Trends in Computing, Springer, Heidelberg 2010.zobacz w PBN
• Gloria Virginia i Hung Son Nguyen, Developing an automatic ontology constructor for bahasa indonesia using cognitive approach: A proposal, w: Proc. Konferensi Nasional Teknologi Informasi dan Komunikasi 2010 (KNasTIK 2010), University of Yogyakarta, Japan 2010.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, A Layered Rule-Based Architecture for Approximate Knowledge Fusion, Computer Science And Information Systems 7 (3) 2010, s. 617–642.zobacz w PBN
• Marek Cygan, Łukasz Kowalik, Marcin Mucha, Marcin Pilipczuk i Piotr Sankowski, Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes In Computer Science 6346 2010, s. 72–83.zobacz w PBN
• Jerzy Tyszkiewicz, Spreadsheet as a relational database engine, w: SIGMOD Conference, 2010.zobacz w PBN
• Rok Erman, Łukasz Kowalik, Matjaz Krnc i Tomasz Waleń, Improved induced matchings in sparse graphs, Discrete Applied Mathematics 158 (18) 2010, s. 1994–2003.zobacz w PBN
• Marek Cygan i Marcin Pilipczuk, Exact and approximate bandwidth, Theoretical Computer Science 411 (40-42) 2010, s. 3701–3713.zobacz w PBN
• Krzysztof Stencel, Marta Burzańska, Patrycja Suchomska, Aneta Szumowska i Piotr Wiśniewski, Recursive Queries Using Object Relational Mapping, Lecture Notes In Computer Science 6485 2010, s. 42–50.zobacz w PBN
• Tai-hoon Kim, Thanos Vasilakos, Kouichi Sakurai, Yang Xiao i Dominik Ślęzak (red.), FGCN, Communication and Networking, International Conference, FGCN 2010, Part I, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, p.1-468, Springer, Heidelberg 2010.zobacz w PBN
• Wojciech Świeboda i Hung Son Nguyen, Mining large and sparse data sets with Rough Sets, w: Proc. Concurrency Specification and Programming (CS&P), Humboldt Universitaet zu Berlin, Berlin 2010.zobacz w PBN
• Glencora Borradaile, Piotr Sankowski i Christian Wulff-Nilsen, Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, w: FOCS, 2010.zobacz w PBN
• Jakub Radoszewski i Wojciech Rytter, Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup, Lecture Notes In Computer Science 5901 2010, s. 663–671.zobacz w PBN
• Łukasz Kowalik, Borut Luzar i Riste Skrekovski, An improved bound on the largest induced forests for triangle-free planar graphs, Discrete Mathematics And Theoretical Computer Science 12 (1) 2010, s. 87–100.zobacz w PBN
• Konrad Iwanicki i Maarten van Steen, Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets, Ieee Transactions On Parallel And Distributed Systems 21 (4) 2010, s. 562–576.zobacz w PBN
• Krzysztof Stencel, Piotr Przymus, Aleksandra Boniewicz i Marta Burzańska, Recursive Query Facilities in Relational Databases: A Survey, w: DTA and BSBT, 2010.zobacz w PBN
• Paweł Parys, Some Results on Complexity of Mu-Calculus Evaluation in the Black-Box Model, w: Logical Approaches to Barriers in Computing and Complexity, Greifswald 2010, s. 83–86.zobacz w PBN
• Tai-hoon Kim, Thanos Vasilakos, Kouichi Sakurai, Yang Xiao i Dominik Ślęzak (red.), FGCN, Communication and Networking, International Conference, FGCN 2010, Part II, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, p.1-246, Springer, Heidelberg 2010.zobacz w PBN
• Piotr Kwiatkowski, Sinh Hoa Nguyen i Hung Son Nguyen, On Scalability of Rough Set Methods, w: Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Methods - 13th International Conference, IPMU 2010, Dortmund, Germany, June 28, Springer, Heidelberg 2010.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Information systems in modeling interactive computations on granules, w: Systemy Wspomagania Decyzji, Uniwersytet Śląski, Katowice 2010.zobacz w PBN
• Wojciech Czerwiński i Sławomir Lasota, Fast equivalence-checking for normed context-free processes, w: FSTTCS, 2010.zobacz w PBN
• Krzysztof Diks i Piotr Stańczyk, Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time, Lecture Notes In Computer Science 5901 2010, s. 321–333.zobacz w PBN
• Jędrzej Fulara, Konrad Durnoga, Krzysztof Jakubczyk i Aleksy Schubert, Relational Abstract Domain of Weighted Hexagons, Electronic Notes In Theoretical Computer Science 267 (1) 2010, s. 59–72.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH, Lncs Transactions On Computational Collective Intelligence 1 2010, s. 21–38.zobacz w PBN
• Krzysztof Stencel, Marta Burzańska i Piotr Wiśniewski, Intermediate Structure Reduction Algorithms for Stack Based Query Languages, w: ASEA, 2010.zobacz w PBN
• Andrzej Komisarski, Henryk Michalewski i Paweł Milewski, Functions equivalent to Borel measurable ones, Bulletin Of The Polish Academy Of Sciences. Mathematics 58 (1) 2010, s. 55–64.zobacz w PBN
• Dominik Ślęzak, Compound analytics of compound data within RDBMS framework - Infobright's Perspective, w: Future Generation Information Technology (FGIT) 2010, Springer, Heidelberg 2010.zobacz w PBN
• Gloria Virginia i Hung Son Nguyen, Rough set in term relation analysis of indonesian language, w: Proc. Concurrency Specification and Programming (CS&P), Humboldt Universitaet zu Berlin, Berlin 2010.zobacz w PBN
• Tai-hoon Kim, Haeng-kon Kim, Muhammad Khurram Khan, Akingbehin Kiumi i Dominik Ślęzak, Advances in Software Engineering, International Conference, ASEA 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, 2010.zobacz w PBN
• Mikołaj Bojańczyk i Paweł Parys, Efficient Evaluation of Nondeterministic Automata Using Factorization Forests, Lecture Notes In Computer Science 6198 2010, s. 515–526.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes In Computer Science 5901 2010, s. 296–307.zobacz w PBN
• Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta i Michał Skrzypczak, On the Borel Complexity of MSO Definable Sets of Branches, Fundamenta Informaticae 98 (4) 2010, s. 337–349.zobacz w PBN
• Paweł Lenkiewicz i Krzysztof Stencel, Percentages of Rows Read by Queries as an Operational Database Quality Indicator, w: Advances in Intelligent Information and Database Systems, 2010, s. 17–27.zobacz w PBN
• Tai-hoon Kim, Jianhua Ma, Wai-chi Fang, Byungjoo Park, Byeong-Ho Kang i Dominik Ślęzak (red.), U- and E-Service, Science and Technology. International Conference UNESST 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010. Proceedings, Berlin Heidelberg 2010.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, An introduction to perception based computing. Proceedings of the Future Generation Information Technology - Second International Conference (FGIT 2010), Jeju Island, Korea, December 13-15, 2010, Lecture Notes In Computer Science 6485 2010, s. 12–25.zobacz w PBN
• Dominik Ślęzak i Sebastian Widz, Evolutionary inspired optimization of feature subset ensembles, w: Nature and Biologically Inspired Computing (NaBIC) 2010, IEEE Press, Kitakyushu, Japan 2010.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Scalable methods in Rough Sets, w: Proc. of the International Symposium on Integrated Uncertainty Management and Applications (IUM'2010, April 09-11, Ishikawa, Japan), Springer, Heidelberg 2010.zobacz w PBN
• Tai-hoon Kim, Alan Chin-Chen Chang, MingChu Li, Chunming Rong i Dominik Ślęzak, Communication and Networking, International Conference, FGCN 2010, Part I, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010, Springer, 2010.zobacz w PBN
• Mikołaj Bojańczyk i Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Logical Methods In Computer Science 6 (4) 2010, s. 1–26.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes In Computer Science 6393 2010, s. 258–269.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, A Framework for Graded Beliefs, Goals and Intentions, Fundamenta Informaticae 100 (1-4) 2010, s. 53–76.zobacz w PBN
• Marcelo Arenas, Pablo Barceló, Leonid Libkin i Filip Murlak, Relational and XML Data Exchange, Morgan & Claypool Publishers, 2010.zobacz w PBN
• Krzysztof Stencel, Michał Piotr Chromiak i Kazimierz Subieta, Indexing Distributed and Heterogeneous Resources, w: U- and E-Service, Science and Technology. International Conference UNESST 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010, Jeju Island, Korea, December 13-15, 2010. Proceedings, Berlin Heidelberg 2010, s. 214–223.zobacz w PBN
• Szczepan Hummel, Michał Paweł Skrzypczak i Szymon Toruńczyk, On the Topological Complexity of MSO+U and Related Automata Models, w: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, Springer, Brno 2010, s. 429–440.zobacz w PBN

2009

• Tomasz Michalak, Jacek Sroka, Michael Wooldridge i Peter McBurney, On distributing coalition structure generation, w: Workshop on Concurrency, Specification, and Programming (CS&P), 2009.zobacz w PBN
• Wojciech Czerwiński, Sibylle B. Fröschle i Sławomir Lasota, Partially-Commutative Context-Free Processes, Lecture Notes In Computer Science 5710 2009, s. 259–273.zobacz w PBN
• Jakub Pawlewicz i Mihai Patrascu, Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons, Algorithmica 55 (2) 2009, s. 271–282.zobacz w PBN
• Marek Biskup i Wojciech Plandowski, Shortest synchronizing strings for Huffman codes, Theoretical Computer Science 410 (38-40) 2009, s. 3925–3941.zobacz w PBN
• Daryl H. Hepting, Timothy Maciag, Richard Spring, Katherine Arbuthnott i Dominik Ślęzak, A rough sets approach for personalized support of face recognition, Lecture Notes In Computer Science 5908 2009, s. 201–208.zobacz w PBN
• L. Arge, Ch. Cachin i Andrzej Tarlecki (red.), Special issue on Automata, Languages and Programming (ICALP 2007), Elsevier, Amsterdam 2009.zobacz w PBN
• Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz i Jan Van den Bussche, Database Query Processing Using Finite Cursor Machines, Theory Of Computing Systems 44 (4) 2009, s. 533–560.zobacz w PBN
• T. Poranen, V. Dagiene, A. Eldhuset, H. Hyyro, Marcin Kubica, A. Laaksonen, M. Opmanis, W. Pohl, J. Skupiene, P. Soderhjelm i A. Truu, Baltic Olympiads in Informatics: Challenges for Training Together, Olympiads In Informatics 3 2009, s. 112–131.zobacz w PBN
• Bartosz Wilczyński i Norbert Dojer, BNFinder: Exact and efficient method for learning Bayesian networks, Bioinformatics 25 (2) 2009, s. 286–287.zobacz w PBN
• Jacques Duparc, Alessandro Facchini i Filip Murlak, Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata, Lecture Notes In Computer Science 5771 2009, s. 225–239.zobacz w PBN
• Bartosz Wilczyński, Norbert Dojer, Mateusz Patelak i Jerzy Tiuryn, Finding evolutionarily conserved cis-regulatory modules with a universal set of motifs, Bmc Bioinformatics 10 2009, s. 82.zobacz w PBN
• Elena Czeizler i Wojciech Plandowski, On systems of word equations over three unknowns with at most six occurrences of one of the unknowns, Theoretical Computer Science 410 (30-32) 2009, s. 2889–2909.zobacz w PBN
• Hiroshi Sakai, Kohei Hayashi, Michinori Nakata i Dominik Ślęzak, The lower system, the upper system and rules with stability factor in non-deterministic information systems, Lecture Notes In Computer Science 5908 2009, s. 313–320.zobacz w PBN
• Bartosz Klin, Bialgebraic methods and modal logic in structural operational semantics, Information And Computation 207 (2) 2009, s. 237–257.zobacz w PBN
• Piotr Sankowski, Maximum weight bipartite matching in matrix multiplication time, Theoretical Computer Science 410 (44) 2009, s. 4480–4488.zobacz w PBN
• Dov M. Gabbay i Andrzej Szałas, Voting by Eliminating Quantifiers, Studia Logica 92 (3) 2009, s. 365–379.zobacz w PBN
• Piotr Sankowski i Perła Kacman, Modeling of Tunneling Magnetoresistance in (Ga, Mn) As-TRILAYERS, International Journal Of Modern Physics B 23 (12-13) 2009, s. 2969–2973.zobacz w PBN
• J. Sroka i J. Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I, Fundamenta Informaticae Vol. 92, nr 3 2009, s. 279–299.zobacz w PBN
• Szczepan Hummel, Henryk Michalewski i Damian Niwiński, On the Borel inseparability of game tree languages, w: 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, February 26 - 28, 2009, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2009.zobacz w PBN
• Mikołaj Bojańczyk, Algebra for Tree Languages, Lecture Notes In Computer Science 5771 2009, s. 1.zobacz w PBN
• Peter J. A. Cock, Tiago Antao, Jeffrey T. Chang, Brad A. Chapman, Cymon J. Cox, Andrew Dalke, Iddo Friedberg, Thomas Hamelryck, Frank Kauff, Bartosz Wilczyński i Michiel J. L. de Hoon, Biopython: freely available Python tools for computational molecular biology and bioinformatics., Bioinformatics 25 (11) 2009, s. 1422–1423.zobacz w PBN
• Paweł Baturo i Wojciech Rytter, Compressed string-matching in standard Sturmian words, Theoretical Computer Science 410 (30-32) 2009, s. 2804–2810.zobacz w PBN
• Dominik Ślęzak i Hiroshi Sakai, Automatic extraction of decision rules from non-deterministic data systems: Theoretical foundations and SQL-based implementation, w: DTA, Springer, 2009.zobacz w PBN
• Bartosz Klin, Structural operational semantics for weighted transition systems, Lecture Notes In Computer Science 5700 2009, s. 121–139.zobacz w PBN
• Bartosz Wilczyński i Eileen Furlong, Challenges for modeling global gene regulatory networks during development: Insights from Drosophila, Developmental Biology 10 (2) 2009, s. 32.zobacz w PBN
• Dov M. Gabbay i Andrzej Szałas, Annotation Theories over Finite Graphs, Studia Logica 93 (2-3) 2009, s. 147–180.zobacz w PBN
• J. Sroka i J. Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II, Fundamenta Informaticae Vol. 92, nr 4 2009, s. 373–396.zobacz w PBN
• Bogusław Kluge, Anna Gambin i Wojciech Niemiro, Modeling Exopeptidase Activity from LC-MS Data, Journal Of Computational Biology 16 (2) 2009, s. 395–406.zobacz w PBN
• Marek Biskup i Wojciech Plandowski, Guaranteed Synchronization of Huffman Codes with Known Position of Decoder, w: DCC, 2009.zobacz w PBN
• Sibylle B. Fröschle i Sławomir Lasota, Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences, Electronic Notes In Theoretical Computer Science 239 2009, s. 17–42.zobacz w PBN
• Paweł Parys i Igor Walukiewicz, Weak Alternating Timed Automata, Lecture Notes In Computer Science 5555 2009, s. 273–284.zobacz w PBN
• Mihir K. Chakraborty, Aboul Ella Hassanien, Hiroshi Sakai, William Zhu i Dominik Ślęzak (red.), Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 12th International Conference, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2009.zobacz w PBN
• Mikołaj Bojańczyk, Two-Way Unary Temporal Logic over Trees, Logical Methods In Computer Science 5 (3) 2009, s. 1–29.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge (red.), Formal Approaches to Multi-Agent systems, Springer, Berlin Heidelberg 2009.zobacz w PBN
• Marcin Andrychowicz, Marcin Kubica i Jakub Radoszewski (red.), XVI Olimpiada Informatyczna 2008/2009, Komitet Główny Olimpiady Informatycznej, Warszawa 2009.zobacz w PBN
• Anh Linh Nguyen, An Efficient Tableau Prover using Global Caching for the Description Logic ALC, Fundamenta Informaticae 93 (1-3) 2009, s. 273–288.zobacz w PBN
• Jakub Karczmarski, Anna Gambin, Marta Łuksza, Jerzy Ostrowski i Bogusław Kluge, Two-Stage Model-Based Clustering for Liquid Chromatography Mass Spectrometry Data Analysis, Statistical Applications In Genetics And Molecular Biology 8 (1) 2009, s. 1–37.zobacz w PBN
• Markku Laine i Wojciech Plandowski, Word Equations with One Unknown, w: Developments in Language Theory, 2009.zobacz w PBN
• Aleksy Schubert i Daria Walukiewicz-Chrząszcz, The Non-Interference Protection in BML, Electronic Notes In Theoretical Computer Science 253 (5) 2009, s. 113–127.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science 410 2009, s. 5000–5009.zobacz w PBN
• B.-H. Kang, T.-H. Kim, A. Stoica i Dominik Ślęzak (red.), Control and Automation, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Mikołaj Bojańczyk i Szymon Toruńczyk, Deterministic Automata and Extensions of Weak MSO, w: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, Leibniz-Zentrum fuer Informatik, Dagstuhl 2009.zobacz w PBN
• Aleksy Schubert, Jacek Chrząszcz i Marieke Huisman, BML and Related Tools, Lecture Notes In Computer Science 5751 2009, s. 278–297.zobacz w PBN
• Piotr Habela i Krzysztof Stencel, WWW. Narzędzia, metody, standardy, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 2009.zobacz w PBN
• Paweł Parys, Lower Bound for Evaluation of mu-nu Fixpoint, w: 6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, 12-13 September 2009, Proceedings, 2009.zobacz w PBN
• Adam Krawczyk, Witold Marciszewski i Henryk Michalewski, Remarks on the set of G_δ-points in Eberlein and Corson compact spaces, Topology And Its Applications 156 2009, s. 1746–1748.zobacz w PBN
• Mikołaj Bojańczyk, Howard Straubing i Igor Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, w: LICS, IEEE Computer Society, Los Angeles 2009.zobacz w PBN
• Jacek Sroka i Jan Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I, Fundamenta Informaticae 92 (3) 2009, s. 279–299.zobacz w PBN
• Rok Erman, Łukasz Kowalik, Matjaz Krnc i Tomasz Waleń, Improved Induced Matchings in Sparse Graphs, Lecture Notes In Computer Science 5917 2009, s. 134–148.zobacz w PBN
• Y. Ma, Y. Chung, T.-H. Kim, Y. Zhang i Dominik Ślęzak (red.), Database Theory and Application, International Conference, DTA 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Till Mossakowski i Andrzej Tarlecki, Heterogeneous Logical Environments for Distributed Specifications, Lecture Notes In Computer Science 5486 2009, s. 266–289.zobacz w PBN
• Maxime Crochemore, Lucian Ilie i Wojciech Rytter, Repetitions in strings: Algorithms and combinatorics, Theoretical Computer Science 410 (50) 2009, s. 5227–5235.zobacz w PBN
• Linh Anh Nguyen i Andrzej Szałas, A Tableau Calculus for Regular Grammar Logics with Converse, Lecture Notes In Computer Science 5663 2009, s. 421–436.zobacz w PBN
• Patrycja Węgrzynowicz i Krzysztof Stencel, The good, the bad, and the ugly: three ways to use a semantic code query system, w: OOPSLA Companion, ACM, Florida 2009.zobacz w PBN
• Jacek Sroka i Jan Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II, Fundamenta Informaticae 92 (4) 2009, s. 373–396.zobacz w PBN
• Paweł Parys, XPath Evaluation in Linear Time With Polynomial Combined Complexity, w: PODS, ACM, Providence 2009.zobacz w PBN
• O. Gervasi, B.-H. Kang, T.-H. Kim, S.S.T. Yau i Dominik Ślęzak (red.), Grid and Distributed Computing, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Marcin Kubica i Tomasz Waleń, Improved Algorithm for Rhythm Recognition in Musical Sequences, w: London Algorithmics 2008: Theory and Practice, College Publications, London 2009.zobacz w PBN
• Marcin Piątkowski i Wojciech Rytter, Usefullness of directed acyclic graphs in problems related to standard Sturmian words, International Journal Of Foundations Of Computer Science 20 (6) 2009, s. 1005–1023.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, Fusing Approximate Knowledge from Distributed Sources, w: IDC 2009, 3rd International Symposium on Intelligent Distributed Computing, Springer-Verlag, 2009.zobacz w PBN
• Leonid Libkin, Filip Murlak i Shun'ichi Amano, XML schema mappings, w: PODS, 2009.zobacz w PBN
• Leszek Gasieniec, Mirosław Kowaluk i Andrzej Lingas, Faster multi-witnesses for Boolean matrix multiplication, Information Processing Letters 109 (4) 2009, s. 242–247.zobacz w PBN
• Marta Burzańska, Krzysztof Stencel i Piotr Wiśniewski, Pushing Predicates into Recursive SQL Common Table Expressions, Lecture Notes In Computer Science 5739 2009, s. 194–205.zobacz w PBN
• W.C. Fang, F.E Sandnes, B.-H Kang, B. Gu, T.-H Kim, J. Ma i Dominik Ślęzak (red.), U- and E-Service, Science and Technology, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Michał Bleja, Krzysztof Stencel i Kazimierz Subieta, Optimization of Object-Oriented Queries Addressing Large and Small Collections, w: Proceedings of the International Multiconference on Computer Science and Information Technology, Mrągowo 2009, s. 643–650.zobacz w PBN
• Jeremie Cabessa, Jacques Duparc, Alessandro Facchini i Filip Murlak, The Wadge Hierarchy of Max-Regular Languages, w: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2009.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, An Optimal Tableau Decision Procedure for Converse-PDL, w: KSE 2009, 1st International Conference on Knowlegde and Systems Engineering, IEEE Computer Society, 2009.zobacz w PBN
• Aleksy Schubert, The Existential Fragment of the One-Step Parallel Rewriting Theory, Lecture Notes In Computer Science 5595 2009, s. 78–92.zobacz w PBN
• Marek Cygan, Łukasz Kowalik i Mateusz Wykurz, Exponential-time approximation of weighted set cover, Information Processing Letters 109 (16) 2009, s. 957–961.zobacz w PBN
• Anna Gambin, D. Grzebelus, M. Gładysz, A. Macko-Podgórni, T. Gambin, B. Golis i R. Rakoczy, Population dynamics of miniature inverted-repeat transposable elements (MITEs) in Medicago truncatula, Gene 448 (2) 2009, s. 214–220.zobacz w PBN
• J. Gu, B.-H. Kang, H. Kuroda, S. Pal i Dominik Ślęzak (red.), Signal Processing, Image Processing and Pattern Recognition, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Anh Linh Nguyen, Modal Logic Programming Revisited, Journal Of Applied Non-classical Logics 19 (2) 2009, s. 167–181.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC, Lecture Notes In Computer Science 5796 2009, s. 473–488.zobacz w PBN
• James F. Peters i Piotr Wasilewski, Foundations of Near Sets, Information Sciences 179 2009, s. 3091–3109.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, w: CS&P 2009, the 18th Concurrency, Specification and Programming Workshop, 2009.zobacz w PBN
• Tomasz P. Michałak, Talal Rahwan, Jacek Sroka, Andrew Dowell, Michael J. Wooldridge, Peter McBurney i Nicholas R. Jennings, On representing coalitional games with externalities, w: ACM Conference on Electronic Commerce, 2009.zobacz w PBN
• Gerold Jäger i Marcin Peczarski, The number of pessimistic guesses in Generalized Mastermind, Information Processing Letters 109 (12) 2009, s. 635–641.zobacz w PBN
• Andrzej Jankowski, Andrzej Skowron i Marcin Szczuka, Interactive granular computing in rightly judging systems, Lecture Notes In Computer Science 5589 2009, s. 1–16.zobacz w PBN
• W.I. Grosky, T.-H. Kim, B.-H. Kang, N. Pissinou, T.K. Shih i Dominik Ślęzak (red.), Multimedia, Computer Graphics and Broadcasting, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Rajeev Gore i Anh Linh Nguyen, Clausal Tableaux for Multimodal Logics of Belief, Fundamenta Informaticae 94 (1) 2009, s. 21–40.zobacz w PBN
• Alicja Szałas i Andrzej Szałas, Paraconsistent Reasoning with Words, Lecture Notes In Computer Science 5070 2009, s. 43–58.zobacz w PBN
• Dominik Ślęzak, Degrees of conditional (in)dependence: A framework for approximate Bayesian networks and examples related to the rough set-based feature selection, Information Sciences - Applications 179 (3) 2009, s. 197–209.zobacz w PBN
• Aida Vitória, Jan Małuszyński i Andrzej Szałas, Modeling and Reasoning with Paraconsistent Rough Sets, Fundamenta Informaticae 97 (4) 2009, s. 405–438.zobacz w PBN
• Mikołaj Bojańczyk, Weak MSO with the Unbounding Quantifier, w: STACS, 2009.zobacz w PBN
• Sławomir Lasota, EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters 109 (15) 2009, s. 850–855.zobacz w PBN
• Jan Bazan, Andrzej Skowron i Marcin Szczuka, An approach and tools for interactive classification of complex objects, w: 1st ISoLA Workshop: International Workshop on Modeling, Analyzing, Discovering Complex Biological Structures, June 4-5, 2009, Potsdam, Springer Verlag, Heidelberg 2009.zobacz w PBN
• K.P. Arnett, W. C. Fang, T.-H. Kim i Dominik Ślęzak (red.), Security Technology, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Anh Linh Nguyen, Extending the Description Horn Logic DHL, w: The 18th Concurrency, Specification and Programming Workshop, Uniwersytet Warszawski, Warszawa 2009.zobacz w PBN
• Mikołaj Bojańczyk, Factorization Forests, Lecture Notes In Computer Science 5583 2009, s. 1–17.zobacz w PBN
• Barbara Dunin-Kęplicz, Michał Ślizak i Rineke Verbrugge, Case-Study for TeamLog, a Theory of Teamwork, w: IDC 2009, 3rd International Symposium on Intelligent Distributed Computing, Springer-Verlag, 2009.zobacz w PBN
• Paweł Urzyczyn, Inhabitation of Low-Rank Intersection Types, Lecture Notes In Computer Science 5608 2009, s. 356–370.zobacz w PBN
• Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick i Luc Segoufin, Two-variable logic on data trees and XML reasoning, Journal Of The Acm 56 (3) 2009.zobacz w PBN
• Piotr Kwiatkowski i Hung Son Nguyen, Building Scalable Lazy Rough Classifiers, w: Recent Advances in Intelligent Information Systems, IPI PAN; Academic Publishing House, 2009.zobacz w PBN
• Wai-Chi Fang, Tai-Hoon Kim, Young-Hoon Lee i Dominik Ślęzak (red.), Future Generation Information Technology, First International Conference, Springer, Berlin, 2009.zobacz w PBN
• Fabio Arcella, Janina Mincer-Daszkiewicz i Simone Ravaioli, Web-services for Exchange of Data on Cooperation and Mobility between Higher Education Institutions, w: EUNIS 2009, The 15th International Conference of European University Information Systems, Universidade de Santiago de Compostela, Santiago de Compostela 2009, s. 76(abstract).zobacz w PBN
• R. Diaconescu, T. Mossakowski i Andrzej Tarlecki, What is a Logic Translation?, Logica Universalis 3 2009, s. 95–124.zobacz w PBN
• Anna Gambin, E. Szczurek, J. Dutkowski, M. Bakun i Michał Dadlez, Classification of peptide mass fingerprint data by novel no-regret boosting method, Computers In Biology And Medicine 39 2009, s. 460–473.zobacz w PBN
• Dariusz Grzebelus, Mirosława Gładysz, Alicja Macko-Podgórni, Tomasz Gambin, Barbara Golis, Roksana Rakoczy i Anna Gambin, Population dynamics of miniature inverted-repeat transposable elements (MITEs) in Medicago truncatula, Gene 448 2009, s. 214–220.zobacz w PBN
• Alexander Kurz, Marina Lenisa i Andrzej Tarlecki (red.), Third International Conference on Algebra and Coalgebra in Computer Science, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2009.zobacz w PBN
• Ken-etsu Fujita i Aleksy Schubert, Existential Type Systems with No Types in Terms, Lecture Notes In Computer Science 5608 2009, s. 112–126.zobacz w PBN
• Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter i Dora Souliou, Improved methods for extracting frequent itemsets from interim-support trees, Software-practice & Experience 39 (6) 2009, s. 551–571.zobacz w PBN
• Ludwik Czaja i Marcin Szczuka (red.), Concurrency, Specification and Programming (CS&P), volume 1 & 2, University of Warsaw, Warszawa 2009.zobacz w PBN
• J. Verner, S. Abrahao, T. Jiang, T.-H. Kim, A. Kiumi i Dominik Ślęzak (red.), Advances in Software Engineering and Its Applications, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Agata Janowska i Tomasz Uliński, Improved method of verifying Estelle with Verics, w: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'09), Uniwersytet Warszawski, Warszawa 2009.zobacz w PBN
• Anna Gambin, Ewa Szczurek, Janusz Dutkowski, Magda Bakun i Michał Dadlez, Classification of peptide mass fingerprint data by novel no-regret boosting method, Computers In Biology And Medicine 39 2009, s. 460–473.zobacz w PBN
• Rastislav Kralovic i Damian Niwiński (red.), 34th International Symposium on Mathematical Foundations of Computer Science, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2009.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes In Computer Science 5664 2009, s. 471–482.zobacz w PBN
• Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek i Gregory Kucherov, On Subset Seeds for Protein Alignment, Ieee-acm Transactions On Computational Biology And Bioinformatics 6 (3) 2009, s. 483–494.zobacz w PBN
• Marcin Szczuka i Ludwik Czaja, Approximation of loss and risk in granular context, w: CS&P 2009, the 18th Concurrency, Specification and Programming Worksho, University of Warsaw, Warszawa 2009.zobacz w PBN
• T. Arslan, W.C. Fang, T.-H. Kim, X. Song i Dominik Ślęzak (red.), Bio-Science and Bio-Technology, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Janusz Dutkowski i Jerzy Tiuryn, Phylogeny-guided interaction mapping in seven eukaryotes, Bmc Bioinformatics 10 2009, s. 393.zobacz w PBN
• Marcin Konrad Dziubiński, Debabrata Datta i Jaideep Roy, A location game on disjoint circles, International Game Theory Review 11 (4) 2009, s. 391–406.zobacz w PBN
• Marta Łuksza, Bogusław Kluge, Jerzy Ostrowski, Jakub Karczmarski i Anna Gambin, Two-Stage Model-Based Clustering for Liquid Chromatography Mass Spectrometry Data Analysis, Statistical Applications In Genetics And Molecular Biology 8 2009, s. 15.zobacz w PBN
• Katarzyna Paluch, Marcin Mucha i Aleksander Madry, A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem, Lecture Notes In Computer Science 5687 2009, s. 298–311.zobacz w PBN
• Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Subwords in a String, Lecture Notes In Computer Science 5874 2009, s. 345–355.zobacz w PBN
• Lars Arge, Christian Cachin i Andrzej Tarlecki, Preface, Theoretical Computer Science 410 (18) 2009.zobacz w PBN
• Marcin Szczuka, Approximation of loss and risk in selected granular systems, w: RSFDGrC 2009, Springer-Verlag, 2009.zobacz w PBN
• A.C.-C Chang, T.-H. Kim, M. Li, K. Sakurai, T. Vasilakos i Dominik Ślęzak (red.), Communication and Networking, International Conference, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009, Springer, Berlin 2009.zobacz w PBN
• Ewa Szczurek, Irit Gat-Viks, Jerzy Tiuryn i Martin Vingron, Elucidating regulatory mechanisms downstream of a signaling pathway using informative experiments, Molecular Systems Biology 10 2009, s. 82.zobacz w PBN
• M. Szot, A. Szczerbakow, K. Dybko, L. Kowalczyk, E. Smajek, V. Domukhovski, E. Łusakowska, P. Dziawa, A. Mycielski, T. Story, M. Bukała, M. Galicka, Piotr Sankowski, R. Buczko i P. Kacman, Experimental and Theoretical Analysis οf PbTe-CdTe Solid Solution Grown by Physical Vapour Transport Method, Acta Physica Polonica A 116 (5) 2009, s. 959–961.zobacz w PBN
• Mikołaj Bojańczyk i Tomasz Idziaszek, Algebra for Infinite Forests with an Application to the Temporal Logic EF, Lecture Notes In Computer Science 5710 2009, s. 131–145.zobacz w PBN
• Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, LPF Computation Revisited, Lecture Notes In Computer Science 5874 2009, s. 158–169.zobacz w PBN
• Łukasz Kowalik, Improved edge-coloring with three colors, Theoretical Computer Science 410 (38-40) 2009, s. 3733–3742.zobacz w PBN
• Dominik Ślęzak i Marcin Kowalski, Intelligent data granulation on load: Improving infobright's knowledge grid, Lecture Notes In Computer Science 5899 2009, s. 12–25.zobacz w PBN
• Chris Cornelis, Richard Jensen, German Hurtado i Dominik Ślęzak, Attribute selection with fuzzy decision reducts, Information Sciences 30 2009, s. 1–16.zobacz w PBN
• Markku Laine i Wojciech Plandowski, Word equations with one unknown, Lecture Notes In Computer Science 5583 2009, s. 348–359.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, On Word Equations in One Variable, Algorithmica 9375-3 2009, s. 3.zobacz w PBN

2008

• Marcin Szczuka, Approximate assessment of risk of classification systems in the presence of granularity, w: CS&P 2008 - Concurrency, Specification and Programing, Humboldt Universitaet zu Berlin, Berlin 2008.zobacz w PBN
• Wojciech Frączak, Wojciech Rytter i Mohammadreza Yazdani, Matching Integer Intervals by Minimal Sets of Binary Words with don't cares, Lecture Notes In Computer Science 5029 2008, s. 217–229.zobacz w PBN
• Filip Murlak, Weak index versus Borel rank, w: STACS, 2008.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription., w: KR: International Conference on the Principles of Knowledge Representation and Reasoning, AAAI Press, 2012, s. 560–570.zobacz w PBN
• Agata Janowska, Paweł Janowski i Wojciech Nabiałek, Timed Promela Semantics, w: CS&P, 2008.zobacz w PBN
• Anh Linh Nguyen, An Efficient Tableau Prover using Global Caching for the Description Logic ALC, w: CS&P, 2008.zobacz w PBN
• Marcin Szczuka, Risk assessment in granular environments, w: PRICAI 2008 - Pacific Rim International Conference on Artificial Intelligence, Institute of Information Technology, Vietnamese Academy of Sciences and Technology, Vietnam 2008.zobacz w PBN
• Johann A. Makowsky i Damian Niwiński, The Ackermann Award 2008, Lecture Notes In Computer Science 5213 2008, s. 508–512.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Johannes Nowak, A Path Cover Technique for LCAs in Dags, Lecture Notes In Computer Science 5124 2008, s. 222–233.zobacz w PBN
• Jan Hidders i Jacek Sroka, Towards a Calculus for Collection-Oriented Scientific Workflows with Side Effects., w: OTM Conferences, 2008.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Paweł Findeisen i Grzegorz Wolny, Time Distribution in Structural Workflow Nets, Fundamenta Informaticae 85 (1-4) 2008, s. 67–87.zobacz w PBN
• Patryk Czarnik i Aleksy Schubert, Extending Operational Semantics of the Java Bytecode, w: Trustworthy Global Computing, 2008, s. 57–72.zobacz w PBN
• Anna Gambin, Piotr Krzyżanowski i Piotr Pokarowski, Aggregation Algorithms for Perturbed Markov Chains with Applications to Networks Modeling, Siam Journal On Scientific Computing 31 (1) 2008, s. 45–73.zobacz w PBN
• Mikołaj Bojańczyk, The Common Fragment of ACTL and LTL, Lecture Notes In Computer Science 4962 2008, s. 172–185.zobacz w PBN
• Paweł Baturo, Marcin Piatkowski i Wojciech Rytter, The Number of Runs in Sturmian Words, w: CIAA, 2008.zobacz w PBN
• Krzysztof Stencel i Patrycja Węgrzynowicz, Implementation Variants of the Singleton Design Pattern., w: OTM Workshops, 2008.zobacz w PBN
• Edward Ochmański i Jerzy Tyszkiewicz (red.), Mathematical Foundations of Computer Science 2008, 33rd International Symposium, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2008.zobacz w PBN
• Sinh Hoa Nguyen, Thanh Nguyen i Hung Son Nguyen, A hybrid system for learning sunspot recognition and classification, w: Proceedings of International Conference on Concurrency, Specification and Programming 2008, Humboldt Universität zu Berlin, Berlin 2008.zobacz w PBN
• Gudmund Skovbjerg Frandsen i Piotr Sankowski, Dynamic Normal Forms and Dynamic Characteristic Polynomial, Lecture Notes In Computer Science 5125 2008, s. 434–446.zobacz w PBN
• Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek i Gregory Kucherov, Efficient Seeding Techniques for Protein Similarity Search, w: BIRD, 2008.zobacz w PBN
• Jean-Sebastien Sereni, Łukasz Kowalik i Riste Skrekovski, Total colouring of plane graphs with maximum degree nine, Siam Journal On Discrete Mathematics 22 (4) 2008, s. 1462––1479.zobacz w PBN
• Daria Walukiewicz-Chrząszcz i Jacek Chrząszcz, Consistency and completeness of rewriting in the Calculus of Constructions, Logical Methods In Computer Science 4 (3:8) 2008, s. 1–20.zobacz w PBN
• Karolina Majorek, Marcin Jąkalski, Janusz Bujnicki i Łukasz Kozłowski, First Steps of Protein Structure Prediction, w: Prediction of Protein Structures, Functions, and Interactions, 2008, s. 39–62.zobacz w PBN
• Anjana Mahanta i Hung Son Nguyen, Discovery by relation approximation, w: Proceedings of International Workshop on Soft Computing for Knowledge Technology - SCKT’2008(in conjunction with PRICAI 2008, Hanoi University of Technology, Hanoi 2008.zobacz w PBN
• Mikołaj Bojańczyk i Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Lecture Notes In Computer Science 5126 2008, s. 233–245.zobacz w PBN
• Mikołaj Bojańczyk, Tree-Walking Automata, Lecture Notes In Computer Science 5196 2008, s. 1–2.zobacz w PBN
• Jean Goubault-Larrecq, Sławomir Lasota i David Nowak, Logical Relations for Monadic Types, Mathematical Structures In Computer Science 18 (6) 2008, s. 1169–1217.zobacz w PBN
• Aleksy Schubert, On the building of affine retractions, Mathematical Structures In Computer Science 18 (4) 2008, s. 753–793.zobacz w PBN
• Piotr Hofman i Marcin Pilipczuk, A few new facts about the EKG sequence, Journal Of Integer Sequences 11 2008.zobacz w PBN
• Hung Son Nguyen i Tu Ho, Rough document clustering and the Internet, w: Handbook of Granular Computing, Wiley & Sons, New York 2008.zobacz w PBN
• Grzegorz Falda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Executable Platform Independent Models for Data Intensive Applications, Lecture Notes In Computer Science 5103 2008, s. 301–310.zobacz w PBN
• Jan Hidders, Natalia Kwaśnikowska, Jacek Sroka, Jerzy Tyszkiewicz i Jan Van den Bussche, DFL: A dataflow language based on Petri nets and nested relational calculus, Information Systems 33 (3) 2008, s. 261–284.zobacz w PBN
• Filip Murlak, The Wadge Hierarchy of Deterministic Tree Languages, Logical Methods In Computer Science 4 (4) 2008, s. 1–44.zobacz w PBN
• Aleksy Schubert, Krzysztof Jakubczyk i Jędrzej Fulara, Supplementing Java Bytecode with Specifications, w: Software Engineering Techniques in Progress, Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław 2008.zobacz w PBN
• Krzysztof Diks, Marcin Kubica, Jakub Radoszewski i Krzysztof Stencel, A Proposal for a Task Preparation Process, Olympiads In Informatics 2 2008, s. 64–74.zobacz w PBN
• Richard Cole i Łukasz Kowalik, New Linear-Time Algortihms for Edge-Coloring Planar Graphs, Algorithmica 50 (3) 2008, s. 351–368.zobacz w PBN
• Hung Son Nguyen i Andrzej Skowron, Rough set approach to KDD (Extended abstract), Lecture Notes In Computer Science 5009 2008, s. 19–20.zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, OCL as the Query Language for UML Model Execution, Lecture Notes In Computer Science 5103 2008, s. 311–320.zobacz w PBN
• Michel Bidoit, Donald Sannella i Andrzej Tarlecki, Observational interpretation of Casl specifications, Mathematical Structures In Computer Science 18 (2) 2008, s. 325–371.zobacz w PBN
• Janina Mincer-Daszkiewicz, International Cooperation and Mobility in Higher Education from IT Perspective, w: EUNIS 2008, The 14th International Conference of European University Information Systems, University of Aarhus, Aarhus, Dania 2008, s. 133(abstract).zobacz w PBN
• Tomasz Pieciukiewicz, Krzysztof Stencel i Kazimierz Subieta, Recursive Query Processing in SBQL, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 57–76.zobacz w PBN
• Marcin Szczuka, Towards approximation of risk, Lecture Notes In Computer Science 5306 2008, s. 320–328.zobacz w PBN
• Michał Adamaszek, Piotr Chrząstowski-Wachtel i Anna Niewiarowska, VIPER, a Student-Friendly Visual Interpreter of Pascal, Lecture Notes In Computer Science 5090 2008, s. 192–203.zobacz w PBN
• Piotr Sankowski, Processor Efficient Parallel Matching, Theory Of Computing Systems 42 (1) 2008, s. 73–90.zobacz w PBN
• Janina Mincer-Daszkiewicz, Zarządzanie tożsamością w systemach internetowych uczelni wyższych, w: Informatyczne Wspomaganie Zarządzania Uczelnią, 2008.zobacz w PBN
• Radosław Adamus, Michał Lentner, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Stack-Based Architecture andStack-Based Query Language, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 77–95.zobacz w PBN
• P Sankowski, Perla Kacman i Jacek Majewski, Modeling of bias anomaly in (Ga,Mn)As tunneling magnetoresistance structures, Journal Of Applied Physics 103 2008, s. 1–10.zobacz w PBN
• Krzysztof Diks i Jan Madey, From Top Coders to Top IT Professionals, Lecture Notes In Computer Science 5090 2008, s. 31–40.zobacz w PBN
• Marcin Peczarski, The Gold Partition Conjecture for 6-Thin Posets, Order-a Journal On The Theory Of Ordered Sets And Its Applications 25 (2) 2008, s. 91–103.zobacz w PBN
• Andrzej Szałas, Towards Incorporating Background Theories into Quantifier Elimination, Journal Of Applied Non-classical Logics 18 (2-3) 2008, s. 325–340.zobacz w PBN
• Radosław Adamus, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, SBQL Object Views - Unlimited Mapping and Updatability, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 119–140.zobacz w PBN
• Andrzej Piotr Janusz, Similarity Relation in Classification Problems, w: Proceedings of RSCTC 2008, 2008, s. 211–222.zobacz w PBN
• Piotr Sankowski, P. Kacman i J. A. Majewski, Self-consistent model of spin dependent tunneling in (Ga,Mn)As structures, Physica E-low-dimensional Systems & Nanostructures 40 (6) 2008, s. 1944–1946.zobacz w PBN
• Mikołaj Bojańczyk, Luc Segoufin i Howard Straubing, Piecewise Testable Tree Languages, w: LICS, 2008.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Colcombet, Tree-Walking Automata Do Not Recognize All Regular Languages, Siam Journal On Computing 38 (2) 2008, s. 658–701.zobacz w PBN
• Dov M. Gabbay, Renate Schmidt i Andrzej Szałas, Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications, College Publications, London, 2008.zobacz w PBN
• Grzegorz Fałda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Object Oriented Database Prototype as a Model Execution Engine for Executable UML, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 167–178.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Rough sets and granular computing in hierarchical learning, w: Handbook of Granular Computing, Wiley & Sons, New York 2008.zobacz w PBN
• Piotr Sankowski, Algebraic Graph Algorithms, Lecture Notes In Computer Science 5162 2008, s. 68–82.zobacz w PBN
• Dariusz R. Kowalski i Adam Malinowski, How to meet in anonymous network, Theoretical Computer Science 399 (1-2) 2008, s. 141–156.zobacz w PBN
• Paweł Parys, Systems of Equations Satisfied in All Commutative Finite Semigroups., w: FoSSaCS, 2008.zobacz w PBN
• Radosław Adamus, Marcin Daczkowski, Tomasz Kowalski, Michał Lentner, Tomasz Pieciukiewicz, Mariusz Trzaska, Tomasz Wardziak, Jacek Wiślicki, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Overview of the Project ODRA, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 179–197.zobacz w PBN
• Marek Stępień i Jerzy Paweł Tyszkiewicz, Computer Algorithm to Detect Similar Administrative Documents from the Ur III Archives, w: Proceedings of the 51st Rencontre Assyriologique International, Held at The Oriental Institute of The University of Chicago, July 18 – 22, 2005, Chicago 2008.zobacz w PBN
• Mikołaj Bojańczyk i Paweł Parys, XPath Evaluation in Linear Time, w: PODS, 2008.zobacz w PBN
• Sławomir Lasota i Igor Walukiewicz, Alternating timed automata, Acm Transactions On Computational Logic 9 (2) 2008.zobacz w PBN
• Paweł Urzyczyn i Morten Heine Soerensen, Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions, Journal Of Symbolic Logic 73 (3) 2008, s. 919–932.zobacz w PBN
• Grzegorz Fałda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Platform-Independent Programming of Data-Intensive Applications Using UML, Lecture Notes In Computer Science 5082 2008, s. 103–115.zobacz w PBN
• Krzysztof Stencel i Patrycja Węgrzynowicz, Visitor Pattern Revisited for Recognition, w: ADBIS (local proceedings), 2008.zobacz w PBN
• Jan Małuszyński, Andrzej Szałas i Aida Vitória, Paraconsistent Logic Programs with Four-Valued Rough Sets, Lecture Notes In Computer Science 5306 2008, s. 41–51.zobacz w PBN
• Maxime Crochemore i Wojciech Rytter, Squares and Repetitions, w: Encyclopedia of Algorithms, 2008.zobacz w PBN
• Piotr Sankowski, P. Kacman i J. A. Majewski, Modeling of bias anomaly in (Ga,Mn)As structures, Journal Of Applied Physics 103 (10) 2008, s. 103709–103702.zobacz w PBN
• Patrycja Węgrzynowicz i Krzysztof Stencel, Detection of Diverse Design Pattern Variants, w: APSEC, 2008.zobacz w PBN
• Agnieszka Kozubek i Paweł Urzyczyn, In the search of a naive type theory, Lecture Notes In Computer Science 4941 2008, s. 110–124.zobacz w PBN
• Piotr Wasilewski i Dominik Ślęzak, Foundations of Rough Sets from Vagueness Perspective, w: Rough Computing. Theories, Technologies and Applications, Information Science Reference, USA 2008.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, Deterministic 7/8-Approximation for the Metric Maximum TSP, w: APPROX-RANDOM, 2008.zobacz w PBN
• Aida Vitória, Andrzej Szałas i Jan Małuszyński, Four-Valued Extension of Rough Sets, Lecture Notes In Computer Science 5009 2008, s. 106–114.zobacz w PBN
• Marcin Mucha, Maximum Matching, w: Encyclopedia of Algorithms, 2008.zobacz w PBN
• Andrzej Tarlecki, T. Mossakowski, A. Haxthausen i D. Sannella, CASL --- The Common Algebraic Specification Language, w: Logics of Specification Languages, Springer, 2008.zobacz w PBN
• Jakub Radoszewski, Przemysława Kanarek i Adam Iwanicki (red.), XV Olimpiada Informatyczna 2007/2008, Komitet Główny Olimpiady Informatycznej, Warszawa 2008.zobacz w PBN
• Anh Linh Nguyen i Rajeev Gore, Analytic Cut-free Tableaux for Regular Modal Logics of Agent Beliefs, Lecture Notes In Computer Science 5056 2008, s. 268–287.zobacz w PBN
• Anh Linh Nguyen, Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics, Logic Journal Of The Igpl 16 (2) 2008, s. 175–193.zobacz w PBN
• Hung Son Nguyen i Andrzej Skowron, A rough granular computing in discovery of process models from data and domain knowledge, Journal Of Chongqing University Of Post And Telecommunications 20 (3) 2008, s. 341–347.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, Observability Concepts in Abstract Data Type Specification, 30 Years Later, w: Concurrency, Graphs and Models, 2008.zobacz w PBN
• Naveen Garg, Anupam Gupta, Stefano Leonardi i Piotr Sankowski, Stochastic analyses for online combinatorial optimization problems, w: SODA, 2008.zobacz w PBN
• Ewa Madalińska-Bugaj i Anh Linh Nguyen, Generalizing the QSQR Evaluation Method for Horn Knowledge Bases, w: New Challenges in Applied Intelligence Technologies, 2008.zobacz w PBN
• Agata Janowska, Paweł Janowski i Dobiesław Wróblewski, Translation of Intermediate Language to Timed Automata with Discrete Data, Fundamenta Informaticae 85 (1-4) 2008, s. 235–248.zobacz w PBN
• Jakub Radoszewski, Jakub Łącki i Marcin Kubica (red.), Baltic Olympiad in Informatics 2008, Task and Solutions, 2008.zobacz w PBN
• Hung Son Nguyen, Andrzej Skowron i Jaroslaw Stepaniuk, Discovery of changes along trajectories generated by process models induced from data and domain knowledge, w: Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P 2008), Gross Vaeter, Germany, September 29-October 1, 2008, Humboldt Universitaet zu Berlin, Berlin 2008.zobacz w PBN
• María Victoria Cengarle, Alexander Knapp, Andrzej Tarlecki i Martin Wirsing, A Heterogeneous Approach to UML Semantics, w: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2008.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman i Tomasz Waleń, Improved Algorithms for the Range Next Value Problem and Applications, w: STACS, 2008.zobacz w PBN
• Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski i Mohit Singh, Set Covering with our Eyes Closed., w: FOCS, 2008.zobacz w PBN
• Agata Janowska, Paweł Janowski i Wojciech Nabiałek, Translation of Timed Promela to Timed Automata with Discrete Data, Fundamenta Informaticae 85 (1-4) 2008, s. 409–424.zobacz w PBN
• Marcin Pilipczuk i Jakub Wojtaszczyk, The negative association property for the absolute values of random variables equidistributed on a gene ralized Orlicz ball, Positivity 12 2008, s. 421–474.zobacz w PBN
• Anh Linh Nguyen i Rajeev Gore, Sound Global Caching for Abstract Modal Tableaux, w: CS&P, 2008.zobacz w PBN

2007

• Kenneth Revett i Marcin Szczuka, Analysis of a Lymphoma/Leukemia Dataset Using Rough Sets, Lecture Notes In Computer Science 4413 2007, s. 229–239.zobacz w PBN
• Juhani Karhumaki, Yury Lifshits i Wojciech Rytter, Tiling Periodicity, Lecture Notes In Computer Science 4580 2007, s. 295–306.zobacz w PBN
• Mikołaj Bojańczyk, A new algorithm for testing if a regular language is locally threshold testable, Information Processing Letters 104 (3) 2007, s. 91–94.zobacz w PBN
• Jacek Chrząszcz i Daria Walukiewicz-Chrząszcz, Towards rewriting in Coq, Lecture Notes In Computer Science 4600 2007, s. 113–131.zobacz w PBN
• Wojciech Plandowski, Palindromes in Mathematics, w: XXth Symposium on Photonics Applications in Astronomy, Communications,Industry and High Energy Physics Applications, Warszawa 2007.zobacz w PBN
• Marcin Kubica, Powódź, w: XIV Olimpiada Informatyczna 2006/2007, Komitet Główny Olimpiady Informatycznej, Warszawa 2007.zobacz w PBN
• Anna Gambin, Janusz Dutkowski, Jakub Karczmarski, Bogusław Kluge, Krzysztof Kowalczyk, Jerzy Ostrowski, Jarosław Poznański, Jerzy Tiuryn, Magda Bakun i Michał Dadlez, Automated reduction and interpretation of multidimensional mass spectra for analysis of complex peptide mixtures, International Journal Of Mass Spectrometry 260 2007, s. 20–30.zobacz w PBN
• M. Dziubiński, R. Verbrugge i B. Dunin-Kęplicz, Complexity Issues in Multiagent Logics, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 239–262.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Hierarchical Rough Classifiers, Lecture Notes In Computer Science 4585 2007, s. 40–50.zobacz w PBN
• Costas Iliopoulos, M. Rahman i Wojciech Rytter, Algorithms for Two Versions of LCS Problem for Indeterminate Strings, w: 18th International Workshop on Combinatorial Algorithms, London 2007.zobacz w PBN
• Henrik Bjorklund i Mikołaj Bojańczyk, Bounded Depth Data Trees, Lecture Notes In Computer Science 4596 2007, s. 862–874.zobacz w PBN
• Artur Czumaj, Mirosław Kowaluk i Andrzej Lingas, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science 380 (1) 2007, s. 37–46.zobacz w PBN
• Rajeev Gore i Anh Linh Nguyen, EXPTIME Tableaux for ALC Using Sound Global Caching, w: Proceedings of Description Logics 2007, Bozen-Bolzano University Press, Bozen-Bolzano 2007.zobacz w PBN
• Marcin Kubica, Koleje, w: XIV Olimpiada Informatyczna 2006/2007, Komitet Główny Olimpiady Informatycznej, Warszawa 2007.zobacz w PBN
• Ł. Bolikowski i A. Gambin, New Metrics for Phylogenies, Fundamenta Informaticae Vol. 78, nr 2 2007, s. 199–216.zobacz w PBN
• Patrick Doherty, Witold Lukaszewicz i Andrzej Szałas, Communication between agents with heterogeneous perceptual capabilities, Information Fusion 8 (1) 2007, s. 56–69.zobacz w PBN
• Lars Arge, Christian Cachin, Tomasz Jurdziński i Andrzej Tarlecki (red.), Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings., Springer, 2007.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, Learning Concept Approximation from the pair-wise Space, w: Concurrency, Specification and Programming Workshop 2007, Zakład Graficzny Uniwersytetu Warszawskiego, Warszawa 2007.zobacz w PBN
• Wojciech Rytter, Parallel algorithms on strings, w: Handbook of Parallel Computing: Models, Algorithms and Applications, Chapman and Hall, Dordrecht 2007.zobacz w PBN
• Henrik Bjorklund i Mikołaj Bojańczyk, Shuffle Expressions and Words with Nested Data, Lecture Notes In Computer Science 4708 2007, s. 750–761.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication, Lecture Notes In Computer Science 4698 2007, s. 265–274.zobacz w PBN
• Krzysztof Diks, Marcin Kubica i Krzysztof Stencel, Polish Olympiad in Informatics - 14 Years of Experience, w: Olympiads in Informatics, Institute of Mathematics and Informatics, Lithuania 2007.zobacz w PBN
• Janina Mincer-Daszkiewicz, Dobór oprogramowania dla uczelni wyższych, w: Panel dyskusyjny "Neutralność technologiczna i byty pokrewne" Trzynaste Forum Teleinformatyki, Legionowo 2007.zobacz w PBN
• Jan Maluszynski, Andrzej Szałas i Aida Vitória, A Four-Valued Logic for Rough Set-Like Approximate Reasoning, Lecture Notes In Computer Science Transactions On Rough Sets 6 2007, s. 176–190.zobacz w PBN
• Jing Yao, Pawan Lingras, Wei-Zhi WU, Marcin Szczuka, Nick Cercone i Dominik Ślęzak (red.), Rough Sets and Knowledge Technology Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007, pp. 1-668, Springer, Heidelberg 2007.zobacz w PBN
• Wojciech Fraczak, Wojciech Rytter i Mohammadreza Yazdani, TCAM representations of intervals of integers encoded by binary trees, w: 18th International Workshop on Combinatorial Algorithms, College Publications, London 2007.zobacz w PBN
• Piotr Hoffman i Mikołaj Bojańczyk, Reachability in Unions of Commutative Rewriting Systems Is Decidable, Lecture Notes In Computer Science 4393 2007, s. 622–633.zobacz w PBN
• Eryk Kopczyński, Omega-Regular Half-positional winning conditions, Lecture Notes In Computer Science 4646 2007, s. 41–53.zobacz w PBN
• Janina Mincer-Daszkiewicz, Electronic Student Identity Cards at the University of Warsaw, w: Eunis 2007, The 13th International Conference of European University Information Systems, Grenoble 2007, s. 34.zobacz w PBN
• Marcin Szczuka, Daniel Howard, Dominik Ślęzak, Haeng-kon Kim, Tai-hoon Kim, Il-seok Ko, Geuk Lee i Peter M.A. Sloot (red.), Advances in Hybrid Information Technology: zbiór wybranych, poprawionych i rozszerzonych artykułów z konferencji ICHIT’2006, pp.1-668, Springer, Heidelberg 2007.zobacz w PBN
• Marcin Konrad Dziubiński, Rineke Verbrugge i Barbara Dunin-Kęplicz, Complexity issues in multiagent logics, Fundamenta Informaticae 75 (1) 2007, s. 239–262.zobacz w PBN
• Łukasz Kowalik, Adjacency Queries in Dynamic Sparse Graphs, Information Processing Letters 102 (5) 2007, s. 191–195.zobacz w PBN
• Agata Janowska i Wojciech Penczek, Path Compression in Timed Automata, Fundamenta Informaticae 79 (3-4) 2007, s. 379–399.zobacz w PBN
• Marek Stępień, Jerzy Tyszkiewicz i Wojciech Jaworski, Water transport in Sumer in the kingdom of the III Dynasty of Ur, w: Proceedings of the ECML/PKDD'2007 Discovery Challenge, Uniwersytet Warszawski, Warszawa 2007.zobacz w PBN
• P. Doherty i A. Szałas, A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 179–193.zobacz w PBN
• Hung Son Nguyen (red.), Proceedings of the ECML/PKDD 2007 Discovery Challenge Workshop during 18th European Conference on Machine Learning and 11th European Conference on Principles of Practice and Knowledge Discovery in Databases, Zakład Graficzny Uniwersytetu Warszawskiego, Warszawa 2007.zobacz w PBN
• P. Doherty, Barbara Dunin-Kęplicz i Andrzej Szałas, Dynamics of Approximate Information Fusion, Lecture Notes In Computer Science 4585 2007, s. 668–677.zobacz w PBN
• Richard Cole, Łukasz Kowalik i Riste Skrekovski, A Generalization of Kotzig's Theorem and its Application, Siam Journal On Discrete Mathematics 21 (1) 2007, s. 93–106.zobacz w PBN
• Jacques Duparc i Filip Murlak, On the topological complexity of weakly recognizable tree languages, Lecture Notes In Computer Science 4639 2007, s. 261–273.zobacz w PBN
• Agata Janowska i Paweł Janowski, Translation of Intermediate Language to Timed Automata with Discrete Data, w: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'07), Warszawa 2007.zobacz w PBN
• Marcin Grynberg, Li Zhanwen, Ewa Maria Szczurek i Adam Godzik, Putative type IV secretion genes in Bacillus anthracis, Trends In Microbiology 15 (5) 2007.zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Equivalence of simple functions, Theoretical Computer Science 376 (1) 2007, s. 42–51.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Towards Approximate BGI Systems, Lecture Notes In Computer Science 4696 2007, s. 277–287.zobacz w PBN
• Andre Arnold, Jacques Duparc, Filip Murlak i Damian Niwiński, On the topological complexity of tree languages, w: Logic and automata: History and Perspectives, Amsterdam University Press, Amsterdam 2007.zobacz w PBN
• Janusz Dutkowski i Anna Gambin, On consensus biomarker selection, Bmc Bioinformatics 8 (Suppl. 5) 2007, s. 1–13.zobacz w PBN
• Janina Mincer-Daszkiewicz, Na studia z KReM-em, Forum Akademickie 7-8 2007, s. 67–69.zobacz w PBN
• Wojciech Rytter, The number of runs in a string: improved analysis of the linear upper bound, Information And Computation 205 (9) 2007, s. 1459–1469.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge (red.), Proceedings of the Third Workshop on Formal Approaches to Multi-agent Systems, Durham University, Durham 2007.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality, Lecture Notes In Computer Science 4619 2007, s. 589–600.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physica Status Solidi C-conferences 4 (2) 2007, s. 493–496.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Paweł Findeisen i Grzegorz Wolny, Time Distribution in Structural Workflow Nets, w: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'07), Uniwersytet Warszawski, Warszawa 2007.zobacz w PBN
• Michał Drabikowski, Szymon Nowakowski i Jerzy Tiuryn, Library of Local Descriptors Models the Core of Proteins Accurately, Proteins-structure Function And Bioinformatics 69 (3) 2007, s. 499–510.zobacz w PBN
• Marcin Konrad Dziubiński, Rineke Verbrugge i Barbara Dunin-Kęplicz, Reducing the complexity of logics for multiagent systems, w: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems, ACM Press, New York, NY, USA 2007, s. 1082–1084.zobacz w PBN
• Anna Gambin i P. Wojtalewicz, CTX-BLAST - context sensitive version of protein BLAST, Bioinformatics 23 (13) 2007, s. 1686–1688.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Vertical spin transport in semiconductor heterostructures, Low Temperature Physics 33 2007, s. 187.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Why is Teaching Programming so Important and so Difficult?, w: Proceedings of conference DIDINFO 2007, University of Matej Bel, Banska Bystrica 2007.zobacz w PBN
• Jerzy Tiuryn i Damian Wójtowicz, Evolution of gene families based on gene duplication, loss, accumulated change, and innovation, Journal Of Computational Biology 14 (4) 2007, s. 479–495.zobacz w PBN
• Anna Gambin, Janusz Dutkowski, Jakub Karczmarski, Bogusław Kluge, Krzysztof Kowalczyk, Jerzy Ostrowski, Jarosław Poznański,