Dimitris Fotakis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Linear Label Ranking with Bounded Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Label Ranking through Nonparametric Regression.

[BibT_eX]

[DOI]

Eleni Psaroudaki

Proceedings of the International Conference on Machine Learning, 2022

Differentially Private Regression with Unbounded Covariates.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Dimensionality and Coordination in Voting: The Distortion of STV.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds.

[BibT_eX]

[DOI]

CoRR, 2021

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds.

[BibT_eX]

[DOI]

CoRR, 2021

Dimensionality, Coordination, and Robustness in Voting.

[BibT_eX]

[DOI]

CoRR, 2021

Learning Augmented Online Facility Location.

[BibT_eX]

[DOI]

Evangelia Gergatsouli

Themis Gouleakis

Nikolas Patris

CoRR, 2021

Stochastic Opinion Dynamics for Interest Prediction in Social Networks.

[BibT_eX]

[DOI]

Marios Papachristou

CoRR, 2021

Online Facility Location in Evolving Metrics.

[BibT_eX]

[DOI]

Loukas Kavouras

Lydia Zakynthinou

Algorithms, 2021

Strategyproof Facility Location in Perturbation Stable Instances.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Metric-Distortion Bounds Under Limited Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Private and Non-private Uniformity Testing for Ranking Data.

[BibT_eX]

[DOI]

Róbert Busa-Fekete

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Identity testing for Mallows model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Efficient Online Learning for Dynamic k-Clustering.

[BibT_eX]

[DOI]

Georgios Piliouras

Proceedings of the 38th International Conference on Machine Learning, 2021

On the Approximability of Multistage Min-Sum Set Cover.

[BibT_eX]

[DOI]

Panagiotis Kostopanagiotis

Vasileios Nakos

Georgios Piliouras

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Efficient Algorithms for Learning from Coarse Labels.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Aggregating Incomplete and Noisy Rankings.

[BibT_eX]

[DOI]

Konstantinos Stavropoulos

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries.

[BibT_eX]

[DOI]

Thanasis Pittas

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Efficient Truthful Scheduling and Resource Allocation through Monitoring.

[BibT_eX]

[DOI]

Carmine Ventre

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

A Mechanism Design and Learning Approach for Revenue Maximization on Cloud Dynamic Spot Markets.

[BibT_eX]

[DOI]

Asterios Tsiourvas

Constantinos Bitsakos

Ioannis Konstantinou

Nectarios Koziris

Proceedings of the 14th IEEE International Conference on Cloud Computing, 2021

2020

Scheduling MapReduce Jobs on Identical and Unrelated Processors.

[BibT_eX]

[DOI]

Ioannis Milis

Vasilis Vassalos

Georgios Zois

Theory Comput. Syst., 2020

Solving Inverse Problems for Spectral Energy Distributions with Deep Generative Networks.

[BibT_eX]

[DOI]

CoRR, 2020

Local Aggregation in Preference Games.

[BibT_eX]

[DOI]

Angelo Fanelli

CoRR, 2020

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics.

[BibT_eX]

[DOI]

Dimitris Christou

Grigorios Koumoutsos

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Mechanism Design for Perturbation Stable Combinatorial Auctions.

[BibT_eX]

[DOI]

Giannis Fikioris

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Asymptotically Optimal Communication in Simple Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games.

[BibT_eX]

[DOI]

Anthimos Vardis Kandiros

Nikos Mouzakis

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The Online Min-Sum Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Object Allocation and Positive Graph Externalities.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Efficient Parameter Estimation of Truncated Boolean Product Distributions.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

2019

Preface to Special Issue on Algorithms and Complexity.

[BibT_eX]

[DOI]

Aris Pagourtzis

Vangelis Th. Paschos

Theor. Comput. Sci., 2019

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games.

[BibT_eX]

[DOI]

Anthimos Vardis Kandiros

Nikos Mouzakis

