Personal data

Full Professor, Computer Science Department, Universitat Politècnica de Catalunya.

Address: Edifici Omega-desp. 235-Campus Nord. Jordi Girona Salgado 1-3 E-08034 Barcelona
Phone: +34 - 934137850
Fax: +34 - 934017014
e-mail: mjserna [at] cs.upc.edu

1. Education

Graduate Studies

• PhD. in Informàtica (Computer Science), Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, June 1990.
  Title: The parallel approximability of P-complete problems.
  Advisors: Joaquim Gabarró and Paul Spirakis.

Undergraduate Studies

• Licenciada en Matemáticas, Universitat de Barcelona, June 1981.
• Licenciada en Informática, Universitat Politècnica de Catalunya, June 1985.

2. Grants and Projects funded

• Pre-doctoral scholarship of the Spanish Ministry of Eduaction, from October 1/1988 to August 31/1990.
• Member of the research team of the EC project Algorithms and Complexity (ALCOM), grant No ESPRIT-BRA 3075, amount 2.1 MECU, from May 27/1989 to April 27/1992. The project was succesfully completed.
• Member of the research team of the EC project Algorithms and Complexity II (ALCOM-II), grant No EECC, ESPRIT-BRA 7141, amount 1.8 MECU, from April 2/1993 to April 2/1995. The project was succesfully completed.
• Principal investigator in Barcelona of the INTAS project RANDOM: Randomized and Derandomized Algorithms Operational Methodology, grant No INTAS-94-3936, from January 1995 to January 1998. The project ended succesfully.
• Member of the research team of the EC project Algorithms and Complexity: Information Transfer (ALCOM-IT), grant No ESPRIT-LTR 20244, amount 2 MECU, from November 1/1995 to July 1/1999. The project was succesfully completed.
• Member of the research team of the project Algoritmos y Complejidad: Transferencia de la Información, funded by the Spanish Ministry of Eduaction under grant No CICYT-TIC97-1475-CE, from January 1/1997 to January 1/1999. The project ended succesfully.
• Member of the Grup de Recerca en Algorismes i Complexitat, funded by the Catalan Government under grant No CIRIT-1997SGR-00366, from December 31/1997 to December 31/1999. The project ended succesfully.
• Member of the research team of the project Métodos Heurísticos e Interfaces gráficas para la librería paralela de optimización combinatoria, funded by the Spanish Ministry of Eduaction under grant CICYT TIC98-0690-C02-01, amount 1MPTAS, from November 30/1998 to November 30/1999. The project was succesfully completed.
• Member of the research team of the project Entornos geográficamente distribuidos: Métodos Heurísticos: Librería de Optimización Combinatoria (MALLBA), funded by the Spanish Ministry of Eduaction under grant No CICYT TIC99-0754-C03-02, amount 11MPTAS, from November 30/1999 to November 30/2002. The project ended succesfully.
• Member of the research team of the project Métodos formales para el desarrollo y verificación de programas BSP, funded by the Spanish Ministry of Eduaction under grant CICYT HB 1999-0093, from January 1/2000 to January 1/2002. The project ended succesfully.
• Member of the research team of the EC project Algorithms and Complexity, Future Technologies (ALCOM-FT), grant No IST-1999-14186, from February 2000 to May 2003. The project ended succesfully.
• Member of the research team of the project Algoritmos y Complejidad: Futuras Tecnologias, funded by the Spanish Ministry of Eduaction under grant No CICYT-TIC-2000-1970-CE, from June 2000 to June 2003.
• Member of the research team of the EC project Foundational Aspects of Global Computing Systems (FLAGS) grant No IST-2001-33116, from January 2002 to April 2005.
• Member of the research team of the project Aspectos fundamentales de los sistemas de computación global, funded by the Spanish Ministry of Eduaction under grant No CICYT-TIC-2001-4917-E, from May 2002 to January 2005.
• Member of the research team of the project Técnicas de optimización avanzada para problemas complejos (TRACER), funded by the Spanish Ministry of Eduaction under grant No CICYT-TIC-2002-04498-C05-03, from January 2003 to February 2006.
• Member of the research team of the project Dynamically evolving Large Scale Information Systems, (DELIS). FET pro-actives Integrated Project 001907. The project started January 2004 and lasts 36 months.
• National representative of the action Dynamic communication networks: Foundations and Algorithms (DYNAMO). COST Action 293. The action started January 2005 and lasts 48 months.
• Principal investigator in Barcelona of the project Algorithmic principles for building efficient overlay computers (AEOLUS). FET pro-actives Integrated Project 15964. The project started September 2004 and lasts 48 months.
• Principal investigator in Barcelona of the project Autoorganización en sistemas de comunicación emergentes (ASCE), funded by the Spanish Ministry of Eduaction under grant No TIN-2005-09198-C02-02, the project started January 2006 and lasts 36 months.
• Member of the Grup de Recerca en Algorismia, Bioinformàtica, Complexitat i Mètodes Formals, funded by the Catalan Government under grant No CIRIT 2005SGR 00516, from November 2005 to November 2008.
• Principal investigator of the project AEOLUS: Principios algoritmicos para la construcción de computadores superpuestos eficientes, funded by the Spanish Ministry of Eduaction under grant No TIN-2005-25859-E. From September 2005 to March 2010. 44 months.
• Principal investigator of the project Self-organization in sensor networks and overlay networks funded by the Spanish Ministry of Eduaction under grant No MEC HA2006-0127 (Integrated Action Spain-Germany). The project started January 2007 and lasts 2 years.
• Member of the research team of the project Foundations of adaptive networks of artifcats (FRONTS), ICT-2007-3 FET pro-actives STREP Project 215270. From March 1st, 2008 to March 1st, 2011.
  
• Member of the Grup de Recerca en Algorismia, Bioinformàtica, Complexitat i Mètodes Formals, funded by the Catalan Government under grant No 2009SGR 1137, from November 2009 to November 2013.
• Member of the research team of the project Métodos formales y algoritmos para el diseño de sistemas (FORMALISM), funded by the Spanish Ministry of Science and Innovation under grant No TIN2007-66523, from January 2007 to November 2014.
• Member of the research team of the project Wireless Sensor Network Testbeds (WISEBED), FP7-ICT-2007-2 ICT-2007.1.6 (New Paradigms and Experimental Facilities) STREP Project 224460. From June 2008 to June 2011.
• Member of the research team of the project Modelos y métodos computacionales para datos masivos estructurados(COMMAS), funded by the Spanish Ministry of Science and Innovation and the European Union (FEDER funds) under grant No TIN2013-46181-C2-1-R, from January 2015 to November 2017.
• Member of the Grup de Recerca en Algorismia, Bioinformàtica, Complexitat i Mètodes Formals, funded by the Catalan Government under grant No 2014SGR 1034, from September 2014 to September 2017.
• Member of the research team of the project Graph-based Models and Methods for Computing in the Large (GRAMM), funded by the Spanish Ministry of Science and Innovation and the European Union (FEDER funds) under grant No TIN2017-86727-C2-1-R, from January 2018.
• Member of the Grup de Recerca en Algorismia, Bioinformàtica, Complexitat i Mètodes Formals, funded by the Catalan Government under grant No 2017SGR 786, from June 2018.

