Pavlos Eirinakis

According to our database, Pavlos Eirinakis authored at least 26 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

On Pareto optimal balanced exchanges.

Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris

Discret. Optim., 2024

2022

Cognitive Digital Twins for Resilience in Production: A Conceptual Framework.

Pavlos Eirinakis, Stavros Lounis, Stathis Plitsos, George Arampatzis, Kostas Kalaboukas, Klemen Kenda, Jinzhi Lu, Joze M. Rozanec, Nenad Stojanovic

Inf., 2022

A big data approach for Fuel Oil Consumption estimation in the maritime industry.

Dimitrios Kaklis, Pavlos Eirinakis, George Giannakopoulos, Constantine D. Spyropoulos, Takis J. Varelas, Iraklis Varlamis

Proceedings of the Eighth IEEE International Conference on Big Data Computing Service and Applications, 2022

2021

Pareto optimal exchange with indifferent endowments.

Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris

CoRR, 2021

2020

The diameter of the stable marriage polytope: Bounding from below.

Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos

Discret. Math., 2020

Enhancing Cognition for Digital Twins.

Pavlos Eirinakis, Kostas Kalaboukas, Stavros Lounis, Ioannis Mourtos, Joze M. Rozanec, Nenad Stojanovic, Georgios Zois

Proceedings of the 2020 IEEE International Conference on Engineering, 2020

2018

The stable b-matching polytope revisited.

Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos

Discret. Appl. Math., 2018

2017

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.

Pavlos Eirinakis, Matthew D. Williamson, K. Subramani

J. Graph Algorithms Appl., 2017

Erratum to: Analyzing restricted fragments of the theory of linear arithmetic.

Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani

Ann. Math. Artif. Intell., 2017

Analyzing restricted fragments of the theory of linear arithmetic.

Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani

Ann. Math. Artif. Intell., 2017

A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration.

Pavlos Eirinakis, Jorge Buenabad-Chávez, Rosanna Fornasiero, Haluk Gokmen, Julien-Etienne Mascolo, Ioannis Mourtos, Sven Spieckermann, Vasilis Tountopoulos, Frank Werner, Robert Woitsch

Proceedings of the Collaboration in a Data-Rich World, 2017

2016

Pareto Optimal Matchings in Many-to-Many Markets with Ties.

Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari

Theory Comput. Syst., 2016

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem.

Matthew D. Williamson, Pavlos Eirinakis, K. Subramani

Algorithmica, 2016

On the computational complexities of Quantified Integer Programming variants.

Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015

Identifying Negative Cost Cycles in Strongly Polynomial Space.

Natarajan Shankar, K. Subramani, Pavlos Eirinakis

Nord. J. Comput., 2015

2014

On the complexity of quantified linear systems.

Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani, Piotr Wojciechowski

Theor. Comput. Sci., 2014

Blockers and antiblockers of stable matchings.

Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos

Theor. Comput. Sci., 2014

From One Stable Marriage to the Next: How Long Is the Way?

Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos

SIAM J. Discret. Math., 2014

Polyhedral Aspects of Stable Marriage.

Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis

Math. Oper. Res., 2014

Pareto optimality in many-to-many matching problems.

Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková

Discret. Optim., 2014

On quantified linear implications.

Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski

Ann. Math. Artif. Intell., 2014

Variants of Quantified Linear Programming and Quantified Linear Implication.

Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2012

Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem.

Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis

INFORMS J. Comput., 2012

A complexity perspective on entailment of parameterized linear constraints.

Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski

Constraints An Int. J., 2012

Computational complexity of inclusion queries over polyhedral sets.

Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2007

Hyperarc Consistency for the Stable Admissions Problem.

Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007