The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Maria J. Serna: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:313-323 [Conf]
  2. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Layout Problems on Lattice Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:103-112 [Conf]
  3. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:298-307 [Conf]
  4. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:275-286 [Conf]
  5. Josep Díaz, Maria J. Serna, Jacobo Torán
    Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:145-156 [Conf]
  6. Maria J. Serna, Fatos Xhafa
    On Parallel versus Sequential Approximation. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:409-419 [Conf]
  7. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:380-390 [Conf]
  8. Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos
    H-Colorings of Large Degree Graphs. [Citation Graph (0, 0)][DBLP]
    EurAsia-ICT, 2002, pp:850-857 [Conf]
  9. Maria J. Serna, Fatos Xhafa
    Approximating Scheduling Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:440-449 [Conf]
  10. Alan Stewart, Maurice Clint, Joaquim Gabarró, Maria J. Serna
    Towards Formally Refining BSP Barrier s into Explicit Two-Sided Communications. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2001, pp:549-559 [Conf]
  11. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis
    The Parallel Complexity of the Subgraph Connectivity Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:294-299 [Conf]
  12. Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna
    Routing Tree Problems on Random Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:99-110 [Conf]
  13. Hermann Jung, Maria J. Serna, Paul G. Spirakis
    A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:417-428 [Conf]
  14. Carme Àlvarez, Maria J. Blesa, Maria J. Serna
    The Impact of Failure Management on the Stability of Communication Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2004, pp:153-160 [Conf]
  15. Maria J. Serna, Fatos Xhafa
    The Parallel Approximability of a Subclass of Quadratic Programming. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1997, pp:474-0 [Conf]
  16. Carme Àlvarez, Joaquim Gabarró, Maria J. Serna
    Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, . [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:634-643 [Conf]
  17. Josep Díaz, Jordi Petit, Panagiotis Psycharis, Maria J. Serna
    A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:457-466 [Conf]
  18. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:192-203 [Conf]
  19. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Computation of the Bisection Width for Random d-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:49-58 [Conf]
  20. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna
    Adversarial Models for Priority-Based Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:142-151 [Conf]
  21. Carme Àlvarez, Joaquim Gabarró, Maria J. Serna
    Pure Nash Equilibria in Games with a Large Number of Actions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:95-106 [Conf]
  22. Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna
    Adversarial Queueing Model for Continuous Network Dynamics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:144-155 [Conf]
  23. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    (H, C, K)-Coloring: Fast, Easy, and Hard Cases. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:304-315 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Mobility Management & Wireless Access Protocols, 2004, pp:106-110 [Conf]
  25. Maria J. Serna, Paul G. Spirakis
    The Approximability of Problems Complete for P. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:193-204 [Conf]
  26. Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
    Bisection of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:114-125 [Conf]
  27. Josep Díaz, Jordi Petit, Maria J. Serna
    Random Geometric Problems on [0, 1]². [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:294-306 [Conf]
  28. Carme Àlvarez, Maria J. Blesa, Maria J. Serna
    Universal stability of undirected graphs in the adversarial queueing model. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:183-197 [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:48-52 [Conf]
  30. Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald
    Connectivity for Wireless Agents Moving on a Cycle or Grid. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:353-364 [Conf]
  31. Maria J. Serna, Paul G. Spirakis
    Tight RNC Approximations to Max Flow. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:118-126 [Conf]
  32. Maria J. Serna, Luca Trevisan, Fatos Xhafa
    The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:488-498 [Conf]
  33. Josep Díaz, Jordi Petit, Maria J. Serna
    Evaluation of Basic Protocols for Optical Smart Dust Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:97-106 [Conf]
  34. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Linear Orderings of Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:291-302 [Conf]
  35. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The Complexity of Restrictive H-Coloring. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:126-137 [Conf]
  36. Josep Díaz, Maria J. Serna, Jacobo Torán
    Parallel Approximation Schemes for Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:4, pp:387-408 [Journal]
  37. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:6, pp:- [Journal]
  38. Josep Díaz, Jordi Petit, Maria J. Serna
    A survey of graph layout problems. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:3, pp:313-356 [Journal]
  39. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The restrictive H-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:297-305 [Journal]
  40. Carme Àlvarez, Josep Díaz, Maria J. Serna
    The hardness of intervalizing four colored caterpillars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:19-27 [Journal]
  41. Josep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan
    Approximating layout problems on random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:245-253 [Journal]
  42. Maria J. Serna, Dimitrios M. Thilikos
    Parameterized Complexity for Graph Layout Problems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:86, n:, pp:41-65 [Journal]
  43. Carme Àlvarez, Joaquim Gabarró, Maria J. Serna
    Pure Nash equilibria in games with a large number of actions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:031, pp:- [Journal]
  44. Joaquim Gabarró, Maria J. Serna
    Rational Processes and Linear Systems in CSP. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:24, n:3, pp:283-302 [Journal]
  45. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:5, pp:261-266 [Journal]
  46. Maria J. Serna
    Approximating Linear Programming is Log-Space Complete for P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:233-236 [Journal]
  47. Maria J. Serna
    Asymptotical Behaviour of Some Non-Uniform Measures. [Citation Graph (0, 0)][DBLP]
    ITA, 1989, v:23, n:3, pp:281-293 [Journal]
  48. Maria J. Serna, Fatos Xhafa
    On the Average Case Complexity of Some P-complete Problems. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:1, pp:33-46 [Journal]
  49. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Approximating Layout Problems on Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:78-116 [Journal]
  50. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Cutwidth I: A linear time fixed parameter algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:1-24 [Journal]
  51. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Cutwidth II: Algorithms for partial w-trees of bounded degree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:25-49 [Journal]
  52. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández
    Adversarial models for priority-based networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:1, pp:23-35 [Journal]
  53. Josep Díaz, Jordi Petit, Maria J. Serna
    Faulty Random Geometric Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:4, pp:343-358 [Journal]
  54. Maria J. Serna, Fatos Xhafa
    The Parallel Approximability of the False and True Gates Problems for NOR-Circuits. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2002, v:12, n:1, pp:127-136 [Journal]
  55. Carme Àlvarez, Maria J. Blesa, Maria J. Serna
    A Characterization of Universal Stability in the Adversarial Queuing Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:41-66 [Journal]
  56. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis
    Parallel Complexity of the Connected Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:573-586 [Journal]
  57. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:531-547 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:267-287 [Journal]
  59. Josep Díaz, Maria J. Serna, Paul G. Spirakis
    On the Random Generation and Counting of Matchings in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:201, n:1-2, pp:281-290 [Journal]
  60. Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis
    The chromatic and clique numbers of random scaled sector graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:40-51 [Journal]
  61. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-colorings of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:291-309 [Journal]
  62. Hermann Jung, Maria J. Serna, Paul G. Spirakis
    An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:639-652 [Journal]
  63. Maria J. Serna, Luca Trevisan, Fatos Xhafa
    The approximability of non-Boolean satisfiability problems and restricted integer programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:123-139 [Journal]
  64. Maria J. Serna, Fatos Xhafa
    On the parallel approximability of a subclass of quadratic programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:217-231 [Journal]
  65. Josep Díaz, Jordi Petit, Maria J. Serna
    A Random Graph Model for Optical Networks of Sensors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2003, v:2, n:3, pp:186-196 [Journal]
  66. Joaquim Gabarró, Alina García, Maria J. Serna
    On the Complexity of Game Isomorphism. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:559-571 [Conf]
  67. Maria J. Serna
    Random Models for Geometric Graphs (Abstract). [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:37- [Conf]
  68. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Complexity issues on bounded restrictive H-coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2082-2093 [Journal]
  69. Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna
    Communication tree problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:197-217 [Journal]
  70. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Bounds on the bisection width for random d -regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:120-130 [Journal]

  71. Sensor Field: A Computational Model. [Citation Graph (, )][DBLP]


  72. On the Complexity of Equilibria Problems in Angel-Daemon Games. [Citation Graph (, )][DBLP]


  73. A Hyper-Heuristic for Scheduling Independent Jobs in Computational Grids. [Citation Graph (, )][DBLP]


  74. The Complexity of Testing Properties of Simple Games [Citation Graph (, )][DBLP]


  75. Vertex fusion under distance constraints. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.457secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002