CoRR, 2019

Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows.

[BibT_eX]

[DOI]

Konstantinos Ameranis

Nikolaos Vathis

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Reallocating Multiple Facilities on the Line.

[BibT_eX]

[DOI]

Panagiotis Kostopanagiotis

Loukas Kavouras

Philip Lazos

Nikos Zarifis

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Optimal Learning of Mallows Block Model.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

Malleable Scheduling Beyond Identical Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders.

[BibT_eX]

[DOI]

Kyriakos Lotidis

Chara Podimata

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Opinion Dynamics with Limited Information.

[BibT_eX]

[DOI]

Anthimos Vardis Kandiros

Vasilis Kontonis

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Covering Clients with Types and Budgets.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Learning Powers of Poisson Binomial Distributions.

[BibT_eX]

[DOI]

CoRR, 2017

Selfish Transportation Games.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Laurent Gourvès

Jérôme Monnot

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Opinion Formation Games with Aggregation and Negative Influence.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Stathis Zachos at 70!

[BibT_eX]

[DOI]

Nikolaos S. Papaspyrou

Katerina Potika

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Minimum Congestion Redundant Assignments.

[BibT_eX]

[DOI]

Paul (Pavlos) Spirakis

Encyclopedia of Algorithms, 2016

Conference Program Design with Single-Peaked and Single-Crossing Preferences.

[BibT_eX]

[DOI]

Laurent Gourvès

Jérôme Monnot

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse.

[BibT_eX]

[DOI]

Michael Lampis

Vangelis Th. Paschos

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Mechanism Design with Selective Verification.

[BibT_eX]

[DOI]

Manolis Zampetakis

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Opinion Dynamics with Local Interactions.

[BibT_eX]

[DOI]

Dimitris Palyvos-Giannas

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

On the Size and the Approximability of Minimum Temporally Connected Subgraphs.

[BibT_eX]

[DOI]

Kyriakos Axiotis

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Scheduling MapReduce Jobs Under Multi-round Precedences.

[BibT_eX]

[DOI]

Ioannis Milis

Vasilis Vassalos

Georgios Zois

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking.

[BibT_eX]

[DOI]

Tobias Harks

Theory Comput. Syst., 2015

Who to Trust for Truthfully Maximizing Welfare?

[BibT_eX]

[DOI]

CoRR, 2015

Efficient lineage for SUM aggregate queries.

[BibT_eX]

[DOI]

Foto N. Afrati

Angelos Vasilakopoulos

AI Commun., 2015

Improving Selfish Routing for Risk-Averse Players.

[BibT_eX]

[DOI]

Dimitris Kalimeris

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors.

[BibT_eX]

[DOI]

Ioannis Milis

Georgios Zois

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Efficient Money Burning in General Domains.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

A Selective Tour Through Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

A Glimpse at Paul G. Spirakis.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Othon Michail

Grammati E. Pantziou

Christos D. Zaroliagis

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations.

[BibT_eX]

[DOI]

Maria I. Andreou

Vicky Papadopoulou Lesta

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

The Power of Verification for Greedy Mechanism Design.

[BibT_eX]

[DOI]

Carmine Ventre

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Influence Maximization in Switching-Selection Threshold Models.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Scheduling MapReduce Jobs on Unrelated Processors.

[BibT_eX]

[DOI]

Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

Combinatorial auctions without money.

[BibT_eX]

[DOI]

Carmine Ventre

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Strategyproof facility location with concave costs.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

Strategy-Proof Facility Location for Concave Cost Functions

[BibT_eX]

[DOI]

CoRR, 2013

Truthfulness Flooded Domains and the Power of Verification for Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Resolving Braess's Paradox in Random Networks.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Strategyproof facility location for concave cost functions.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Stochastic Congestion Games with Risk-Averse Players.

[BibT_eX]

[DOI]

Haris Angelidakis

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Enumerating subgraph instances using map-reduce.

