Georgios Amanatidis

89 papers A* 15A 4B 7Journal 56Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Metric distortion under group-fair objectives. Auton. Agents Multi Agent Syst. Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett, Alexandros A. Voudouris
2026	J	`jnl`	On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. Theory Comput. Syst. Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos
2026	J	`jnl`	Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity. Theor. Comput. Sci. Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser
2025	A	`conf`	Algorithmically Fair Maximization of Multiple Submodular Objective Functions. AAMAS Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2025	B	`conf`	Metric Distortion Under Group-Fair Objectives. SAGT Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett, Alexandros A. Voudouris
2025	J	`jnl`	On the Tractability Landscape of the Conditional Minisum Approval Voting Rule. Inf. Process. Lett. Georgios Amanatidis, Michael Lampis, Evangelos Markakis, Georgios Papasotiropoulos
2025	B	`conf`	Online Budget-Feasible Mechanism Design with Predictions. SAGT Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios, Guido Schäfer, Panagiotis Tsamopoulos, Artem Tsikiridis
2025	J	`jnl`	Online Budget-Feasible Mechanism Design with Predictions. CoRR Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios, Guido Schäfer, Panagiotis Tsamopoulos, Artem Tsikiridis
2025	B	`conf`	Online Fair Division for Personalized 2-Value Instances. SAGT Georgios Amanatidis, Alexandros Lolos, Evangelos Markakis, Victor Turmel
2025	J	`jnl`	Online Fair Division for Personalized 2-Value Instances. CoRR Georgios Amanatidis, Alexandros Lolos, Evangelos Markakis, Victor Turmel
2025	J	`jnl`	Pandora's box problem with time constraints. Artif. Intell. Georgios Amanatidis, Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis
2025	J	`jnl`	Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. ACM Trans. Economics and Comput. Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
2025	J	`jnl`	Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. Math. Oper. Res. Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2024	J	`jnl`	Algorithmically Fair Maximization of Multiple Submodular Objective Functions. CoRR Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2024	J	`jnl`	Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. Math. Oper. Res. Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2024	J	`jnl`	Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. SIAM J. Discret. Math. Georgios Amanatidis, Pieter Kleer
2024	J	`jnl`	Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. SIAM J. Discret. Math. Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2024	J	`jnl`	Metric Distortion under Group-Fair Objectives. CoRR Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett, Alexandros A. Voudouris
2024	A	`conf`	On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. AAMAS Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos
2024	J	`jnl`	On the Tractability Landscape of Conditional Minisum Approval Voting Rule. CoRR Georgios Amanatidis, Michael Lampis, Evangelos Markakis, Georgios Papasotiropoulos
2024	—	`conf`	Pandora's Box Problem Over Time. WINE Georgios Amanatidis, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis
2024	J	`jnl`	Pandora's Box Problem Over Time. CoRR Georgios Amanatidis, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis
2024	A*	`conf`	Pushing the Frontier on Approximate EFX Allocations. EC Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa
2024	J	`jnl`	Pushing the Frontier on Approximate EFX Allocations. CoRR Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa
2023	A	`conf`	Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. STACS Georgios Amanatidis, Pieter Kleer
2023	J	`jnl`	Fair division of indivisible goods: Recent progress and open questions. Artif. Intell. Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu
2023	J	`jnl`	On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. CoRR Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos
2023	—	`conf`	Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. WINE Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
2023	J	`jnl`	Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. CoRR Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
2023	A*	`conf`	Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. EC Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2023	J	`jnl`	Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. CoRR Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2022	J	`jnl`	A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. J. Artif. Intell. Res. Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	J	`jnl`	Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online. Math. Oper. Res. Georgios Amanatidis, Pieter Kleer, Guido Schäfer
2022	J	`jnl`	Decentralised Update Selection with Semi-Strategic Experts. CoRR Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío
2022	B	`conf`	Decentralized Update Selection with Semi-strategic Experts. SAGT Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío
2022	A*	`conf`	Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. NeurIPS Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	J	`jnl`	Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. CoRR Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	A*	`conf`	Fair Division of Indivisible Goods: A Survey. IJCAI Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	J	`jnl`	Fair Division of Indivisible Goods: A Survey. CoRR Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	J	`jnl`	Fair Division of Indivisible Goods: A Survey. CoRR Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu
2022	J	`jnl`	Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. J. Artif. Intell. Res. Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2022	J	`jnl`	Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices. SIAM J. Discret. Math. Georgios Amanatidis, Pieter Kleer
2021	A*	`conf`	A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. AAAI Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2021	—	`conf`	Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. WINE Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2021	J	`jnl`	Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. CoRR Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2021	J	`jnl`	Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. CoRR Georgios Amanatidis, Pieter Kleer
2021	J	`jnl`	Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theor. Comput. Sci. Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat
2021	J	`jnl`	Maximum Nash welfare and other stories about EFX. Theor. Comput. Sci. Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
2021	J	`jnl`	Peeking behind the ordinal curtain: Improving distortion via cardinal queries. Artif. Intell. Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2021	A*	`conf`	Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ICML Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser
2021	J	`jnl`	Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. CoRR Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser
2020	J	`jnl`	A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. CoRR Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2020	J	`jnl`	A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. Inf. Process. Lett. Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2020	A*	`conf`	Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. NeurIPS Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2020	J	`jnl`	Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. CoRR Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
2020	A*	`conf`	Maximum Nash Welfare and Other Stories About EFX. IJCAI Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
2020	J	`jnl`	Maximum Nash Welfare and Other Stories About EFX. CoRR Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
2020	A*	`conf`	Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination. AAAI Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
2020	J	`jnl`	Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. Theor. Comput. Sci. Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
2020	A*	`conf`	Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries. AAAI Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2020	J	`jnl`	Rapid mixing of the switch Markov chain for strongly stable degree sequences. Random Struct. Algorithms Georgios Amanatidis, Pieter Kleer
2019	A*	`conf`	Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. EC Georgios Amanatidis, Pieter Kleer, Guido Schäfer
2019	J	`jnl`	Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. CoRR Georgios Amanatidis, Pieter Kleer, Guido Schäfer
2019	J	`jnl`	Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination. CoRR Georgios Amanatidis, Apostolos Ntokos, Evangelos Markakis
2019	J	`jnl`	Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries. CoRR Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2019	A*	`conf`	Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices. SODA Georgios Amanatidis, Pieter Kleer
2018	B	`conf`	An Improved Envy-Free Cake Cutting Protocol for Four Agents. SAGT Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou
2018	J	`jnl`	An Improved Envy-Free Cake Cutting Protocol for Four Agents. CoRR Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou
2018	A*	`conf`	Comparing Approximate Relaxations of Envy-Freeness. IJCAI Georgios Amanatidis, Georgios Birmpas, Vangelis Markakis
2018	J	`jnl`	Comparing Approximate Relaxations of Envy-Freeness. CoRR Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2018	J	`jnl`	Connected realizations of joint-degree matrices. Discret. Appl. Math. Georgios Amanatidis, Bradley Green, Milena Mihail
2018	J	`jnl`	Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences. CoRR Georgios Amanatidis, Pieter Kleer
2017	—	`—`	Algorithmic and Mechanism Design Aspects of Problems with Limited - or no - Payments. Georgios Amanatidis
2017	J	`jnl`	Approximation Algorithms for Computing Maximin Share Allocations. ACM Trans. Algorithms Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi
2017	—	`conf`	On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. WINE Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2017	J	`jnl`	On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. CoRR Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2017	A*	`conf`	Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. EC Georgios Amanatidis, Georgios Birmpas, George Christodoulou, Evangelos Markakis
2017	J	`jnl`	Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. CoRR Georgios Amanatidis, Georgios Birmpas, George Christodoulou, Evangelos Markakis
2016	—	`conf`	Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. WINE Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2016	J	`jnl`	Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. CoRR Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2016	B	`conf`	Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. MFCS Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat
2016	J	`jnl`	Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. CoRR Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat
2016	A*	`conf`	On Truthful Mechanisms for Maximin Share Allocations. IJCAI Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2016	J	`jnl`	On Truthful Mechanisms for Maximin Share Allocations. CoRR Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
2015	—	`conf`	Approximation Algorithms for Computing Maximin Share Allocations. ICALP (1) Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi
2015	J	`jnl`	Approximation Algorithms for Computing Maximin Share Allocations. CoRR Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi
2015	J	`jnl`	Graphic Realizations of Joint-Degree Matrices. CoRR Georgios Amanatidis, Bradley Green, Milena Mihail
2015	A	`conf`	Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. AAMAS Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries
2007	B	`conf`	Provably-Secure Schemes for Basic Query Support in Outsourced Databases. DBSec Georgios Amanatidis, Alexandra Boldyreva, Adam O'Neill

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.