| 2008 |
|---|
| 85 | EE | Josep Díaz,
Lefteris M. Kirousis,
Dieter Mitsche,
Xavier Pérez-Giménez:
A new upper bound for 3-SAT.
FSTTCS 2008 |
| 84 | EE | Josep Díaz,
Dieter Mitsche,
Xavier Pérez-Giménez:
On the connectivity of dynamic random geometric graphs.
SODA 2008: 601-610 |
| 83 | EE | Josep Díaz,
Dieter Mitsche,
Xavier Pérez:
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
CoRR abs/0806.0311: (2008) |
| 82 | EE | Josep Díaz,
Lefteris M. Kirousis,
Dieter Mitsche,
Xavier Pérez-Giménez:
A new upper bound for 3-SAT
CoRR abs/0807.3600: (2008) |
| 81 | EE | Josep Díaz,
Zvi Lotker,
Maria J. Serna:
The distant-2 chromatic number of random proximity and random geometric graphs.
Inf. Process. Lett. 106(4): 144-148 (2008) |
| 80 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Efficient algorithms for counting parameterized list H-colorings.
J. Comput. Syst. Sci. 74(5): 919-937 (2008) |
| 79 | EE | Josep Díaz,
Xavier Pérez,
Maria J. Serna,
Nicholas C. Wormald:
Walkers on the Cycle and the Grid.
SIAM J. Discrete Math. 22(2): 747-775 (2008) |
| 78 | EE | Carme Àlvarez,
Josep Díaz,
Jordi Petit,
José D. P. Rolim,
Maria J. Serna:
High level communication functionalities for wireless sensor networks.
Theor. Comput. Sci. 406(3): 240-247 (2008) |
| 2007 |
|---|
| 77 | EE | Josep Díaz,
Jaroslav Nesetril:
Introduction.
Computer Science Review 1(1): 1 (2007) |
| 76 | EE | Jan Kratochvíl,
Josep Díaz,
Jirí Fiala:
Editorial.
Discrete Applied Mathematics 155(2): 79-80 (2007) |
| 75 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Complexity issues on bounded restrictive H-coloring.
Discrete Mathematics 307(16): 2082-2093 (2007) |
| 74 | EE | Josep Díaz,
Dieter Mitsche,
Xavier Pérez:
Sharp Threshold for Hamiltonicity of Random Geometric Graphs.
SIAM J. Discrete Math. 21(1): 57-65 (2007) |
| 73 | EE | Josep Díaz,
Marcin Kaminski:
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs.
Theor. Comput. Sci. 377(1-3): 271-276 (2007) |
| 72 | EE | Carme Àlvarez,
Rafel Cases,
Josep Díaz,
Jordi Petit,
Maria J. Serna:
Communication tree problems.
Theor. Comput. Sci. 381(1-3): 197-217 (2007) |
| 71 | EE | Josep Díaz,
Maria J. Serna,
Nicholas C. Wormald:
Bounds on the bisection width for random d -regular graphs.
Theor. Comput. Sci. 382(2): 120-130 (2007) |
| 2006 |
|---|
| 70 | | Josep Díaz,
Klaus Jansen,
José D. P. Rolim,
Uri Zwick:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings
Springer 2006 |
| 69 | EE | Josep Díaz,
Fabrizio Grandoni,
Alberto Marchetti-Spaccamela:
Balanced Cut Approximation in Random Geometric Graphs.
ISAAC 2006: 527-536 |
| 68 | EE | Josep Díaz,
Dimitrios M. Thilikos:
Fast FPT-Algorithms for Cleaning Grids.
STACS 2006: 361-371 |
| 67 | EE | Josep Díaz,
Jordi Petit,
Dimitrios M. Thilikos:
Kernels for the Vertex Cover Problem on the Preferred Attachment Model.
WEA 2006: 231-240 |
| 66 | EE | Josep Díaz,
Marcin Kaminski:
Max-Cut and Max-Bisection are NP-hard on unit disk graphs
CoRR abs/cs/0609128: (2006) |
| 2005 |
|---|
| 65 | EE | Josep Díaz,
G. Grammatikopoulos,
Alexis C. Kaporis,
Lefteris M. Kirousis,
Xavier Pérez,
Dionisios G. Sotiropoulos:
5-Regular Graphs are 3-Colorable with Positive Probability.
ESA 2005: 215-225 |
| 64 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
The restrictive H-coloring problem.
Discrete Applied Mathematics 145(2): 297-305 (2005) |
| 63 | EE | Carme Àlvarez,
Maria J. Blesa,
Josep Díaz,
Maria J. Serna,
Antonio Fernández:
Adversarial models for priority-based networks.
Networks 45(1): 23-35 (2005) |
| 62 | EE | Josep Díaz,
Juhani Karhumäki:
Preface.
Theor. Comput. Sci. 348(2-3): 129 (2005) |
| 61 | EE | Josep Díaz,
Vishal Sanwalani,
Maria J. Serna,
Paul G. Spirakis:
The chromatic and clique numbers of random scaled sector graphs.
Theor. Comput. Sci. 349(1): 40-51 (2005) |
| 2004 |
|---|
| 60 | | Josep Díaz,
Juhani Karhumäki,
Arto Lepistö,
Donald Sannella:
Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings
Springer 2004 |
| 59 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.
ESA 2004: 275-286 |
| 58 | EE | Josep Díaz,
Maria J. Serna,
Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs.
LATIN 2004: 49-58 |
| 57 | EE | Carme Àlvarez,
Josep Díaz,
Jordi Petit,
José D. P. Rolim,
Maria J. Serna:
Efficient and reliable high level communication in randomly deployed wireless sensor networks.
Mobility Management & Wireless Access Protocols 2004: 106-110 |
| 56 | EE | Carme Àlvarez,
Maria J. Blesa,
Josep Díaz,
Antonio Fernández,
Maria J. Serna:
The complexity of deciding stability under FFS in the Adversarial Queueing model.
Inf. Process. Lett. 90(5): 261-266 (2004) |
| 2003 |
|---|
| 55 | EE | Carme Àlvarez,
Maria J. Blesa,
Josep Díaz,
Antonio Fernández,
Maria J. Serna:
Adversarial Models for Priority-Based Networks.
MFCS 2003: 142-151 |
| 54 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
Evaluation of Basic Protocols for Optical Smart Dust Networks.
WEA 2003: 97-106 |
| 53 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
A Random Graph Model for Optical Networks of Sensors.
IEEE Trans. Mob. Comput. 2(3): 186-196 (2003) |
| 52 | EE | Josep Díaz,
Norman Do,
Maria J. Serna,
Nicholas C. Wormald:
Bounds on the max and min bisection of random cubic and random 4-regular graphs.
Theor. Comput. Sci. 307(3): 531-547 (2003) |
| 2002 |
|---|
| 51 | EE | Josep Díaz,
Jaroslav Nesetril,
Maria J. Serna,
Dimitrios M. Thilikos:
H-Colorings of Large Degree Graphs.
EurAsia-ICT 2002: 850-857 |
| 50 | EE | Josep Díaz,
Norman Do,
Maria J. Serna,
Nicholas C. Wormald:
Bisection of Random Cubic Graphs.
RANDOM 2002: 114-125 |
| 49 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
The Complexity of Restrictive H-Coloring.
WG 2002: 126-137 |
| 48 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
A survey of graph layout problems.
ACM Comput. Surv. 34(3): 313-356 (2002) |
| 47 | | Josep Díaz:
Analysis of Algorithms (AofA): Part I: 1993 -- 1998.
Bulletin of the EATCS 77: 42-62 (2002) |
| 46 | | Josep Díaz:
Primes in P (Without Assumptions).
Bulletin of the EATCS 78: 67-71 (2002) |
| 45 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Counting H-colorings of partial k-trees.
Theor. Comput. Sci. 281(1-2): 291-309 (2002) |
| 2001 |
|---|
| 44 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees.
COCOON 2001: 298-307 |
| 43 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
(H, C, K)-Coloring: Fast, Easy, and Hard Cases.
MFCS 2001: 304-315 |
| 42 | EE | Josep Díaz,
Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Maria J. Serna,
Paul G. Spirakis,
Dimitrios M. Thilikos:
Stability and non-stability of the FIFO protocol.
SPAA 2001: 48-52 |
| 41 | | Josep Díaz:
H-Colorings of Graphs.
Bulletin of the EATCS 75: 82-96 (2001) |
| 40 | EE | Carme Àlvarez,
Josep Díaz,
Maria J. Serna:
The hardness of intervalizing four colored caterpillars.
Discrete Mathematics 235(1-3): 19-27 (2001) |
| 39 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna,
Luca Trevisan:
Approximating layout problems on random graphs.
Discrete Mathematics 235(1-3): 245-253 (2001) |
| 38 | | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Approximating Layout Problems on Random Geometric Graphs.
J. Algorithms 39(1): 78-116 (2001) |
| 2000 |
|---|
| 37 | | Carme Àlvarez,
Rafel Cases,
Josep Díaz,
Jordi Petit,
Maria J. Serna:
Routing Tree Problems on Random Graphs.
ICALP Satellite Workshops 2000: 99-110 |
| 36 | | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs.
Combinatorics, Probability & Computing 9(6): (2000) |
| 35 | | Josep Díaz,
Jordi Petit,
Maria J. Serna:
Faulty Random Geometric Networks.
Parallel Processing Letters 10(4): 343-358 (2000) |
| 1999 |
|---|
| 34 | EE | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Layout Problems on Lattice Graphs.
COCOON 1999: 103-112 |
| 33 | EE | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Linear Orderings of Random Geometric Graphs.
WG 1999: 291-302 |
| 1998 |
|---|
| 32 | EE | Josep Díaz,
Jordi Petit,
Panagiotis Psycharis,
Maria J. Serna:
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution.
ISAAC 1998: 457-466 |
| 31 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
Random Geometric Problems on [0, 1]².
RANDOM 1998: 294-306 |
| 30 | EE | Josep Díaz,
Maria J. Serna,
Paul G. Spirakis:
On the Random Generation and Counting of Matchings in Dense Graphs.
Theor. Comput. Sci. 201(1-2): 281-290 (1998) |
| 1997 |
|---|
| 29 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà:
Algorithms for Learning Finite Automata from Queries: A Unified View.
Advances in Algorithms, Languages, and Complexity 1997: 53-72 |
| 28 | EE | Josep Díaz,
Alan Gibbons,
Grammati E. Pantziou,
Maria J. Serna,
Paul G. Spirakis,
Jacobo Torán:
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.
Theor. Comput. Sci. 181(2): 267-287 (1997) |
| 1996 |
|---|
| 27 | | Josep Díaz,
Maria J. Serna:
Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings
Springer 1996 |
| 26 | | Josep Díaz,
Maria J. Serna,
Jacobo Torán:
Parallel Approximation Schemes for Problems on Planar Graphs.
Acta Inf. 33(4): 387-408 (1996) |
| 25 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA.
J. UCS 2(3): 97-112 (1996) |
| 1995 |
|---|
| 24 | | Josep Díaz,
Alan Gibbons,
Grammati E. Pantziou,
Maria J. Serna,
Paul G. Spirakis,
Jacobo Torán:
Efficient Parallel Algorithms for some Tree Layout Problems.
COCOON 1995: 313-323 |
| 1994 |
|---|
| 23 | EE | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA.
COLT 1994: 208-217 |
| 22 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
The Query Complexity of Learning DFA.
New Generation Comput. 12(4): 337-358 (1994) |
| 1993 |
|---|
| 21 | | Josep Díaz,
Maria J. Serna,
Jacobo Torán:
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract).
ESA 1993: 145-156 |
| 20 | | Rafael Casas,
Josep Díaz,
Conrado Martinez:
Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model.
Theor. Comput. Sci. 117(1&2): 99-112 (1993) |
| 1992 |
|---|
| 19 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
A Note on the Query Complexity of Learning DFA (Extended Abstract).
ALT 1992: 53-62 |
| 18 | | Josep Díaz:
Graph Layout Problems.
MFCS 1992: 14-23 |
| 17 | | Ricardo A. Baeza-Yates,
Rafael Casas,
Josep Díaz,
Conrado Martinez:
On the Average Size of the Intersection of Binary Trees.
SIAM J. Comput. 21(1): 24-32 (1992) |
| 1991 |
|---|
| 16 | | Rafael Casas,
Josep Díaz,
Conrado Martinez:
Static on Random Trees.
ICALP 1991: 186-203 |
| 15 | | Josep Díaz,
Alan Gibbons,
Mike Paterson,
Jacobo Torán:
The MINSUMCUT Problem.
WADS 1991: 65-89 |
| 1990 |
|---|
| 14 | | Josep Díaz,
Jacobo Torán:
Classes of Bounded Nondeterminism.
Mathematical Systems Theory 23(1): 21-32 (1990) |
| 1989 |
|---|
| 13 | | Josep Díaz,
Fernando Orejas:
TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89)
Springer 1989 |
| 12 | | Josep Díaz,
Fernando Orejas:
TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages (CCIPL)
Springer 1989 |
| 11 | | Carme Àlvarez,
Josep Díaz,
Jacobo Torán:
Complexity Classes with Complete Problems Between P and NP-C.
FCT 1989: 13-24 |
| 10 | | Rafael Casas,
Josep Díaz,
Jean-Marc Steyaert:
Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables.
Inf. Process. Lett. 31(5): 227-232 (1989) |
| 1987 |
|---|
| 9 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
On Characterizations of the Class PSPACE/POLY.
Theor. Comput. Sci. 52: 251-267 (1987) |
| 1986 |
|---|
| 8 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
On Non- uniform Polynomial Space.
Structure in Complexity Theory Conference 1986: 35-50 |
| 1985 |
|---|
| 7 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
On some "non-uniform" complexity measures.
FCT 1985: 18-27 |
| 6 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
Examples of CFI-BI-immune and CF-levelable sets in logspace.
Bulletin of the EATCS 25: 11-13 (1985) |
| 5 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
Uniform Characterizations of Non-Uniform Complexity Measures
Information and Control 67(1-3): 53-69 (1985) |
| 1984 |
|---|
| 4 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
Some results about Logspace complexity measures.
Bulletin of the EATCS 22: 8 (1984) |
| 1983 |
|---|
| 3 | | Josep Díaz:
Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings
Springer 1983 |
| 1982 |
|---|
| 2 | | José L. Balcázar,
Josep Díaz:
A Note on a Theorem by Ladner.
Inf. Process. Lett. 15(2): 84-86 (1982) |
| 1981 |
|---|
| 1 | | Josep Díaz,
Isidro Ramos:
Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19-25, 1981, Proceedings
Springer 1981 |
