| 2008 |
|---|
| 84 | EE | Joaquim Gabarró,
Alina García,
Maria J. Serna:
On the Complexity of Equilibria Problems in Angel-Daemon Games.
COCOON 2008: 31-40 |
| 83 | EE | Maria J. Serna:
Parallel Algorithms for Two Processors Precedence Constraint Scheduling.
Encyclopedia of Algorithms 2008 |
| 82 | EE | Maria J. Serna:
Randomized Parallel Approximations to Max Flow.
Encyclopedia of Algorithms 2008 |
| 81 | EE | Josep Freixas,
Xavier Molinero,
Martin Olsen,
Maria J. Serna:
The Complexity of Testing Properties of Simple Games
CoRR abs/0803.0404: (2008) |
| 80 | EE | Josep Díaz,
Zvi Lotker,
Maria J. Serna:
The distant-2 chromatic number of random proximity and random geometric graphs.
Inf. Process. Lett. 106(4): 144-148 (2008) |
| 79 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Efficient algorithms for counting parameterized list H-colorings.
J. Comput. Syst. Sci. 74(5): 919-937 (2008) |
| 78 | EE | Josep Díaz,
Xavier Pérez,
Maria J. Serna,
Nicholas C. Wormald:
Walkers on the Cycle and the Grid.
SIAM J. Discrete Math. 22(2): 747-775 (2008) |
| 77 | EE | Carme Àlvarez,
Josep Díaz,
Jordi Petit,
José D. P. Rolim,
Maria J. Serna:
High level communication functionalities for wireless sensor networks.
Theor. Comput. Sci. 406(3): 240-247 (2008) |
| 2007 |
|---|
| 76 | | Juan Antonio Gonzalez,
Maria J. Serna,
Fatos Xhafa:
A Hyper-Heuristic for Scheduling Independent Jobs in Computational Grids.
ICSOFT (PL/DPS/KE/MUSE) 2007: 128-135 |
| 75 | EE | Joaquim Gabarró,
Alina García,
Maria J. Serna:
On the Complexity of Game Isomorphism.
MFCS 2007: 559-571 |
| 74 | EE | Maria J. Serna:
Random Models for Geometric Graphs (Abstract).
WEA 2007: 37 |
| 73 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Complexity issues on bounded restrictive H-coloring.
Discrete Mathematics 307(16): 2082-2093 (2007) |
| 72 | EE | Marc Comas,
Maria J. Serna:
Vertex fusion under diameter constraints.
Electronic Notes in Discrete Mathematics 29: 261-265 (2007) |
| 71 | EE | Carme Àlvarez,
Rafel Cases,
Josep Díaz,
Jordi Petit,
Maria J. Serna:
Communication tree problems.
Theor. Comput. Sci. 381(1-3): 197-217 (2007) |
| 70 | EE | Josep Díaz,
Maria J. Serna,
Nicholas C. Wormald:
Bounds on the bisection width for random d -regular graphs.
Theor. Comput. Sci. 382(2): 120-130 (2007) |
| 2006 |
|---|
| 69 | | Carme Àlvarez,
Maria J. Serna:
Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings
Springer 2006 |
| 2005 |
|---|
| 68 | EE | Carme Àlvarez,
Joaquim Gabarró,
Maria J. Serna:
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, .
ISAAC 2005: 634-643 |
| 67 | EE | 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.
MFCS 2005: 144-155 |
| 66 | EE | Carme Àlvarez,
Joaquim Gabarró,
Maria J. Serna:
Pure Nash Equilibria in Games with a Large Number of Actions.
MFCS 2005: 95-106 |
| 65 | EE | Josep Díaz-Giménez,
Xavier Pérez,
Maria J. Serna,
Nicholas C. Wormald:
Connectivity for Wireless Agents Moving on a Cycle or Grid.
STACS 2005: 353-364 |
| 64 | | Maria J. Serna,
Dimitrios M. Thilikos:
Parameterized Complexity for Graph Layout Problems.
Bulletin of the EATCS 86: 41-65 (2005) |
| 63 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
The restrictive H-coloring problem.
Discrete Applied Mathematics 145(2): 297-305 (2005) |
| 62 | EE | Carme Àlvarez,
Joaquim Gabarró,
Maria J. Serna:
Pure Nash equilibria in games with a large number of actions
Electronic Colloquium on Computational Complexity (ECCC)(031): (2005) |
| 61 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
Cutwidth I: A linear time fixed parameter algorithm.
J. Algorithms 56(1): 1-24 (2005) |
| 60 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
Cutwidth II: Algorithms for partial w-trees of bounded degree.
J. Algorithms 56(1): 25-49 (2005) |
| 59 | EE | Carme Àlvarez,
Maria J. Blesa,
Josep Díaz,
Maria J. Serna,
Antonio Fernández:
Adversarial models for priority-based networks.
Networks 45(1): 23-35 (2005) |
| 58 | EE | Maria J. Serna,
Luca Trevisan,
Fatos Xhafa:
The approximability of non-Boolean satisfiability problems and restricted integer programming.
Theor. Comput. Sci. 332(1-3): 123-139 (2005) |
| 57 | EE | Josep Díaz,
Vishal Sanwalani,
Maria J. Serna,
Paul G. Spirakis:
The chromatic and clique numbers of random scaled sector graphs.
Theor. Comput. Sci. 349(1): 40-51 (2005) |
| 2004 |
|---|
| 56 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.
ESA 2004: 275-286 |
| 55 | EE | Carme Àlvarez,
Maria J. Blesa,
Maria J. Serna:
The Impact of Failure Management on the Stability of Communication Networks.
ICPADS 2004: 153-160 |
| 54 | EE | Josep Díaz,
Maria J. Serna,
Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs.
LATIN 2004: 49-58 |
| 53 | EE | Carme Àlvarez,
Josep Díaz,
Jordi Petit,
José D. P. Rolim,
Maria J. Serna:
Efficient and reliable high level communication in randomly deployed wireless sensor networks.
Mobility Management & Wireless Access Protocols 2004: 106-110 |
| 52 | EE | Carme Àlvarez,
Maria J. Serna:
The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract).
Electronic Notes in Discrete Mathematics 17: 23-28 (2004) |
| 51 | EE | Carme Àlvarez,
Maria J. Blesa,
Josep Díaz,
Antonio Fernández,
Maria J. Serna:
The complexity of deciding stability under FFS in the Adversarial Queueing model.
Inf. Process. Lett. 90(5): 261-266 (2004) |
| 50 | EE | Carme Àlvarez,
Maria J. Blesa,
Maria J. Serna:
A Characterization of Universal Stability in the Adversarial Queuing Model.
SIAM J. Comput. 34(1): 41-66 (2004) |
| 2003 |
|---|
| 49 | EE | Carme Àlvarez,
Maria J. Blesa,
Josep Díaz,
Antonio Fernández,
Maria J. Serna:
Adversarial Models for Priority-Based Networks.
MFCS 2003: 142-151 |
| 48 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
Evaluation of Basic Protocols for Optical Smart Dust Networks.
WEA 2003: 97-106 |
| 47 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
A Random Graph Model for Optical Networks of Sensors.
IEEE Trans. Mob. Comput. 2(3): 186-196 (2003) |
| 46 | | Hermann Jung,
Maria J. Serna,
Paul G. Spirakis:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling.
Theor. Comput. Sci. 292(3): 639-652 (2003) |
| 45 | EE | Josep Díaz,
Norman Do,
Maria J. Serna,
Nicholas C. Wormald:
Bounds on the max and min bisection of random cubic and random 4-regular graphs.
Theor. Comput. Sci. 307(3): 531-547 (2003) |
| 2002 |
|---|
| 44 | EE | Josep Díaz,
Jaroslav Nesetril,
Maria J. Serna,
Dimitrios M. Thilikos:
H-Colorings of Large Degree Graphs.
EurAsia-ICT 2002: 850-857 |
| 43 | EE | Josep Díaz,
Norman Do,
Maria J. Serna,
Nicholas C. Wormald:
Bisection of Random Cubic Graphs.
RANDOM 2002: 114-125 |
| 42 | EE | Carme Àlvarez,
Maria J. Blesa,
Maria J. Serna:
Universal stability of undirected graphs in the adversarial queueing model.
SPAA 2002: 183-197 |
| 41 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
The Complexity of Restrictive H-Coloring.
WG 2002: 126-137 |
| 40 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
A survey of graph layout problems.
ACM Comput. Surv. 34(3): 313-356 (2002) |
| 39 | EE | Maria J. Serna,
Fatos Xhafa:
The Parallel Approximability of the False and True Gates Problems for NOR-Circuits.
Parallel Processing Letters 12(1): 127-136 (2002) |
| 38 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Counting H-colorings of partial k-trees.
Theor. Comput. Sci. 281(1-2): 291-309 (2002) |
| 2001 |
|---|
| 37 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees.
COCOON 2001: 298-307 |
| 36 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.
ESA 2001: 380-390 |
| 35 | EE | Alan Stewart,
Maurice Clint,
Joaquim Gabarró,
Maria J. Serna:
Towards Formally Refining BSP Barrier s into Explicit Two-Sided Communications.
Euro-Par 2001: 549-559 |
| 34 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
(H, C, K)-Coloring: Fast, Easy, and Hard Cases.
MFCS 2001: 304-315 |
| 33 | EE | Josep Díaz,
Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Maria J. Serna,
Paul G. Spirakis,
Dimitrios M. Thilikos:
Stability and non-stability of the FIFO protocol.
SPAA 2001: 48-52 |
| 32 | EE | Carme Àlvarez,
Josep Díaz,
Maria J. Serna:
The hardness of intervalizing four colored caterpillars.
Discrete Mathematics 235(1-3): 19-27 (2001) |
| 31 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna,
Luca Trevisan:
Approximating layout problems on random graphs.
Discrete Mathematics 235(1-3): 245-253 (2001) |
| 30 | | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Approximating Layout Problems on Random Geometric Graphs.
J. Algorithms 39(1): 78-116 (2001) |
| 29 | EE | Maria J. Serna,
Fatos Xhafa:
On the parallel approximability of a subclass of quadratic programming.
Theor. Comput. Sci. 259(1-2): 217-231 (2001) |
| 2000 |
|---|
| 28 | | Carme Àlvarez,
Rafel Cases,
Josep Díaz,
Jordi Petit,
Maria J. Serna:
Routing Tree Problems on Random Graphs.
ICALP Satellite Workshops 2000: 99-110 |
| 27 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.
ISAAC 2000: 192-203 |
| 26 | | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs.
Combinatorics, Probability & Computing 9(6): (2000) |
| 25 | | Josep Díaz,
Jordi Petit,
Maria J. Serna:
Faulty Random Geometric Networks.
Parallel Processing Letters 10(4): 343-358 (2000) |
| 1999 |
|---|
| 24 | EE | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Layout Problems on Lattice Graphs.
COCOON 1999: 103-112 |
| 23 | EE | Josep Díaz,
Mathew D. Penrose,
Jordi Petit,
Maria J. Serna:
Linear Orderings of Random Geometric Graphs.
WG 1999: 291-302 |
| 22 | | Maria J. Serna,
Fatos Xhafa:
On the Average Case Complexity of Some P-complete Problems.
ITA 33(1): 33-46 (1999) |
| 1998 |
|---|
| 21 | | Michael Luby,
José D. P. Rolim,
Maria J. Serna:
Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings
Springer 1998 |
| 20 | EE | Josep Díaz,
Jordi Petit,
Panagiotis Psycharis,
Maria J. Serna:
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution.
ISAAC 1998: 457-466 |
| 19 | EE | Josep Díaz,
Jordi Petit,
Maria J. Serna:
Random Geometric Problems on [0, 1]².
RANDOM 1998: 294-306 |
| 18 | | Maria J. Serna,
Luca Trevisan,
Fatos Xhafa:
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming.
STACS 1998: 488-498 |
| 17 | EE | Josep Díaz,
Maria J. Serna,
Paul G. Spirakis:
On the Random Generation and Counting of Matchings in Dense Graphs.
Theor. Comput. Sci. 201(1-2): 281-290 (1998) |
| 1997 |
|---|
| 16 | | Maria J. Serna,
Fatos Xhafa:
Approximating Scheduling Problems in Parallel.
Euro-Par 1997: 440-449 |
| 15 | EE | Maria J. Serna,
Fatos Xhafa:
The Parallel Approximability of a Subclass of Quadratic Programming.
ICPADS 1997: 474- |
| 14 | EE | Josep Díaz,
Alan Gibbons,
Grammati E. Pantziou,
Maria J. Serna,
Paul G. Spirakis,
Jacobo Torán:
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.
Theor. Comput. Sci. 181(2): 267-287 (1997) |
| 1996 |
|---|
| 13 | | Josep Díaz,
Maria J. Serna:
Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings
Springer 1996 |
| 12 | | Josep Díaz,
Maria J. Serna,
Jacobo Torán:
Parallel Approximation Schemes for Problems on Planar Graphs.
Acta Inf. 33(4): 387-408 (1996) |
| 1995 |
|---|
| 11 | | Josep Díaz,
Alan Gibbons,
Grammati E. Pantziou,
Maria J. Serna,
Paul G. Spirakis,
Jacobo Torán:
Efficient Parallel Algorithms for some Tree Layout Problems.
COCOON 1995: 313-323 |
| 10 | | Maria J. Serna,
Fatos Xhafa:
On Parallel versus Sequential Approximation.
ESA 1995: 409-419 |
| 9 | | Joaquim Gabarró,
Maria J. Serna:
Rational Processes and Linear Systems in CSP.
Fundam. Inform. 24(3): 283-302 (1995) |
| 1993 |
|---|
| 8 | | Josep Díaz,
Maria J. Serna,
Jacobo Torán:
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract).
ESA 1993: 145-156 |
| 7 | | Lefteris M. Kirousis,
Maria J. Serna,
Paul G. Spirakis:
Parallel Complexity of the Connected Subgraph Problem.
SIAM J. Comput. 22(3): 573-586 (1993) |
| 1991 |
|---|
| 6 | | Hermann Jung,
Maria J. Serna,
Paul G. Spirakis:
A Parallel Algorithm for Two Processors Precedence Constraint Scheduling.
ICALP 1991: 417-428 |
| 5 | | Maria J. Serna,
Paul G. Spirakis:
Tight RNC Approximations to Max Flow.
STACS 1991: 118-126 |
| 4 | | Maria J. Serna:
Approximating Linear Programming is Log-Space Complete for P.
Inf. Process. Lett. 37(4): 233-236 (1991) |
| 1989 |
|---|
| 3 | | Lefteris M. Kirousis,
Maria J. Serna,
Paul G. Spirakis:
The Parallel Complexity of the Subgraph Connectivity Problem
FOCS 1989: 294-299 |
| 2 | | Maria J. Serna,
Paul G. Spirakis:
The Approximability of Problems Complete for P.
Optimal Algorithms 1989: 193-204 |
| 1 | | Maria J. Serna:
Asymptotical Behaviour of Some Non-Uniform Measures.
ITA 23(3): 281-293 (1989) |
