default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosep Díaz
Person information
- affiliation: Polytechnic University of Catalonia, Departament of Computer Science
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j73]Josep Díaz, Öznur Yasar Diner
, Maria J. Serna, Oriol Serra:
The multicolored graph realization problem. Discret. Appl. Math. 354: 146-159 (2024)- [j72]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. Eur. J. Comb. 121: 103842 (2024) - [j71]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
On minimum vertex bisection of random d-regular graphs. J. Comput. Syst. Sci. 144: 103550 (2024) - 2022
- [c49]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. ICALP 2022: 48:1-48:17 - [i23]Josep Díaz, Lyuben Lichev, Bas Lodewijks:
Dynamic random graphs with vertex removal. CoRR abs/2207.05046 (2022) - [i22]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
On Vertex Bisection Width of Random d-Regular Graphs. CoRR abs/2211.03206 (2022) - 2021
- [j70]Josep Díaz, Dieter Mitsche:
A survey of the modified Moran process and evolutionary graph theory. Comput. Sci. Rev. 39: 100347 (2021) - [j69]Josep Díaz, Jarik Nesetril:
Preface. Comput. Sci. Rev. 39: 100354 (2021) - [i21]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
The Multicolored Graph Realization Problem. CoRR abs/2103.12899 (2021) - [i20]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. CoRR abs/2107.14323 (2021) - 2020
- [j68]Josep Díaz:
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). Comput. Sci. Rev. 35: 100202 (2020) - [j67]Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano:
EATCS Fellows 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [j66]Josep Díaz, Colin McDiarmid, Dieter Mitsche:
Learning random points from geometric graphs or orderings. Random Struct. Algorithms 57(2): 339-370 (2020) - [i19]Josep Díaz, Öznur Yasar Diner, Maria J. Serna, Oriol Serra:
On List k-Coloring Convex Bipartite Graphs. CoRR abs/2002.02729 (2020)
2010 – 2019
- 2019
- [j65]Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano:
EATCS Fellows 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [c48]Josep Díaz, Mordecai J. Golin:
The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. APPROX-RANDOM 2019: 35:1-35:14 - [c47]Josep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos:
Algorithmically Efficient Syntactic Characterization of Possibility Domains. ICALP 2019: 50:1-50:13 - [i18]Josep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos:
Algorithmically Efficient Syntactic Characterization of Possibility Domains. CoRR abs/1901.00138 (2019) - 2018
- [j64]Josep Díaz:
EATCS Fellows 2019 - Call for Nominations. Bull. EATCS 126 (2018) - [i17]Josep Díaz, Mordecai J. Golin:
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions. CoRR abs/1807.06845 (2018) - [i16]Josep Díaz, Colin McDiarmid, Dieter Mitsche:
Learning random points from geometric graphs or orderings. CoRR abs/1809.09879 (2018) - 2017
- [j63]Josep Díaz, George B. Mertzios:
Minimum bisection is NP-hard on unit disk graphs. Inf. Comput. 256: 83-92 (2017) - [j62]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Ioannis Mourtos, Maria J. Serna:
The social cost of congestion games by imposing variable delays. ICT Express 3(4): 155-159 (2017) - [j61]Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen:
Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83(1): 132-158 (2017) - 2016
- [j60]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. Theory Comput. Syst. 59(1): 1-23 (2016) - [j59]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption time of the Moran process. Random Struct. Algorithms 49(1): 137-159 (2016) - 2014
- [j58]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica 69(1): 78-91 (2014) - [c46]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. APPROX-RANDOM 2014: 630-642 - [c45]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. LATIN 2014: 695-706 - [c44]Josep Díaz, George B. Mertzios:
Minimum Bisection Is NP-hard on Unit Disk Graphs. MFCS (2) 2014: 251-262 - [e9]Josep Díaz, Ivan Lanese, Davide Sangiorgi:
Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8705, Springer 2014, ISBN 978-3-662-44601-0 [contents] - [i15]Josep Díaz, George B. Mertzios:
Minimum Bisection is NP-hard on Unit Disk Graphs. CoRR abs/1404.0117 (2014) - [i14]Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez:
On the relation between graph distance and Euclidean distance in random geometric graphs. CoRR abs/1404.4757 (2014) - [i13]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Yiannis Mourtos, Maria J. Serna:
Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. CoRR abs/1406.5153 (2014) - 2013
- [c43]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. APPROX-RANDOM 2013: 484-496 - [i12]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. CoRR abs/1309.6474 (2013) - [i11]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. CoRR abs/1311.7631 (2013) - 2012
- [j57]Josep Díaz:
Book Review: George Dyson "Turing's Cathedral: The Origins of the Digital Universe" (2012) Pantheon Books. Comput. Sci. Rev. 6(4): 185-186 (2012) - [j56]Josep Díaz, Carme Torras:
A personal account of Turing's imprint on the development of computer science. Comput. Sci. Rev. 6(5-6): 225-234 (2012) - [j55]Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna:
Continuous monitoring in the dynamic sensor field model. Theor. Comput. Sci. 463: 114-122 (2012) - [c42]Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen:
On the Complexity of Metric Dimension. ESA 2012: 419-430 - [c41]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating fixation probabilities in the generalized Moran process. SODA 2012: 954-960 - [i10]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Can Fixation be Guaranteed in the Generalized Moran Process? CoRR abs/1202.0436 (2012) - [i9]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. CoRR abs/1211.6997 (2012) - 2011
- [j54]Josep Díaz, Jaroslav Nesetril:
Introduction. Comput. Sci. Rev. 5(1): 1 (2011) - [j53]Josep Díaz:
Cris Moore, Stephen Mertens, , The Nature of Computation (2011) Oxford UP. Comput. Sci. Rev. 5(4): 341-345 (2011) - [j52]Tiziana Calamoneri, Josep Díaz:
Editorial. J. Discrete Algorithms 9(3): 213 (2011) - [c40]Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna:
Continuous Monitoring in the Dynamic Sensor Field Model. ALGOSENSORS 2011: 161-172 - [c39]Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa:
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. ESA 2011: 723-735 - [p1]Josep Díaz, Dieter Mitsche, Paolo Santi:
Theoretical Aspects of Graph Models for MANETs. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 161-190 - [i8]Josep Díaz, Olli Pottonen, Erik Jan van Leeuwen:
Planar Metric Dimension is NP-complete. CoRR abs/1107.2256 (2011) - [i7]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. CoRR abs/1111.3321 (2011) - 2010
- [j51]Josep Díaz:
Book review. Comput. Sci. Rev. 4(2): 125-127 (2010) - [j50]Josep Díaz, Dieter Mitsche:
The cook-book approach to the differential equation method. Comput. Sci. Rev. 4(3): 129-151 (2010) - [j49]Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos:
A note on the subgraphs of the (2×∞)-grid. Discret. Math. 310(3): 531-536 (2010) - [e8]Tiziana Calamoneri, Josep Díaz:
Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings. Lecture Notes in Computer Science 6078, Springer 2010, ISBN 978-3-642-13072-4 [contents] - [i6]Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa:
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. CoRR abs/1007.5240 (2010)
2000 – 2009
- 2009
- [b5]Josep Díaz, Maria J. Serna, Paul G. Spirakis, Jacobo Torán:
Paradigms for fast parallel approximability (Reprint from 1997). Cambridge international series on parallel computation 8, Cambridge University Press 2009, ISBN 978-0-521-43170-5, pp. I-VIII, 1-158 - [j48]Josep Díaz, Jarik Nesetril:
Introduction. Comput. Sci. Rev. 3(2): 53 (2009) - [j47]Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez-Giménez, Nicholas C. Wormald:
On the chromatic number of a random 5-regular graph. J. Graph Theory 61(3): 157-191 (2009) - [j46]Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela:
Balanced cut approximation in random geometric graphs. Theor. Comput. Sci. 410(27-29): 2725-2731 (2009) - [j45]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
On the satisfiability threshold of formulas with three literals per clause. Theor. Comput. Sci. 410(30-32): 2920-2934 (2009) - [j44]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Large Connectivity for Dynamic Random Geometric Graphs. IEEE Trans. Mob. Comput. 8(6): 821-835 (2009) - [c38]Josep Díaz, Dieter Mitsche, Navin Rustagi, Jared Saia:
On the Power of Mediators. WINE 2009: 455-462 - 2008
- [j43]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) - [j42]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) - [j41]Josep Díaz, Xavier Pérez-Giménez, Maria J. Serna, Nicholas C. Wormald:
Walkers on the Cycle and the Grid. SIAM J. Discret. Math. 22(2): 747-775 (2008) - [j40]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) - [c37]Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
A new upper bound for 3-SAT. FSTTCS 2008: 163-174 - [c36]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
On the connectivity of dynamic random geometric graphs. SODA 2008: 601-610 - [i5]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs. CoRR abs/0806.0311 (2008) - [i4]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) - 2007
- [j39]Josep Díaz, Jaroslav Nesetril:
Introduction. Comput. Sci. Rev. 1(1): 1 (2007) - [j38]Jan Kratochvíl, Josep Díaz, Jirí Fiala:
Editorial. Discret. Appl. Math. 155(2): 79-80 (2007) - [j37]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Complexity issues on bounded restrictive H-coloring. Discret. Math. 307(16): 2082-2093 (2007) - [j36]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Sharp Threshold for Hamiltonicity of Random Geometric Graphs. SIAM J. Discret. Math. 21(1): 57-65 (2007) - [j35]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) - [j34]Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna:
Communication tree problems. Theor. Comput. Sci. 381(1-3): 197-217 (2007) - [j33]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) - [i3]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Dynamic Random Geometric Graphs. CoRR abs/cs/0702074 (2007) - 2006
- [c35]Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela:
Balanced Cut Approximation in Random Geometric Graphs. ISAAC 2006: 527-536 - [c34]Josep Díaz, Dimitrios M. Thilikos:
Fast FPT-Algorithms for Cleaning Grids. STACS 2006: 361-371 - [c33]Josep Díaz, Jordi Petit, Dimitrios M. Thilikos:
Kernels for the Vertex Cover Problem on the Preferred Attachment Model. WEA 2006: 231-240 - [e7]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. Lecture Notes in Computer Science 4110, Springer 2006, ISBN 3-540-38044-2 [contents] - [i2]Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Sharp threshold for hamiltonicity of random geometric graphs. CoRR abs/cs/0607023 (2006) - [i1]Josep Díaz, Marcin Kaminski:
Max-Cut and Max-Bisection are NP-hard on unit disk graphs. CoRR abs/cs/0609128 (2006) - 2005
- [j32]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
The restrictive H-coloring problem. Discret. Appl. Math. 145(2): 297-305 (2005) - [j31]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) - [j30]Josep Díaz, Juhani Karhumäki:
Preface. Theor. Comput. Sci. 348(2-3): 129 (2005) - [j29]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) - [c32]Josep Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, Xavier Pérez-Giménez, Dionisios G. Sotiropoulos:
5-Regular Graphs are 3-Colorable with Positive Probability. ESA 2005: 215-225 - [c31]Josep Díaz, Xavier Pérez-Giménez, Maria J. Serna, Nicholas C. Wormald:
Connectivity for Wireless Agents Moving on a Cycle or Grid. STACS 2005: 353-364 - 2004
- [j28]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) - [c30]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 - [c29]Josep Díaz, Maria J. Serna, Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs. LATIN 2004: 49-58 - [c28]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 - [e6]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. Lecture Notes in Computer Science 3142, Springer 2004, ISBN 3-540-22849-7 [contents] - 2003
- [j27]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) - [j26]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) - [c27]Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
Adversarial Models for Priority-Based Networks. MFCS 2003: 142-151 - [c26]Josep Díaz, Jordi Petit, Maria J. Serna:
Evaluation of Basic Protocols for Optical Smart Dust Networks. WEA 2003: 97-106 - 2002
- [j25]Josep Díaz, Jordi Petit, Maria J. Serna:
A survey of graph layout problems. ACM Comput. Surv. 34(3): 313-356 (2002) - [j24]Josep Díaz:
Analysis of Algorithms (AofA): Part I: 1993 -- 1998. Bull. EATCS 77: 42-62 (2002) - [j23]Josep Díaz:
Primes in P (Without Assumptions). Bull. EATCS 78: 67-71 (2002) - [j22]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) - [c25]Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos:
H-Colorings of Large Degree Graphs. EurAsia-ICT 2002: 850-857 - [c24]Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald:
Bisection of Random Cubic Graphs. RANDOM 2002: 114-125 - [c23]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
The Complexity of Restrictive H-Coloring. WG 2002: 126-137 - 2001
- [j21]Carme Àlvarez, Josep Díaz, Maria J. Serna:
The hardness of intervalizing four colored caterpillars. Discret. Math. 235(1-3): 19-27 (2001) - [j20]Josep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan:
Approximating layout problems on random graphs. Discret. Math. 235(1-3): 245-253 (2001) - [j19]Josep Díaz:
H-Colorings of Graphs. Bull. EATCS 75: 82-96 (2001) - [j18]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) - [c22]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees. COCOON 2001: 298-307 - [c21]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Recent Results on Parameterized H-Colorings. Graphs, Morphisms and Statistical Physics 2001: 65-85 - [c20]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
(H, C, K)-Coloring: Fast, Easy, and Hard Cases. MFCS 2001: 304-315 - [c19]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 - 2000
- [j17]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. Comb. Probab. Comput. 9(6): 489-511 (2000) - [j16]Josep Díaz, Jordi Petit, Maria J. Serna:
Faulty Random Geometric Networks. Parallel Process. Lett. 10(4): 343-358 (2000) - [c18]Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna:
Routing Tree Problems on Random Graphs. ICALP Satellite Workshops 2000: 99-110
1990 – 1999
- 1999
- [c17]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Layout Problems on Lattice Graphs. COCOON 1999: 103-112 - [c16]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Linear Orderings of Random Geometric Graphs. WG 1999: 291-302 - 1998
- [j15]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) - [c15]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 - [c14]Josep Díaz, Jordi Petit, Maria J. Serna:
Random Geometric Problems on [0, 1]². RANDOM 1998: 294-306 - 1997
- [j14]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) - [c13]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 - [c12]Josep Díaz, Maria J. Serna, Paul G. Spirakis:
Linear and nonlinear systems: A survey. Contemporary Trends in Discrete Mathematics 1997: 29-47 - 1996
- [j13]Josep Díaz, Maria J. Serna, Jacobo Torán:
Parallel Approximation Schemes for Problems on Planar Graphs. Acta Informatica 33(4): 387-408 (1996) - [j12]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA. J. Univers. Comput. Sci. 2(3): 97-112 (1996) - [e5]Josep Díaz, Maria J. Serna:
Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings. Lecture Notes in Computer Science 1136, Springer 1996, ISBN 3-540-61680-2 [contents] - 1995
- [b4]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Structural Complexity I, Second Edition. Texts in Theoretical Computer Science. An EATCS Series, Springer 1995, ISBN 978-3-642-79237-3, pp. 1-210 - [c11]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
- [j11]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
The Query Complexity of Learning DFA. New Gener. Comput. 12(4): 337-358 (1994) - [c10]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA. COLT 1994: 208-217 - 1993
- [j10]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) - [c9]Josep Díaz, Maria J. Serna, Jacobo Torán:
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). ESA 1993: 145-156 - 1992
- [j9]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) - [c8]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 - [c7]Josep Díaz:
Graph Layout Problems. MFCS 1992: 14-23 - 1991
- [c6]Rafael Casas, Josep Díaz, Conrado Martinez:
Static on Random Trees. ICALP 1991: 186-203 - [c5]Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán:
The MINSUMCUT Problem. WADS 1991: 65-89 - 1990
- [b3]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Structural Complexity I. EATCS Monographs on Theoretical Computer Science 11, Springer 1990, ISBN 978-3-642-97064-1, pp. i-ix, 1-191 - [b2]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Structural Complexity II. EATCS Monographs on Theoretical Computer Science 22, Springer 1990, ISBN 978-3-642-75359-6, pp. I-IX, 1-285 - [j8]Josep Díaz, Jacobo Torán:
Classes of Bounded Nondeterminism. Math. Syst. Theory 23(1): 21-32 (1990)
1980 – 1989
- 1989
- [j7]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) - [c4]Carme Àlvarez, Josep Díaz, Jacobo Torán:
Complexity Classes with Complete Problems Between P and NP-C. FCT 1989: 13-24 - [e4]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). Lecture Notes in Computer Science 351, Springer 1989, ISBN 3-540-50939-9 [contents] - [e3]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). Lecture Notes in Computer Science 352, Springer 1989, ISBN 3-540-50940-2 [contents] - 1988
- [b1]José Luis Balcázar, Josep Díaz, Joaquim Gabarró:
Structural complexity, 1st Edition. EATCS monographs on theoretical computer science 11, Springer 1988, ISBN 0387186220, pp. I-IX, 1-191 - 1987
- [j6]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On Characterizations of the Class PSPACE/POLY. Theor. Comput. Sci. 52: 251-267 (1987) - 1986
- [c3]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On Non- uniform Polynomial Space. SCT 1986: 35-50 - 1985
- [j5]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Examples of CFI-BI-immune and CF-levelable sets in logspace. Bull. EATCS 25: 11-13 (1985) - [j4]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Uniform Characterizations of Non-Uniform Complexity Measures. Inf. Control. 67(1-3): 53-69 (1985) - [c2]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On some "non-uniform" complexity measures. FCT 1985: 18-27 - 1984
- [j3]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Some results about Logspace complexity measures. Bull. EATCS 22: 8 (1984) - 1983
- [e2]Josep Díaz:
Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings. Lecture Notes in Computer Science 154, Springer 1983, ISBN 3-540-12317-2 [contents] - 1982
- [j2]José L. Balcázar, Josep Díaz:
A Note on a Theorem by Ladner. Inf. Process. Lett. 15(2): 84-86 (1982) - [j1]Xavier Berenguer, Josep Díaz, Lawrence H. Harper:
A Solution of the Sperner-Erdös Problem. Theor. Comput. Sci. 21: 99-103 (1982) - 1981
- [e1]Josep Díaz, Isidro Ramos:
Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19-25, 1981, Proceedings. Lecture Notes in Computer Science 107, Springer 1981, ISBN 3-540-10699-5 [contents] - 1980
- [c1]Xavier Berenguer, Josep Díaz:
The Weighted Sperner's Set Problem. MFCS 1980: 137-141
Coauthor Index
José L. Balcázar
aka: José Luis Balcázar
aka: José Luis Balcázar
[j73] [j71] [i22] [i21] [i19] [j62] [j61] [j60] [j59] [j58] [c46] [c45] [i13] [i12] [i11] [j55] [c42] [c41] [i10] [c40] [i7] [b5] [j43] [j42] [j41] [j40] [j37] [j34] [j33] [j32] [j31] [j29] [c31] [j28] [c30] [c29] [c28] [j27] [j26] [c27] [c26] [j25] [j22] [c25] [c24] [c23] [j21] [j20] [j18] [c22] [c21] [c20] [c19] [j17] [j16] [c18] [c17] [c16] [j15] [c15] [c14] [j14] [c12] [j13] [e5] [c11] [c9]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