3. Research interests

• Adversarial queuing theory
• Algorithmic game theory
• Algorithms and complexity of graph theoretic problems
• Probabilistic methods in algorithmics
• Sensor and ad-hoc Networks
• Graph algorithms and complexity

4. Professional Experience

4.1. Job positions

• Prof. Encargado de Curso, 10/1982 a 9/1985
• Prof. Colaborador de Escuela Universitária 10/1985 a 6/1986.
• Prof. Titular de Escuela Universitária 7/1986 a 2/1991.
• Catedrática de Escuela Universitária 3/1991 a 8/1992.

• Catedrática de Escuela Universitária 9/1992 a 3/2006.
• Catedrática de Universidad since 3/2006.

4.2 Academic Activities

Teaching

• Spring 18: Advanced Algorithmics (FIB), Algorithmics (FIB,coordinator).
• Fall 18: Algorithmics (FIB,coordinator), Algorithmic Game Theory (FIB-MIRI, coordinator).
• Spring 17: Advanced Algorithmics (FIB), Algorithmics (FIB,coordinator).
• Fall 17: Algorithmics (FIB,coordinator), Algorithmic Game Theory (FIB-MIRI, coordinator).
• Spring 16: Advanced Algorithmics (FIB), Algorithmics (FIB,coordinator).
• Fall 15: Algorithmics (FIB,coordinator), Algorithmic Game Theory (FIB-MIRI, coordinator)
• Spring 15: Advanced Algorithmics (FIB), Algorithmics (FIB,coordinator), Programming 1(FIB, coordinator).
• Fall 14: Algorithmics (FIB,coordinator), Algorithmic Game Theory (FIB-MIRI, coordinator), Programming 1(FIB, coordinator)
• Spring 14: Advanced Algorithmics (FIB), Algorithmics (FIB,coordinator), Programming of cell phones and mobile autonomous devices (FIB).
• Fall 13: Programming 1(FIB, coordinator)
• Spring 13: Advanced Algorithmics (FIB), Data Bases (FME), Programming of cell phones and mobile autonomous devices (FIB).
• Fall 12: Seminar in Algorithmics and Programming (MCom)
• Spring 12: Algorithmics (FIB, coordinator), Data Bases (FME), Programming workshop: Android applications for Google phones (FIB).
• Fall 11: Advanced Topics in Algorithmics and Complexity (MCom, coordinator), Programming workshop: Android applications for Google phones (FIB), Programming workshop: Sun SPOTs and LEGO Mindstorm (FIB).
• Spring 11: Algorithmics (FIB, coordinator), Data Bases (FME), Programming workshop: Android applications for Google phones (FIB).
• Fall 10: Programming I (FME, coordinator), Algorithms (Soft, coordinator), Advanced Topics in Algorithmics and Complexity (MCom, coordinator), Programming workshop: Android applications for Google phones (FIB).
• Spring 10: Algorithmics (FIB, coordinator), Data Bases (FME), Programming workshop: Android applications for Google phones (FIB), Algorithms for Sensor Networks (FIB).
• Fall 09: Programming I (FME, coordinator), Advanced Topics in Algorithmics and Complexity (MCom, coordinator)
• Spring 09: Algorithms for Sensor Networks (FIB), Algorithmics (FIB, coordinator), Algorithms and Data Structures (FIB).
• Fall 08: Programming I (FME, coordinator), Game theory and Internet (FIB), Advanced Topics in Algorithmics and Complexity (MCom, coordinator)
• Spring 08: Game theory and Internet (FIB), Algorithmics (FIB, coordinator).
• Fall 07: Programming I (FME, coordinator), Game theory and Internet (FIB), Advanced Topics in Algorithmics and Complexity (MCom, coordinator)
• Spring 07: Game theory and Internet (FIB), Algorithmics (FIB, coordinator).
• Fall 06: Programming I (FME, coordinator), Game theory and Internet (FIB), Advanced Topics in Algorithmics and Complexity (MCom, coordinator)
• Spring 06: Game theory and Internet (FIB), Algorithmics (FIB, coordinator).
• Fall 05: Information Retrieval (FIB), Programming I (FME, coordinator), Game theory and Internet (FIB), Algorithms (Soft, coordinator)
• Spring 04: Game theory and Internet (FIB), Seminar on Algorithms and Complexity (Soft, coordinator), Computational Complexity (Soft).
• Fall 04: Algorithms, Computability and Complexity (FIB, coordinator), Algorithmics (FIB, coordinator) Information Retrieval (FIB), Programming I (FME, coordinator), Game theory and Internet (FIB), Algorithms (Soft, coordinator)
• Spring 04: Abstract Models of Computation (FIB, coordinator), Algorihtmic Schemes (FIB, coordinator) Concurrent Programming (FIB), Seminar on Algorithms and Complexity (Soft, coordinator), Web Algorithms and Programs (FIB).
• Fall 03: Abstract Models of Computation (FIB, coordinator), Programming I (FME, coordinator), Web Algorithms and Programs (FIB), Algorithms (Soft, coordinator)
• Spring 03: Abstract Models of Computation (FIB, coordinator), Algorihtmic Schemes (FIB, coordinator), Web Algorithms and Programs (FIB), Seminar on Algorithms and Complexity (Soft, coordinator)
• Fall 02: Abstract Models of Computation (FIB, coordinator), Programming I (FME, coordinator), Web Algorithms and Programs (FIB), Algorithms (Soft, coordinator)
• Spring 02: Abstract Models of Computation (FIB, coordinator), Web Algorithms and Programs (FIB)
• Fall 01: Abstract Models of Computation (FIB, coordinator), Programming I (FME, coordinator), Web Algorithms and Programs (FIB), Algorithms (Soft, coordinator)
• Spring 01: Abstract Models of Computation (FIB, coordinator)
• Fall 00: Abstract Models of Computation (FIB, coordinator), Programming I (FME, coordinator), Web Algorithms and Programs (FIB), Algorithms (Soft, coordinator)
• Spring 00: Seminar on Analysis of Algorithms (graduate course)
• Fall 99: Abstract Models of Computation (FIB, coordinator), Programming I (FME, coordinator), Algorithms (Soft, coordinator)
• Spring 99: Abstract Models of Computation (FIB, coordinator), Seminar on Analysis of Algorithms (Soft)
• Fall 98: Abstract Models of Computation (FIB, coordinator), Programming I (FME, coordinator), Advanced Algorithms (Soft).
• Spring 98: Abstract Models of Computation (FIB, coordinator), Parallel algorithms (FIB, coordinator), Seminar on Analysis of Algorithms (Soft).
• Fall 97: Abstract Models of Computation (FIB, coordinator), Programming I (FME), Advanced Algorithms (graduate course).
• Spring 97: Abstract Models of Computation (FIB, coordinator), Probabilistc Algorithms (Soft).
• Fall 96: Abstract Models of Computation (FIB, coordinator), Recent trends in Algorithms and Complexity (Soft, coordinator)
• Spring 96: Abstract Models of Computation (FIB, coordinator), Parallel algorithms (FIB, coordinator).
• Spring 95, Fall 95: Abstract Models of Computation (FIB)
• Fall 94: Abstract Models of Computation (FIB), Algorithms (FIB)
• Spring 94: Introduction to Logic (FIB, coordinator).
• Fall 92, Spring 93 and Fall 93: Introduction to Logic (FIB).

• Course 91-92: Linear Algebra (coordinator), Applied Informatics (coordinator).
• Course 90-91: Diferential and Integral Calculus, Applied Informatics.
• Courses 88-89, 89-90: On leave at Patras University
• Course 87-88: Algebra and Calculus I, Applied Informatics I, Applied Informatics II.
• Course 86-87: Algebra and Calculus I, Introduction to Informatics, Applied Informatics I
• Course 85-86: Algebra and Calculus I, Introduction to Informatics
• Course 83-84, 84-85: Algebra and Calculus I, Algebra and Calculus II
• Course 82-83: Algebra and Calculus I.

Teaching Managment

• Coordinator of the Computing PhD Program, formerly Software PhD Program (LSI), since December 2005.
• Coordinator of the Master in Computing (LSI), December 2005 to September 2014.
• Coordinator of the intensification in Advanced Programming Techniques of the Informatics Engineering Program (FIB), since October 2003, and in the Master in Information Technologies (FIB), September 2006 to September 2014.

University Comittee membership

• Junta de Departament del Departament de Llenguatges i Sistemes Informàtics, June 2002 to March 2006.
• Comissió Academica del Programa de doctorat Software/Computació , since September 2001.
• Comissió de Doctorat del Departament de Llenguatges i Sistemes Informàtics, since September 2001.
• Comisió Docent del Departament de Llenguatges i Sistemes Informàtics, September 1993 to September 1994, May 1999to September 2005.
• Comissió d'Avaluació Academica de la Facultat de Matemàtiques i Estadística, May 2001 to November 2003.
• Comissió Permanent de la Facultat de Matemàtiques i Estadística, May 2001 to November 2003.
• Junta de Facultat de la Facultat de Matemàtiques y Estadística, November 1998 to November 2005.
• Comissió Permanent de la Facultat d'Informàtica de Barcelona, November 2000 to January 2006.
• Junta de Facultat de la Facultat d'Informàtica de Barcelona, since May 1999.
• Claustre General de la Universitat Politècnica de Catalunya, January 2001- March 2002, December 2003-November 2009, and since April 2017.

4.3 Activity in professional societies

Program Commitee membership

• 5th ACM-W Europe Celebration of Women in Computing (womENcourage 2018). Belgrade, Serbia, October 3-5, 2018.
• 43st International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Liverpool (UK), August 27-31, 2018.
• 10th International Conference on Computer Supported Education (CSEDU 2018). Funchal , Madeira, Portugal, March 15-17, 2018.
• 4th ACM-W Europe Celebration of Women in Computing (womENcourage 2017). Barcelona, Spain on September 6th to 8th, 2017.
• 21st International Conference on Fundamentals of Computation Theory (FCT 2017). Bordeaux, France on September 11-13, 2017.
• 10th International Conference on Algorithms and Complexity (CIAC 2017). Athens, Greece on May 26-28, 2017.
• ACM-SIAM Symposium on Discrete Algorithms (SODA17) Barcelona, Spain on January 16-19, 2017
• 3rd ACM-W Europe Celebration of Women in Computing (womENcourage 2016). Linz, Austria on September 12th to 13th, 2016.
• 41st International Symposium on Mathematical Foundations of Computer Science. August 22-26, 2016, Krakow (Poland).
• 14th International Symposium on Experimental Algorithms (SEA 2015). Paris, France June 29 - July 1, 2015.
• 9th International Conference on Algorithms and Complexity (CIAC 2015). Paris, France Mayo de 2015.
• 10th Conference on Web and Internet Economics (WINE 2014). Beijing, China. 14-17 de Diciembre 2014.
• 41st International Colloquium on Automata, Languages and Programming (ICALP 2014) Copenhagen, Denmark, 7-11 July 2014.
• 12th International Symposium on Experimental Algorithms (SEA 2013), June 5-7, 2013, Rome, Italy.
• 8th International Conference on Algorithms and Complexity (CIAC 2013) Barcelona, May 22-24, 2013. (co-chair)
• 5th International Symposium on Algorithmic Game Theory (SAGT 2012) Barcelona, October 22--23, 2012. (Chair)
• 15th International Conference On Principles Of Distributed Systems (OPODIS 2011), December 13-16, 2011, Toulouse, France
• 6th International Symposium on Trustworthy Global Computing (TGC 2011). Aachen, Germany, September , 2011.
• 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Zurich, Suiza. 4-8 de Julio de 2011
• 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010). Barcelona, Spain, 1-3 de Septiembre de 2010. (Chair).
• 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2010). June 28 - 30, Zarós, Crete, Greece, 2010
• 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010). Nesin Mathematics Village, Sirince, Turkey. June 7-11, 2010
• Trustworthy Global Computing (TGC 2010). Munich, Germany, February 25-26, 2010
• 2nd International Symposium on Algorithmic Game Theory (SAGT 2009) Paphos, Cyprus, October 18--20, 2009. .
• 17th International Symposium on Fundamentals of Computation Theory (FCT 20009) Wroclaw, Poland, September 2-4, 2009.
• 3rd International Conference on Sensor Technologies and Applications (SENSORCOMM 2009), Athens, Greece, June 18-23, 2009.
• The 15th Annual International Computing and Combinatorics Conference (COCOON 2009), Niagara Falls, New York, USA, July 13-15, 2009.
• Trustworthy Global Computing (TGC 2008). Barcelona, Spain. November 3-4, 2008
• The 2nd International Conference on Sensor Technologies and Applications (SENSORCOMM 2008), Cap Esterel, France, August 25-31, 2008
• 4th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS 2008), Santorini Island, Greece, June 11-14, 2008.
• International Conference on Sensor Technologies and Applications (SENSORCOMM 2007). Valencia, Spain, October 14-20, 2007.
  
• COST 295 - 1st Workshop on Dynamic Networks. Salerno, Italy. May 7-8, 2007.
• COST 293 GRAAL and COST 295 DYNAMO. Discussion Workshop and MC meetings. Maribor, Slovenia, 31st January to 4th February 2007.
  
• 2nd Workshop on Internet and Network Economics (WINE 06). Patras, Greece, 15-17 Diciembre 2006.
  
• 5th International Workshop on Experimental Algorithms (WEA 2006). Menorca, Spain. May 24-27, 2006. (chair)
• 2nd International Conference on Distributed Computing in Sensor Systems (DCOSS 2006). San Francisco, USA, 18--20 de Junio, 2006.
  
