Dynamics in matching and coalition formation games with structural constraints
Artif. Intell.
2018
262
222--247
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA
Dagstuhl, Deutschland
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2018
Strategic Contention Resolution in Multiple Channels
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
Helsinki, Finland
Springer
2018
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback
Algorithmic Game Theory - 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings
Beijing, China
Springer
2018
Mutants and Residents with Different Connection Graphs in the Moran Process
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings
Buenos Aires, Argentina
Springer
2018
Approximating the Existential Theory of the Reals
Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings
Oxford, UK
Springer
2018
Additive colourful Carathéodory type results with an application to radii
Linear Algebra and its Applications
2018
554
342-357
A Local-Search Algorithm for Steiner Forest
31:1-31:17
9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Schloss Dagstuhl--Leibniz-Zentrum für Informatik
2018