search result

Cover von Algorithmic Game Theory
12th International Symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, Proceedings
Search for this author
Year: 2019
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science; 11801
Media group: MONOGRAPHIE
Cover von On the Size and the Approximability of Minimum Temporally Connected Subgraphs

On the Size and the Approximability of Minimum Temporally Connected Subgraphs

Year: 2016
Media group: LIPIcs
Cover von The Online Min-Sum Set Cover Problem

The Online Min-Sum Set Cover Problem

Year: 2020
Media group: LIPIcs
Cover von Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games

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

Author: Skoulakis, Stratis
Year: 2020
Media group: LIPIcs
Cover von Malleable Scheduling Beyond Identical Machines

Malleable Scheduling Beyond Identical Machines

Year: 2019
Media group: LIPIcs
Cover von Algorithmic Decision Theory
7th International Conference, ADT 2021, Toulouse, France, November 3 - 5, 2021, Proceedings
Search for this author
Year: 2021
Publisher: Berlin, Springer
Series: Lecture notes in artificial intelligence; 13023
Media group: MONOGRAPHIE
Cover von Algorithms and Complexity
10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings
Search for this author
Year: 2017
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science; 10236
Media group: MONOGRAPHIE
Cover von Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse

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

Year: 2016
Media group: LIPIcs
Cover von Graph Connectivity with Noisy Queries

Graph Connectivity with Noisy Queries

Year: 2023
Media group: LIPIcs
Cover von On the Approximability of Multistage Min-Sum Set Cover

On the Approximability of Multistage Min-Sum Set Cover

Year: 2021
Media group: LIPIcs
OPEN V 11.1.0.0