Curriculum vitae

Maria José Serna Iglesias




Education | Grants and Projects | Research interests | Professional Experience | Publications


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

Undergraduate Studies

2. Grants and Projects funded

3. Research interests

4. Professional Experience

4.1. Job positions

Departament de Matemàtica Aplicada I, Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya.


4.2 Academic Activities


Teaching

As member of the Computer Science Department (CS), Universitat Politècnica de Catalunya. Courses taugth at the Facultat d'Informàtica (FIB), at the Facultat de Matemàtiques i Estadística (FME), in the Software graduate programme of the CS Dept. (Soft), or at the Master in Computing of the CS Dept. (MCom) As member of the Departament de Matemàtica Aplicada I, Universitat Politècnica de Catalunya. Courses taugth at the Escola Universitaria de Arquitectura Tecnica.

Teaching Managment

University Comittee membership

4.3 Activity in professional societies

Program Commitee membership

Organizing Committee membership


5. Publications

Books of International circulation

Books in Catalan or Spanish

Book chapters

As editor

International Journals

  1. J. Gabarró, M. Serna, A. Stewart. Analysing web-orchestrations under stress using uncertainty profiles. The Computer Journal, Section A: Computer Science, Methods and Tools, electronic first, June 2013.
  2. 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).
  3. 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, online first, November 2012.
  4. 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).
  5. 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.
  6. 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).
  7. C. Àlvarez,J. Díaz, D. Mitsche, M. Serna. Continuous monitoring in the dynamic sensor field model. Theoretical Computer Science, 463: 114-122 (2012).
  8. J. Freixas, X. Molinero, M. Serna. On the complexity of problems on simple games. RAIRO. Operations research. 45:295--314(2011).
  9. C. Àlvarez, M. Blesa, M. Serna. The robustness of stability under node and link failures. Theoretical Computer Science, 412(50):6855-6878 (2011).
  10. J. Gabarró, A. García, M. Serna. The complexity of game isomorphism Theoretical Computer Science, 412(48):6675-6695 (2011).
  11. C. Àlvarez, J. Gabarró, M. Serna. Equilibria problems on games: Complexity versus succinctness. Journal of Computer and System Sciences, 77(6): 1172-1197 (2011).
  12. 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).
  13. C. Àlvarez, M. Serna. On the proper intervalization of colored caterpillar trees. RAIRO Theoretical Informatics and Applications. 43:667--686, 2009.
  14. M. Comas, M. Serna. Vertex fusion under distance constraints. European Journal on Combinatorics. 30:1612--1623, 2009.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. C. Àlvarez, R. Cases, J. Díaz, J. Petit, M. Serna Communication Trees. Theoretical Computer Science. 381(1-3): 197-217, 2007.
  23. J. Díaz, M. Serna, D.M. Thilikos. Complexity issues on Bounded Restrictive H-coloring. Discrete Mathematics. 307(16):2082-2093, 2007.
  24. 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.
  25. D.M. Thilikos, M. Serna. Parameterized complexity for graph layout problems. The algorithmics column. Bulletin of the EATCS. 86:41-65, 2005.
  26. D.M. Thilikos, M. Serna, H. Bodlaender. Cutwidth II: Algorithms for partial w-trees. Journal of Algorithms. 56:25-49, 2005.
  27. D.M. Thilikos, M. Serna, H. Bodlaender. Cutwidth I: A constructive linear time algorithm for cutwidth. Journal of Algorithms. 56:1-24, 2005.
  28. 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.
  29. C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, M. Serna. Adversarial models for priority-based networks. Networks. 45(1):1-35, 2005.
  30. J. Díaz, M. Serna, D.M. Thilikos. The restrictive H-coloring problem. Discrete Applied Mathematics. 145:297-305, 2005.
  31. 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.
  32. 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.
  33. 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.
  34. 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
  35. 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
  36. J. Díaz, J. Petit and M. Serna. A Survey of Graph Layout Problems. ACM Computing Surveys. 34(3):313-356, 2002.
  37. 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.
  38. J. Díaz, M. Serna and D.M. Thilikos. Counting H-colorings of partial k-trees . Theoretical Computer Science. 281:291-309, 2002.
  39. M. Serna, F. Xhafa. Approximating Scheduling Unrelated Parallel Machines in parallel. Computational Optimization and Applications. 21:325-338, 2002
  40. M. Serna, F. Xhafa. On the parallel approximability of a subclass of Quadratic Programming. Theoretical Computer Science. 259:217-231, 2001
  41. J. Díaz, J. Petit, M. Serna, L. Trevisan. Approximating graph layout problems on random graphs. Discrete Mathematics, 235:245-253, 2001.
  42. C. Àlvarez, J. Díaz, M. Serna. The hardess of intervalizing four colored caterpillars. Discrete Mathematics, 235:19-27, 2001.
  43. J. Díaz, M. Penrose, J. Petit, M. Serna. Approximating Layout Problems on Random Geometric Graphs. Journal of Algorithms, 39(1):78--117, 2001.
  44. J. Díaz, J. Petit, M. Serna. Faulty random geometric networks. Parallel Processing Letters, 10(4):343-357, 2000.
  45. 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.
  46. M. Serna, F. Xhafa. On the average case complexity of some P-complete problems. Theoretical Informatics and Applications, vol 33:33-45, 1999.
  47. 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
  48. 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.
  49. J. Díaz, M. Serna, J. Torán. Parallel approximation Schemes for problems on planar graphs. Acta Informatica, 33:387-408, 1996.
  50. J. Gabarró, M. Serna. Rational Process and Linear Systems in CSP. Fundamenta Informaticae, 24:283-302, 1995.
  51. L. Kirousis, M. Serna, P. Spirakis. Parallel Complexity of the Connected Subgraph problem. SIAM Journal on Computing, 22:573-586, 1993.
  52. M. J. Serna. Approximating Linear Programming is log-space complete for P. Information Processing Letters, 37:233-236, 1991.
  53. 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

Invited presentations

PhDs awarded as Thesis Advisor

Books presenting some of my results


Last modified: October 24 16:36:21 CET 2012