Publikacje

Instytut Informatyki

2012

• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Jakob Rehof i Paweł Urzyczyn, The Complexity of Inhabitation with Explicit Intersection, w: Logic and Program Semantics, Springer, Berlin 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
• 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
• 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
• 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
• 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
• Donald Sannella i Andrzej Tarlecki, Foundations of Algebraic Specification and Formal Software Development, Springer, Berlin 2012.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
• 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
• 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
• 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
• Mikołaj Bojańczyk, Luc Segoufin i Howard Straubing, Piecewise testable tree languages, Logical Methods In Computer Science 8 (3) 2012.zobacz w PBN
• Alexander Kartzow i Paweł Parys, Strictness of the Collapsible Pushdown Hierarchy, w: MFCS, 2010, s. 566–577.zobacz w PBN
• Dominik Ślęzak, Rough sets and FCA - scalability challenges, w: Formal Concept Analysis, Springer, Berlin 2012.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
• 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
• Stefan Dziembowski i Sebastian Faust, Leakage-Resilient Circuits without Computational Assumptions, w: TCC, 2012.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
• Vinicious Pinheiro, Krzysztof Rządca i Denis Trystram, Campaign Scheduling, w: IEEE International Conference on High Performance Computing (HiPC), Proceedings, 2012.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
• 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
• 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
• 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
• Marek Cygan i Marcin Pilipczuk, Even Faster Exact Bandwidth, Acm Transactions On Algorithms 8 (1) 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
• 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
• 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
• Boris Düdder, Moritz Martens, Jakob Rehof i Paweł Urzyczyn, Bounded Combinatory Logic, w: CSL, 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
• Ł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, 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
• 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
• 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, 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
• 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 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
• 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
• 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
• Paweł Parys, Variants of Collapsible Pushdown Systems, w: CSL, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011, s. 500–515.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
• 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
• 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
• 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
• Paweł Bednarz i Bartosz Wilczyński, Modeling Cell Populations in Development using Individual Stochastic Regulatory Networks, w: SIMULTECH, 2012.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 Stencel, Obiektowe i półstrukturalne bazy danych, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 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
• 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
• 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
• 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
• Son Thanh Cao i Anh Linh Nguyen, Query-Subquery Nets, Lecture Notes In Computer Science 7653 (1) 2012, s. 239–248.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
• 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
• Thierry Coquand, Anuj Dawar i Damian Niwiński, The Ackermann Award 2012, w: CSL, 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
• 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
• 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
• 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
• Mikołaj Bojańczyk, Algorithms for regular languages that use algebra, Siam Journal On Computing 41 (2) 2012, s. 5–14.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
• Andrzej Piotr Janusz, Combining multiple predictive models using genetic algorithms, Intelligent Data Analysis 16 (5) 2012, s. 763–776.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
• 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
• 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
• Jacek Chrząszcz i Aleksy Schubert, ML with PTIME complexity guarantees, 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
• Talal Rahwan, Tomasz Michalak i Nicholas R. Jennings, A Hybrid Algorithm for Coalition Structure Generation., w: AAAI, 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Marcin Mucha, 13/9-approximation for Graphic TSP, w: STACS, 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
• 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
• 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
• Ł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
• Georg Peters, Lingars Pawan, Dominik Ślęzak i Yiyo Yao (red.), Advanced Information and Knowledge Processing, Springer London, Londyn 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
• Andrzej Skowron i Piotr Wasilewski, Interactive information systems: Toward perception based computing, Theoretical Computer Science 454 2012, s. 240–260.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
• 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
• 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
• Piotr Wasilewski i Andrzej Skowron, A characterization of rough separability, w: Rough Sets and Knowledge Technology, Springer, Berlin 2012.zobacz w PBN
• Mikołaj Bojańczyk i Szymon Toruńczyk, Weak MSO+U over infinite trees, w: STACS, 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
• Paweł Parys, Higher-Order Pushdown Systems With Data, w: GandALF, 2012.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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Robert Dąbrowski, Krzysztof Stencel i Grzegorz Timoszuk, Improving software quality by improving architecture management, w: CompSysTech, 2012.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
• 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
• Tomasz Idziaszek, Marcin Kubica i Jakub Jan Radoszewski (red.), XIX Olimpiada Informatyczna 2011/2012, Komitet Główny Olimpiady Informatycznej, Warszawa 2012.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
• 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
• 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
• 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
• 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
• 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 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
• 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
• 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
• 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
• 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
• 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
• Marek Cygan i Marcin Pilipczuk, Bandwidth and distortion revisited, Discrete Applied Mathematics 160 (4-5) 2012, s. 494–504.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
• 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
• 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
• 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
• Andrzej Janusz, Dynamic rule-based similarity model for DNA microarray data, w: Transactions on Rough Sets XV, 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Ł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
• 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
• 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
• 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
• 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
• Mikołaj Bojańczyk i Szymon Toruńczyk, Imperative Programming in Sets with Atoms, w: FSTTCS, LIPICS, Dagstuhl 2012.zobacz w PBN
• Piotr Wasilewski i Andrzej Skowron, Interactive grammars: Toward perception based computing, w: Intelligent Decision Technologies, Springer, Berlin 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
• 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
• Anh Linh Nguyen i Hung Son Nguyen, On designing the SONCA system, Artificial Intelligence 2012, s. 9–36.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
• 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
• 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
• 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
• Anna Gambin, Anna Marciniak-Czochra i Damian Niwiński, Alan Turing and Systems Biology, Ercim News 2012 (91) 2012.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
• 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
• 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
• Marcin Szczuka i Dominik Ślęzak, Representation and evaluation of granular systems, w: Intelligent Decision Technologies, Springer, Berlin 2012.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
• 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
• Paweł Parys, On the Significance of the Collapse Operation, w: LICS, 2008, s. 521–530.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
• 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
• 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
• 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
• 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
• 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
• 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
• Marek Cygan, Deterministic Parameterized Connected Vertex Cover, w: Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Springer, 2012.zobacz w PBN
• Szymon Toruńczyk, Languages of Profinite Words and the Limitedness Problem, 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
• 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
• 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
• 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
• 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
• 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
• 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
• Marcin Peczarski, Towards optimal sorting of 16 elements, Acta Universitatis Sapientiae, Informatica 4 (2) 2012, s. 215––224.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
• Wojciech Czerwiński i Sławomir Lasota, Partially-commutative context-free languages, w: DCM, 2012.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
• Mikołaj Bojańczyk i Sławomir Lasota, A Machine-Independent Characterization of Timed Languages, w: ICALP (2), 2012.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
• 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
• 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
• Paweł Leszczyński i Krzysztof Stencel, Update Propagator for Joint Scalable Storage, Fundamenta Informaticae 119 (3-4) 2012, s. 337–355.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 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ł Parys i Igor Walukiewicz, Weak Alternating Timed Automata, Logical Methods In Computer Science 8 (3) 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
• 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
• Piotr Wiśniewski i Krzysztof Stencel, Universal Query Language, w: CS&P, 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
• Mikołaj Bojańczyk i Thomas Place, Toward Model Theory with Data Values, w: ICALP (2), 2012.zobacz w PBN
• Mikołaj Bojańczyk, Laurent Braud, Bartosz Klin i Sławomir Lasota, Towards nominal computation, w: POPL, 2012.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