المؤلفون: Jansen, Bart M. P., Kozma, László, Nederlof, Jesper

المساهمون: Sub Algorithmic Systems begr. 01/07/2016, Sub Algorithms and Complexity, Algorithms and Complexity

مصطلحات موضوعية: cs.DS, math.CO, Hamiltonian cycle, fixed-parameter tractability, kernelization

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

العلاقة: https://dspace.library.uu.nl/handle/1874/419953Test

الإتاحة: https://dspace.library.uu.nl/handle/1874/419953Test

المؤلفون: Rubinstein, Aviad, Zhao, Junyao

مصطلحات موضوعية: FOS: Computer and information sciences, Fixed-parameter tractability, Computer Science - Data Structures and Algorithms, TheoryofComputation_GENERAL, Data Structures and Algorithms (cs.DS), Theory of computation → Submodular optimization and polymatroids, Submodular optimization, Random-order streaming

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

المؤلفون: Agrawal, Akanksha, Hait, Soumita, Mouawad, Amer E.

مصطلحات موضوعية: FOS: Computer and information sciences, History, Polymers and Plastics, Discrete Mathematics (cs.DM), combinatorial reconfiguration, Computational Complexity (cs.CC), Industrial and Manufacturing Engineering, Token sliding, Computer Science - Computational Complexity, shortest reconfiguration sequence, token jumping, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Theory of computation → Parameterized complexity and exact algorithms, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Business and International Management, Computer Science - Discrete Mathematics

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

المؤلفون: Boehmer, Niclas, Heeger, Klaus, Niedermeier, Rolf

مصطلحات موضوعية: FOS: Computer and information sciences, Theory of computation → W hierarchy, Discrete Mathematics (cs.DM), XP, FPT, Theory of computation → Design and analysis of algorithms, adapting to changing preferences, W[1]-hardness, Theory of computation → Fixed parameter tractability, Theory of computation → Algorithmic game theory, Computer Science - Computer Science and Game Theory, incremental algorithms, Stable Marriage, NP-hardness, master lists, Stable Roommates, Computer Science - Discrete Mathematics, Computer Science and Game Theory (cs.GT)

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

المؤلفون: Gima, Tatsuya, Otachi, Yota

مصطلحات موضوعية: FOS: Computer and information sciences, Mathematics::Logic, vertex integrity, fixed-parameter tractability, Mathematics of computing → Graph algorithms, Computer Science - Data Structures and Algorithms, monadic second-order logic, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), cardinality constraint

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

المؤلفون: Angelini, Patrizio, Bekos, Michael A., Da Lozzo, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra

المساهمون: Artur Czumaj, Qin Xin, Angelini, Patrizio, Bekos, Michael A., DA LOZZO, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra

مصطلحات موضوعية: FOS: Computer and information sciences, Theory of computation → Fixed parameter tractability, Map graphs, Parameterized complexity, Recognition, Mathematics of computing → Graph algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), MathematicsofComputing_DISCRETEMATHEMATICS

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

المؤلفون: Olkowski, Jędrzej, Pilipczuk, Michał, Rychlicki, Mateusz, Węgrzycki, Karol, Zych-Pawlewicz, Anna

المصدر: 40th International Symposium on Theoretical Aspects of Computer Science
Leibniz International Proceedings in Informatics

مصطلحات موضوعية: Edit Distance, FOS: Computer and information sciences, Parameterized algorithms, Dynamic data structures, Theory of computation → Fixed parameter tractability, Theory of computation → Predecessor queries, Predecessor problem, Computer Science - Data Structures and Algorithms, Closest String, String problems, Data Structures and Algorithms (cs.DS), Disjoint Factors

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

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

المؤلفون: Bil��, Davide, Casel, Katrin, Choudhary, Keerti, Cohen, Sarel, Friedrich, Tobias, Lagodzinski, J.A. Gregor, Schirneck, Martin, Wietheger, Simon

مصطلحات موضوعية: FOS: Computer and information sciences, Data structures, Distance preservers, Distance sensitivity oracles, Fault tolerance, Fixed-parameter tractability, K-path, Vertex cover, distance preservers, Theory of computation ��� Fixed parameter tractability, distance sensitivity oracles, k-path, Mathematics of computing ��� Graph algorithms, vertex cover, data structures, Theory of computation ��� Data structures design and analysis, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), fault tolerance

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

المؤلفون: Feldmann, Andreas Emil, Issac, Davis, Rai, Ashutosh

مصطلحات موضوعية: FOS: Computer and information sciences, Theory of computation → Fixed parameter tractability, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, kernelization, Data Structures and Algorithms (cs.DS), Edge Clique Partition

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

المؤلفون: Huszár, Kristóf

المساهمون: Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), ANR-20-CE48-0007,AlgoKnot,Aspects algorithmiques et combinatoires de la théorie des nœuds(2020), This work has been supported by the French government, through the 3IA Côte d'Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002.

المصدر: Computing in Geometry and Topology
Computing in Geometry and Topology, 2022, 1 (1), pp.1:1-1:19. ⟨10.57717/cgt.v1i1.4⟩

مصطلحات موضوعية: complexité paramétrée, Computational Geometry (cs.CG), FOS: Computer and information sciences, topologie algorithmique des 3-variétés, largeur arborescente linéaire, largeur arborescente, G.2.2, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], computational 3-manifold topology, MSC 57Q15, 57N10, 05C75, 57M15, Mathematics - Geometric Topology, divisions de Heegaard généralisées, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], solubilité à paramètre fixé, thick-thin decomposition, treewidth, FOS: Mathematics, F.2.2, volume, generalized Heegaard splittings, hyperbolic 3-manifolds, 3-variétés hyperboliques, 57Q15, 57N10, 05C75, 57M15, pathwidth, Geometric Topology (math.GT), décomposition épaisse-fine, Mathematics::Geometric Topology, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, fixed-parameter tractability, Computer Science - Computational Geometry

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