FPT implicit enumeration of active schedules

Συγγραφείς: Tarhan, İstenç ^{a, b, d, ⁎}, Hanen, Claire ^{a, c}, Kordon, Alix Munier ^a, Carlier, Jacques ^b, Jouglet, Antoine ^b

Πηγή: In Discrete Applied Mathematics 15 December 2025 376:235-250

Computing Distances on Graph Associahedra is Fixed-parameter Tractable

Συγγραφείς: Cunha, Luís Felipe I., Sau, Ignasi, Souza, Uéverton S., Valencia-Pabon, Mario

Συνεισφορές: Luís Felipe I. Cunha and Ignasi Sau and Uéverton S. Souza and Mario Valencia-Pabon

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, reconfiguration, Discrete Mathematics (cs.DM), fixed-parameter tractable algorithm, elimination tree, G.2.1, G.2.2, G.2.3, rotation distance, graph associahedra, combinatorial shortest path, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 05C85, 05C10, 0C05, 90C08, 90C27, parameterized complexity, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2504.18338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.63

An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number

Συγγραφείς: Delaney, Colleen, Maria, Clément, Samperton, Eric

Συνεισφορές: Colleen Delaney and Clément Maria and Eric Samperton

Θεματικοί όροι: 3-manifold, quantum invariant, fixed parameter tractable algorithm, topological parameter, Gauss sums, topological quantum field theory

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 332, 41st International Symposium on Computational Geometry (SoCG 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.38

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.SoCG.2025.38
https://nbn-resolving.org/urn:nbn:de:0030-drops-231901
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.38

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines

Συγγραφείς: Hanen, Claire, Munier Kordon, Alix

Συνεισφορές: HANEN, Claire

Πηγή: Journal of Scheduling. 27:119-133

Θεματικοί όροι: Precedence constraints, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Fixed-parameter tractable algorithm, Typed task system

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.science/hal-04229946v1/document
https://doi.org/10.1007/s10951-023-00788-4
https://hal.science/hal-04229946v1

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth

Συγγραφείς: Baste, Julien ^a, Watel, Dimitri ^{b, c, ⁎}

Πηγή: In Theoretical Computer Science 1 April 2024 990

An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number

Συγγραφείς: Delaney, Colleen, Maria, Clément, Samperton, Eric

Συνεισφορές: Colleen Delaney and Clément Maria and Eric Samperton

Θεματικοί όροι: quantum invariant, Computational Geometry (cs.CG), FOS: Computer and information sciences, Gauss sums, topological quantum field theory, Computational Geometry, Geometric Topology (math.GT), fixed parameter tractable algorithm, Quantum Algebra, Geometric Topology, topological parameter, FOS: Mathematics, Quantum Algebra (math.QA), ddc:004, 3-manifold

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.08514
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.38

Parameterized algorithms for min-max multiway cut and list digraph homomorphism

Συγγραφείς: Kim, Eun Jung, Paul, Christophe, Sau Valls, Ignasi, Thilikos, Dimitrios M.

Συνεισφορές: Eun Jung Kim and Christophe Paul and Ignasi Sau and Dimitrios M. Thilikos

Πηγή: Journal of Computer and System Sciences. 86:191-206

Θεματικοί όροι: FOS: Computer and information sciences, 05C85, 68R10, Multiway Cut, Fixed-Parameter Tractable algorithm, Digraph homomorphism, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Parameterized complexity, Principes généraux des mathématiques, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1509.07404
https://ui.adsabs.harvard.edu/abs/2015arXiv150907404K/abstract
https://arxiv.org/pdf/1509.07404
https://dblp.uni-trier.de/db/journals/corr/corr1509.html#KimPST15
https://arxiv.org/abs/1509.07404
https://www.sciencedirect.com/science/article/abs/pii/S002200001730003X
https://www.sciencedirect.com/science/article/pii/S002200001730003X
https://drops.dagstuhl.de/opus/volltexte/2015/5573/
https://dblp.uni-trier.de/db/conf/iwpec/ipec2015.html#0002PST15
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999/document
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.78
https://pergamos.lib.uoa.gr/uoa/dl/object/3063729

From tree-decompositions to clique-width terms

Συγγραφείς: Courcelle, Bruno

Πηγή: In Discrete Applied Mathematics 30 October 2018 248:125-144

Model Checking with Fly-Automata

Συγγραφείς: Courcelle, Bruno^Aff1367, Durand, Iréne^Aff1368

Συνεισφορές: Kao, Ming-Yang, editor^Aff1

Πηγή: Encyclopedia of Algorithms. :1341-1346

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree

Συγγραφείς: Madathil, Jayakrishnan^{Aff1, cor1}, Saurabh, Saket^{Aff1, Aff2, cor2}, Zehavi, Meirav^{Aff3, cor3}

Πηγή: Theory of Computing Systems. :1-39

An FPT 2-Approximation for Tree-cut Decomposition

Συγγραφείς: Sang-il Oum, Dimitrios M. Thilikos, Ignasi Sau, Eun Jung Kim, Christophe Paul

Πηγή: Lecture Notes in Computer Science ISBN: 9783319286839

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.2, F.2.2, Approximation algorithm, Fixed-parameter tractable algorithm, 68R10, 05C85, Tree-cut width, Computer Science - Data Structures and Algorithms, Modèles mathématiques. Algorithmes, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1509.04880
http://arxiv.org/abs/1509.04880
https://link.springer.com/article/10.1007/s00453-016-0245-5
https://hal.archives-ouvertes.fr/hal-01690385/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01225569
https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0245-5.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1509.html#KimOPST15
https://arxiv.org/abs/1509.04880
https://link.springer.com/chapter/10.1007/978-3-319-28684-6_4
https://link.springer.com/chapter/10.1007/978-3-319-28684-6_4/fulltext.html
https://doi.org/10.1007/978-3-319-28684-6_4
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01264015
http://core.ac.uk/display/29571754
https://dblp.uni-trier.de/db/conf/waoa/waoa2015.html#KimOPST15
https://ui.adsabs.harvard.edu/abs/2015arXiv150904880K/abstract
https://arxiv.org/abs/1509.04880
https://arxiv.org/pdf/1509.04880
https://pergamos.lib.uoa.gr/uoa/dl/object/3063675
https://pergamos.lib.uoa.gr/uoa/dl/object/3064058

Finding Branch-Decompositions and Rank-Decompositions

Συγγραφείς: Hlineny, P, Oum, SI Oum, Sang-il

Πηγή: Lecture Notes in Computer Science ISBN: 9783540755197

Θεματικοί όροι: matroid, 0102 computer and information sciences, graph, rank-width, 01 natural sciences, fixed parameter tractable algorithm, clique-width, branch-width

An FPT 2-Approximation for Tree-Cut Decomposition

Συγγραφείς: Kim, Eun Jung, Oum, Sang-Il, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M.

Συνεισφορές: 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), Department of Mathematical Sciences, KAIST, Korea Advanced Institute of Science and Technology (KAIST), Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), ANR-16-CE40-0028,DE-MO-GRAPH,Décomposition de Modèles Graphiques(2016)

