Sign In

Login

Password

Forgot Password ? Sign Up

Lista problemelor nerezolvate din informatică (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Lista problemelor nerezolvate din informatică" in Romanian language version.

refsWebsite
Global rank Romanian rank
3doi.org
2nd place
3rd place
3ams.org
451st place
697th place
1web.archive.org
1st place
1st place
1semanticscholar.org
11th place
638th place
1uni-koeln.de
2,455th place
low place

ams.org

  • Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan (), „Clique-width is NP-complete” (PDF), SIAM Journal on Discrete Mathematics, 23 (2), pp. 909–939, doi:10.1137/070687256, MR 2519936, arhivat din original (PDF) la  .
  • Demaine, Erik D.; O'Rourke, Joseph (), „24 Geodesics: Lyusternik–Schnirelmann”, Geometric folding algorithms: Linkages, origami, polyhedra, Cambridge: Cambridge University Press, pp. 372–375, doi:10.1017/CBO9780511735172, ISBN 978-0-521-71522-5, MR 2354878 .
  • Gassner, Elisabeth; Jünger, Michael; Percan, Merijam; Schaefer, Marcus; Schulz, Michael (), „Simultaneous graph embeddings with fixed edges” (PDF), Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers (PDF), Lecture Notes in Computer Science, 4271, Berlin: Springer, pp. 325–335, doi:10.1007/11917496_29, MR 2290741 .

doi.org

  • Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan (), „Clique-width is NP-complete” (PDF), SIAM Journal on Discrete Mathematics, 23 (2), pp. 909–939, doi:10.1137/070687256, MR 2519936, arhivat din original (PDF) la  .
  • Demaine, Erik D.; O'Rourke, Joseph (), „24 Geodesics: Lyusternik–Schnirelmann”, Geometric folding algorithms: Linkages, origami, polyhedra, Cambridge: Cambridge University Press, pp. 372–375, doi:10.1017/CBO9780511735172, ISBN 978-0-521-71522-5, MR 2354878 .
  • Gassner, Elisabeth; Jünger, Michael; Percan, Merijam; Schaefer, Marcus; Schulz, Michael (), „Simultaneous graph embeddings with fixed edges” (PDF), Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers (PDF), Lecture Notes in Computer Science, 4271, Berlin: Springer, pp. 325–335, doi:10.1007/11917496_29, MR 2290741 .

semanticscholar.org

pdfs.semanticscholar.org

  • Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan (), „Clique-width is NP-complete” (PDF), SIAM Journal on Discrete Mathematics, 23 (2), pp. 909–939, doi:10.1137/070687256, MR 2519936, arhivat din original (PDF) la  .

uni-koeln.de

e-archive.informatik.uni-koeln.de

web.archive.org

  • Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan (), „Clique-width is NP-complete” (PDF), SIAM Journal on Discrete Mathematics, 23 (2), pp. 909–939, doi:10.1137/070687256, MR 2519936, arhivat din original (PDF) la  .