المؤلفون: Aboulker, Pierre, Bonnet, Édouard^{Aff2, IDs00453022010012_cor2}, Kim, Eun Jung, Sikora, Florian

المصدر: Algorithmica. 85(1):1-28

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ede02e45b3f15e058c198cd457ee474
https://hal.science/hal-04055617

المؤلفون: Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket

المساهمون: Bläser, Markus, Monmege, Benjamin

المصدر: Leibniz International Proceedings in Informatics

مصطلحات موضوعية: Matroids, Diverse solutions, FOS: Computer and information sciences, Theory of computation → Fixed parameter tractability, Fixed-parameter tractable algorithms, General Mathematics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Software

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02b9f5af3742101537b9a5687586e1fc
https://doi.org/10.1007/s10107-023-01959-z

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::973a043bfe623d35edcfd4bd4f144f1e
https://doi.org/10.1007/s00453-022-00960-w

المؤلفون: Bonnet, Édouard, Chakraborty, Dibyayan, Kim, Eun Jung, Köhler, Noleen, Lopes, Raul, Thomassé, Stéphan

المساهمون: 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), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)

المصدر: The International Symposium on Parameterized and Exact Computation (IPEC)
The International Symposium on Parameterized and Exact Computation (IPEC), Sep 2022, Potsdam, Germany

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 05C85, 05C75, Discrete Mathematics (cs.DM), monadic dependence and stability, intersection graphs, visibility graphs, Logic in Computer Science (cs.LO), Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, first-order model checking, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], Combinatorics (math.CO), F.2.2, Computer Science - Discrete Mathematics, Twin-width

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d899c4cb1fbd0a84ca990582c8d44d1
https://hal.science/hal-03956502

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32cb482b0dcc4379c62ba1c24b6d4c19
https://hal.science/hal-03829754

المؤلفون: Galby, Esther, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Tale, Prafullkumar

المصدر: International Symposium on Parameterized and Exact Computation (IPEC 2022)
17th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics

مصطلحات موضوعية: FOS: Computer and information sciences, FPT Algorithms, F.2, Computational Complexity (cs.CC), Informatik [004], Dominating Set, MultiCut with Undeletable Terminals, Chordal Graphs, Computer Science - Computational Complexity, Theory of computation → Fixed parameter tractability, Informatik, Leafage, Multiway Cut with Undeletable Terminals, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 68Q25, 68Q27, ddc:004

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6548a3278e56620ad7210223aa7aee07
https://hdl.handle.net/11420/14451

المؤلفون: Eiben, Eduard, Rambaud, Clément, Wahlström, Magnus

مصطلحات موضوعية: FOS: Computer and information sciences, F.2.2, G.2.2, Parameterized complexity, Theory of computation → Fixed parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), graph separation problems, directed graphs, 68Q27, 68R10

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20f79708995043cea9f89fe594d47fdb
http://arxiv.org/abs/2208.09017

المؤلفون: Bergé, Pierre, Bonnet, Édouard, Déprés, Hugues

المساهمون: 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), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)

المصدر: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022)
49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022), Jul 2022, Paris, France. ⟨10.4230/LIPIcs.ICALP.2022.18⟩

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), 68Q17, Computer Science - Computational Complexity, lower bounds, Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], Combinatorics (math.CO), F.2.2, Computer Science - Discrete Mathematics, Twin-width

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::511eff5f965748618df6eb45c0a351d0
https://hal.science/hal-03750997

المؤلفون: Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Schierreich, Šimon, Suchý, Ondřej, Valla, Tomáš

مصطلحات موضوعية: FOS: Computer and information sciences, Subset TSP, Discrete Mathematics (cs.DM), Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Kernelization, Combinatorics (math.CO), Traveling Salesperson, Waypoint Routing, MathematicsofComputing_DISCRETEMATHEMATICS, Computer Science - Discrete Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::292372ca74bde02958d9f28f802d2b69
http://arxiv.org/abs/2207.01109