Maria J. Serna - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Web Services and ::::Incerta Spiriti::::: A Game Theoretic Approach to UncertaintyJoaquim Gabarró, Maria J. Serna, Alan Stewart. ecsqaru 2011: 651-662 [doi]

Computational models for networks of tiny artifacts: A surveyCarme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, Paul G. Spirakis. csr, 5(1):7-25, 2011. [doi]

2010

Stressed Web Environments as Strategic Games: Risk Profiles and WeltanschauungJoaquim Gabarró, Peter Kilpatrick, Maria J. Serna, Alan Stewart. tgc 2010: 189-204 [doi]

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. ProceedingsMaria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim, editors, Volume 6302 of Lecture Notes in Computer Science, Springer, 2010. [doi]

2009

2008

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

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

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

On the Complexity of Equilibria Problems in Angel-Daemon GamesJoaquim Gabarró, Alina García, Maria J. Serna. cocoon 2008: 31-40 [doi]

Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programmingMaria J. Serna, Fatos Xhafa. ita, 42(2):237-252, 2008. [doi]

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

2007

Vertex fusion under diameter constraintsMarc Comas, Maria J. Serna. endm, 29:261-265, 2007. [doi]

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

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

On the Complexity of Game IsomorphismJoaquim Gabarró, Alina García, Maria J. Serna. mfcs 2007: 559-571 [doi]

A Hyper-Heuristic for Scheduling Independent Jobs in Computational GridsJuan Antonio Gonzalez, Maria J. Serna, Fatos Xhafa. ICSOFT 2007: 128-135

Random Models for Geometric Graphs (Abstract)Maria J. Serna. wea 2007: 37 [doi]

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

2006

Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, ProceedingsCarme Àlvarez, Maria J. Serna, editors, Volume 4007 of Lecture Notes in Computer Science, Springer, 2006.

2005

Adversarial Queueing Model for Continuous Network DynamicsMaria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna. mfcs 2005: 144-155 [doi]

Connectivity for Wireless Agents Moving on a Cycle or GridJosep Díaz-Giménez, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald. STACS 2005: 353-364 [doi]

The restrictive ::::H::::-coloring problemJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. DAM, 145(2):297-305, 2005. [doi]

The chromatic and clique numbers of random scaled sector graphsJosep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis. TCS, 349(1):40-51, 2005. [doi]

The approximability of non-Boolean satisfiability problems and restricted integer programmingMaria J. Serna, Luca Trevisan, Fatos Xhafa. TCS, 332(1-3):123-139, 2005. [doi]

Parameterized Complexity for Graph Layout ProblemsMaria J. Serna, Dimitrios M. Thilikos. eatcs, 86:41-65, 2005.

Cutwidth II: Algorithms for partial w-trees of bounded degreeDimitrios M. Thilikos, Maria J. Serna, Hans Leo Bodlaender. jal, 56(1):25-49, 2005. [doi]

Cutwidth I: A linear time fixed parameter algorithmDimitrios M. Thilikos, Maria J. Serna, Hans Leo Bodlaender. jal, 56(1):1-24, 2005. [doi]

Pure Nash Equilibria in Games with a Large Number of ActionsCarme Àlvarez, Joaquim Gabarró, Maria J. Serna. mfcs 2005: 95-106 [doi]

Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, Carme Àlvarez, Joaquim Gabarró, Maria J. Serna. isaac 2005: 634-643 [doi]

Pure Nash equilibria in games with a large number of actionsCarme Àlvarez, Joaquim Gabarró, Maria J. Serna. eccc, (031), 2005. [doi]

Adversarial models for priority-based networksCarme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández. networks, 45(1):23-35, 2005. [doi]

2004

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

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

The Impact of Failure Management on the Stability of Communication NetworksCarme Àlvarez, Maria J. Blesa, Maria J. Serna. icpads 2004: 153-160 [doi]

A Characterization of Universal Stability in the Adversarial Queuing ModelCarme Àlvarez, Maria J. Blesa, Maria J. Serna. siamcomp, 34(1):41-66, 2004. [doi]

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

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

The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract)Carme Àlvarez, Maria J. Serna. endm, 17:23-28, 2004. [doi]

2003

2002

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

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

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

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

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

The Parallel Approximability of the False and True Gates Problems for NOR-CircuitsMaria J. Serna, Fatos Xhafa. ppl, 12(1):127-136, 2002. [doi]

Universal stability of undirected graphs in the adversarial queueing modelCarme Àlvarez, Maria J. Blesa, Maria J. Serna. spaa 2002: 183-197 [doi]

2001

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

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

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

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

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

On the parallel approximability of a subclass of quadratic programmingMaria J. Serna, Fatos Xhafa. TCS, 259(1-2):217-231, 2001. [doi]

Towards Formally Refining BSP Barrier s into Explicit Two-Sided CommunicationsAlan Stewart, Maurice Clint, Joaquim Gabarró, Maria J. Serna. europar 2001: 549-559 [doi]

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small TreewidthDimitrios M. Thilikos, Maria J. Serna, Hans Leo Bodlaender. esa 2001: 380-390 [doi]

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

2000

1999

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

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

On the Average Case Complexity of Some P-complete ProblemsMaria J. Serna, Fatos Xhafa. ita, 33(1):33-46, 1999.

1998

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

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

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

Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM 98, Barcelona, Spain, October 8-10, 1998, ProceedingsMichael Luby, José D. P. Rolim, Maria J. Serna, editors, Volume 1518 of Lecture Notes in Computer Science, Springer, 1998.

The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer ProgrammingMaria J. Serna, Luca Trevisan, Fatos Xhafa. STACS 1998: 488-498

1997

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

Approximating Scheduling Problems in ParallelMaria J. Serna, Fatos Xhafa. europar 1997: 440-449

The Parallel Approximability of a Subclass of Quadratic ProgrammingMaria J. Serna, Fatos Xhafa. icpads 1997: 474 [doi]

1996

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

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

1995

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

Rational Processes and Linear Systems in CSPJoaquim Gabarró, Maria J. Serna. FUIN, 24(3):283-302, 1995.

On Parallel versus Sequential ApproximationMaria J. Serna, Fatos Xhafa. esa 1995: 409-419

1993

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

Parallel Complexity of the Connected Subgraph ProblemLefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis. siamcomp, 22(3):573-586, 1993.

1991

A Parallel Algorithm for Two Processors Precedence Constraint SchedulingHermann Jung, Maria J. Serna, Paul G. Spirakis. icalp 1991: 417-428

Approximating Linear Programming is Log-Space Complete for PMaria J. Serna. ipl, 37(4):233-236, 1991.

Tight RNC Approximations to Max FlowMaria J. Serna, Paul G. Spirakis. STACS 1991: 118-126

1989

The Parallel Complexity of the Subgraph Connectivity ProblemLefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis. focs 1989: 294-299

Asymptotical Behaviour of Some Non-Uniform MeasuresMaria J. Serna. ita, 23(3):281-293, 1989.

The Approximability of Problems Complete for PMaria J. Serna, Paul G. Spirakis. oa 1989: 193-204