المؤلفون: Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

المصدر: Operations Research Letters. 50(3):370-375

مصطلحات موضوعية: Applied Mathematics, Fixed-parameter tractability, Robust recoverable optimization, Management Science and Operations Research, Industrial and Manufacturing Engineering, Software, Matroid

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68fb1929b28f93b21687e682d4759e9dTest
http://hdl.handle.net/2433/279147Test

المؤلفون: Kobayashi, Yasuaki, Otachi, Yota

المصدر: Algorithmica. 84:2379-2393

مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, fixed-parameter tractability, Mathematics of computing → Graph algorithms, Applied Mathematics, Computer Science - Data Structures and Algorithms, Graph burning, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), parameterized complexity, Computer Science Applications

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71558a9ef79d8bf93a9e536893d2746eTest
https://doi.org/10.1007/s00453-022-00962-8Test

المؤلفون: Garlet Milani, Marcelo

المصدر: Algorithmica. 84:2358-2378

مصطلحات موضوعية: FOS: Computer and information sciences, funnels, General Computer Science, parameterized algorithm, Applied Mathematics, 510 Mathematik, kernels, Computer Science Applications, Theory of computation → Fixed parameter tractability, Computer Science - Data Structures and Algorithms, directed feedback arc set, graph editing, Data Structures and Algorithms (cs.DS), ddc:510

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::973a043bfe623d35edcfd4bd4f144f1eTest
https://doi.org/10.1007/s00453-022-00960-wTest

المؤلفون: Donkers, Huib, Jansen, Bart M. P., Włodarczyk, Michał

المساهمون: Algorithms, Golovach, Petr A., Zehavi, Meirav

المصدر: Algorithmica, 84(11), 3407-3458. Springer
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021

مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, Mathematics of computing ��� Graphs and surfaces, Outerplanar graphs, Mathematics of computing → Graph algorithms, Applied Mathematics, Theory of computation ��� Graph algorithms analysis, Mathematics of computing ��� Graph algorithms, Mathematics of computing → Graphs and surfaces, Computer Science Applications, Theory of computation → Graph algorithms analysis, Fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Theory of computation ��� Parameterized complexity and exact algorithms, Kernelization

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::574791961fab792440da5735d78b9f90Test
https://research.tue.nl/nl/publications/037a5637-ffbf-478d-8d21-5ac08bbf35a2Test

المؤلفون: 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

المؤلفون: 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

المؤلفون: Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh

المصدر: Algorithmica, 84(4)

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), General Computer Science, Applied Mathematics, Populations and Evolution (q-bio.PE), Fixed-parameter algorithms, Computer Science Applications, Phylogenetic networks, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Quantitative Biology::Populations and Evolution, Combinatorics (math.CO), Quantitative Biology - Populations and Evolution, Hybridization number, 92D15 05C90 05C85 56R10, Computer Science - Discrete Mathematics

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b67a80e5be6fd1c4d01c9c0a5a2c2c6Test
http://resolver.tudelft.nl/uuid:70e72477-d616-4b6f-a275-f16df603453bTest

المؤلفون: 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

المؤلفون: Balagopal Komarath, Anurag Pandey, C. S. Rahul

مصطلحات موضوعية: Algebraic complexity, General Computer Science, Applied Mathematics, Fixed-parameter algorithms and complexity, Treewidth, Graph homomorphisms, Mathematics of computing → Graph algorithms, Fine-grained complexity, Algebraic circuits, Homomorphism polynomials, Pathwidth, Computer Science::Computational Complexity, Monotone complexity, Computer Science Applications, Treedepth, Algebraic branching programs, Algebraic formulas, Theory of computation → Parameterized complexity and exact algorithms, Graph algorithms, Theory of computation → Algebraic complexity theory, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28b19a84c511082ce0cdb9e07bf44320Test

المؤلفون: Olivier Boes, Leo van Iersel, Leen Stougie, Steven Kelk, Georgios Stamoulis

المساهمون: Econometrics and Operations Research, Tinbergen Institute, Amsterdam Business Research Institute, DKE Scientific staff, RS: FSE DACS BMI, RS: FSE DACS NSO, RS: FSE DACS, Delft Institute of Applied Mathematics (TWA), Faculty of Electrical Engineering, Mathematics and Computer Science [Delft] (EEMCS)-Delft University of Technology (TU Delft), Department of data science and Knowledge Engineering [Maastricht], Maastricht University [Maastricht], 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)

المصدر: van Iersel, L, Kelk, S, Stamoulis, G, Stougie, L & Boes, O 2018, ' On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems ', Algorithmica, vol. 80, no. 11, pp. 2993-3022 . https://doi.org/10.1007/s00453-017-0366-5Test
Algorithmica, 80, 2993-3022
Algorithmica
Algorithmica, 80(11), 2993-3022. Springer New York
CoRR abs
Algorithmica, 80(11), 2993-3022. Springer Verlag
Algorithmica, 2018, 64 (4), pp.621-637. ⟨10.1093/sysbio/syv020⟩

مصطلحات موضوعية: 0301 basic medicine, FOS: Computer and information sciences, General Computer Science, 0102 computer and information sciences, 01 natural sciences, Article, MAXIMUM AGREEMENT FOREST, Set (abstract data type), Combinatorics, EVENTS, APX-hardness, 03 medical and health sciences, Phylogenetic networks, Computer Science::Discrete Mathematics, Computer Science - Data Structures and Algorithms, Quantitative Biology::Populations and Evolution, Fixedparametertractability, Data Structures and Algorithms (cs.DS), Mathematics, Discrete mathematics, Binary tree, Phylogenetic tree, FIXED-PARAMETER ALGORITHMS, Applied Mathematics, Phylogenetic network, Binary trees, Computer Science Applications, NP-completeness, 030104 developmental biology, 010201 computation theory & mathematics, Binarytrees, Kernelization, Theory of computation, Fixed parameter tractability, TREES, Tree (set theory), Split, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], HYBRIDIZATION NUMBER, APPROXIMATION

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28ce127bae00be2581db634e16338bf3Test
https://doi.org/10.1007/s00453-017-0366-5Test