default search action
Pavlos Eirinakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Pavlos Eirinakis
, Ioannis Mourtos
On Pareto optimal balanced exchanges. Discret. Optim. 52: 100835 (2024) - 2022
- [j17]Pavlos Eirinakis
Cognitive Digital Twins for Resilience in Production: A Conceptual Framework. Inf. 13(1): 33 (2022) - [c8]Dimitrios Kaklis
A big data approach for Fuel Oil Consumption estimation in the maritime industry. BigDataService 2022: 39-47 - 2021
- [i3]Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris:
Pareto optimal exchange with indifferent endowments. CoRR abs/2104.00465 (2021) - 2020
- [j16]Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
The diameter of the stable marriage polytope: Bounding from below. Discret. Math. 343(5): 111804 (2020) - [c7]Pavlos Eirinakis, Kostas Kalaboukas
Enhancing Cognition for Digital Twins. ICE/ITMC 2020: 1-7
2010 – 2019
- 2018
- [j15]Pavlos Eirinakis
The stable b-matching polytope revisited. Discret. Appl. Math. 250: 186-201 (2018) - 2017
- [j14]Piotr Wojciechowski
Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79(1-3): 245-266 (2017) - [j13]Piotr Wojciechowski
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79(4): 371-392 (2017) - [j12]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): 177-181 (2017) - [c6]Pavlos Eirinakis, Jorge Buenabad-Chávez, Rosanna Fornasiero
A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration. PRO-VE 2017: 128-137 - 2016
- [j11]Matthew D. Williamson, Pavlos Eirinakis, K. Subramani
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. Algorithmica 74(1): 270-325 (2016) - [j10]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59(4): 700-721 (2016) - [c5]Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis:
On the computational complexities of Quantified Integer Programming variants. ISAIM 2016 - [i2]Pavlos Eirinakis, Matthew D. Williamson, K. Subramani:
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. CoRR abs/1603.08627 (2016) - 2015
- [j9]Natarajan Shankar, K. Subramani, Pavlos Eirinakis:
Identifying Negative Cost Cycles in Strongly Polynomial Space. Nord. J. Comput. 15(2): 154-171 (2015) - [c4]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT 2015: 27-39 - [i1]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 abs/1507.02866 (2015) - 2014
- [j8]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani
On quantified linear implications. Ann. Math. Artif. Intell. 71(4): 301-325 (2014) - [j7]Katarína Cechlárová
Pareto optimality in many-to-many matching problems. Discret. Optim. 14: 160-169 (2014) - [j6]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Polyhedral Aspects of Stable Marriage. Math. Oper. Res. 39(3): 656-671 (2014) - [j5]Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
From One Stable Marriage to the Next: How Long Is the Way? SIAM J. Discret. Math. 28(4): 1971-1979 (2014) - [j4]Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani
On the complexity of quantified linear systems. Theor. Comput. Sci. 518: 128-134 (2014) - [j3]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Blockers and antiblockers of stable matchings. Theor. Comput. Sci. 524: 126-133 (2014) - [c3]Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani:
Variants of Quantified Linear Programming and Quantified Linear Implication. ISAIM 2014 - 2012
- [j2]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani
A complexity perspective on entailment of parameterized linear constraints. Constraints An Int. J. 17(4): 461-487 (2012) - [j1]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. INFORMS J. Comput. 24(2): 245-259 (2012) - [c2]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski:
Computational complexity of inclusion queries over polyhedral sets. ISAIM 2012
2000 – 2009
- 2007
- [c1]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Hyperarc Consistency for the Stable Admissions Problem. ICTAI (1) 2007: 239-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: