المؤلفون: Elsayed Badr, I. M. Selim, Hoda Mostafa, Hala Attiya

مصطلحات موضوعية: Graph Labeling and Dimension Problems, Computational Theory and Mathematics, Computer Science, Physical Sciences, Optical Code Division Multiple Access, Electrical and Electronic Engineering, FOS Electrical engineering, electronic engineering, information engineering, Engineering, Graph Theory and Algorithms, Parameterized Complexity, Approximation Algorithms, Fixed-Parameter Algorithms, Computational Complexity, Mathematics, FOS Mathematics, Integer programming, Linear programming, Simplex algorithm, Criss-cross algorithm, Branch and cut, Correctness, Branch and price, Linear-fractional programming, Mathematical optimization, Linear programming relaxation, Duality order theory, Time complexity, Algorithm, Discrete mathematics

العلاقة: https://dx.doi.org/10.60692/755fq-71188Test

الإتاحة: https://doi.org/10.60692/fwch4-5wq5610.60692/755fq-71188Test

المؤلفون: Kim, Eun Jung

مصطلحات موضوعية: 004, Fixed-Parameter Tractability, Algorithm, Graph Theory, Constraint Satisfaction Problems, Computational complexity

الوصول الحر: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541502Test

المؤلفون: Castelli, Mauro, Dondi, Riccardo, Mauri, Giancarlo, Zoppis, Italo

المساهمون: NOVA Information Management School (NOVA IMS), Information Management Research Center (MagIC) - NOVA Information Management School, RUN

مصطلحات موضوعية: Approximation algorithms, Computational complexity, Fixed-parameter algorithms, Longest common subsequence, Software

وصف الملف: application/pdf

العلاقة: 9783959770392; PURE: 3236258; http://www.scopus.com/inward/record.url?scp=85027276315&partnerID=8YFLogxKTest

المؤلفون: Dondi, Riccardo

المساهمون: Laxmi Parida, Esko Ukkonen, Dondi, Riccardo, Lafond, Manuel, Scornavacca, Celine

مصطلحات موضوعية: Computational complexity, Fixed-parameter algorithm, Gene trees/species tree reconciliation, Phylogenetic, Software, Settore INF/01 - Informatica

وصف الملف: optical disk

العلاقة: info:eu-repo/semantics/altIdentifier/isbn/9783959770828; ispartofbook:18th International Workshop on Algorithms in Bioinformatics : WABI 2018, August 20–22, 2018, Helsinki, Finland; WABI 2018: 18th International Workshop on Algorithms in Bioinformatics, Helsinki, Finland, 20-22 August 2018; volume:113; issue:art. n. 5; firstpage:1; lastpage:16; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Laxmi Parida; Esko Ukkonen; http://hdl.handle.net/10446/132416Test; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85051353409

الإتاحة: https://doi.org/10.4230/LIPIcs.WABI.2018.5Test
http://hdl.handle.net/10446/132416Test

المؤلفون: Fertin, Guillaume, Fradin, Julien, Komusiewicz, Christian

المساهمون: Guillaume Fertin and Julien Fradin and Christian Komusiewicz

مصطلحات موضوعية: Subgraph problem, computational complexity, algorithms, fixed-parameter tractability, kernelization

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 105, 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018); urn:nbn:de:0030-drops-86939; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.17Test

الإتاحة: https://doi.org/10.4230/LIPIcs.CPM.2018.17Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-86939Test

المؤلفون: Castelli, Mauro, Dondi, Riccardo, Mauri, Giancarlo, Zoppis, Italo

المساهمون: NOVA Information Management School (NOVA IMS), Information Management Research Center (MagIC) - NOVA Information Management School

مصطلحات موضوعية: Approximation algorithms, Computational complexity, Fixed-parameter algorithms, Longest common subsequence, String algorithms, Theoretical Computer Science, Computer Science(all)

العلاقة: info:eu-repo/grantAgreement/FCT/3599-PPCDT/DSAIPA%2FDS%2F0022%2F2018/PT; PURE: 14929015; PURE UUID: 3da44078-74f1-4721-bf40-26b40805817c; Scopus: 85072570657; WOS: 000496338900019; ORCID: /0000-0002-8793-1451/work/72856192; http://www.scopus.com/inward/record.url?scp=85072570657&partnerID=8YFLogxKTest; https://doi.org/10.1016/j.tcs.2019.09.022Test

الإتاحة: https://doi.org/10.1016/j.tcs.2019.09.022Test
http://www.scopus.com/inward/record.url?scp=85072570657&partnerID=8YFLogxKTest

المؤلفون: Castelli, M, Dondi, R, MAURI, GIANCARLO, ZOPPIS, ITALO FRANCESCO

المساهمون: Kärkkäinen, J, Radoszewski, J, Rytter, W, Castelli, M, Dondi, R, Mauri, G, Zoppis, I

مصطلحات موضوعية: Approximation algorithm, Computational complexity, Fixed-parameter algorithm, Longest common subsequence, INF/01 - INFORMATICA

العلاقة: info:eu-repo/semantics/altIdentifier/isbn/9783959770392; ispartofbook:Proceedings CPM 2017 – 28th Annual Symposium on Combinatorial Pattern Matching; 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017; volume:78; firstpage:1; lastpage:14; numberofpages:14; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Kärkkäinen, J; Radoszewski, J; Rytter, W; http://hdl.handle.net/10281/168555Test; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85027276315; http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04Test

الإتاحة: https://doi.org/10.4230/LIPIcs.CPM.2017.14Test
http://hdl.handle.net/10281/168555Test
http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04Test

المؤلفون: Dondi, Riccardo

المساهمون: Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter, Castelli, Mauro, Dondi, Riccardo, Mauri, Giancarlo, Zoppis, Italo

مصطلحات موضوعية: Approximation algorithm, Computational complexity, Fixed-parameter algorithm, Longest common subsequence, Software, Settore INF/01 - Informatica

وصف الملف: remote

العلاقة: info:eu-repo/semantics/altIdentifier/isbn/9783959770392; ispartofbook:28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017); 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017; volume:78; firstpage:1; lastpage:13; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter; http://hdl.handle.net/10446/118352Test; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85027276315

الإتاحة: https://doi.org/10.4230/LIPIcs.CPM.2017.14Test
http://hdl.handle.net/10446/118352Test

المؤلفون: Bulatov, Andrei A., Guruswami, Venkatesan, Krokhin, Andrei

المصدر: Dagstuhl Reports, Volume 5, Issue 7; ISSN 2192-5283

مصطلحات موضوعية: Constraint satisfaction problem (CSP), Computational complexity, CSP dichotomy conjecture, Hardness of approximation, Unique games conjecture, Fixed-parameter tractability, Descriptive complexity, Universal algebra, Logic, Decomposition methods

وصف الملف: application/pdf

الإتاحة: https://doi.org/10.4230/DagRep.5.7.22Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-56714Test
https://drops.dagstuhl.de/opus/volltexte/2016/5671Test/

المؤلفون: Hastad, Johan, Krokhin, Andrei

المصدر: Dagstuhl Reports, Volume 2, Issue 11; ISSN 2192-5283

مصطلحات موضوعية: Constraint satisfaction problem (CSP), Computational complexity, CSP dichotomy conjecture, Hardness of approximation, Unique games conjceture, Fixed-parameter tractability, Descriptive complexity, niversal algebra, Logic, Decomposition methods

وصف الملف: application/pdf

الإتاحة: https://doi.org/10.4230/DagRep.2.11.1Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-39764Test
https://drops.dagstuhl.de/opus/volltexte/2013/3976Test/