Publications

Institute of Informatics

2011

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