Pavlos Eirinakis

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 15

Top Topics

Integer Program

Stable Marriage

Top Venues

Ann. Math. Artif. Intell.

Theor. Comput. Sci.

Discret. Optim.

Publications

Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris
On Pareto optimal balanced exchanges. Discret. Optim. 52 (2024)
Dimitrios Kaklis, Pavlos Eirinakis, George Giannakopoulos, Constantine D. Spyropoulos, Takis J. Varelas, Iraklis Varlamis
A big data approach for Fuel Oil Consumption estimation in the maritime industry. BigDataService (2022)
Pavlos Eirinakis, Stavros Lounis, Stathis Plitsos, George Arampatzis, Kostas Kalaboukas, Klemen Kenda, Jinzhi Lu, Joze M. Rozanec, Nenad Stojanovic
Cognitive Digital Twins for Resilience in Production: A Conceptual Framework. Inf. 13 (1) (2022)
Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris
Pareto optimal exchange with indifferent endowments. CoRR (2021)
Pavlos Eirinakis, Kostas Kalaboukas, Stavros Lounis, Ioannis Mourtos, Joze M. Rozanec, Nenad Stojanovic, Georgios Zois
Enhancing Cognition for Digital Twins. ICE/ITMC (2020)
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
The diameter of the stable marriage polytope: Bounding from below. Discret. Math. 343 (5) (2020)
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
The stable b-matching polytope revisited. Discret. Appl. Math. 250 (2018)
Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani
Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79 (1-3) (2017)
Pavlos Eirinakis, Jorge Buenabad-Chávez, Rosanna Fornasiero, Haluk Gokmen, Julien-Etienne Mascolo, Ioannis Mourtos, Sven Spieckermann, Vasilis Tountopoulos, Frank Werner, Robert Woitsch
A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration. PRO-VE (2017)
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. J. Graph Algorithms Appl. 21 (2) (2017)
Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79 (4) (2017)
Piotr J. Wojciechowski, K. Subramani, Pavlos Eirinakis
On the computational complexities of Quantified Integer Programming variants. ISAIM (2016)
Matthew D. Williamson, Pavlos Eirinakis, K. Subramani
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. Algorithmica 74 (1) (2016)
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. CoRR (2016)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59 (4) (2016)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT (2015)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
Pareto Optimal Matchings in Many-to-Many Markets with Ties. CoRR (2015)
Natarajan Shankar, K. Subramani, Pavlos Eirinakis
Identifying Negative Cost Cycles in Strongly Polynomial Space. Nord. J. Comput. 15 (2) (2015)
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski
On quantified linear implications. Ann. Math. Artif. Intell. 71 (4) (2014)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Blockers and antiblockers of stable matchings. Theor. Comput. Sci. 524 (2014)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
Polyhedral Aspects of Stable Marriage. Math. Oper. Res. 39 (3) (2014)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková
Pareto optimality in many-to-many matching problems. Discret. Optim. 14 (2014)
Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani, Piotr J. Wojciechowski
On the complexity of quantified linear systems. Theor. Comput. Sci. 518 (2014)
Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani
Variants of Quantified Linear Programming and Quantified Linear Implication. ISAIM (2014)
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
From One Stable Marriage to the Next: How Long Is the Way? SIAM J. Discret. Math. 28 (4) (2014)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. INFORMS J. Comput. 24 (2) (2012)
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski
Computational complexity of inclusion queries over polyhedral sets. ISAIM (2012)
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski
A complexity perspective on entailment of parameterized linear constraints. Constraints An Int. J. 17 (4) (2012)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
Hyperarc Consistency for the Stable Admissions Problem. ICTAI (1) (2007)