default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThemistoklis Melissourgos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Tight Inapproximability for PPAD. J. ACM 71(5): 31:1-31:48 (2024)- [c14]Yiannis Giannakopoulos
, Alexander Grosz, Themistoklis Melissourgos:
On the Smoothed Complexity of Combinatorial Local Search. ICALP 2024: 72:1-72:19 - 2023
- [c13]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. AAAI 2023: 5600-5607 - [c12]Ozgur Salman, Themistoklis Melissourgos, Michael Kampouridis:
Optimization of Trading Strategies Using a Genetic Algorithm Under the Directional Changes Paradigm with Multiple Thresholds. CEC 2023: 1-8 - 2022
- [j5]Michael Kampouridis, Panagiotis Kanellopoulos, Maria Kyropoulou, Themistoklis Melissourgos, Alexandros A. Voudouris:
Multi-agent systems for computational economics and finance. AI Commun. 35(4): 369-380 (2022) - [j4]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
An extension of the Moran process using type-specific connection graphs. J. Comput. Syst. Sci. 124: 77-96 (2022) - [j3]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125: 106-128 (2022) - [c11]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Pizza Sharing Is PPA-Hard. AAAI 2022: 4957-4965 - [c10]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. FOCS 2022: 159-170 - [c9]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant inapproximability for PPA. STOC 2022: 1010-1023 - [i13]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant Inapproximability for PPA. CoRR abs/2201.10011 (2022) - [i12]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. CoRR abs/2209.15149 (2022) - [i11]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. CoRR abs/2209.15151 (2022) - [i10]Michael Kampouridis, Panagiotis Kanellopoulos, Maria Kyropoulou, Themistoklis Melissourgos, Alexandros A. Voudouris:
Multi-Agent Systems for Computational Economics and Finance. CoRR abs/2210.03540 (2022) - [i9]Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos:
On the Smoothed Complexity of Combinatorial Local Search. CoRR abs/2211.07547 (2022) - 2021
- [j2]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. Algorithmica 83(11): 3403-3431 (2021) - [j1]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. 117: 75-98 (2021) - [c8]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. AAMAS 2021: 413-419 - 2020
- [i8]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. CoRR abs/2005.11796 (2020) - [i7]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Square-Cut Pizza Sharing is PPA-complete. CoRR abs/2012.14236 (2020)
2010 – 2019
- 2019
- [b1]Themistoklis Melissourgos:
Algorithms and complexity of problems arising from strategic settings. University of Liverpool, UK, 2019 - [c7]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP 2019: 138:1-138:14 - [c6]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. SAGT 2019: 216-236 - [i6]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR abs/1903.03101 (2019) - [i5]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. CoRR abs/1906.02774 (2019) - 2018
- [c5]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Mutants and Residents with Different Connection Graphs in the Moran Process. LATIN 2018: 790-804 - [c4]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. SAGT 2018: 245-250 - [c3]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. WAOA 2018: 165-180 - [c2]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. WINE 2018: 126-139 - [i4]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. CoRR abs/1810.01393 (2018) - [i3]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. CoRR abs/1810.04565 (2018) - 2017
- [c1]Themistoklis Melissourgos, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. CIAC 2017: 418-429 - [i2]Themistoklis Melissourgos, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. CoRR abs/1701.08108 (2017) - [i1]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Mutants and Residents with Different Connection Graphs in the Moran Process. CoRR abs/1710.07365 (2017)
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-11-11 22:26 CET 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:
