| ||
51. | Preface
FUNDAMENTA INFORMATICAE Tom 103 Nr 1-4 r. 2010, str. (Artykuł) Anna Gambin, Damian Niwiński, Paweł Urzyczyn | |
52. | Tiling Periodicity
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE Tom 12 Nr 2 r. 2010, str. 237-248 (Artykuł) Juhani Karhumäki, Yury Lifshits, Wojciech Rytter | |
53. | A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 5687 r. 2009, str. 298-311 (Artykuł) Katarzyna Paluch, Marcin Mucha, Aleksander Madry | |
54. | Classification of peptide mass fingerprint data by novel no-regret boosting method
COMPUTERS IN BIOLOGY AND MEDICINE Tom 39 Nr 5 r. 2009, str. 460-473 (Artykuł) Anna Gambin, Ewa Szczurek, Janusz Dutkowski, Michał Dadlez, Magda Bakun | |
55. | Classification of peptide mass fingerprint data by novel no-regret boosting method
COMPUTERS IN BIOLOGY AND MEDICINE Tom 39 r. 2009, str. 460-473 (Artykuł) Anna Gambin, E. Szczurek, J. Dutkowski, M. Bakun, Michał Dadlez | |
56. | Compressed string-matching in standard Sturmian words
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 30-32 r. 2009, str. 2804-2810 (Artykuł) Paweł Baturo, Wojciech Rytter | |
57. | Deterministic 7/8-approximation for the Metric Maximum TSP
THEORETICAL COMPUTER SCIENCE Tom 410 r. 2009, str. 5000-5009 (Artykuł) Łukasz Kowalik, Marcin Mucha | |
58. | Exponential-time approximation of weighted set cover
INFORMATION PROCESSING LETTERS Tom 109 Nr 16 r. 2009, str. 957-961 (Artykuł) Marek Cygan, Łukasz Kowalik, Mateusz Wykurz | |
59. | Faster multi-witnesses for Boolean matrix multiplication
INFORMATION PROCESSING LETTERS Tom 109 Nr 4 r. 2009, str. 242-247 (Artykuł) Leszek Gasieniec, Mirosław Kowaluk, Andrzej Lingas | |
60. | Improved edge-coloring with three colors
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 38-40 r. 2009, str. 3733-3742 (Artykuł) Łukasz Kowalik | |
61. | Improved Induced Matchings in Sparse Graphs
LECTURE NOTES IN COMPUTER SCIENCE Tom 5917 r. 2009, str. 134-148 (Artykuł) Rok Erman, Łukasz Kowalik, Matjaz Krnc, Tomasz Waleń | |
62. | Improved methods for extracting frequent itemsets from interim-support trees
SOFTWARE-PRACTICE & EXPERIENCE Tom 39 Nr 6 r. 2009, str. 551-571 (Artykuł) Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou | |
63. | LPF Computation Revisited
LECTURE NOTES IN COMPUTER SCIENCE Tom 5874 r. 2009, str. 158-169 (Artykuł) Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń | |
64. | Maximum weight bipartite matching in matrix multiplication time
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 44 r. 2009, str. 4480-4488 (Artykuł) Piotr Sankowski | |
65. | Modeling Exopeptidase Activity from LC-MS Data
JOURNAL OF COMPUTATIONAL BIOLOGY Tom 16 Nr 2 r. 2009, str. 395-406 (Artykuł) Bogusław Kluge, Anna Gambin, Wojciech Niemiro | |
66. | On Subset Seeds for Protein Alignment
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS Tom 6 Nr 3 r. 2009, str. 483-494 (Artykuł) Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov | |
67. | On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 30-32 r. 2009, str. 2889-2909 (Artykuł) Elena Czeizler, Wojciech Plandowski | |
68. | On the Maximal Number of Cubic Subwords in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 5874 r. 2009, str. 345-355 (Artykuł) Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
69. | On Word Equations in One Variable
[ LINK ]
ALGORITHMICA Tom 9375-3 r. 2009, str. 3-3 (Artykuł) Robert D±browski, Wojciech Plandowski | |
70. | Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons
ALGORITHMICA Tom 55 Nr 2 r. 2009, str. 271-282 (Artykuł) Jakub Pawlewicz, Mihai Patrascu | |
71. | Population dynamics of miniature inverted-repeat transposable elements (MITEs) in Medicago truncatula
GENE Tom 448 Nr 2 r. 2009, str. 214-220 (Artykuł) Anna Gambin, D. Grzebelus, M. Gładysz, A. Macko-Podgórni, T. Gambin, B. Golis, R. Rakoczy | |
72. | Repetitions in strings: Algorithms and combinatorics
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 50 r. 2009, str. 5227-5235 (Artykuł) Maxime Crochemore, Lucian Ilie, Wojciech Rytter | |
73. | Shortest synchronizing strings for Huffman codes
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 38-40 r. 2009, str. 3925-3941 (Artykuł) Marek Biskup, Wojciech Plandowski | |
74. | The number of pessimistic guesses in Generalized Mastermind
INFORMATION PROCESSING LETTERS Tom 109 Nr 12 r. 2009, str. 635-641 (Artykuł) Gerold Jäger, Marcin Peczarski | |
75. | Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
LECTURE NOTES IN COMPUTER SCIENCE Tom 5664 r. 2009, str. 471-482 (Artykuł) Łukasz Kowalik, Marcin Mucha |