Πηγή: ISSN: 0178-4617.

Θεματικοί όροι: tree-cut width, Multiway Cut, Fixed-Parameter Tractable algorithm, Parameterized complexity, approximation algorithm, Digraph homomorphism, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Διαθεσιμότητα: https://hal.science/hal-01690385
https://hal.science/hal-01690385v1/document
https://hal.science/hal-01690385v1/file/2-approx-ctw_Journal_Revision.pdf
https://doi.org/10.1007/s00453-016-0245-5

Parameterized complexity of finding small degree-constrained subgraphs

Συγγραφείς: Omid Amini, Saket Saurabh, Ignasi Sau

Πηγή: Journal of Discrete Algorithms. 10:70-83

Θεματικοί όροι: Degree-constrained subgraph, Treewidth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, 16. Peace & justice, W[1]-hardness, 01 natural sciences, Fixed-parameter tractable algorithm, Theoretical Computer Science, Parameterized complexity, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Excluded minors

Σύνδεσμος πρόσβασης: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00736517
http://www.sciencedirect.com/science/article/pii/S1570866711000529
https://www.sciencedirect.com/science/article/pii/S1570866711000529
http://www.lirmm.fr/~sau/Pubs/ASS11.pdf
http://repository.ias.ac.in/123458/
https://dblp.uni-trier.de/db/journals/jda/jda10.html#AminiSS12

