default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitris Fotakis 0001
Dimitris A. Fotakis 0001
Person information
- affiliation: National Technical University of Athens, School of Electrical and Computer Engineering, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]Dimitris Fotakis
, Panagiotis Patsilinakos, Eleni Psaroudaki, Michalis Xefteris:
Efficient Time-Series Clustering through Sparse Gaussian Modeling. Algorithms 17(2): 61 (2024)- [j53]Agapi Rissaki, Orestis Pavlou, Dimitris Fotakis, Vicky Papadopoulou, Andreas Efstathiou:
Reconstructing the mid-infrared spectra of galaxies using ultraviolet to submillimeter photometry and Deep Generative Networks. Astron. Comput. 47: 100823 (2024) - [j52]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds. Math. Program. 206(1): 515-539 (2024) - [c95]Andrii Kliachkin, Eleni Psaroudaki, Jakub Marecek, Dimitris Fotakis:
Fairness in Ranking: Robustness through Randomization without the Protected Attribute. ICDEW 2024: 201-208 - [i50]Andrii Kliachkin, Eleni Psaroudaki, Jakub Marecek, Dimitris Fotakis:
Fairness in Ranking: Robustness through Randomization without the Protected Attribute. CoRR abs/2403.19419 (2024) - [i49]Ioannis Z. Emiris, Dimitris Fotakis, Giorgos Giannopoulos, Dimitrios Gunopulos, Loukas Kavouras, Kleopatra Markou, Eleni Psaroudaki, Dimitrios Rontogiannis, Dimitris Sacharidis, Nikolaos Theologitis, Dimitrios Tomaras, Konstantinos Tsopelas:
GLANCE: Global Actions in a Nutshell for Counterfactual Explainability. CoRR abs/2405.18921 (2024) - [i48]Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos:
On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries. CoRR abs/2408.11755 (2024) - 2023
- [j51]Dimitris Fotakis, Anthimos Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis:
Opinion Dynamics with Limited Information. Algorithmica 85(12): 3855-3888 (2023) - [j50]Sotirios Dimos, Dimitris Fotakis, Thanasis Lianeas, Kyriakos Sergis:
Escaping Braess's paradox through approximate Caratheodory's theorem. Inf. Process. Lett. 179: 106289 (2023) - [j49]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable scheduling beyond identical machines. J. Sched. 26(5): 425-442 (2023) - [c94]Dimitris Fotakis, Laurent Gourvès:
On the Distortion of Single Winner Elections with Aligned Candidates. AAMAS 2023: 1409-1411 - [c93]Dimitrios Kelesis, Dimitrios Vogiatzis, Georgios Katsimpras, Dimitris Fotakis, Georgios Paliouras:
Reducing Oversmoothing in Graph Neural Networks by Changing the Activation Function. ECAI 2023: 1231-1238 - [c92]Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos:
Graph Connectivity with Noisy Queries. MFCS 2023: 47:1-47:14 - [c91]Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method. NeurIPS 2023 - [c90]Loukas Kavouras, Konstantinos Tsopelas, Giorgos Giannopoulos, Dimitris Sacharidis, Eleni Psaroudaki, Nikolaos Theologitis, Dimitrios Rontogiannis, Dimitris Fotakis, Ioannis Z. Emiris:
Fairness Aware Counterfactuals for Subgroups. NeurIPS 2023 - [i47]Loukas Kavouras, Konstantinos Tsopelas, Giorgos Giannopoulos, Dimitris Sacharidis, Eleni Psaroudaki, Nikolaos Theologitis, Dimitrios Rontogiannis, Dimitris Fotakis, Ioannis Z. Emiris:
Fairness Aware Counterfactuals for Subgroups. CoRR abs/2306.14978 (2023) - [i46]Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods. CoRR abs/2310.05309 (2023) - 2022
- [j48]Dimitris Fotakis, Laurent Gourvès:
On the distortion of single winner elections with aligned candidates. Auton. Agents Multi Agent Syst. 36(2): 37 (2022) - [j47]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. Algorithmica 84(8): 2186-2221 (2022) - [j46]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds under Limited Information. J. Artif. Intell. Res. 74: 1449-1483 (2022) - [j45]Dimitris Fotakis, Evangelos Markakis:
Special issue on algorithmic game theory (SAGT 2019). Theory Comput. Syst. 66(3): 517-518 (2022) - [j44]Giannis Fikioris, Dimitris Fotakis:
Mechanism Design for Perturbation Stable Combinatorial Auctions. Theory Comput. Syst. 66(4): 778-801 (2022) - [c89]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Dimensionality and Coordination in Voting: The Distortion of STV. AAAI 2022: 4776-4784 - [c88]Jason Milionis, Alkis Kalavasis, Dimitris A. Fotakis, Stratis Ioannidis:
Differentially Private Regression with Unbounded Covariates. AISTATS 2022: 3242-3273 - [c87]Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki:
Label Ranking through Nonparametric Regression. ICML 2022: 6622-6659 - [c86]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. IPCO 2022: 237-250 - [c85]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Linear Label Ranking with Bounded Noise. NeurIPS 2022 - [c84]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Perfect Sampling from Pairwise Comparisons. NeurIPS 2022 - [c83]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. WSDM 2022: 37-47 - [i45]Jason Milionis, Alkis Kalavasis, Dimitris Fotakis, Stratis Ioannidis:
Differentially Private Regression with Unbounded Covariates. CoRR abs/2202.11199 (2022) - [i44]Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos:
Graph Connectivity with Noisy Queries. CoRR abs/2208.10423 (2022) - [i43]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Sampling and Optimal Preference Elicitation in Simple Mechanisms. CoRR abs/2208.11787 (2022) - [i42]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Perfect Sampling from Pairwise Comparisons. CoRR abs/2211.12868 (2022) - 2021
- [j43]Dimitris Fotakis, Loukas Kavouras, Lydia Zakynthinou:
Online Facility Location in Evolving Metrics. Algorithms 14(3): 73 (2021) - [j42]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating multiple facilities on the line. Theor. Comput. Sci. 858: 13-34 (2021) - [c82]Asterios Tsiourvas, Constantinos Bitsakos, Ioannis Konstantinou, Dimitris Fotakis, Nectarios Koziris:
A Mechanism Design and Learning Approach for Revenue Maximization on Cloud Dynamic Spot Markets. CLOUD 2021: 427-432 - [c81]Dimitris Fotakis, Thanasis Pittas, Stratis Skoulakis:
Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries. AAAI 2021: 4045-4053 - [c80]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Efficient Truthful Scheduling and Resource Allocation through Monitoring. AAAI 2021: 5423-5431 - [c79]Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos:
Aggregating Incomplete and Noisy Rankings. AISTATS 2021: 2278-2286 - [c78]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Efficient Algorithms for Learning from Coarse Labels. COLT 2021: 2060-2079 - [c77]Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis:
On the Approximability of Multistage Min-Sum Set Cover. ICALP 2021: 65:1-65:19 - [c76]Dimitris Fotakis, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning for Dynamic k-Clustering. ICML 2021: 3396-3406 - [c75]Róbert Busa-Fekete, Dimitris Fotakis, Emmanouil Zampetakis:
Private and Non-private Uniformity Testing for Ranking Data. NeurIPS 2021: 9480-9492 - [c74]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Emmanouil Zampetakis:
Identity testing for Mallows model. NeurIPS 2021: 23179-23190 - [c73]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds Under Limited Information. SAGT 2021: 299-313 - [c72]Dimitris Fotakis, Panagiotis Patsilinakos:
Strategyproof Facility Location in Perturbation Stable Instances. WINE 2021: 95-112 - [e3]Dimitris Fotakis, David Ríos Insua:
Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings. Lecture Notes in Computer Science 13023, Springer 2021, ISBN 978-3-030-87755-2 [contents] - [i41]Dimitris Fotakis, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning for Dynamic k-Clustering. CoRR abs/2106.04336 (2021) - [i40]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds under Limited Information. CoRR abs/2107.02489 (2021) - [i39]Marios Papachristou, Dimitris Fotakis:
Stochastic Opinion Dynamics for Interest Prediction in Social Networks. CoRR abs/2107.03449 (2021) - [i38]Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis, Nikolas Patris:
Learning Augmented Online Facility Location. CoRR abs/2107.08277 (2021) - [i37]Dimitris Fotakis, Panagiotis Patsilinakos:
Strategyproof Facility Location in Perturbation Stable Instances. CoRR abs/2107.11977 (2021) - [i36]Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis:
On the Approximability of Multistage Min-Sum Set Cover. CoRR abs/2107.13344 (2021) - [i35]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Efficient Algorithms for Learning from Coarse Labels. CoRR abs/2108.09805 (2021) - [i34]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Dimensionality, Coordination, and Robustness in Voting. CoRR abs/2109.02184 (2021) - [i33]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. CoRR abs/2110.13324 (2021) - [i32]Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki:
Label Ranking through Nonparametric Regression. CoRR abs/2111.02749 (2021) - [i31]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds. CoRR abs/2111.06225 (2021) - [i30]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds. CoRR abs/2111.06733 (2021) - 2020
- [j41]Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas:
Improving Selfish Routing for Risk-Averse Players. Theory Comput. Syst. 64(2): 339-370 (2020) - [j40]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs on Identical and Unrelated Processors. Theory Comput. Syst. 64(5): 754-782 (2020) - [c71]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. COLT 2020: 1586-1600 - [c70]Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis:
Object Allocation and Positive Graph Externalities. ECAI 2020: 107-114 - [c69]Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis:
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ICALP 2020: 50:1-50:19 - [c68]Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas:
The Online Min-Sum Set Cover Problem. ICALP 2020: 51:1-51:16 - [c67]Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. NeurIPS 2020 - [c66]Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Asymptotically Optimal Communication in Simple Mechanisms. SAGT 2020: 17-31 - [c65]Giannis Fikioris, Dimitris Fotakis:
Mechanism Design for Perturbation Stable Combinatorial Auctions. SAGT 2020: 47-63 - [c64]Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. WAOA 2020: 143-158 - [i29]Angelo Fanelli, Dimitris Fotakis:
Local Aggregation in Preference Games. CoRR abs/2002.01251 (2020) - [i28]Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas:
The Online Min-Sum Set Cover Problem. CoRR abs/2003.02161 (2020) - [i27]Giannis Fikioris, Dimitris Fotakis:
Mechanism Design for Perturbation Stable Combinatorial Auctions. CoRR abs/2006.09889 (2020) - [i26]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. CoRR abs/2007.02392 (2020) - [i25]Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. CoRR abs/2007.08669 (2020) - [i24]Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos:
Aggregating Incomplete and Noisy Rankings. CoRR abs/2011.00810 (2020) - [i23]Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. CoRR abs/2011.02817 (2020) - [i22]Agapi Rissaki, Orestis Pavlou, Dimitris Fotakis, Vicky Papadopoulou, Andreas Efstathiou:
Solving Inverse Problems for Spectral Energy Distributions with Deep Generative Networks. CoRR abs/2012.06331 (2020)
2010 – 2019
- 2019
- [j39]Markos Epitropou, Dimitris Fotakis, Martin Hoefer, Stratis Skoulakis:
Opinion Formation Games with Aggregation and Negative Influence. Theory Comput. Syst. 63(7): 1531-1553 (2019) - [j38]Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. 754: 1-2 (2019) - [c63]Dimitris Fotakis, Kyriakos Lotidis, Chara Podimata:
A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders. AAAI 2019: 1949-1956 - [c62]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable Scheduling Beyond Identical Machines. APPROX-RANDOM 2019: 17:1-17:14 - [c61]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. COLT 2019: 529-532 - [c60]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating Multiple Facilities on the Line. IJCAI 2019: 273-279 - [c59]Konstantinos Ameranis, Nikolaos Vathis, Dimitris Fotakis:
Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows. SEA² 2019: 343-358 - [e2]Dimitris Fotakis, Evangelos Markakis:
Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, Proceedings. Lecture Notes in Computer Science 11801, Springer 2019, ISBN 978-3-030-30472-0 [contents] - [i21]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable scheduling beyond identical machines. CoRR abs/1903.11016 (2019) - [i20]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating Multiple Facilities on the Line. CoRR abs/1905.12379 (2019) - [i19]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. CoRR abs/1906.01009 (2019) - [i18]Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis:
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games. CoRR abs/1911.08704 (2019) - 2018
- [j37]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
The Power of Verification for Greedy Mechanism Design. J. Artif. Intell. Res. 62: 459-488 (2018) - [c58]Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav:
Covering Clients with Types and Budgets. ISAAC 2018: 73:1-73:12 - [c57]Dimitris Fotakis, Anthimos Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis:
Opinion Dynamics with Limited Information. WINE 2018: 282-296 - [i17]Dimitris Fotakis, Kyriakos Lotidis, Chara Podimata:
A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders. CoRR abs/1809.01803 (2018) - 2017
- [j36]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Combinatorial Auctions Without Money. Algorithmica 77(3): 756-785 (2017) - [j35]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. Algorithmica 78(3): 788-818 (2017) - [c56]Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
Stathis Zachos at 70! CIAC 2017: 469-484 - [c55]Markos Epitropou, Dimitris Fotakis, Martin Hoefer, Stratis Skoulakis:
Opinion Formation Games with Aggregation and Negative Influence. SAGT 2017: 173-185 - [c54]Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Selfish Transportation Games. SOFSEM 2017: 176-187 - [e1]Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Lecture Notes in Computer Science 10236, 2017, ISBN 978-3-319-57585-8 [contents] - [i16]Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta, Paul G. Spirakis:
Learning Powers of Poisson Binomial Distributions. CoRR abs/1707.05662 (2017) - 2016
- [j34]Dimitris Fotakis, Christos Tzamos:
Strategyproof Facility Location for Concave Cost Functions. Algorithmica 76(1): 143-167 (2016) - [j33]Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. Theory Comput. Syst. 59(4): 619-640 (2016) - [c53]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs Under Multi-round Precedences. Euro-Par 2016: 209-222 - [c52]Kyriakos Axiotis, Dimitris Fotakis:
On the Size and the Approximability of Minimum Temporally Connected Subgraphs. ICALP 2016: 149:1-149:14 - [c51]Dimitris Fotakis, Dimitris Palyvos-Giannas, Stratis Skoulakis:
Opinion Dynamics with Local Interactions. IJCAI 2016: 279-285 - [c50]Dimitris Fotakis, Christos Tzamos, Manolis Zampetakis:
Mechanism Design with Selective Verification. EC 2016: 771-788 - [c49]Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. STACS 2016: 37:1-37:14 - [c48]Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Conference Program Design with Single-Peaked and Single-Crossing Preferences. WINE 2016: 221-235 - [r2]Dimitris Fotakis, Paul (Pavlos) Spirakis:
Minimum Congestion Redundant Assignments. Encyclopedia of Algorithms 2016: 1298-1302 - [i15]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs under Multi-Round Precedences. CoRR abs/1602.05263 (2016) - [i14]Kyriakos Axiotis, Dimitris Fotakis:
On the Size and the Approximability of Minimum Temporally Connected Subgraphs. CoRR abs/1602.06411 (2016) - 2015
- [j32]Foto N. Afrati, Dimitris Fotakis, Angelos Vasilakopoulos:
Efficient lineage for SUM aggregate queries. AI Commun. 28(4): 655-663 (2015) - [j31]Dimitris Fotakis, Tobias Harks:
Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking. Theory Comput. Syst. 57(3): 673-680 (2015) - [j30]Dimitris Fotakis, Emmanouil Zampetakis:
Truthfulness Flooded Domains and the Power of Verification for Mechanism Design. ACM Trans. Economics and Comput. 3(4): 20:1-20:29 (2015) - [c47]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
The Power of Verification for Greedy Mechanism Design. AAMAS 2015: 307-315 - [c46]Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros C. Kontogiannis, Othon Michail, Sotiris E. Nikoletseas, Grammati E. Pantziou, Christos D. Zaroliagis:
A Glimpse at Paul G. Spirakis. Algorithms, Probability, Networks, and Games 2015: 3-24 - [c45]Maria I. Andreou, Dimitris Fotakis, Vicky Papadopoulou Lesta, Sotiris E. Nikoletseas, Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations. Algorithms, Probability, Networks, and Games 2015: 97-132 - [c44]Dimitris Fotakis:
A Selective Tour Through Congestion Games. Algorithms, Probability, Networks, and Games 2015: 223-241 - [c43]Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. SAGT 2015: 85-97 - [c42]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. SEA 2015: 137-150 - [c41]Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas:
Improving Selfish Routing for Risk-Averse Players. WINE 2015: 328-342 - [i13]Dimitris Fotakis, Christos Tzamos, Emmanouil Zampetakis:
Who to Trust for Truthfully Maximizing Welfare? CoRR abs/1507.02301 (2015) - [i12]Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. CoRR abs/1507.04391 (2015) - 2014
- [j29]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the hardness of network design for bottleneck routing games. Theor. Comput. Sci. 521: 107-122 (2014) - [j28]Dimitris Fotakis, Paris Siminelakis:
On the efficiency of Influence-and-Exploit strategies for revenue maximization under positive externalities. Theor. Comput. Sci. 539: 68-86 (2014) - [j27]Dimitris Fotakis, Paraschos Koutris:
Online Sum-Radii Clustering. Theor. Comput. Sci. 540: 27-39 (2014) - [j26]Dimitris Fotakis, Christos Tzamos:
On the Power of Deterministic Mechanisms for Facility Location Games. ACM Trans. Economics and Comput. 2(4): 15:1-15:37 (2014) - [c40]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Combinatorial auctions without money. AAMAS 2014: 1029-1036 - [c39]Dimitris Fotakis, Ioannis Milis, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs on Unrelated Processors. EDBT/ICDT Workshops 2014: 2-5 - [c38]Dimitris Fotakis, Thodoris Lykouris, Evangelos Markakis, Svetlana Obraztsova:
Influence Maximization in Switching-Selection Threshold Models. SAGT 2014: 122-133 - 2013
- [j25]Dimitris Fotakis, Christos Tzamos:
Strategyproof facility location with concave costs. SIGecom Exch. 12(2): 46-49 (2013) - [j24]Dimitris Fotakis, Christos Tzamos:
Winner-imposing strategyproof mechanisms for multiple Facility Location games. Theor. Comput. Sci. 472: 90-103 (2013) - [c37]Dimitris Fotakis, Christos Tzamos:
On the Power of Deterministic Mechanisms for Facility Location Games. ICALP (1) 2013: 449-460 - [c36]Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman:
Enumerating subgraph instances using map-reduce. ICDE 2013: 62-73 - [c35]Haris Angelidakis, Dimitris Fotakis, Thanasis Lianeas:
Stochastic Congestion Games with Risk-Averse Players. SAGT 2013: 86-97 - [c34]Dimitris Fotakis, Christos Tzamos:
Strategyproof facility location for concave cost functions. EC 2013: 435-452 - [c33]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. WINE 2013: 188-201 - [c32]Dimitris Fotakis, Emmanouil Zampetakis:
Truthfulness Flooded Domains and the Power of Verification for Mechanism Design. WINE 2013: 202-215 - [i11]Dimitris Fotakis, Christos Tzamos:
Strategy-Proof Facility Location for Concave Cost Functions. CoRR abs/1305.3333 (2013) - [i10]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Combinatorial Auctions without Money. CoRR abs/1310.0177 (2013) - [i9]Foto N. Afrati, Dimitris Fotakis, Angelos Vasilakopoulos:
Efficient Lineage for SUM Aggregate Queries. CoRR abs/1312.2990 (2013) - [i8]Dimitris Fotakis, Ioannis Milis, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs on Unrelated Processors. CoRR abs/1312.4203 (2013) - 2012
- [j23]Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
The Impact of Social Ignorance on Weighted Congestion Games. Theory Comput. Syst. 50(3): 559-578 (2012) - [j22]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient methods for selfish network design. Theor. Comput. Sci. 448: 9-20 (2012) - [c31]Dimitris Fotakis, Paraschos Koutris:
Online Sum-Radii Clustering. MFCS 2012: 395-406 - [c30]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. SAGT 2012: 156-167 - [c29]Dimitris Fotakis, Paris Siminelakis:
On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. WINE 2012: 270-283 - [i7]Dimitris Fotakis, Christos Tzamos:
On the Power of Deterministic Mechanisms for Facility Location Games. CoRR abs/1207.0935 (2012) - [i6]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. CoRR abs/1207.5212 (2012) - [i5]Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman:
Enumerating Subgraph Instances Using Map-Reduce. CoRR abs/1208.0615 (2012) - 2011
- [j21]Dimitris Fotakis:
Online and incremental algorithms for facility location. SIGACT News 42(1): 97-131 (2011) - [j20]Dimitris Fotakis:
Memoryless facility location in one pass. ACM Trans. Algorithms 7(4): 49:1-49:24 (2011) - [c28]Dimitris Fotakis, Piotr Krysta, Orestis Telelis:
Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116 - [i4]Dimitris Fotakis, Paraschos Koutris:
Online Sum-Radii Clustering. CoRR abs/1109.5325 (2011) - [i3]Dimitris Fotakis, Paris Siminelakis:
On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. CoRR abs/1110.1894 (2011) - 2010
- [j19]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent. Theory Comput. Syst. 47(1): 38-59 (2010) - [j18]Dimitris Fotakis:
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. Theory Comput. Syst. 47(1): 113-136 (2010) - [j17]Dimitris Fotakis:
Stackelberg Strategies for Atomic Congestion Games. Theory Comput. Syst. 47(1): 218-249 (2010) - [c27]Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos:
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT 2010: 162-173 - [c26]Dimitris Fotakis, Christos Tzamos:
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. WINE 2010: 234-245
2000 – 2009
- 2009
- [j16]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009) - [c25]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient Methods for Selfish Network Design. ICALP (2) 2009: 459-471 - [c24]Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
The Impact of Social Ignorance on Weighted Congestion Games. WINE 2009: 316-327 - [p1]Charalampos N. Moschopoulos, Panagiotis Tsiatsis, Grigorios N. Beligiannis, Dimitris Fotakis, Spiridon D. Likothanassis:
Dealing with Large Datasets Using an Artificial Intelligence Clustering Tool. Tools and Applications with Artificial Intelligence 2009: 105-120 - 2008
- [j15]Dimitris Fotakis:
On the Competitive Ratio for Online Facility Location. Algorithmica 50(1): 1-57 (2008) - [j14]Dimitris Fotakis, Paul G. Spirakis:
Cost-Balancing Tolls for Atomic Network Congestion Games. Internet Math. 5(4): 343-363 (2008) - [j13]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic congestion games among coalitions. ACM Trans. Algorithms 4(4): 52:1-52:27 (2008) - [c23]Dimitris Fotakis:
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. SAGT 2008: 33-45 - [c22]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent. SAGT 2008: 121-132 - [r1]Dimitris Fotakis, Paul G. Spirakis:
Minimum Congestion Redundant Assignments. Encyclopedia of Algorithms 2008 - 2007
- [j12]Dimitris Fotakis:
A primal-dual algorithm for online non-uniform facility location. J. Discrete Algorithms 5(1): 141-148 (2007) - [c21]Dimitris Fotakis:
Stackelberg Strategies for Atomic Congestion Games. ESA 2007: 299-310 - [c20]Dimitris Fotakis, Paul G. Spirakis:
Cost-Balancing Tolls for Atomic Network Congestion Games. WINE 2007: 179-190 - 2006
- [j11]Dimitris Fotakis, Stefanos Gritzalis:
Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks. Comput. Commun. 29(11): 2109-2122 (2006) - [j10]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. J. Discrete Algorithms 4(3): 433-454 (2006) - [j9]Dimitris Fotakis:
Incremental algorithms for Facility Location and k-Median. Theor. Comput. Sci. 361(2-3): 275-313 (2006) - [c19]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583 - [c18]Dimitris Fotakis:
Memoryless Facility Location in One Pass. STACS 2006: 608-620 - 2005
- [j8]Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. 38(2): 229-248 (2005) - [j7]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocoloring in planar graphs: Complexity and approximations. Theor. Comput. Sci. 340(3): 514-538 (2005) - [j6]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005) - [c17]Dimitris Fotakis:
A Primal-Dual Algorithm for Online Non-uniform Facility Location. Panhellenic Conference on Informatics 2005: 47-56 - [c16]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175 - 2004
- [c15]Dimitris Fotakis:
Incremental Algorithms for Facility Location and k-Median. ESA 2004: 347-358 - [c14]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Selfish Unsplittable Flows. ICALP 2004: 593-605 - 2003
- [j5]Spiridon D. Likothanassis, Grigorios N. Beligiannis, Dimitris Fotakis, Dimitris Fragoudis, Konstantinos C. Giotopoulos:
An Evolutionary Computation Technique for User Profile Optimization. Int. J. Comput. Their Appl. 10(1): 25-33 (2003) - [c13]Dimitris Fotakis:
On the Competitive Ratio for Online Facility Location. ICALP 2003: 637-652 - [c12]Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time. STACS 2003: 271-282 - 2002
- [j4]Dimitris Fotakis, Paul G. Spirakis:
Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica 32(3): 396-422 (2002) - [c11]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134 - [c10]Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. MFCS 2002: 81-92 - [c9]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. WG 2002: 223-234 - 2001
- [j3]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring. Comput. Artif. Intell. 20(2): 121-180 (2001) - [j2]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem. Bull. EATCS 75: 152-181 (2001) - [j1]Sokratis K. Katsikas, Spiridon D. Likothanassis, Grigorios N. Beligiannis, K. G. Berkeris, Dimitris Fotakis:
Genetically determined variable structure multiple model estimation. IEEE Trans. Signal Process. 49(10): 2253-2261 (2001) - [c8]Dimitris Fotakis, Spiridon D. Likothanassis, Stamatis Stefanakos:
An Evolutionary Annealing Approach to Graph Coloring. EvoWorkshops 2001: 120-129 - [c7]Spiridon D. Likothanassis, Grigorios N. Beligiannis, Dimitris Fotakis, Dimitris Fragoudis, Konstantinos C. Giotopoulos:
An Evolutionary Computation Technique for User Profile Optimization. IRI 2001: 24-29 - 2000
- [c6]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. MFCS 2000: 363-372
1990 – 1999
- 1999
- [b1]Dimitris Fotakis:
Προσεγγιστική επίλυση υπολογιστικά δύσκολων προβλημάτων: αλγόριθμοι και πολυπλοκότητα. University of Patras, Greece, 1999 - [c5]Christos Bouras, Dimitris Fotakis, Vaggelis Kapoulas, Anni Koubek, Harald Mayer, Herwig Rehatschek:
Virtual European School - VES. ICMCS, Vol. 2 1999: 1055-1057 - [c4]Dimitris Fotakis, Paul G. Spirakis:
Efficient Redundant Assignments under Fault-Tolerance Constraints. RANDOM-APPROX 1999: 156-167 - 1998
- [c3]Dimitris Fotakis, Paul G. Spirakis:
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. FSTTCS 1998: 18-29 - [i2]Dimitris Fotakis, Paul G. Spirakis:
Graph Properties that Facilitate Travelling. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Dimitris Fotakis, Paul G. Spirakis:
Random Walks, Conditional Hitting Sets and Partial Derandomization. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c2]Dimitris Fotakis, Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis:
Frequency assignment in mobile and radio networks. Networks in Distributed Computing 1997: 73-90 - 1996
- [c1]Dimitris Fotakis, Paul G. Spirakis:
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. MFCS 1996: 360-371
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-10-07 21:24 CEST 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:
