The Weighted Sperner's Set Problem. - Xavier Berenguer; Josep Díaz (MFCS, 1980)

A Note on a Theorem by Ladner. - José L. Balcázar; Josep Díaz (Inf. Process. Lett., 1982)

A Solution of the Sperner-Erdös Problem. - Xavier Berenguer; Josep Díaz; Lawrence H. Harper (Theor. Comput. Sci., 1982)

Some results about Logspace complexity measures. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Bull. EATCS, 1984)

On some "non-uniform" complexity measures. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (FCT, 1985)

Examples of CFI-BI-immune and CF-levelable sets in logspace. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Bull. EATCS, 1985)

Uniform Characterizations of Non-Uniform Complexity Measures - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Inf. Control., 1985)

On Non- uniform Polynomial Space. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (SCT, 1986)

On Characterizations of the Class PSPACE/POLY. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Theor. Comput. Sci., 1987)

Structural complexity, 1st Edition. - José Luis Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1988)

Complexity Classes with Complete Problems Between P and NP-C. - Carme Àlvarez; Josep Díaz; Jacobo Torán (FCT, 1989)

Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables. - Rafael Casas; Josep Díaz; Jean-Marc Steyaert (Inf. Process. Lett., 1989)

Classes of Bounded Nondeterminism. - Josep Díaz; Jacobo Torán (Math. Syst. Theory, 1990)

Structural Complexity I - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1990)

Structural Complexity II - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1990)

Static on Random Trees. - Rafael Casas; Josep Díaz; Conrado Martinez (ICALP, 1991)

The MINSUMCUT Problem. - Josep Díaz; Alan Gibbons; Mike Paterson; Jacobo Torán (WADS, 1991)

A Note on the Query Complexity of Learning DFA (Extended Abstract). - José L. Balcázar; Josep Díaz; Ricard Gavaldà; Osamu Watanabe 001 (ALT, 1992)

Graph Layout Problems. - Josep Díaz (MFCS, 1992)

On the Average Size of the Intersection of Binary Trees. - Ricardo A. Baeza-Yates; Rafael Casas; Josep Díaz; Conrado Martinez (SIAM J. Comput., 1992)

Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). - Josep Díaz; Maria J. Serna; Jacobo Torán (ESA, 1993)

Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model. - Rafael Casas; Josep Díaz; Conrado Martinez (Theor. Comput. Sci., 1993)

The Query Complexity of Learning DFA. - José L. Balcázar; Josep Díaz; Ricard Gavaldà; Osamu Watanabe 001 (New Gener. Comput., 1994)

Efficient Parallel Algorithms for some Tree Layout Problems. - Josep Díaz; Alan Gibbons; Grammati E. Pantziou; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (COCOON, 1995)

Structural Complexity I, Second Edition - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1995)

Parallel Approximation Schemes for Problems on Planar Graphs. - Josep Díaz; Maria J. Serna; Jacobo Torán (Acta Informatica, 1996)

An Optimal Parallel Algorithm for Learning DFA. - José L. Balcázar; Josep Díaz; Ricard Gavaldà; Osamu Watanabe 001 (J. Univers. Comput. Sci., 1996)

Algorithms for Learning Finite Automata from Queries: A Unified View. - José L. Balcázar; Josep Díaz; Ricard Gavaldà (Advances in Algorithms, Languages, and Complexity, 1997)

Linear and nonlinear systems: A survey. - Josep Díaz; Maria J. Serna; Paul G. Spirakis (Contemporary Trends in Discrete Mathematics, 1997)

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. - Josep Díaz; Alan Gibbons; Grammati E. Pantziou; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (Theor. Comput. Sci., 1997)

A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. - Josep Díaz; Jordi Petit; Panagiotis Psycharis; Maria J. Serna (ISAAC, 1998)

Random Geometric Problems on [0, 1]². - Josep Díaz; Jordi Petit; Maria J. Serna (RANDOM, 1998)

On the Random Generation and Counting of Matchings in Dense Graphs. - Josep Díaz; Maria J. Serna; Paul G. Spirakis (Theor. Comput. Sci., 1998)

Layout Problems on Lattice Graphs. - Josep Díaz; Mathew D. Penrose; Jordi Petit; Maria J. Serna (COCOON, 1999)

Linear Orderings of Random Geometric Graphs. - Josep Díaz; Mathew D. Penrose; Jordi Petit; Maria J. Serna (WG, 1999)

Routing Tree Problems on Random Graphs. - Carme Àlvarez; Rafel Cases; Josep Díaz; Jordi Petit; Maria J. Serna (ICALP Satellite Workshops, 2000)

Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. - Josep Díaz; Mathew D. Penrose; Jordi Petit; Maria J. Serna (Comb. Probab. Comput., 2000)

Faulty Random Geometric Networks. - Josep Díaz; Jordi Petit; Maria J. Serna (Parallel Process. Lett., 2000)

Recent Results on Parameterized H-Colorings. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (Graphs, Morphisms and Statistical Physics, 2001)

(H, C, K)-Coloring: Fast, Easy, and Hard Cases. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (MFCS, 2001)

Stability and non-stability of the FIFO protocol. - Josep Díaz; Dimitrios Koukopoulos; Sotiris E. Nikoletseas; Maria J. Serna; Paul G. Spirakis; Dimitrios M. Thilikos (SPAA, 2001)

The hardness of intervalizing four colored caterpillars. - Carme Àlvarez; Josep Díaz; Maria J. Serna (Discret. Math., 2001)

Approximating layout problems on random graphs. - Josep Díaz; Jordi Petit; Maria J. Serna; Luca Trevisan 001 (Discret. Math., 2001)

H-Colorings of Graphs. - Josep Díaz (Bull. EATCS, 2001)

Approximating Layout Problems on Random Geometric Graphs. - Josep Díaz; Mathew D. Penrose; Jordi Petit; Maria J. Serna (J. Algorithms, 2001)

H-Colorings of Large Degree Graphs. - Josep Díaz; Jaroslav Nesetril; Maria J. Serna; Dimitrios M. Thilikos (EurAsia-ICT, 2002)

Bisection of Random Cubic Graphs. - Josep Díaz; Norman Do; Maria J. Serna; Nicholas C. Wormald (RANDOM, 2002)

The Complexity of Restrictive H-Coloring. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (WG, 2002)

A survey of graph layout problems. - Josep Díaz; Jordi Petit; Maria J. Serna (ACM Comput. Surv., 2002)

Primes in P (Without Assumptions). - Josep Díaz (Bull. EATCS, 2002)

Analysis of Algorithms (AofA): Part I: 1993 – 1998. - Josep Díaz (Bull. EATCS, 2002)

Counting H-colorings of partial k-trees. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (Theor. Comput. Sci., 2002)

Evaluation of Basic Protocols for Optical Smart Dust Networks. - Josep Díaz; Jordi Petit; Maria J. Serna (WEA, 2003)

Bounds on the max and min bisection of random cubic and random 4-regular graphs. - Josep Díaz; Norman Do; Maria J. Serna; Nicholas C. Wormald (Theor. Comput. Sci., 2003)

A Random Graph Model for Optical Networks of Sensors. - Josep Díaz; Jordi Petit; Maria J. Serna (IEEE Trans. Mob. Comput., 2003)

Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (ESA, 2004)

Computation of the Bisection Width for Random d-Regular Graphs. - Josep Díaz; Maria J. Serna; Nicholas C. Wormald (LATIN, 2004)

Efficient and reliable high level communication in randomly deployed wireless sensor networks. - Carme Àlvarez; Josep Díaz; Jordi Petit; José D. P. Rolim; Maria J. Serna (Mobility Management & Wireless Access Protocols, 2004)

The complexity of deciding stability under FFS in the Adversarial Queueing model. - Carme Àlvarez; Maria J. Blesa; Josep Díaz; Antonio Fernández 001; Maria J. Serna (Inf. Process. Lett., 2004)

5-Regular Graphs are 3-Colorable with Positive Probability. - Josep Díaz; G. Grammatikopoulos; Alexis C. Kaporis; Lefteris M. Kirousis; Xavier Pérez-Giménez; Dionisios G. Sotiropoulos (ESA, 2005)

Connectivity for Wireless Agents Moving on a Cycle or Grid. - Josep Díaz; Xavier Pérez-Giménez; Maria J. Serna; Nicholas C. Wormald (STACS, 2005)

The restrictive H-coloring problem. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (Discret. Appl. Math., 2005)

Adversarial models for priority-based networks. - Carme Àlvarez; Maria J. Blesa; Josep Díaz; Maria J. Serna; Antonio Fernández 001 (Networks, 2005)

Preface. - Josep Díaz; Juhani Karhumäki (Theor. Comput. Sci., 2005)

The chromatic and clique numbers of random scaled sector graphs. - Josep Díaz; Vishal Sanwalani; Maria J. Serna; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Fast FPT-Algorithms for Cleaning Grids. - Josep Díaz; Dimitrios M. Thilikos (STACS, 2006)

Kernels for the Vertex Cover Problem on the Preferred Attachment Model. - Josep Díaz; Jordi Petit; Dimitrios M. Thilikos (WEA, 2006)

Dynamic Random Geometric Graphs - Josep Díaz; Dieter Mitsche; Xavier Pérez-Giménez (CoRR, 2007)

Introduction. - Josep Díaz; Jaroslav Nesetril (Comput. Sci. Rev., 2007)

Editorial. - Jan Kratochvíl; Josep Díaz; Jirí Fiala 001 (Discret. Appl. Math., 2007)

Complexity issues on bounded restrictive H-coloring. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (Discret. Math., 2007)

Sharp Threshold for Hamiltonicity of Random Geometric Graphs. - Josep Díaz; Dieter Mitsche; Xavier Pérez-Giménez (SIAM J. Discret. Math., 2007)

Communication tree problems. - Carme Àlvarez; Rafel Cases; Josep Díaz; Jordi Petit; Maria J. Serna (Theor. Comput. Sci., 2007)

MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. - Josep Díaz; Marcin Kaminski 001 (Theor. Comput. Sci., 2007)

Bounds on the bisection width for random d -regular graphs. - Josep Díaz; Maria J. Serna; Nicholas C. Wormald (Theor. Comput. Sci., 2007)

A new upper bound for 3-SAT. - Josep Díaz; Lefteris M. Kirousis; Dieter Mitsche; Xavier Pérez-Giménez (FSTTCS, 2008)

On the connectivity of dynamic random geometric graphs. - Josep Díaz; Dieter Mitsche; Xavier Pérez-Giménez (SODA, 2008)

On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs - Josep Díaz; Dieter Mitsche; Xavier Pérez-Giménez (CoRR, 2008)

The distant-2 chromatic number of random proximity and random geometric graphs. - Josep Díaz; Zvi Lotker; Maria J. Serna (Inf. Process. Lett., 2008)

Efficient algorithms for counting parameterized list H-colorings. - Josep Díaz; Maria J. Serna; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2008)

Walkers on the Cycle and the Grid. - Josep Díaz; Xavier Pérez-Giménez; Maria J. Serna; Nicholas C. Wormald (SIAM J. Discret. Math., 2008)

High level communication functionalities for wireless sensor networks. - Carme Àlvarez; Josep Díaz; Jordi Petit; José D. P. Rolim; Maria J. Serna (Theor. Comput. Sci., 2008)

Paradigms for fast parallel approximability (Reprint from 1997). - Josep Díaz; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (Cambridge University Press, 2009)

On the Power of Mediators. - Josep Díaz; Dieter Mitsche; Navin Rustagi; Jared Saia (WINE, 2009)

On the chromatic number of a random 5-regular graph. - Josep Díaz; Alexis C. Kaporis; G. D. Kemkes; Lefteris M. Kirousis; Xavier Pérez-Giménez; Nicholas C. Wormald (J. Graph Theory, 2009)

Balanced cut approximation in random geometric graphs. - Josep Díaz; Fabrizio Grandoni 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2009)

On the satisfiability threshold of formulas with three literals per clause. - Josep Díaz; Lefteris M. Kirousis; Dieter Mitsche; Xavier Pérez-Giménez (Theor. Comput. Sci., 2009)

Large Connectivity for Dynamic Random Geometric Graphs. - Josep Díaz; Dieter Mitsche; Xavier Pérez-Giménez (IEEE Trans. Mob. Comput., 2009)

Book review. - Josep Díaz (Comput. Sci. Rev., 2010)

The cook-book approach to the differential equation method. - Josep Díaz; Dieter Mitsche (Comput. Sci. Rev., 2010)

A note on the subgraphs of the (2×∞)-grid. - Josep Díaz; Marcin Kaminski 001; Dimitrios M. Thilikos (Discret. Math., 2010)

Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. - Josep Díaz; Alberto Marchetti-Spaccamela; Dieter Mitsche; Paolo Santi; Julinda Stefa (ESA, 2011)

Planar Metric Dimension is NP-complete - Josep Díaz; Olli Pottonen; Erik Jan van Leeuwen (CoRR, 2011)

Cris Moore, Stephen Mertens, , The Nature of Computation (2011) Oxford UP. - Josep Díaz (Comput. Sci. Rev., 2011)

Editorial. - Tiziana Calamoneri; Josep Díaz (J. Discrete Algorithms, 2011)

