Publikacje

Instytut Informatyki

2016

• 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
• 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
• Łukasz Kowalik i Juho Lauri, On finding rainbow and colorful paths, Theoretical Computer Science 628 2016, s. 110–114.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
• 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
• 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
• Jakub Sygnowski i Henryk Michalewski, Learning from the Memory of Atari 2600, w: Computer Games, Springer International Publishing, 2016.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Michał Paweł Skrzypczak, Descriptive Set Theoretic Methods in Automata Theory - Decidability and Topological Complexity, Springer, 2016.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
• 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
• Ewa Maria Szczurek i Niko Beerenwinkel, Linear effects models of signaling pathways from combinatorial perturbation data., Bioinformatics 12 (32) 2016.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
• 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
• 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
• 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
• 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
• 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
• 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
• Tomasz Idziaszek i Jakub Jan Radoszewski (red.), XXII Olimpiada Informatyczna 2014/2015, Komitet Główny Olimpiady Informatycznej, Warszawa 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
• Jakub Pawlewicz i Ryan B. Hayward, Conspiracy number search with relative sibling scores, Theoretical Computer Science 644 2016, s. 127–142.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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 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
• 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
• 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
• 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
• 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
• 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
• Ludwik Czaja, Wojciech Penczek i Krzysztof Stencel, Preface, Fundamenta Informaticae 147 (2-3) 2016, s. i–iii.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
• 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
• 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
• 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
• 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
• Ł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
• 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
• 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
• 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
• 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
• Davide Ciucci, Dominik Ślęzak i Marcin Wolski, Preface, Fundamenta Informaticae 148 (1-2) 2016, s. v–vi.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
• Marek Adam Cygan, Lukasz Jez i Jiri Sgall, Online Knapsack Revisited, Theory Of Computing Systems 58 (1) 2016, s. 153–190.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Ł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
• 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
• 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
• Oskar Skibski, Rozbijanie sieci terrorystycznych za pomocą teorii gier, Delta 2016.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
• 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
• 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
• 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
• 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
• 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
• Paweł Parys, Weak Containment for Partial Words is coNP-Complete, Information Processing Letters 116 (2) 2016, s. 125–127.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
• 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
• Jarosław Andrzej Paszek i Paweł Górecki, Genomic duplication problems for unrooted gene trees, Bmc Genomics 17 (1) 2016.zobacz w PBN
• Jakub Pawlewicz, Myszy, Delta 2016.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
• 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
• 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
• 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
• Marcin Ireneusz Mucha i Piotr Sankowski, Maximum Matching, w: Encyclopedia of Algorithms, Springer, 2016, s. 1238–1240.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
• 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
• Andreas Bjorklund, Petteri Kaski i Łukasz Kowalik, Constrained Multilinear Detection and Generalized Graph Motifs, Algorithmica 74 (2) 2016, s. 947–967.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Michał Przybyłek, Logical systems I: Internal calculi, Journal Of Pure And Applied Algebra 221 (2) 2016, s. 449–489.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
• 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
• 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
• Damian Niwiński, Contribution of Warsaw Logicians to Computational Logic, Axioms 5 (2) 2016.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
• 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
• 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
• 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
• 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
• 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
• Paweł Urzyczyn, Intuitionistic Games: Determinacy, Completeness, and Normalization, Studia Logica 104 (5) 2016, s. 957–1001.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Paweł Parys, A Characterization of Lambda-Terms Transforming Numerals, Journal Of Functional Programming 26 2016, s. e12.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Łukasz Kozłowski, IPC – Isoelectric Point Calculator, Biology Direct 11 (1) 2016, s. 55.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
• 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
• 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
• 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
• 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
• 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