• IEEE International Workshop on Foundations and Algorithms for wireless networking (FAWN 2006). Pisa, Italy. March 13, 2006.
• 13th Annual European Symposium on Algorithms (ESA 2005) Mallorca, October 3-6, 2005.
• 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005). Santorini, Grecia. May 10-13, 2005.
• 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2004). Turku, Finland. July 16, 2004.
• 2nd International Workshop on Efficient and Experimental Algorithms (WEA 2003). Ascona, Switzerland, April 23-26, 2003.
• European Conference on Parallel Computing (EUROPAR 2002). Paderborn, Germany. August 27-30, 2002.
• 5th Latin American Theoretical Informatics conference (LATIN 2002), Cancun, Mexico. April 3--6, 2002
• 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete, Greece. July 10-15, 2001
• European Conference on Parallel Computing (EUROPAR 2000). München, Germany. August 29 - Sept 1, 2000.
• 2nd International Symposium on Randomization and Approximation Techniques in Computer Science (RANDOM´98). Barcelona, Spain. October 8-10, 1998.
• 6th Annual European Symposium on Algorithms (ESA´98) Venice, Italy. August 1998
• 1st International Symposium on Randomization and Approximation Techniques in Computer Science (RANDOM´97). Bologne, Italy. July 8-10 1997.

Organizing Committee membership

• APPROX+RANDOM 2014, Barcelona, Spain. 4-6 September 2014.
• 8th International Conference on Algorithms and Complexity (CIAC 2013) Barcelona, May 22-24, 2013. (Chair)
• 5th International Symposium on Algorithmic Game Theory (SAGT 2012) Barcelona, October 22--23, 2012. (Chair)
• APPROX+RANDOM 2010, Barcelona, Spain. 1-3 September 2010, (Chair) including
  • 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. APPROX 2006.
  • 14th International Symposium on Randomization and Approximation Techniques in Computer Science. RANDOM 2006.
• TGC + GC Reviews 2008, Barcelona, Spain. 3-7 de Noviembre 2008 (co-chair), including
  • TGC 08 - 4th International Symposium on Trustworthy Global Computing, 3-4 Noviembre.
  • AEOLUS Annual Review Meeting, 5-6 Noviembre.
  • MOBIUS Annual Review Meeting, 5-6 Noviembre
  • SENSORIA Annual Review Meeting, 6-7 Noviembre
• DELIS Final Workshop and Review Meeting. Barcelona, 26-29 Febrero, 2008 (co-chair).
• Workshop on Theoretical Aspects and Models of Large, Complex and Open Information Networks, DELIS CompNet. Barcelona, 18-20 de Octubre de 2006.
• APPROX+RANDOM 2006, Barcelona, Spain. 28-30 Agosto 2006, incluyendo
  • 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. APPROX 2006.
  • 10th International Symposium on Randomization and Approximation Techniques in Computer Science. RANDOM 2006.
• 5th International Workshop on Experimental Algorithms. WEA 2006. Menorca, Spain. May 24-27, 2006. (chair)
• ALGO 2005 Conference and Workshops, Palma de Mallorca, October 3-7, 2005. (co-chair)
  • ESA 2005 - 13th Annual European Symposium on Algorithms.
  • WABI 2005 - 5th Workshop on Algorithms in Bioinformatics
  • WAOA 2005 - 3rd Workshop on Approximation and Online Algorithms
  • ATMOS 2005 - 5th Workshop on Algorithmic Methods and Models for Optimization of Railways
• Final ALCOM IT Workshop and Review Meeting. Barcelona, Spain June 7-9, 1999. (Chair).
• 2nd International Symposium on Randomization and Approximation Techniques in Computer Science. RANDOM´98. Barcelona, Spain. October 8-10, 1998. (Chair)
• 4th Annual European Symposium on Algorithms. ESA´96. Barcelona, Spain. September 25-27, 1996.

5. Publications

Books of International circulation

• J. Díaz, M. Serna, P. Spirakis and J. Torán Paradigms for fast parallel approximability , Cambridge University Press, 1997.

Books in Catalan or Spanish

• M. Serna, C. Àlvarez, R. Cases, A. Lozano. Els límits de la Computació. Indecidibilitat i NP-completesa. Edicions UPC, 2001 (in catalan).
• J. Díaz, M. Serna. Algorísmica per a paralelisme massiu. Una introducció. Edicions virtuals UPC, 1998 (in catalan).
• J. Casabó, M. J. Serna. Una Introducción al Cálculo Numérico. Departament de Matemàtica Aplicada I, secció E.U.P.B, UPC, 1989 (in spanish).
• J. Casabó, T. Crespo, F. Pañella, J. J. Rodriguez, M. J. Serna, J. A. Torrent. Algebra Lineal y Geometria. Cátedra de Matemáticas Aplicadas, E.U.A.T.B., UPC, 1989 (in spanish)
• J. Casabó, T. Crespo, F. Pañella, J. J. Rodriguez, M. J. Serna, J. A. Torrent. Cálculo Diferencial e Integral. Cátedra de Matemáticas Aplicadas, E.U.A.T.B., UPC, 1987 (in spanish)

Book chapters

• M. Serna. Randomized parallel approximations to MaxFlow. Encyclopedia of Algorithms. Ming-Yang Kao, Ed. pags. 734--737, Springer, 2008
• M. Serna. Parallel algorithms for two processors precedence constraint scheduling. Encyclopedia of Algorithms. Ming-Yang Kao, Ed. pags. 627--629, Springer, 2008
• J. Gabarro, A. García, M. Serna, A. Stewart, P. Kilpatrick. Analysing orchestrations with risk profiles and angel daemon games. Grid Computing Achievements and Prospects, S. Gorlatch, P. Fragopoulo, T. Priol, Eds. Core GRID, Springer, pp. 121--132, 2008. Selected papers from the CoreGRID Integration Workshop 2008.
• J. Díaz, M. Serna and D.M. Thilikos. Efficient algorithms for parameterized H-colorings. In Topics in Discrete Mathematics, M. Klazar, J. Kratochvíl, M. Loebl, J. Matousek, R. Thomas, P. Valtr, Eds. Algorithmcs and Combinatorics, vol 26, pags. 373--406, Springer, 2006.
• J. Díaz, M. Serna and D.M. Thilikos. Recent results on parameterized H-coloring. In Graphs, morphisms and statistical physics. J. Nesetril, P. Winkler, Eds. DIMACS: Series in Discrete Mathematics and Computer Science, vol 63, pp 65--86, 2004.
• J. Díaz, J. Petit, M. Serna. A guide to concentration bounds in Handbook of Randomized Computing. Vol II. S. Rajasekaran, P. Pardalos, J. H. Reif and J. Rolim, Eds. Kluwer, 2001.
• C. Alvarez, J. Díaz, M. Serna Modelos de grafos para la web in Las Matemáticas del siglo XX. Una mirada en 101 artículos.Ed. Nivola, 2000 (in spanish).
• J. Díaz, M. Serna, P. Spirakis Linear and non-linear systems: a survey. In Contemporary trends in Discrete Mathematics. From DIMACS and DIMATIA to the future. DIMACS: Series in Discrete Mathematics and Computer Science, vol 49, pp 29--47, 1999.

As editor

• co-editor with P.G. Spirakis of the volumen 7878 of Lecture Notes in Computer Science (Springer-Verlag), proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013.
• editor of the volumen 7615 of Lecture Notes in Computer Science (Springer-Verlag), proceedings of the 5th International Symposium on Algorithmic Game Theory, SAGT 2012.
• co-editor con R. Shaltiel, K.Jansen and J. Rolim of the volumen 6302 of Lecture Notes in Computer Science (Springer-Verlag) , proceedings of the 13th International Workshop, APPROX 2010 y del 14th International Workshop, RANDOM 2010.
• co-editor with C. Àlvarez of the volume 4007 of Lecture Notes in Computer Science (Springer-Verlag) of the Proceedings of the Workshop on Experimental Algorithms (WEA 2006).
• co-editor with J. Díaz of the ESA-96 best papers volume in Algorithmica, vol 21, number 1, 1998.
• co-editor with M. Luby and J. Rolim. of the volume 1518 of Lecture Notes in Computer Science (Springer-Verlag) of the Proceedings of the Second International Workshop in Randomization and Approximation Techniques in Computer Science (RANDOM-98).
• co-editor with J. Díaz of the volume 1136 of Lecture Notes in Computer Science (Springer-Verlag) of the Proceedings of the European Symposiyum on Algorithms (ESA-96).

International Journals

1. F. Riquelme, P. González-Cantergiani, X. Molinero, M. Serna. Centrality measure in social networks based on linear threshold model. Knowledge-Based Systems, 140:92-102, 2018
2. J. Díaz, I. Giotis, L. Kirousis, I. Mourto, M. Serna. The social cost of congestion games by imposing variable delays. ICT Express, 3(4):155-159, 2017
3. J. Gabarró, S. Leon-Gaixas, M. Serna. The computational complexity of QoS measures for orchestrations. Journal of Combinatorial Optimization, 34(4) 1265-1301, 2017.
4. J. Díaz, O. Pottonen, M. Serna, E.J. van Leeuwen. Complexity of Metric Dimension on Planar Graphs. Journal of Computer and System Sciences, 83(1): 132-158, 2017
5. J. Gabarró, M. Serna. Uncertainty in Basic Short-Term Macroeconomic Models with Angel-Daemon Games. International Journal of Data Analysis Techniques and Strategies, 9(4): 314-330, 2017.
6. C. Àlvarez, M.J. Blesa, A. Duch, A. Messegué, M. Serna. Celebrity Games. Theoretical Computer Science, 648:56-71, 2016.
7. J. Diaz, L.A. Goldberg, D. Richerby and M. Serna. Absorption time of the Moran process. Random Structures and Algorithms, 49(1): 137-159, 2016.
8. C. Àlvarez, M. Serna, A. Fernàndez. Network formation for Asymmetric players and bilateral contracting. Theory of Computing Systems, 59(3): 397-415, 2016.
9. J. Díaz, I. Giotis, L.M. Kirousis, E. Markakis, M. Serna. On the Stability of Generalized Second Price Auctions with Budgets. Theory of Computing Systems, 59(1): 1-23, 2016.
10. X. Molinero, M. Olsen, M. Serna. On the complexity of exchanging. Information Processing Letters, 116:437-441, 2016
11. X. Molinero, F. Riquelme, M. Serna. Forms of representation for simple games: sizes, conversions and equivalences. Mathematical Social Sciences, 77:87-102, 2015.
12. X. Molinero, F. Riquelme, M. Serna. Cooperation through social in uence. European Journal of Operational Research, 242(3): 960-974, 2015.
13. J. Gabarró, M. Serna, A. Stewart. Analysing web-orchestrations under stress using uncertainty profiles. The Computer Journal, Section A: Computer Science, Methods and Tools, 57(11): 1591- 1615, 2014.
14. J. Diaz, L.A. Goldberg, G.B. Mertzios, D. Richerby, M. Serna and P.G. Spirakis. Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica, 69(1): 78-91, 2014.
15. J. Gabarró, A. García, M. Serna. Computational aspects of uncertainty profiles and angel-daemon games. Theory of Computing Systems, 54(1): 83-110, 2014.
16. J. Diaz, L.A. Goldberg, G.B. Mertzios, D. Richerby, M. Serna and P.G. Spirakis. On the fixation probability of superstars. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 469(2156), 2013.
17. J. Gabarró, A. García, M. Serna. On the hardness of game equivalence under local isomorphism. RAIRO Theoretical Informatics and Applications, 47(2):147-169 (2013).
18. C. Àlvarez,J. Díaz, D. Mitsche, M. Serna. Continuous monitoring in the dynamic sensor field model. Theoretical Computer Science, 463: 114-122 (2012).
19. J. Freixas, X. Molinero, M. Serna. On the complexity of problems on simple games. RAIRO. Operations research. 45:295--314(2011).
20. C. Àlvarez, M. Blesa, M. Serna. The robustness of stability under node and link failures. Theoretical Computer Science, 412(50):6855-6878 (2011).
21. J. Gabarró, A. García, M. Serna. The complexity of game isomorphism. Theoretical Computer Science, 412(48):6675-6695 (2011).
22. C. Àlvarez, J. Gabarró, M. Serna. Equilibria problems on games: Complexity versus succinctness. Journal of Computer and System Sciences, 77(6): 1172-1197 (2011).
23. C. Àlvarez, I. Chatzigiannakis, A. Duch, J. Gabarró, O. Michail, M. Serna, P.G. Spirakis. Computational models for networks of tiny artifacts: A survey. Computer Science Review 5(1): 7-25 (2011).
24. C. Àlvarez, M. Serna. On the proper intervalization of colored caterpillar trees. RAIRO Theoretical Informatics and Applications. 43:667--686, 2009.
25. M. Comas, M. Serna. Vertex fusion under distance constraints. European Journal on Combinatorics. 30:1612--1623, 2009.
26. M. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, M. Serna. Adversarial queueing models for continous networks dynamics. Theory of Computing Systems. 44:304--331,2009.
27. C. Àlvarez, J. Díaz, J. Petit, J. Rolim, M. Serna. High level communication functionalities for wireless sensor networks. Theoretical Computer Science. 406(3):240--247,2008.
28. J. Díaz, M. Serna, D.M. Thilikos. Efficient algorithms for counting parameterized list H-Colorings. Journal of Computer and System Sciences 74(5):919--937, 2008.
29. J. Díaz, Z. Lotker, M. Serna. The distant-2 chromatic number of random proximity and random geometric graphs. Information Processing Letters. 106(4):144--148, 2008.
    
30. J. Díaz, J. Pérez, M.J. Serna, N. Wormald. Walkers on the cycle and the grid. SIAM Journal on Discrete Mathematics. 22(2):747-775, 2008.
    
