Josep Díaz - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

EditorialTiziana Calamoneri, Josep Díaz. jda, 9(3):213, 2011. [doi]

IntroductionJosep Díaz, Jaroslav Nesetril. csr, 5(1):1, 2011. [doi]

Social-Aware Forwarding Improves Routing Performance in Pocket Switched NetworksJosep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa. esa 2011: 723-735 [doi]

2010

Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. ProceedingsTiziana Calamoneri, Josep Díaz, editors, Volume 6078 of Lecture Notes in Computer Science, Springer, 2010. [doi]

A note on the subgraphs of the (2× INFINITY )-gridJosep Díaz, Marcin Kaminski, Dimitrios M. Thilikos. DM, 310(3):531-536, 2010. [doi]

Book reviewJosep Díaz. csr, 4(2):125-127, 2010. [doi]

The cook-book approach to the differential equation methodJosep Díaz, Dieter Mitsche. csr, 4(3):129-151, 2010. [doi]

2009

Balanced cut approximation in random geometric graphsJosep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela. TCS, 410(27-29):2725-2731, 2009. [doi]

Large Connectivity for Dynamic Random Geometric GraphsJosep Díaz, Dieter Mitsche, Xavier Pérez-Giménez. tmc, 8(6):821-835, 2009. [doi]

On the chromatic number of a random 5-regular graphJosep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez, Nicholas C. Wormald. jgt, 61(3):157-191, 2009. [doi]

2008

A new upper bound for 3-SATJosep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez. fsttcs 2008: [doi]

Efficient algorithms for counting parameterized list H-coloringsJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. jcss, 74(5):919-937, 2008. [doi]

On the connectivity of dynamic random geometric graphsJosep Díaz, Dieter Mitsche, Xavier Pérez-Giménez. soda 2008: 601-610 [doi]

The distant-2 chromatic number of random proximity and random geometric graphsJosep Díaz, Zvi Lotker, Maria J. Serna. ipl, 106(4):144-148, 2008. [doi]

Walkers on the Cycle and the GridJosep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald. siamdm, 22(2):747-775, 2008. [doi]

High level communication functionalities for wireless sensor networksCarme Àlvarez, Josep Díaz, Jordi Petit, José D. P. Rolim, Maria J. Serna. TCS, 406(3):240-247, 2008. [doi]

2007

Complexity issues on bounded restrictive H-coloringJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. DM, 307(16):2082-2093, 2007. [doi]

IntroductionJosep Díaz, Jaroslav Nesetril. csr, 1(1):1, 2007. [doi]

MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphsJosep Díaz, Marcin Kaminski. TCS, 377(1-3):271-276, 2007. [doi]

Sharp Threshold for Hamiltonicity of Random Geometric GraphsJosep Díaz, Dieter Mitsche, Xavier Pérez. siamdm, 21(1):57-65, 2007. [doi]

Bounds on the bisection width for random d -regular graphsJosep Díaz, Maria J. Serna, Nicholas C. Wormald. TCS, 382(2):120-130, 2007. [doi]

EditorialJan Kratochvíl, Josep Díaz, Jirí Fiala. DAM, 155(2):79-80, 2007. [doi]

Communication tree problemsCarme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna. TCS, 381(1-3):197-217, 2007. [doi]

2006

2005

2004

Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-ColoringsJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. esa 2004: 275-286 [doi]

Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. ProceedingsJosep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella, editors, Volume 3142 of Lecture Notes in Computer Science, Springer, 2004.

Computation of the Bisection Width for Random d-Regular GraphsJosep Díaz, Maria J. Serna, Nicholas C. Wormald. latin 2004: 49-58 [doi]

The complexity of deciding stability under FFS in the Adversarial Queueing modelCarme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna. ipl, 90(5):261-266, 2004. [doi]

Efficient and reliable high level communication in randomly deployed wireless sensor networksCarme Àlvarez, Josep Díaz, Jordi Petit, José D. P. Rolim, Maria J. Serna. mobicom 2004: 106-110 [doi]

2003

2002

Primes in P (Without Assumptions)Josep Díaz. eatcs, 78:67-71, 2002.

The Complexity of Restrictive H-ColoringJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. criwg 2002: 126-137 [doi]

Counting H-colorings of partial k-treesJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. TCS, 281(1-2):291-309, 2002. [doi]

Analysis of Algorithms (AofA): Part I: 1993 -- 1998Josep Díaz. eatcs, 77:42-62, 2002.

H-Colorings of Large Degree GraphsJosep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos. eurasiaict 2002: 850-857 [doi]

A survey of graph layout problemsJosep Díaz, Jordi Petit, Maria J. Serna. ACM Comput. Surv., 34(3):313-356, 2002. [doi]

Bisection of Random Cubic GraphsJosep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald. random 2002: 114-125 [doi]

2001

Counting H-Colorings of Partial k-TreesJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. cocoon 2001: 298-307 [doi]

Approximating layout problems on random graphsJosep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan. DM, 235(1-3):245-253, 2001. [doi]

Approximating Layout Problems on Random Geometric GraphsJosep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna. jal, 39(1):78-116, 2001.

H-Colorings of GraphsJosep Díaz. eatcs, 75:82-96, 2001.

