- Non-procedural Programming +1NPRG005 | Faculty of Mathematics and Physics
- Introduction to AlgorithmsNPRG062 | Faculty of Mathematics and Physics
- Software Project IINPRG078 | Faculty of Mathematics and Physics
- Research Project IINPRG079 | Faculty of Mathematics and Physics
- Company Project IINPRG080 | Faculty of Mathematics and Physics
- Data Compression AlgorithmsNSWI072 | Faculty of Mathematics and Physics
- Seminar on Stringology and Data CompressionNSWI100 | Faculty of Mathematics and Physics
- String AlgorithmsNTIN087 | Faculty of Mathematics and Physics
- Information TechnologiesNUIN014 | Faculty of Mathematics and Physics
- Special SeminarNUIN017 | Faculty of Mathematics and Physics

- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements2024 | Faculty of Mathematics and Physics
- Neighbor connectivity of k-ary n-cubes2020 | Faculty of Mathematics and Physics
- Gray codes extending quadratic matchings2019 | Faculty of Mathematics and Physics
- Generalized Gray codes with prescribed ends2017 | Faculty of Mathematics and Physics
- Towards a problem of Ruskey and Savage on matching extendability2017 | Faculty of Mathematics and Physics
- On verification of workflow and planning domain models using attribute grammars2017 | Faculty of Mathematics and Physics
- Matchings of quadratic size extend to long cycles in hypercubes2016 | Faculty of Mathematics and Physics
- Linear time construction of a compressed Gray code2013 | Faculty of Mathematics and Physics
- Gray codes with bounded weights2012 | Faculty of Mathematics and Physics
- Testing connectivity of faulty networks in sublinear time2012 | Faculty of Mathematics and Physics

Loading network view...