نتائج البحث - "fixed-parameter"

المصدر: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 180, 8, [1]-15 (2020). doi:10.4230/LIPICS.IPEC.2020.8 ; 15th International Symposium on Parameterized and Exact Computation : IPEC 2020, December 14-18, 2020, Hong Kong, China (virtual conference) / edited by Yixin Cao, Marcin Pilipczuk ; 15th International Symposium on Parameterized and Exact Computation : IPEC 2020, December 14-18, 2020, Hong Kong, China (virtual conference) / edited by Yixin Cao, Marcin Pilipczuk 15. International Symposium on Parameterized and Exact Computation, IPEC 2020, online, 2020-12-14 - 2020-12-18

مصطلحات موضوعية: H-graphs, Mathematics of computing → Graph theory, Theory of computation → Fixed parameter tractability, fixed-parameter tractability, intersection graphs, recognition

جغرافية الموضوع: DE

العلاقة: https://publications.rwth-aachen.de/record/816205Test; https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-03046%22Test

الإتاحة: https://doi.org/10.4230/LIPICS.IPEC.2020.8Test
https://doi.org/10.18154/RWTH-2021-03046Test
https://publications.rwth-aachen.de/record/816205Test
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-03046%22Test

View record in BASE

4

مؤتمر

Parameterized complexity of quantum knot invariants

المؤلفون: Maria, Clément

المساهمون: 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-20-CE48-0007,AlgoKnot,Aspects algorithmiques et combinatoires de la théorie des nœuds(2020)

المصدر: 37th International Symposium on Computational Geometry (SoCG 2021)
Symposium on Computational Geometry (SoCG)
https://hal.science/hal-02429767Test
Symposium on Computational Geometry (SoCG), Jun 2021, Buffalo (NY), United States. ⟨10.4230/LIPIcs.SoCG.2021.53⟩

مصطلحات موضوعية: computational knot theory, parameterized complexity, quantum invariants, Theory of computation → Fixed parameter tractability, Theory of computation → Computational geometry, Mathematics of computing → Graphs and surfaces, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [MATH.MATH-QA]Mathematics [math]/Quantum Algebra [math.QA]

جغرافية الموضوع: Buffalo (NY), United States

العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/1910.00477; hal-02429767; https://hal.science/hal-02429767Test; https://hal.science/hal-02429767/documentTest; https://hal.science/hal-02429767/file/main.pdfTest; ARXIV: 1910.00477

الإتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2021.53Test
https://hal.science/hal-02429767Test
https://hal.science/hal-02429767/documentTest
https://hal.science/hal-02429767/file/main.pdfTest

View record in BASE

5

مؤتمر

An Investigation of the Recoverable Robust Assignment Problem

المؤلفون: Fischer, Dennis, Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard

المصدر: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, LIPIcs - Leibniz International Proceedings in Informatics 214, 19:1-19:14 (2021). doi:10.4230/LIPIcs.IPEC.2021.19 ; 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) / Herausgeber: Petr A. Golovach, Meirav Zehavi ; 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) / Herausgeber: Petr A. Golovach, Meirav Zehavi 16. International Symposium on Parameterized and Exact Computation, IPEC 2021, Lisbon, Portugal, 2021-09-08 - 2021-09-10

مصطلحات موضوعية: info:eu-repo/classification/ddc/004, Mathematics of computing → Graph theory, RNC, Theory of computation → Fixed parameter tractability, assignment problem, exact matching, fixed paramter tractablity, matchings, robust optimization

جغرافية الموضوع: DE

العلاقة: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-216-7; https://publications.rwth-aachen.de/record/835670Test; https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-10735%22Test

الإتاحة: https://doi.org/10.4230/LIPIcs.IPEC.2021.19Test
https://doi.org/10.18154/RWTH-2021-10735Test
https://publications.rwth-aachen.de/record/835670Test
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-10735%22Test

View record in BASE

6

Sur la largeur des décompositions JSJ compliquées

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

المساهمون: 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), Centre National de la Recherche Scientifique (CNRS), The University of Sydney, Chambers, Erin W., Gudmundsson, Joachim, 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), ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021), ANR-10-LABX-0059,CARMIN,Centers of Hosting and International Mathematical Encounters(2010)

المصدر: Leibniz International Proceedings in Informatics (LIPIcs)
39th International Symposium on Computational Geometry (SoCG 2023)
39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.42:1--42:18, ⟨10.4230/LIPIcs.SoCG.2023.42⟩
Kristóf Huszár

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, F.2.2, G.2.2, generalized Heegaard splittings, 57Q15, 57N10, 05C75, 57M15, Theory of computation → Problems, reductions and completeness, pathwidth, triangulations, Geometric Topology (math.GT), MSC: 57Q15, 57N10, 05C75, 57M15, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Mathematics of computing → Geometric topology, computational 3-manifold topology, Theory of computation → Fixed parameter tractability, 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, JSJ decompositions, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], FOS: Mathematics, treewidth, Computer Science - Computational Geometry