(H, C, K)-Coloring: Fast, Easy, and Hard CasesJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. mfcs 2001: 304-315 [doi]

Stability and non-stability of the FIFO protocolJosep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos. spaa 2001: 48-52 [doi]

The hardness of intervalizing four colored caterpillarsCarme Àlvarez, Josep Díaz, Maria J. Serna. DM, 235(1-3):19-27, 2001. [doi]

2000

Faulty Random Geometric NetworksJosep Díaz, Jordi Petit, Maria J. Serna. ppl, 10(4):343-358, 2000.

Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric GraphsJosep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna. cpc, 9(6), 2000.

Routing Tree Problems on Random GraphsCarme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna. icalp 2000: 99-110

1999

Layout Problems on Lattice GraphsJosep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna. cocoon 1999: 103-112 [doi]

Linear Orderings of Random Geometric GraphsJosep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna. criwg 1999: 291-302 [doi]

1998

A Parallel Algorithm for Sampling Matchings from an Almost Uniform DistributionJosep Díaz, Jordi Petit, Panagiotis Psycharis, Maria J. Serna. isaac 1998: 457-466 [doi]

Random Geometric Problems on [0, 1]²Josep Díaz, Jordi Petit, Maria J. Serna. random 1998: 294-306 [doi]

On the Random Generation and Counting of Matchings in Dense GraphsJosep Díaz, Maria J. Serna, Paul G. Spirakis. TCS, 201(1-2):281-290, 1998. [doi]

1997

Algorithms for Learning Finite Automata from Queries: A Unified ViewJosé L. Balcázar, Josep Díaz, Ricard Gavaldà. BIRTHDAY 1997: 53-72

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout ProblemsJosep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán. TCS, 181(2):267-287, 1997. [doi]

1996

An Optimal Parallel Algorithm for Learning DFAJosé L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. jucs, 2(3):97-112, 1996.

Algorithms - ESA 96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, ProceedingsJosep Díaz, Maria J. Serna, editors, Volume 1136 of Lecture Notes in Computer Science, Springer, 1996.

Parallel Approximation Schemes for Problems on Planar GraphsJosep Díaz, Maria J. Serna, Jacobo Torán. ACTA, 33(4):387-408, 1996.

1995

Efficient Parallel Algorithms for some Tree Layout ProblemsJosep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán. cocoon 1995: 313-323

1994

The Query Complexity of Learning DFAJosé L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. ngc, 12(4):337-358, 1994.

An Optimal Parallel Algorithm for Learning DFAJosé L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. colt 1994: 208-217 [doi]

1993

Average-Case Analysis on Simple Families of Trees Using a Balanced Probability ModelRafael Casas, Josep Díaz, Conrado Martinez. TCS, 117(1&2):99-112, 1993.

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

1992

On the Average Size of the Intersection of Binary TreesRicardo A. Baeza-Yates, Rafael Casas, Josep Díaz, Conrado Martinez. siamcomp, 21(1):24-32, 1992.

A Note on the Query Complexity of Learning DFA (Extended Abstract)José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. alt 1993: 53-62

Graph Layout ProblemsJosep Díaz. mfcs 1992: 14-23

1991

Static on Random TreesRafael Casas, Josep Díaz, Conrado Martinez. icalp 1991: 186-203

The MINSUMCUT ProblemJosep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán. wads 1991: 65-89

1990

Classes of Bounded NondeterminismJosep Díaz, Jacobo Torán. mst, 23(1):21-32, 1990.

1989

Average-Case Analysis of Robinson s Unification Algorithm with Two Different VariablesRafael Casas, Josep Díaz, Jean-Marc Steyaert. ipl, 31(5):227-232, 1989.

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 IsJosep Díaz, Fernando Orejas, editors, Volume 352 of Lecture Notes in Computer Science, Springer, 1989.

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 AlJosep Díaz, Fernando Orejas, editors, Volume 351 of Lecture Notes in Computer Science, Springer, 1989.

Complexity Classes with Complete Problems Between P and NP-CCarme Àlvarez, Josep Díaz, Jacobo Torán. fct 1989: 13-24

1987

On Characterizations of the Class PSPACE/POLYJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. TCS, 52:251-267, 1987.

1986

On Non- uniform Polynomial SpaceJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. cocoon 1986: 35-50

1985

Uniform Characterizations of Non-Uniform Complexity MeasuresJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. iandc, 67(1-3):53-69, October/November/December 1985.

Examples of CFI-BI-immune and CF-levelable sets in logspaceJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. eatcs, 25:11-13, 1985.

On some non-uniform complexity measuresJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. fct 1985: 18-27

1984

Some results about Logspace complexity measuresJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. eatcs, 22:8, 1984.

1983

Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, ProceedingsJosep Díaz, editor, Volume 154 of Lecture Notes in Computer Science, Springer, 1983.

1982

A Note on a Theorem by LadnerJosé L. Balcázar, Josep Díaz. ipl, 15(2):84-86, 1982.

1981

Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19-25, 1981, ProceedingsJosep Díaz, Isidro Ramos, editors, Volume 107 of Lecture Notes in Computer Science, Springer, 1981.