Theoretical Aspects of Graph Models for MANETs. - Josep Díaz; Dieter Mitsche; Paolo Santi (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

On the Complexity of Metric Dimension. - Josep Díaz; Olli Pottonen; Maria J. Serna; Erik Jan van Leeuwen (ESA, 2012)

Can Fixation be Guaranteed in the Generalized Moran Process? - Josep Díaz; Leslie Ann Goldberg; George B. Mertzios; David Richerby; Maria J. Serna; Paul G. Spirakis (CoRR, 2012)

Book Review: George Dyson "Turing's Cathedral: The Origins of the Digital Universe" (2012) Pantheon Books. - Josep Díaz (Comput. Sci. Rev., 2012)

A personal account of Turing's imprint on the development of computer science. - Josep Díaz; Carme Torras (Comput. Sci. Rev., 2012)

Continuous monitoring in the dynamic sensor field model. - Carme Àlvarez; Josep Díaz; Dieter Mitsche; Maria J. Serna (Theor. Comput. Sci., 2012)

The Power of Choice for Random Satisfiability. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (APPROX-RANDOM, 2013)

Approximating Fixation Probabilities in the Generalized Moran Process. - Josep Díaz; Leslie Ann Goldberg; George B. Mertzios; David Richerby; Maria J. Serna; Paul G. Spirakis (Algorithmica, 2014)

Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Yiannis Mourtos; Maria J. Serna (CoRR, 2014)

On the relation between graph distance and Euclidean distance in random geometric graphs. - Josep Díaz; Dieter Mitsche; Guillem Perarnau; Xavier Pérez-Giménez (CoRR, 2014)

On the Stability of Generalized Second Price Auctions with Budgets. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Evangelos Markakis; Maria J. Serna (Theory Comput. Syst., 2016)

Absorption time of the Moran process. - Josep Díaz; Leslie Ann Goldberg; David Richerby; Maria J. Serna (Random Struct. Algorithms, 2016)

Minimum bisection is NP-hard on unit disk graphs. - Josep Díaz; George B. Mertzios (Inf. Comput., 2017)

The social cost of congestion games by imposing variable delays. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Ioannis Mourtos; Maria J. Serna (ICT Express, 2017)

Complexity of metric dimension on planar graphs. - Josep Díaz; Olli Pottonen; Maria J. Serna; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2017)

Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions. - Josep Díaz; Mordecai J. Golin (CoRR, 2018)

EATCS Fellows 2019 - Call for Nominations. - Josep Díaz (Bull. EATCS, 2018)

The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. - Josep Díaz; Mordecai J. Golin (APPROX-RANDOM, 2019)

Algorithmically Efficient Syntactic Characterization of Possibility Domains. - Josep Díaz; Lefteris M. Kirousis; Sofia Kokonezi; John Livieratos (ICALP, 2019)

EATCS Fellows 2020 - Call for Nominations. - Christel Baier; Mikolaj Bojanczyk; Mariangiola Dezani; Josep Díaz; Giuseppe F. Italiano (Bull. EATCS, 2019)

On List k-Coloring Convex Bipartite Graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (CoRR, 2020)

The making of a new science: A personal Journey Through the Early Years of Theoretical Computer Science, Ausiello Giorgio, Fisher Adam (Eds.), in: Valley of Genius: The uncensored History of Silicon Valley. Twelve (Hachette) (2018). - Josep Díaz (Comput. Sci. Rev., 2020)

EATCS Fellows 2021 - Call for Nominations. - Christel Baier; Mikolaj Bojanczyk; Mariangiola Dezani; Josep Díaz; Giuseppe F. Italiano (Bull. EATCS, 2020)

Learning random points from geometric graphs or orderings. - Josep Díaz; Colin McDiarmid; Dieter Mitsche (Random Struct. Algorithms, 2020)

A survey of the modified Moran process and evolutionary graph theory. - Josep Díaz; Dieter Mitsche (Comput. Sci. Rev., 2021)

Preface. - Josep Díaz; Jarik Nesetril (Comput. Sci. Rev., 2021)

Improved Reconstruction of Random Geometric Graphs. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (ICALP, 2022)

Dynamic random graphs with vertex removal. - Josep Díaz; Lyuben Lichev; Bas Lodewijks (CoRR, 2022)

On Vertex Bisection Width of Random d-Regular Graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (CoRR, 2022)

The multicolored graph realization problem. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (Discret. Appl. Math., 2024)

Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (Eur. J. Comb., 2024)

On minimum vertex bisection of random d-regular graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (J. Comput. Syst. Sci., 2024)

The Metric Dimension of Sparse Random Graphs. - Josep Díaz; Harrison Hartle; Cristopher Moore (CoRR, 2025)