Constrained k-center and movement to independence

Συγγραφείς: Adrian Dumitrescu, Minghui Jiang

Πηγή: Discrete Applied Mathematics. 159:859-865

Θεματικοί όροι: Linear programming, Independent set, Fixed parameter tractable algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Client–server problem, 16. Peace & justice, Approximation algorithm, 01 natural sciences, Computational geometry

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/dam/dam159.html#DumitrescuJ11
http://dblp.uni-trier.de/db/journals/dam/dam159.html#DumitrescuJ11
https://www.sciencedirect.com/science/article/pii/S0166218X11000205
https://www.sciencedirect.com/science/article/abs/pii/S0166218X11000205

Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism

Συγγραφείς: Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M.

Συνεισφορές: 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), Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), Department of Mathematics Athens, National and Kapodistrian University of Athens (NKUA)

Πηγή: IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999 ; IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩

Θεματικοί όροι: Combinatorics, Parameterized complexity, Fixed-Parameter Tractable algorithm, Multi-way Cut, Digraph homomorphism, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Θέμα γεωγραφικό: Patras, Greece

Διαθεσιμότητα: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999v1/file/10.pdf
https://doi.org/10.4230/LIPIcs.IPEC.2015.78

Model Checking with Fly-Automata

Συγγραφείς: Courcelle, Bruno, Durand, Irène

Συνεισφορές: Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Méthodes Formelles, Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Ming-Yang Kao

Πηγή: Encyclopedia of Algorithms, second edition. ; https://hal.archives-ouvertes.fr/hal-01299432 ; Ming-Yang Kao Encyclopedia of Algorithms, second edition., Chapitre 20, 2015, 978-3-642-27848-8. ⟨10.1007/978-3-642-27848-8_692-1⟩

Θεματικοί όροι: Model-checking, monadic second-order logic, tree-width, clique-width, fixed parameter tractable algorithm, automaton on terms, fly-automaton, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Relation: hal-01299432; https://hal.archives-ouvertes.fr/hal-01299432; https://hal.archives-ouvertes.fr/hal-01299432/document; https://hal.archives-ouvertes.fr/hal-01299432/file/BC-IDsurveyEncycloAlgos.pdf

Διαθεσιμότητα: https://hal.archives-ouvertes.fr/hal-01299432
https://hal.archives-ouvertes.fr/hal-01299432/document
https://hal.archives-ouvertes.fr/hal-01299432/file/BC-IDsurveyEncycloAlgos.pdf
https://doi.org/10.1007/978-3-642-27848-8_692-1

A fixed-parameter-tractable algorithm for set packing

Συγγραφείς: Chen Jianer, Zhang Chuan-lin, Jia Weijia

Πηγή: Acta Mathematicae Applicatae Sinica. 17:494-502

Θεματικοί όροι: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, set packing, fixed-parameter-tractable algorithm, Combinatorial aspects of packing and covering, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1719439
https://doi.org/10.1007/bf02669702
https://link.springer.com/article/10.1007/BF02669702
https://link.springer.com/content/pdf/10.1007/BF02669702.pdf

A general method to speed up fixed-parameter-tractable algorithms

Συγγραφείς: Peter Rossmanith, Rolf Niedermeier

Πηγή: Information Processing Letters. 73:125-129

Θεματικοί όροι: time complexity, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, FTP algorithm, 15. Life on land, fixed-parameter-tractable algorithm, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1771749
https://doi.org/10.1016/s0020-0190(00)00004-1

Discrete multi-module capacitated lot-sizing problems with multiple items

Συγγραφείς: Kulkarni, Kartik, Bansal, Manish ^⁎

Πηγή: In Operations Research Letters March 2022 50(2):168-175