31. M. Serna, F. Xhafa. Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming. RAIRO - Theoretical Informatics and Applications. 42(2):237--252, 2007.
32. J. Díaz, M. Serna, N.C. Wormald. Bounds on the bisection width for random d-regular graphs. Theoretical Computer Science. 382(2): 120-130, 2007.
33. C. Àlvarez, R. Cases, J. Díaz, J. Petit, M. Serna Communication Trees. Theoretical Computer Science. 381(1-3): 197-217, 2007.
34. J. Díaz, M. Serna, D.M. Thilikos. Complexity issues on Bounded Restrictive H-coloring. Discrete Mathematics. 307(16):2082-2093, 2007.
35. J. Díaz, V. Sambalani, M. Serna, P. Spirakis. The chromatic and clique number of random scaled sector graphs. Theoretical Computer Science. 349(1):40-51, 2005.
36. D.M. Thilikos, M. Serna. Parameterized complexity for graph layout problems. The algorithmics column. Bulletin of the EATCS. 86:41-65, 2005.
37. D.M. Thilikos, M. Serna, H. Bodlaender. Cutwidth II: Algorithms for partial w-trees. Journal of Algorithms. 56:25-49, 2005.
38. D.M. Thilikos, M. Serna, H. Bodlaender. Cutwidth I: A constructive linear time algorithm for cutwidth. Journal of Algorithms. 56:1-24, 2005.
39. M. Serna, L. Trevisan, F. Xhafa. The Approximability of Non-Boolean Satisfiability problems and restricted integer programming. Theoretical Computer Science. 332(1-3):123-139, 2005.
40. C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, M. Serna. Adversarial models for priority-based networks. Networks. 45(1):1-35, 2005.
41. J. Díaz, M. Serna, D.M. Thilikos. The restrictive H-coloring problem. Discrete Applied Mathematics. 145:297-305, 2005.
42. C. Àlvarez, M. Blesa, M. Serna. A characterization of universal stability in the adversarial queueing model. SIAM Journal on Computing. 34(1):41-66, 2004.
43. C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, M. Serna. The complexity of deciding stability under FFS in the Adversarial Queueing model. Information Processing Letters. 90(5):261-266, 2004.
44. J. Diaz, J. Petit, M. Serna. A random graph model for optical networks of sensors. IEEE Transactions on Mobile Computing. 2(3):186-196, 2003.
45. J. Díaz, N. Do, M. Serna, N. Wormald. Bounds on the max and min bisection of random cubic and 4-regular graphs. Theoretical Computer Science. 307:531-547, 2003
46. H. Jung, M. Serna, P. Spirakis. An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Theoretical Computer Science. 292(3): 639-652, 2003
47. J. Díaz, J. Petit and M. Serna. A Survey of Graph Layout Problems. ACM Computing Surveys. 34(3):313-356, 2002.
48. M. Serna and F. Xhafa. The parallel approximability of the true and false gates problems for nor circuits. Parallel Processing Letters. 12(1):127-136, 2002.
49. J. Díaz, M. Serna and D.M. Thilikos. Counting H-colorings of partial k-trees . Theoretical Computer Science. 281:291-309, 2002.
50. M. Serna, F. Xhafa. Approximating Scheduling Unrelated Parallel Machines in parallel. Computational Optimization and Applications. 21:325-338, 2002
51. M. Serna, F. Xhafa. On the parallel approximability of a subclass of Quadratic Programming. Theoretical Computer Science. 259:217-231, 2001
52. J. Díaz, J. Petit, M. Serna, L. Trevisan. Approximating graph layout problems on random graphs. Discrete Mathematics, 235:245-253, 2001.
53. C. Àlvarez, J. Díaz, M. Serna. The hardess of intervalizing four colored caterpillars. Discrete Mathematics, 235:19-27, 2001.
54. J. Díaz, M. Penrose, J. Petit, M. Serna. Approximating Layout Problems on Random Geometric Graphs. Journal of Algorithms, 39(1):78--117, 2001.
55. J. Díaz, J. Petit, M. Serna. Faulty random geometric networks. Parallel Processing Letters, 10(4):343-357, 2000.
56. J. Díaz, M. Penrose, J. Petit, M. Serna. Convergence theorems for some layout measures on random lattice and random geometric graphs. Combinatorics, Probability and Computing, 9:489-511, 2000.
57. M. Serna, F. Xhafa. On the average case complexity of some P-complete problems. Theoretical Informatics and Applications, vol 33:33-45, 1999.
58. J. Díaz, M. Serna, P. Spirakis. On the random generation and counting of matchings in dense graphs. Theoretical Computer Science, 201:275-279, 1998
59. J. Díaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis, J. Torán. Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science, 181:267-287, 1997.
60. J. Díaz, M. Serna, J. Torán. Parallel approximation Schemes for problems on planar graphs. Acta Informatica, 33:387-408, 1996.
61. J. Gabarró, M. Serna. Rational Process and Linear Systems in CSP. Fundamenta Informaticae, 24:283-302, 1995.
62. L. Kirousis, M. Serna, P. Spirakis. Parallel Complexity of the Connected Subgraph problem. SIAM Journal on Computing, 22:573-586, 1993.
63. M. J. Serna. Approximating Linear Programming is log-space complete for P. Information Processing Letters, 37:233-236, 1991.
64. M. Serna. Asymptotical behaviour of some non-uniform measures. Theoretical Informatics and Applications, 23:281-293, 1989.

Refereed International Conferences

1. X. Molinero, F. Riquelme, M. Serna Star-shaped mediation in influence games. 12th Cologne-TwenteWorkshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. K. Cornelissen, R. Hoeksma, J. Hurink, B. Manthey (Eds) CTIT Workshop Proceedings, pp. 179-182, 2013
2. J. Díaz, O. Pottonen, M. Serna E.J. van Leeuwen. On the Complexity of Metric Dimension. European Symposium on Algorithms (ESA 2012), Ljubljana, Slovenia, September 10-12, 2012. LNCS vol. 7501 pp. 419-430, 2012.
3. J. Díaz, L.A. Goldberg, G. Mertzios, D. Richerby, M. Serna, P.G. Spirakis. Approximating Fixation Probabilities in the Generalized Moran Process Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 954-960, 2012.
4. C. Àlvarez, A. Duch, M. Serna, D. Thilikos. On the existence of Pure Nash Equilibria in strategic search games. Trustworthy Global Computing. 5th International Conference (TGC 2011). Aachen, Germany, September 9-10, 2011. Revised Selected Papers, LNCS vol 7173 pp. 58-72, 2012.
5. J. Gabarró, M. Serna, A. Stewart. Orchestrating unreliable services: strategic and probabilistic approaches to reliability. Trustworthy Global Computing. 5th International Conference (TGC 2011). Aachen, Germany, September 9-10, 2011. Revised Selected Papers, LNCS vol 7173 pp. 197-211, 2012.
6. J. Gabarró, M. Serna, A. Stewart. Web Services and Incerta Spiriti: a Game Theoretic approach to Uncertainty. 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011). LNCS/LNAI vol 6717 pp. 651-662, 2011.
7. J. Gabarró, P. Kilpatrick, A. Stewart, M. Serna. Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung Trustworthy Global Computing, 4th international workshop (TGC 2010). Munich, Germany, February 25-26, 2010. Revised Selected Papers, LNCS, vol 6084 pp. 189-204, 2010.
8. C. Àlvarez, A. Duch, J. Gabarro, M. Serna. Sensor Field: A Computational model. The 5th Workshop on Algorithms for Sensor Networks (ALGOSENSORS 2009), July 10-11, 2009; Rhodes Island, Greece. Shlomi Dolev, Ed. LNCS, vol. 5804 pp. 3--14, 2009.
9. M. Comas, M. Serna. A coloring characterization for graph cover problems. Proceeding of the VI Jornadas de Matemática Discreta y Algorítmica, pp. 263--270, 2008.
10. J. Gabarró, A. García, M. Serna. On the Complexity of Equilibria Problems in Angel-Daemon Games. The 14th Annual International Computing and Combinatorics Conference
    (COCOON, June 27-29, 2008; Dalian, China). LNCS, vol. 5092 pp. 31--40, 2008.
    
