AP
Aris Pagourtzis
cs.DScs.CCcs.DCcs.GT
On Valency
published · living versionsW_f38w68np·v1 · currentpublished
Leveraging Recourse and Size Bounds for OnlineKnapsack with Removable Items
with Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos
1 version
Preprints & journals
18 papers in the corpus · 2016–2026The Complexity of Computing Class Probabilities in BID Probabilistic Databases2609.21245v1 · Sotiris Kanellopoulos, Ioannis Koutras, Aris Pagourtzis2026 · 0 citationsarXiv
Temporal Path Covers: Dilworth Properties and Parameterized Complexity2607.00118v7 · Lapo Cioni, Sotiris Kanellopoulos, Edouard Nemery et al.2026 · 0 citationsarXiv
Finite Pinwheel Scheduling: the k-Visits Problem2507.11681v4 · Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou et al.2025 · 0 citationsarXiv
Beer Path Problems in Temporal Graphs2507.08685v6 · Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos et al.2025 · 0 citationsarXiv
Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio2503.18241v4 · Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos et al.2025 · 0 citationsarXiv
Satisfactory Budget Division2502.00484v2 · Laurent Gourves, Michael Lampis, Nikolaos Melissinos et al.2025 · 0 citationsarXiv
On the power of counting the total number of computation paths of NPTMs2306.11614v6 · Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos et al.2023 · 3 citationsarXiv
On the Approximability of External-Influence-Driven Problems2305.19251v1 · Panagiotis Aivasiliotis, Aris Pagourtzis2023 · 0 citationsarXiv
Approximating Subset Sum Ratio via Partition Computations2201.04165v2 · Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos et al.2022 · 3 citationsarXiv
Faster Algorithms for -Subset Sum and Variations2112.04244v2 · Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis et al.2021 · 6 citationsarXiv
Approximation Schemes for Subset Sum Ratio Problems2003.06622v1 · Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis2020 · 3 citationsarXiv
Characterizations and approximability of hard counting classes below #P2003.02524v2 · Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis2020 · 1 citationarXiv
Approximate #Knapsack Computations to Count Semi-Fair Allocations1912.12430v1 · Theofilos Triommatis, Aris Pagourtzis2019 · 1 citationarXiv
Parameterized Fine-Grained Reductions1902.05529v1 · Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis et al.2019 · 0 citationsarXiv
A Faster FPTAS for the Subset-Sums Ratio Problem1803.09952v1 · Nikolaos Melissinos, Aris Pagourtzis2018 · 14 citationsarXiv
Joining Local Knowledge to Communicate Reliably (Extended Abstract)1711.01725v1 · Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas2017 · 0 citationsarXiv
A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree1710.07040v2 · Parikshit Saikia, Sushanta Karmakar, Aris T. Pagourtzis2017 · 1 citationarXiv
-shot Broadcasting in Ad Hoc Radio Networks1603.08393v1 · Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis et al.2016 · 0 citationsarXiv
Career total: 144 works. 18 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.