Research output per year
Research output per year
Personal profile
Research interests
Algorithmic Game Theory
Mechanism Design
Algorithms
Computational Complexity
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Constant Inapproximability for PPA
Deligkas, A., Fearnley, J., Hollender, A. & Melissourgos, T., 15 Oct 2027, (Accepted/In press) In: SIAM Journal on Computing.Research output: Contribution to journal › Article › peer-review
Open AccessFile4 Downloads (Pure) -
Agent-Constrained Truthful Facility Location Games
Deligkas, A., Lotfi, M. & Voudouris, A. A., 31 Aug 2024, Algorithmic Game Theory: 17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3–6, 2024, Proceedings. Schäfer, G. & Ventre, C. (eds.). 1 ed. Springer, [Cham], p. 129-146 (Lecture Notes in Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Approximate and Randomized algorithms for Computing a Second Hamiltonian Cycle
Deligkas, A., Mertzios, G. B., Spirakis, P. G. & Zamaraev, V., 12 Jun 2024, (E-pub ahead of print) In: Algorithmica. 20 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile9 Downloads (Pure) -
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source
Deligkas, A., Döring, M., Eiben, E., Goldsmith, T.-L. & Skretas, G., Aug 2024, In: Information and Computation. 299, 19 p., 105171.Research output: Contribution to journal › Article › peer-review
-
Constant Inapproximability for Fisher Markets
Deligkas, A., Fearnley, J., Hollender, A. & Melissourgos, T., 18 May 2024, (Accepted/In press).Research output: Contribution to conference › Paper › peer-review
Open AccessFile56 Downloads (Pure)
Projects
- 1 Active
-
NAfANE: New Approaches for Approximate Nash Equilibria
Deligkas, A. (PI)
Eng & Phys Sci Res Council EPSRC
1/01/24 → 31/12/26
Project: Research