Carme Àlvarez

Theor. Comput. Sci., 2024

2023

On the PoA Conjecture: Trees versus Biconnected Components.

[BibT_eX]

[DOI]

Arnau Messegué Buisan

SIAM J. Discret. Math., June, 2023

Computing a Best Response against a Maximum Disruption Attack.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Some results of Maria Serna on strategic games: Complexity of equilibria and models.

[BibT_eX]

[DOI]

Amalia Duch

Comput. Sci. Rev., 2021

Maria Serna in Barcelona.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2021

2020

New Insights into the Structure of Equilibria for the Network Creation Game.

[BibT_eX]

[DOI]

CoRR, 2020

2019

On the Price of Anarchy for High-Price Links.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

2018

On the Constant Price of Anarchy Conjecture.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Network Creation Games: Structure vs Anarchy.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Celebrity games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Network Formation for Asymmetric Players and Bilateral Contracting.

[BibT_eX]

[DOI]

Aleix Fernàndez

Theory Comput. Syst., 2016

Firefighting as a Strategic Game.

[BibT_eX]

[DOI]

Hendrik Molter

Internet Math., 2016

Max Celebrity Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015

Preface.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Stars and Celebrities: A Network Creation Game.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Firefighting as a Game.

[BibT_eX]

[DOI]

Hendrik Molter

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2012

Continuous monitoring in the dynamic sensor field model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Network Formation: Heterogeneous Traffic, Bilateral Contracting and Myopic Dynamics

[BibT_eX]

[DOI]

Aleix Fernàndez

CoRR, 2012

2011

The robustness of stability under link and node failures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Equilibria problems on games: Complexity versus succinctness.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Computational models for networks of tiny artifacts: A survey.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Comput. Sci. Rev., 2011

On the Existence of Nash Equilibria in Strategic Search Games.

[BibT_eX]

[DOI]

Amalia Duch

Dimitrios M. Thilikos

Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

2010

The HOM problem is decidable.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009

Preface to special section of selected papers from WEA 2006.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

On the proper intervalization of colored caterpillar trees.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Sensor Field: A Computational Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

High level communication functionalities for wireless sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

Communication tree problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2005

Adversarial models for priority-based networks.

[BibT_eX]

[DOI]

Networks, 2005

Pure Nash equilibria in games with a large number of actions

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, .

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A Characterization of Universal Stability in the Adversarial Queuing Model.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

The complexity of deciding stability under FFS in the Adversarial Queueing model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Efficient and reliable high level communication in randomly deployed wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004

The Impact of Failure Management on the Stability of Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

2002

Universal stability of undirected graphs in the adversarial queueing model.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

2001

The hardness of intervalizing four colored caterpillars.

[BibT_eX]

[DOI]

Josep Díaz

Discret. Math., 2001

2000

A compendium of problems complete for symmetric logarithmic space.

[BibT_eX]

[DOI]

Raymond Greenlaw

Comput. Complex., 2000

Routing Tree Problems on Random Graphs.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

1995

On Adaptive DLOGTIME and POLYLOGTIME Reductions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Adaptive Logspace Reducibility and Parallel Time.

[BibT_eX]

[DOI]

José L. Balcázar

Math. Syst. Theory, 1995

A Note on Logspace Optimization.

[BibT_eX]

[DOI]

Comput. Complex., 1995

1994

On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1993

A Very Hard log-Space Counting Class.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

1991

The Parallel Complexity of Two Problems on Concurrency.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Functional Oracle Queries as a Measure of Parallel Time.

[BibT_eX]

[DOI]

José L. Balcázar

Proceedings of the STACS 91, 1991

Parallel Complexity in the Design and Analysis on Conurrent Systems.

[BibT_eX]

[DOI]

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1989

Complexity Classes with Complete Problems Between P and NP-C.

[BibT_eX]

[DOI]