Projects per year
Personal profile
Personal profile
Aistis graduated from PhD at University of Warwick in 2015. Prior to joining XJTLU in September 2019, he worked as a Teaching Fellow of Mathematics and Statistics at London School of Economics (2016-2019) and as a Lecturer of Mathematics at Nottingham Trent University (2016). His research interests lie in Graph Theory and Combinatorics.
Experience
Aug 2019-present, Lecturer in Pure Mathematics, XJTLU
Sep 2016 - Aug 2019, Teaching Fellow in Mathematics and Statistics, London School of Economics and Political Sciences (LSE)
Jan 2016 - Jul 2016, Lecturer in Mathematics, Nottingham Trent University
Teaching
2019-2020 XJTLU: Lecturer for Analysis 1 and Analysis 2.
2016-2019 London School of Economics: Teaching Fellow for Elementary Statistical Theory, Real Analysis, Complex Analysis, Optimisation Theory, Differential Equations, Further Mathematical Methods, Further Quantitative Methods, Quantitative Methods.
2016 Nottingham Trent University: Lecturer and seminar leader for Foundations and Investigations in Mathematics (introductory analysis), Differential Equations and Transforms; Seminar leader for Linear Algebra and Applications.
2011-2014 University of Warwick: Teaching assistant for Math for Computer Scientists, Combinatorics, Algorithmic Graph Theory, Graph Theory; Supervisor for second year undergraduate students on core modules including: Analysis, Algebra, Vector Analysis, Differentiation.
Education/Academic qualification
2011-2015, University of Warwick, PhD in Mathematics, Advisor Prof. V. Lozin, Thesis: Well-quasi-ordering of Combinatorial Structures (thesis available online on http://wrap.warwick.ac.uk/67023/)
2007-2011, University of Cambridge, Girton College, Mathematical Tripos (BA and MMath)
Person Types
- Staff
Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Projects
- 1 Active
-
Deciding atomicity for posets of combinatorial structures
1/01/23 → 31/12/24
Project: Internal Research Project
-
Deciding atomicity of subword-closed languages
Atminas, A. & Lozin, V., 1 Jul 2024, In: Theoretical Computer Science. 1003, 114595.Research output: Contribution to journal › Article › peer-review
-
Combinatorics and Algorithms for Quasi-Chain Graphs
Alecu, B., Atminas, A., Lozin, V. & Malyshev, D., Mar 2023, In: Algorithmica. 85, 3, p. 642-664 23 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Graph parameters, implicit representations and factorial properties
Alecu, B., Alekseev, V. E., Atminas, A., Lozin, V. & Zamaraev, V., Oct 2023, In: Discrete Mathematics. 346, 10, 113573.Research output: Contribution to journal › Article › peer-review
Open Access4 Citations (Scopus) -
Classes of graphs without star forests and related graphs
Atminas, A., Dec 2022, In: Discrete Mathematics. 345, 12, 113089.Research output: Contribution to journal › Article › peer-review
Open Access4 Citations (Scopus) -
Deciding Atomicity of Subword-Closed Languages
Atminas, A. & Lozin, V., 2022, Developments in Language Theory - 26th International Conference, DLT 2022, Proceedings. Diekert, V. & Volkov, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 69-77 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13257 LNCS).Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review
3 Citations (Scopus)