11. J. Gabarró, A. García, M. Serna, A. Stewart, P. Kilpatrick. Analysing orchestrations with risk profiles anf angel daemon games. Proceeding of the CoreGRID Integration Workshop 2008
    "Integrated Research in Grid Computing", pp. 347-358, 2008.
12. J. Gabarró, A. García, M. Serna. On the complexity of game isomorphism 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS-2007),  vol. 4708 of  Lecture Notes in Computer Science,  pp. 559-571, 2007.
13. J.A. Gonzalez, M. Serna, F. Xhafa.
14. A hyper-heuristic for scheduling independent jobs in Computational Grids. Proccedings of the 2nd International Conference on Software and Data Technologies (ICSOFT 2007), pp. 128-135, 2007.
15. M. Comas, M. Serna. Vertex fusion under diameter constraints European Conference on Combinatorics, Graph Theory and Applications Seville, September 11 - 15, 2007, Electronic Notes on Discrete Mathematics, 29:261-265, 2007.
16. C. Àlvarez, J. Gabarró, M. Serna. Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees The 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), vol. 3827, Lecture Notes in Computer Science, pp.634--643, 2005.
17. M. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, M. Serna. Adversarial queueing models for continous networks dynamics 30th International Symposium on Mathematical Foundations of Computer Science (MFCS-2005), vol. 3618, Lecture Notes in Computer Science, pp. 144-155, 2005.
18. C. Àlvarez, J. Gabarró, M. Serna. Pure Nash Equilibria in games with a large number of actions 30th International Symposium on Mathematical Foundations of Computer Science (MFCS-2005), vol. 3618, Lecture Notes in Computer Science, pp. 95-106, 2005.
19. J. Díaz, X. Perez, M. Serna, N.C. Wormald. Connectivity for wireless agents moving on a cycle or grid. 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005), Lecture Notes in Computer Science, vol. 3404, pp. 353 - 364, 2005.
20. C. Àlvarez, J. Díaz, J. Petit, J. Rolim, M. Serna. Efficient and reliable high level communication in randomly deployed wireless sensor networks. ACM International Workshop on Mobility Management and Wireless Access. (Mobiwac 2004), pp. 106--110, 2004.
21. J. Díaz, M. Serna, D.M. Thilikos Fixed parameter algorithms for counting and deciding bounded restrictive H-coloring. 12th European Symposium on Algorithms (ESA 2004), Lecture Notes in Computer Science, vol 3221, pp. 275--286, 2004.
22. C. Àlvarez, M. Blesa, M. Serna. The impact of failure management on the stability of communication networks 10th International Conference on Parallel and Distributed Systems (ICPADS-2004), pp. 153--160, 2004.
23. C. Àlvarez, M. Serna. The Proper Interval Colored Graph problem for Caterpillar Trees. CTW on Graphs and Combinatorial Optimization (CTW 2004), Electronic Notes on Discrete Mathematics, 17:23--28, 2004.
24. J. Díaz, M. Serna, N.C. Wormald. Computation of the bisection width for random d-regular graphs. 6th Latin American Theoretical Informatics Conference (LATIN-2004), Lecture Notes in Computer Science, vol 2976, pp. 49-58, 2004.
25. C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, M. Serna. Adversarial models for priority-based networks 28th International Symposium on Mathematical Foundations of Computer Science (MFCS-2003), vol. 2747, Lecture Notes in Computer Science, pp 142-151, 2003.
26. G. Arzhantseva, J. Díaz, J. Petit, J. Rolim, M. Serna } Broadcasting on networks of sensors communicating through directional antenas. International Workshop on Ambient Intelligence Computing in conjunction with 2nd FLAGS Technical Workshop, Santorini, Greece, June 2003. CTI Press, pp. 1-12 , 2003.
27. J. Díaz, J. Petit, M. Serna. Evaluation of basic protocols for optical smart dust networks. Second International Workshop on Experimental and Efficient Algorithms (WEA-2003). Vol. 2647, Lecture Notes in Computer Science, pp 97-106, 2003.
28. J. Díaz, M. Serna, D. Thilikos. The complexity of restrictive H-coloring. 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG-2002). Vol 2573 of Lecture Notes in Computer Science, pp 126-137, 2002.
29. J. Díaz, J. Nesetril, M. Serna, D. Thilikos. H-colorings of large degree graphs. First EurAsian Conference on Advances in Information and Communication Technology (EURASIA-ICT-2002). Vol 2510 of Lecture Notes in Computer Science, pp 850-857, 2002.
30. J. Díaz, N. Do, M. Serna, N. Wormald. Bisection of random cubic graphs. 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-2002). Vol 2483 of Lecture Notes in Computer Science, pp 114-125, 2002.
31. C. Àlvarez, M. Blesa, M. Serna. Universal stability of undirected graphs in the adversarial queueing model. Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-2002), pp 183-191, 2002.
32. D.M. Thilikós, M. Serna, H. Bodlaender. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. 9th Annual European Symposium on Algorithms (ESA-2001). Vol 2161 of Lecture Notes in Computer Science, pp 380-390, 2001.
33. A. Stewart, M. Clint, J. Gabarró and M. Serna. Towards formally refining BSP barriers into explicit two-sided communications. 7th Euro-Par Conference on Parallel and Distributed Computing (EUROPAR-2001). Vol 2150 of Lecture Notes in Computer Science, pp 549-559, 2001.
34. J. Díaz, M. Serna and D.M. Thilikos. (H,C,K)-colorings: Fast, Easy and Hard Cases. . 26th International Symposium on Mathematical Foundations of Computer Science (MFCS-2001). Vol 2136 of Lecture Notes in Computer Science, pp 304-315, 2001.
35. J. Díaz, M. Serna and D.M. Thilikos. Counting H-colorings of graphs of partial k-trees . 7th Annual International Computing and Combinatorics Conference (COCOON-2001). Vol 2108 of Lecture Notes in Computer Science, pp 3-3, 2001.
36. J. Díaz, D. Koukopoulos, S. Nikoletseas, M. Serna, P. Spirakis and D.M. Thilikos. Stability and non-stability of the FIFO protocol. Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-2001), pp 48-53, 2001
37. D.M. Thilikós, M. Serna, H. Bodlaender. Constructive linear time algorithms for small cutwidth and carving-width. 11th International Symposium on Algorithms and Computation (ISAAC-2000), Vol 1969 of Lecture Notes in Computer Science, pp 192-203, 2000
38. C. Alvarez, R. Cases, J. Díaz, J. Petit, M. Serna. Routing trees for random graphs. Approximation and Randomized algorithms in Communication Networks (ARACNE-2000), Proceedings in Informatics, vol 8, pp 99-110, 2000.
39. M. Serna, F. Xhafa. Parallel Approximation to High Multiplicity Scheduling Problems via Smooth Multi-values Quadratic Programming. Vectorial and Parallel Processing (VECPAR-2000). Porto, June 2000.
40. J. Díaz, J. Petit, M. Serna. A Survey on layout problems. International Conference on Mathematical Foundations of Informatics. Hanoi, Oct 25-28, 1999.
41. C. Àlvarez, M. Serna. The proper interval colored graph problem for caterpillar trees. International Conference on Mathematical Foundations of Informatics. Hanoi, Oct 25-28, 1999.
42. J. Díaz, M. Penrose, J. Petit, M. Serna. Layout problems and Geometric Graphs. International Conference on Mathematical Foundations of Informatics. Hanoi, Oct 25-28, 1999.
43. M. Serna, F. Xhafa. Parallel Approximation to dense high multiplicity scheduling problems. International Conference on Mathematical Foundations of Informatics. Hanoi, Oct 25-28, 1999.
44. J. Díaz, M. Penrose, J. Petit, M. Serna. Linear orderings of random geometric graphs. Fifth Annual International Computing and Combinatorics Conference (COCOON-1999), vol. 1665 of Lecture Notes in Computer Science, pp 291-302, 1999
45. J. Díaz, M. Penrose, J. Petit, M. Serna. Layout problems on lattice graphs. 25th International Workshop on Graph Theoretic Concepts in Computer Science (WG-1999), vol. 1627 of Lecture Notes in Computer Science, pp 103-112, 1999
46. J. Díaz, J. Petit, P. Psycharis, M. Serna. A parallel algorithm for sampling matchings from an almost uniform distribution. Ninth Annual International Symposium on Algorithms and Computation (ISAAC-1998), vol. 1533 of Lecture Notes in Computer Science, pp 457-466, 1998.
47. J. Díaz, J. Petit, M. Serna. Random Geometric Problems on [0,1]^2. Second International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-1998), vol 1518 of Lecture Notes in Computer Science, pp 294-306,1998.
48. M. Serna, L. Trevisan, F. Xhafa. The (Parallel) Approximability of Non-Boolean Satisfiability problems and restricted integer programming. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-1998), vol 1373 of Lecture Notes in Computer Science, pp. 488-498, 1998.
49. M. Serna, F. Xhafa. The Parallel Approximability of a subclass of Quadratic Programming . International Conference on Parallel and Distributed Systems Seul December 10-13 1997.
50. M. Serna, L. Trevisan, F. Xhafa. The (Parallel) approximability of Non-Boolean satisfiability problems and restricted integer programming. Workshop on randomized algorithms in sequential, parallel, and distributed computing. RALCOM-97 Santorini, October 6-11, 1997.
51. J. Díaz, S. Nikoletseas, P. Psycharis, M. Serna, P. Spirakis. Sampling matchings in parallel . Workshop on Randomized Parallel Computation (WRPC, IPSS) Ginebra, 1996.
52. M. Serna, F. Xhafa. Approximating Scheduling Problems in Parallel 3rd International Euro-Par Conference. Parallel and Distributed Algorithms (EUROPAR-1997), vol 1300 of Lecture Notes in Computer Science, pp. 440-449, 1997.
53. J. Díaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis, J. Torán. Efficient parallel algorithms for some tree layout problems. First Annual International Conference on Computing and Combinatorics (COCOON-1995), vol 959 of Lecture Notes in Computer Science, pp 313-323, 1995.
54. J. Díaz, M. Serna, J. Torán. Parallel Approximation Schemes for problems on planar graphs. First Annual European Symposium on Algorithms (ESA-1993), vol. 726 of Lecture Notes in Computer Science, pp 145-156, 1993.
55. J. Díaz, M. Serna, P. Spirakis, J. Torán. Parallel Approximation classes . Workshop on Parallel algorithms. San Diego, May 19, 1993.
56. H. Jung, M. Serna, P. Spirakis. A parallel algorithm for two processors precedence constraint scheduling. 18th International Colloquium on Automata languages and programming (ICALP-1991), vol 501 of Lecture Notes in Computer Science, pp 417-428, 1991.
57. M. Serna, P. Spirakis. Tight RNC Approximations to Max Flow. 8th Symposium on Theoretical Aspects of Computer Science (STACS-1991), vol 480 of Lecture Notes in Computer Science, pp 118-126, 1991.
58. M. Serna, P. Spirakis. The approximability of problems complete for P International Symposium on Optimal Algorithms, vol 401 of Lecture Notes in Computer Science, pp 193-204, 1989.
59. L. Kirousis, M. Serna, P. Spirakis. The paralel complexity of the subgraph connectivity problem. 30th Annual IEEE Symposium on Foundations of Computer Science. North Caroline, Oct 29 - Nov 1, 1989
60. M. Serna. Lupanov Hierarchy. Journees LANFOR. Barcelona, November 17-21, 1986

