| Publication | Date of Publication | Type |
|---|
The diameter of sum basic equilibria games
Theoretical Computer Science | 2024-10-08 | Paper |
| On bipartite sum basic equilibria | 2024-09-13 | Paper |
On the PoA Conjecture: Trees versus Biconnected Components
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
| The Diameter of Sum Basic Equilibria Games | 2023-04-25 | Paper |
Some results of Maria Serna on strategic games: complexity of equilibria and models
Computer Science Review | 2021-12-20 | Paper |
Maria Serna in Barcelona
Computer Science Review | 2021-12-20 | Paper |
Firefighting as a strategic game
Internet Mathematics | 2021-03-26 | Paper |
On the price of anarchy for high-price links
(available as arXiv preprint) | 2020-06-30 | Paper |
| Max celebrity games | 2018-10-26 | Paper |
Network formation for asymmetric players and bilateral contracting
Theory of Computing Systems | 2017-01-12 | Paper |
Celebrity games
Theoretical Computer Science | 2016-09-12 | Paper |
Firefighting as a game
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Computational models for networks of tiny artifacts: a survey
Computer Science Review | 2014-10-24 | Paper |
The HOM problem is decidable
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Continuous monitoring in the dynamic sensor field model
Theoretical Computer Science | 2013-01-07 | Paper |
Equilibria problems on games: complexity versus succinctness
Journal of Computer and System Sciences | 2012-01-11 | Paper |
The robustness of stability under link and node failures
Theoretical Computer Science | 2011-12-07 | Paper |
On the proper intervalization of colored caterpillar trees
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
On the proper intervalization of colored caterpillar trees
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
High level communication functionalities for wireless sensor networks
Theoretical Computer Science | 2008-11-12 | Paper |
Communication tree problems
Theoretical Computer Science | 2007-09-03 | Paper |
The Proper Interval Colored Graph problem for caterpillar trees
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing | 2005-02-21 | Paper |
The hardness of intervalizing four colored caterpillars
Discrete Mathematics | 2001-07-18 | Paper |
A compendium of problems complete for symmetric logarithmic space
Computational Complexity | 2001-04-17 | Paper |
On adaptive DLOGTIME and POLYLOGTIME reductions
Theoretical Computer Science | 1997-02-28 | Paper |
A note on logspace optimization
Computational Complexity | 1996-05-27 | Paper |
Adaptive logspace reducibility and parallel time
Mathematical Systems Theory | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 176523 (Why is no real title available?) | 1993-05-18 | Paper |
A very hard log-space counting class
Theoretical Computer Science | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 17527 (Why is no real title available?) | 1992-06-26 | Paper |
The parallel complexity of two problems on concurrency
Information Processing Letters | 1991-01-01 | Paper |
