| Discrete optimization algorithms: with Pascal programs MM Sysło, N Deo, JS Kowalik Prentice Hall, 1983; Dover, 2006;, 1983 | 662* | 1983 |
| Computer science in K-12 school curricula of the 2lst century: Why, what and when? M Webb, N Davis, T Bell, YJ Katz, N Reynolds, DP Chambers, MM Sysło Education and Information Technologies 22, 445-468, 2017 | 238 | 2017 |
| Algorytmy optymalizacji dyskretnej: z programami w języku Pascal MM Sysło, N Deo, JS Kowalik Wydawnictwo Naukowe PWN, 1999 | 149 | 1999 |
| Characterizations of outerplanar graphs MM Sysło Discrete Mathematics 26 (1), 47-53, 1979 | 115 | 1979 |
| The bandwidth of caterpillars with hairs of length 1 and 2 SF Assmann, GW Peck, MM Sysło, J Zak SIAM Journal on Algebraic Discrete Methods 2 (4), 387-393, 1981 | 100 | 1981 |
| Introducing a new computer science curriculum for all school levels in Poland MM Sysło, AB Kwiatkowska Informatics in Schools. Curricula, Competences, and Competitions: 8th …, 2015 | 67 | 2015 |
| An efficient cycle vector space algorithm for listing all cycles of a planar graph MM Sysło SIAM Journal on Computing 10 (4), 797-808, 1981 | 59 | 1981 |
| Minimizing the jump number for partially ordered sets: A graph-theoretic approach MM Sysło Order 1, 7-19, 1984 | 53 | 1984 |
| Informatics for all high school students: A computational thinking approach MM Sysło, AB Kwiatkowska Informatics in Schools. Sustainable Informatics Education for Pupils of all …, 2013 | 50 | 2013 |
| The challenging face of informatics education in Poland MM Sysło, AB Kwiatkowska Informatics Education-Supporting Computational Thinking: Third International …, 2008 | 46 | 2008 |
| On halin graphs MM Sysło, A Proskurowski Graph Theory: Proceedings of a Conference held in Łagów, Poland, February 10 …, 2006 | 45 | 2006 |
| Efficient vertex-and edge-coloring of outerplanar graphs A Proskurowski, MM Sysło SIAM Journal on Algebraic Discrete Methods 7 (1), 131-136, 1986 | 45 | 1986 |
| On cycle bases of a graph MM Sysło Networks 9 (2), 123-132, 1979 | 40 | 1979 |
| A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs A Lingas, MM Sysło Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988 | 32 | 1988 |
| Algorytmy MM Sysło Sklep WSiP 10% rabatu, 2002 | 31 | 2002 |
| Computational experiments with some approximation algorithms for the travelling salesman problem A Adrabiński, MM Sysło Applicationes Mathematicae 18 (1), 91-95, 1983 | 31 | 1983 |
| Triangulated edge intersection graphs of paths in a tree MM Sysło Discrete mathematics 55 (2), 217-220, 1985 | 30 | 1985 |
| Piramidy, szyszki i inne konstrukcje algorytmiczne MM Sysło Wydawnictwa Szkolne i Pedagogiczne, 1998 | 27 | 1998 |
| Efficient outerplanarity testing MM Sysło, M Iri Fundamenta Informaticae 2 (1), 261-275, 1978 | 27 | 1978 |
| Myślenie komputacyjne MM Sysło Nowe spojrzenie na kompetencje informatyczne. W: Materiały konferencji …, 2014 | 26 | 2014 |
Mary WebbKing's College LondonVerified email at kcl.ac.uk
