| ||
| 26. | Polynomial-Time Approximation Algorithms for Weighted LCS Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 6661 r. 2011, str. 455-466 (Artykuł konferencyjny) Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 27. | Software Is a Directed Multigraph
LECTURE NOTES IN COMPUTER SCIENCE Tom 6903 r. 2011, str. 360-369 (Artykuł konferencyjny) Robert D±browski, Krzysztof Stencel, Grzegorz Timoszuk | |
| 28. | The number of pessimistic guesses in Generalized Black-peg Mastermind
INFORMATION PROCESSING LETTERS Tom 111 r. 2011, str. 933-940 (Artykuł) Gerold Jager, Marcin Peczarski | |
| 29. | Towards Optimal Play in Multi-Player Yahtzee
ICGA JOURNAL Tom 34 Nr 1 r. 2011, str. 7-21 (Artykuł) Jakub Pawlewicz | |
| 30. | Unique Small Subgraphs Are Not Easier to Find
LECTURE NOTES IN COMPUTER SCIENCE Tom 6638 r. 2011, str. 336-341 (Artykuł) Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell | |
| 31. | Word Equations with One Unknown
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Tom 22 Nr 2 r. 2011, str. 345-375 (Artykuł) Markku Laine, Wojciech Plandowski | |
| 32. | A Planar Linear Arboricity Conjecture
LECTURE NOTES IN COMPUTER SCIENCE Tom 6078 r. 2010, str. 204-216 (Artykuł) Marek Cygan, Łukasz Kowalik, Borut Luzar | |
| 33. | Algorithms for Three Versions of the Shortest Common Superstring Problem
LECTURE NOTES IN COMPUTER SCIENCE Tom 6129 r. 2010, str. 299-309 (Artykuł) Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 34. | An improved bound on the largest induced forests for triangle-free planar graphs
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE Tom 12 Nr 1 r. 2010, str. 87-100 (Artykuł) Łukasz Kowalik, Borut Luzar, Riste Skrekovski | |
| 35. | Approximating the Maximum 3- and 4-Edge-Colorable Subgraph
LECTURE NOTES IN COMPUTER SCIENCE Tom 6139 r. 2010, str. 395-407 (Artykuł) Marcin Kamiński, Łukasz Kowalik | |
| 36. | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
LECTURE NOTES IN COMPUTER SCIENCE Tom 5901 r. 2010, str. 296-307 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń | |
| 37. | Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup
LECTURE NOTES IN COMPUTER SCIENCE Tom 5901 r. 2010, str. 663-671 (Artykuł) Jakub Radoszewski, Wojciech Rytter | |
| 38. | Extracting Powers and Periods in a String from Its Runs Structure
LECTURE NOTES IN COMPUTER SCIENCE Tom 6393 r. 2010, str. 258-269 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 39. | Fast 3-coloring Triangle-Free Planar Graphs
ALGORITHMICA Tom 58 Nr 3 r. 2010, str. 770-789 (Artykuł) Łukasz Kowalik | |
| 40. | Fast Approximation in Subspaces by Doubling Metric Decomposition
LECTURE NOTES IN COMPUTER SCIENCE Tom 6346 r. 2010, str. 72-83 (Artykuł) Marek Cygan, Łukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski | |
| 41. | Fast Dynamic Transitive Closure with Lookahead
ALGORITHMICA Tom 56 Nr 2 r. 2010, str. 180-197 (Artykuł) Piotr Sankowski, Marcin Mucha | |
| 42. | Finding Patterns In Given Intervals
FUNDAMENTA INFORMATICAE Tom 101 Nr 3 r. 2010, str. 173-186 (Artykuł) Maxime Crochemore, Marcin Kubica, Tomasz Waleń, Costas S. Iliopoulos, M. Sohel Rahman | |
| 43. | Improved induced matchings in sparse graphs
DISCRETE APPLIED MATHEMATICS Tom 158 Nr 18 r. 2010, str. 1994-2003 (Artykuł) Rok Erman, Łukasz Kowalik, Matjaz Krnc, Tomasz Waleń | |
| 44. | Modeling Proteolysis from Mass Spectrometry Proteomic Data
FUNDAMENTA INFORMATICAE Tom 103 Nr 1-4 r. 2010, str. 89-104 (Artykuł) Anna Gambin, Bogusław Kluge | |
| 45. | Nearly Optimal Computer Play in Multi-player Yahtzee
LECTURE NOTES IN COMPUTER SCIENCE Tom 6515 r. 2010, str. 250-262 (Artykuł konferencyjny) Jakub Pawlewicz | |
| 46. | On the Maximal Number of Cubic Runs in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 6031 r. 2010, str. 227-238 (Artykuł) Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 47. | On the Maximal Sum of Exponents of Runs in a String
LECTURE NOTES IN COMPUTER SCIENCE Tom 6460 r. 2010, str. 10-19 (Artykuł konferencyjny) Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń | |
| 48. | Online Network Design with Outliers
LECTURE NOTES IN COMPUTER SCIENCE Tom 6198 r. 2010, str. 114-126 (Artykuł) Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski | |
| 49. | Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
LECTURE NOTES IN COMPUTER SCIENCE Tom 5901 r. 2010, str. 321-333 (Artykuł) Krzysztof Diks, Piotr Stańczyk | |
| 50. | Post Correspondence Problem with Partially Commutative Alphabets
LECTURE NOTES IN COMPUTER SCIENCE Tom 6031 r. 2010, str. 356-367 (Artykuł) Barbara Klunder, Wojciech Rytter | |