Thesis

• The parallel Approximability of P-complete problems, Departament de Llenguatges i Sistemes Informàtics, TR LSI-90-8. Advisors: Joaquim Gabarro and Paul G. Spirakis.

Invited presentations

• Invited talk in the 6th Workshop on Experimental Algorithms (WEA 2007) Rome, Italy, June 6-8, 2007.
• Invited talk in the 4th ECOTEL Ecole d'hivern des telecommunications de Sophia Antipolis y 2nd ARACNE school. Golfe Juan, December 10-14, 2001.
• Invited speaker in the International Conference on Mathematical Foundations of Informatics. Hanoi, Oct. 1999.
• Invited talk in the DIMACS Workshop on Randomization Methods in Algorithm Design, Princeton, December 1997.
• Invited talk in the Workshop on probabilistic algorithms and algorithmic probability. Utrecht, May 1995.
• Invited Lecturer in the Primer curso Iberoamericano de Informática Aplicada, Santa Cruz de la Sierra, Bolivia, Mayo 1995.

PhDs awarded as Thesis Advisor

• Fatos Xhafa, On Parallel versus Sequential Approximability: Complexity and Approximation Results. December 1998
• Maria Blesa, Stability in Communication Networks under Adversarial Models. February 2006
• Fabian Riquelme, Computational Aspects of Simple and Influence Games. July 2014, co-supervisor Xavier Molinero.

Books presenting some of my results

• A. Gibbons. P. Spirakis eds. Lectures on parallel computation Cambridge University press, 1993.