Dimitris Fotakis, Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis. Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. In Artur Czumaj, Anuj Dawar, Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). Volume 168 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{FotakisKLMPS20, title = {Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games}, author = {Dimitris Fotakis and Vardis Kandiros and Thanasis Lianeas and Nikos Mouzakis and Panagiotis Patsilinakos and Stratis Skoulakis}, year = {2020}, doi = {10.4230/LIPIcs.ICALP.2020.50}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.50}, researchr = {https://researchr.org/publication/FotakisKLMPS20}, cites = {0}, citedby = {0}, booktitle = {47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)}, editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli}, volume = {168}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-138-2}, }