( en | de | ru )

 

Disambiguation of "Serna, Maria J."

Author of the publication

copydeleteadd this publication to your clipboard
The Approximability of Problems Complete for P.

, and . Optimal Algorithms, volume 401 of Lecture Notes in Computer Science, page 193-204. Springer, (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

María-Trinidad Serna-Encinas

Andrés Serna

Angel Serna

Gerda Sernau

Alexandra Serna

 

Other publications of authors with the same name

Network Formation for Asymmetric Players and Bilateral Contracting., , and . Theory Comput. Syst., 59 (3): 397-415 (2016)On the Existence of Nash Equilibria in Strategic Search Games., , , and . TGC, volume 7173 of Lecture Notes in Computer Science, page 58-72. Springer, (2011)Bisection of Random Cubic Graphs., , , and . RANDOM, volume 2483 of Lecture Notes in Computer Science, page 114-125. Springer, (2002)Data-Compression for Parametrized Counting Problems on Sparse Graphs., , and . ISAAC, volume 123 of LIPIcs, page 20:1-20:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Forms of representation for simple games: Sizes, conversions and equivalences., , and . Math. Soc. Sci., (2015)The Parallel Approximability of the False and True Gates Problems for NOR-Circuits., and . Parallel Process. Lett., 12 (1): 127-136 (2002)Faulty Random Geometric Networks., , and . Parallel Process. Lett., 10 (4): 343-358 (2000)Asymptotical Behaviour of Some Non-Uniform Measures.. RAIRO Theor. Informatics Appl., 23 (3): 281-293 (1989)Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems., , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (1997)On the Random Generation and Counting of Matchings in Dense Graphs., , and . Theor. Comput. Sci., 201 (1-2): 281-290 (1998)