[BibT_eX]

[DOI]

Foto N. Afrati

Jeffrey D. Ullman

Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

On the Power of Deterministic Mechanisms for Facility Location Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities.

[BibT_eX]

[DOI]

Paris Siminelakis

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

On the Hardness of Network Design for Bottleneck Routing Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Online Sum-Radii Clustering.

[BibT_eX]

[DOI]

Paraschos Koutris

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Online and incremental algorithms for facility location.

[BibT_eX]

[DOI]

SIGACT News, 2011

Externalities among Advertisers in Sponsored Search.

[BibT_eX]

[DOI]

Orestis Telelis

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.

[BibT_eX]

[DOI]

Charalampos N. Moschopoulos

George Karakostas

Stavros G. Kolliopoulos

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Dealing with Large Datasets Using an Artificial Intelligence Clustering Tool.

[BibT_eX]

[DOI]

Panagiotis Tsiatsis

Grigorios N. Beligiannis

Proceedings of the Tools and Applications with Artificial Intelligence, 2009

The Impact of Social Ignorance on Weighted Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Efficient Methods for Selfish Network Design.

[BibT_eX]

[DOI]

Alexis C. Kaporis

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Minimum Congestion Redundant Assignments.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Atomic Congestion Games: Fast, Myopic and Concurrent.

[BibT_eX]

[DOI]

Alexis C. Kaporis

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Cost-Balancing Tolls for Atomic Network Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Stackelberg Strategies for Atomic Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Incremental algorithms for Facility Location and k-Median.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks.

[BibT_eX]

[DOI]

Stefanos Gritzalis

Comput. Commun., 2006

Memoryless Facility Location in One Pass.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Atomic Congestion Games Among Coalitions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Radiocoloring in planar graphs: Complexity and approximations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

A Primal-Dual Algorithm for Online Non-uniform Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

2004

Selfish Unsplittable Flows.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Incremental Algorithms for Facility Location and k-Median.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

Space Efficient Hash Tables with Worst Case Constant Access Time.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

On the Competitive Ratio for Online Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Minimum Congestion Redundant Assignments to Tolerate Random Faults.

[BibT_eX]

[DOI]

Algorithmica, 2002

Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.

[BibT_eX]

[DOI]

Maria I. Andreou

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.

[BibT_eX]

[DOI]

Elias Koutsoupias

Marios Mavronicolas

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Genetically determined variable structure multiple model estimation.

[BibT_eX]

[DOI]

Sokratis K. Katsikas

Grigorios N. Beligiannis

K. G. Berkeris

IEEE Trans. Signal Process., 2001

Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.

[BibT_eX]

Bull. EATCS, 2001

Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2001

An Evolutionary Computation Technique for User Profile Optimization.

[BibT_eX]

Grigorios N. Beligiannis

Konstantinos C. Giotopoulos

Dimitris Fragoudis

Proceedings of the ISCA 3rd International Conference on Information Reuse and Integration, 2001

An Evolutionary Annealing Approach to Graph Coloring.

[BibT_eX]

[DOI]

Stamatis Stefanakos

Proceedings of the Applications of Evolutionary Computing, 2001

2000

NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

Προσεγγιστική επίλυση υπολογιστικά δύσκολων προβλημάτων: αλγόριθμοι και πολυπλοκότητα

[BibT_eX]

[DOI]

PhD thesis, 1999

Efficient Redundant Assignments under Fault-Tolerance Constraints.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

Virtual European School - VES.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

1998

Random Walks, Conditional Hitting Sets and Partial Derandomization

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

Graph Properties that Facilitate Travelling

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

A Hamiltonian Approach to the Assignment of Non-reusable Frequencies.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Frequency assignment in mobile and radio networks.

[BibT_eX]

[DOI]

Proceedings of the Networks in Distributed Computing, 1997

1996

(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.

[BibT_eX]

[DOI]