-
1كتاب
المؤلفون: Bodlaender, Hans L., Kolay, Sudeshna, Pieterse, Astrid
المساهمون: Sub Algorithms and Complexity, Algorithms and Complexity, Friggstad, Zachary, Salavatipour, Mohammad R., Sack, Jörg-Rüdiger
مصطلحات موضوعية: Combinatorial bounds, Conflict-free coloring, Fixed-parameter tractability, Kernelization, Taverne, Theoretical Computer Science, General Computer Science
وصف الملف: application/pdf
-
2دورية أكاديمية
المؤلفون: 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 -
3
المؤلفون: Bartier, Valentin, Bousquet, Nicolas, Mouawad, Amer E.
المساهمون: Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Graphes, AlgOrithmes et AppLications (GOAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science and Mathematics [Lebanese American University] (CSM/SAS/LAU), Lebanese American University (LAU), ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018)
المصدر: European Symposium on Algorithms
European Symposium on Algorithms, Sep 2022, Potsdam, Germany. ⟨10.4230/LIPIcs.ESA.2022.15⟩مصطلحات موضوعية: FOS: Computer and information sciences, History, Polymers and Plastics, General Computer Science, Discrete Mathematics (cs.DM), Computer Networks and Communications, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Computational Complexity (cs.CC), Industrial and Manufacturing Engineering, Theoretical Computer Science, Theory of computation → Fixed parameter tractability, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Business and International Management, parameterized complexity, Theory of computation → W hierarchy, reconfiguration, galactic reconfiguration, Applied Mathematics, token sliding, Computer Science - Computational Complexity, independent set, Computational Theory and Mathematics, Combinatorics (math.CO), sparse graphs, MathematicsofComputing_DISCRETEMATHEMATICS, Computer Science - Discrete Mathematics
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32cb482b0dcc4379c62ba1c24b6d4c19Test
https://hal.science/hal-03829754Test -
4
المؤلفون: Erlebach, Thomas, Spooner, Jakob T.
المساهمون: Aspnes, James, Michail, Othon
المصدر: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Virtual Conference, 28-30 March 2022 [Conference proceedings]
Journal of Computer and System Sciences, 2023, Vol.135, pp.73-88 [Peer Reviewed Journal]مصطلحات موضوعية: FOS: Computer and information sciences, F.2.2, G.2.2, Temporal graphs, General Computer Science, Computer Networks and Communications, Applied Mathematics, Theoretical Computer Science, Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, Computational Theory and Mathematics, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 05C85, MathematicsofComputing_DISCRETEMATHEMATICS, parameterized complexity
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51becba1dfca6bddd8708bb15b099c64Test
-
5
المصدر: SSRN Electronic Journal.
مصطلحات موضوعية: Theory of computation → Fixed parameter tractability, History, Perfectly Matched Sets, Interval Graphs, General Computer Science, Polymers and Plastics, d-degenerate graphs, Apex-minor-free graphs, Planar graphs, Business and International Management, Industrial and Manufacturing Engineering, Theoretical Computer Science, Parameterized Complexity
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21efaf48a4c386415d4e02fcb80bbbe4Test
https://doi.org/10.2139/ssrn.4289703Test -
6
المؤلفون: Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
المصدر: SSRN Electronic Journal.
مصطلحات موضوعية: FOS: Computer and information sciences, Grid Recognition, Computational Theory and Mathematics, General Computer Science, Computer Networks and Communications, Applied Mathematics, Computer Science - Data Structures and Algorithms, Theory of computation ��� Fixed parameter tractability, Data Structures and Algorithms (cs.DS), Grid Graph, Mathematics of computing ��� Graph algorithms, Theoretical Computer Science, Parameterized Complexity
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a599a1a2a9c79b7fc76e6348da9732d1Test
https://doi.org/10.2139/ssrn.4244667Test -
7
المؤلفون: Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira
المساهمون: Graduate School of Information Sciences [Sendaï], Tohoku University [Sendai], TU Dortmund, Fakultät für Mathematik, Fakultät für Mathematik [Dortmund], Research Institute for Mathematical Sciences, Kyoto University, Japan, Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)
المصدر: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020
15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Dec 2020, Hong-Kong, China. ⟨10.4230/LIPIcs.IPEC.2020.15⟩مصطلحات موضوعية: FOS: Computer and information sciences, Theory of computation → Fixed parameter tractability, General Computer Science, Combinatorial Reconfiguration, Mathematics of computing → Graph algorithms, Computer Science - Data Structures and Algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), Computer Science::Computational Complexity, Fixed Parameter Tractability, Nondeterministic Constraint Logic, Theoretical Computer Science, MathematicsofComputing_DISCRETEMATHEMATICS
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2027833a115ce99ee14f92d986bd555Test
https://hal.archives-ouvertes.fr/hal-03089890Test -
8
المؤلفون: Leen Stougie, Mark Jones, Steven Kelk
المساهمون: Operations Analytics, Tinbergen Institute, Amsterdam Business Research Institute, Delft Institute of Applied Mathematics (DIAM), Delft University of Technology (TU Delft), Centrum Wiskunde & Informatica (CWI), Vrije Universiteit Amsterdam [Amsterdam] (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Dept. of Advanced Computing Sciences, RS: FSE DACS, RS: FSE DACS Mathematics Centre Maastricht, Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands, Department of Data Science and Knowledge Engineering (DKE), Maastricht University
المصدر: Journal of Computer and System Sciences, 117, 165-181. Elsevier
Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2021, 117, pp.165-181. ⟨10.1016/j.jcss.2020.10.003⟩
Journal of Computer and System Sciences, 117
Journal of Computer and System Sciences, 117, 165-181. Academic Press Inc.
Jones, M, Kelk, S & Stougie, L 2021, ' Maximum parsimony distance on phylogenetic trees : A linear kernel and constant factor approximation algorithm ', Journal of Computer and System Sciences, vol. 117, pp. 165-181 . https://doi.org/10.1016/j.jcss.2020.10.003Test
Journal of Computer and System Sciences, 117, 165-181
Journal of Computer and System Sciences, 2021, 117, pp.165-181. ⟨10.1016/j.jcss.2020.10.003⟩مصطلحات موضوعية: Maximum agreement forest, Computer Networks and Communications, [SDV]Life Sciences [q-bio], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Combinatorics, Reduction (complexity), 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], AGREEMENT FOREST, Mathematics, Linear function (calculus), COMPLEXITY, Applied Mathematics, Approximation algorithm, Function (mathematics), COMPATIBILITY, Maximum parsimony, Treewidth, Phylogenetics, Computational Theory and Mathematics, 010201 computation theory & mathematics, Kernel (statistics), Bounded function, Fixed parameter tractability, MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::677f9b51e4e2d56f977cbdc9757ff034Test
https://research.vu.nl/en/publications/0522f5f0-ab66-4220-84ab-f66b5b6df576Test -
9
المؤلفون: Riccardo Dondi, Italo Zoppis, Giancarlo Mauri, Mauro Castelli
المساهمون: NOVA Information Management School (NOVA IMS), NOVA IMS Research and Development Center (MagIC), Information Management Research Center (MagIC) - NOVA Information Management School, Castelli, M, Dondi, R, Mauri, G, Zoppis, I
المصدر: Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAPمصطلحات موضوعية: String algorithms, General Computer Science, Computational complexity theory, Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, Fixed-parameter algorithms, 01 natural sciences, ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, String algorithm, Theoretical Computer Science, Approximation algorithms, Computational complexity, Longest common subsequence, Combinatorics, Longest common subsequence problem, Subsequence, 0202 electrical engineering, electronic engineering, information engineering, Time complexity, Mathematics, Multiset, Sequence, Settore INF/01 - Informatica, Approximation algorithm, INF/01 - INFORMATICA, 010201 computation theory & mathematics, Fixed-parameter algorithm, 020201 artificial intelligence & image processing, Computer Science(all)
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0664c00e5a56b99900cf2b2228e95575Test
http://www.scopus.com/inward/record.url?scp=85072570657&partnerID=8YFLogxKTest -
10
المؤلفون: Max Bannach, Till Tantau
المصدر: Algorithms, Vol 14, Iss 96, p 96 (2021)
Algorithms
Volume 14
Issue 3مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, lcsh:T55.4-60.8, Computer science, Parameterized complexity, Color-coding, 0102 computer and information sciences, Computational Complexity (cs.CC), Descriptive complexity theory, 01 natural sciences, lcsh:QA75.5-76.95, Theoretical Computer Science, color coding, Simple (abstract algebra), Quantifier elimination, lcsh:Industrial engineering. Management engineering, 0101 mathematics, Numerical Analysis, 000 Computer science, knowledge, general works, 010102 general mathematics, para-AC0, Logic in Computer Science (cs.LO), descriptive complexity, Computational Mathematics, Transfer (group theory), Computer Science - Computational Complexity, Computational Theory and Mathematics, quantifier elimination, 010201 computation theory & mathematics, fixed-parameter tractability, Path (graph theory), Computer Science, Embedding, lcsh:Electronic computers. Computer science
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73762f924b9e8fa61a68e19c307c665aTest
https://www.mdpi.com/1999-4893/14/3/96Test
النص الكامل