| Enhancing cognition for digital twins P Eirinakis, K Kalaboukas, S Lounis, I Mourtos, JM Rožanec, N Stojanovic, ... 2020 IEEE International Conference on Engineering, Technology and Innovation …, 2020 | 37 | 2020 |
| Pareto optimality in many-to-many matching problems K Cechlárová, P Eirinakis, T Fleiner, D Magos, I Mourtos, E Potpinková Discrete Optimization 14, 160-169, 2014 | 33 | 2014 |
| Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem P Eirinakis, D Magos, I Mourtos, P Miliotis INFORMS Journal on Computing, 2011 | 23 | 2011 |
| Cognitive digital twins for resilience in production: A conceptual framework P Eirinakis, S Lounis, S Plitsos, G Arampatzis, K Kalaboukas, K Kenda, ... Information 13 (1), 33, 2022 | 16 | 2022 |
| Pareto optimal matchings in many-to-many markets with ties K Cechlárová, P Eirinakis, T Fleiner, D Magos, D Manlove, I Mourtos, ... Theory of Computing Systems 59 (4), 700-721, 2016 | 16 | 2016 |
| Polyhedral aspects of stable marriage P Eirinakis, D Magos, I Mourtos, P Miliotis Mathematics of Operations Research 39 (3), 656-671, 2014 | 15 | 2014 |
| Situation-aware manufacturing systems for capturing and handling disruptions P Eirinakis, G Kasapidis, I Mourtos, P Repoussis, E Zampou Journal of Manufacturing Systems 58, 365-383, 2021 | 12 | 2021 |
| A proposal of decentralised architecture for optimised operations in manufacturing ecosystem collaboration P Eirinakis, J Buenabad-Chavez, R Fornasiero, H Gokmen, JE Mascolo, ... Collaboration in a Data-Rich World: 18th IFIP WG 5.5 Working Conference on …, 2017 | 12 | 2017 |
| Pareto optimal matchings in many-to-many markets with ties K Cechlárová, P Eirinakis, T Fleiner, D Magos, DF Manlove, I Mourtos, ... International Symposium on Algorithmic Game Theory, 27-39, 2015 | 12 | 2015 |
| On quantified linear implications P Eirinakis, S Ruggieri, K Subramani, P Wojciechowski Annals of Mathematics and Artificial Intelligence 71 (4), 301-325, 2014 | 10 | 2014 |
| Computational complexities of inclusion queries over polyhedral sets P Eirinakis, S Ruggieri, K Subramani, P Wojciechowski ISAIM 2012, 2012 | 9 | 2012 |
| On the Shoshan-Zwick algorithm for the all-pairs shortest path problem P Eirinakis, M Williamson, K Subramani Journal of Graph Algorithms and Applications 21 (2), 177-181, 2017 | 7 | 2017 |
| On the complexity of quantified linear systems S Ruggieri, P Eirinakis, K Subramani, P Wojciechowski Theoretical Computer Science 518, 128-134, 2014 | 7 | 2014 |
| Hyperarc Consistency for the Stable Admissions Problem P Eirinakis, D Magos, I Mourtos, P Miliotis ICTAI 2007, 239-242, 2007 | 7 | 2007 |
| Blockers and antiblockers of stable matchings P Eirinakis, D Magos, I Mourtos Theoretical Computer Science 524, 126-133, 2014 | 6 | 2014 |
| A big data approach for Fuel Oil Consumption estimation in the maritime industry D Kaklis, P Eirinakis, G Giannakopoulos, C Spyropoulos, TJ Varelas, ... 2022 IEEE Eighth International Conference on Big Data Computing Service and …, 2022 | 5 | 2022 |
| The stable b-matching polytope revisited P Eirinakis, D Magos, I Mourtos Discrete Applied Mathematics 250, 186-201, 2018 | 5 | 2018 |
| Approximation algorithms for the teachers assignment problem K Cechlarova, P Eirinakis, T Fleiner, D Magos, I Mourtos, E Ocel’áková Institute of Mathematics, series A, 1-10, 2014 | 5 | 2014 |
| From one stable marriage to the next: How long is the way? P Eirinakis, D Magos, I Mourtos SIAM Journal on Discrete Mathematics 28 (4), 1971-1979, 2014 | 5 | 2014 |
| Finding a minimum-regret many-to-many Stable Matching P Eirinakis, D Magos, I Mourtos, P Miliotis Optimization, 2012 | 5 | 2012 |
Yiannis MourtosAthens University of Economics and BusinessPreverjeni e-poštni naslov na aueb.gr
