Výsledky vyhledávání - Fixed-parameter algorithms and complexity*

Parameterized Inapproximability Hypothesis under ETH.

Autoři: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi a další

Zdroj: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-40. 40p.

Témata: COMPUTATIONAL complexity, CONSTRAINT satisfaction, HADAMARD codes

The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems

Autoři: Andreas Emil Feldmann Dániel Marx Andreas Emil Feldmann and Dániel Marx a další

Přispěvatelé: Andreas Emil Feldmann Dániel Marx Andreas Emil Feldmann and Dániel Marx a další

Zdroj: ACM Transactions on Computation Theory. 15:1-28

Témata: FOS: Computer and information sciences, Directed Steiner Tree, fixed-parameter tractability, Directed Steiner Network, Computer Science - Data Structures and Algorithms, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, dichotomy

Popis souboru: application/pdf; text

Přístupová URL adresa: http://arxiv.org/abs/1707.06808
https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#FeldmannM16
http://ui.adsabs.harvard.edu/abs/2017arXiv170706808F/abstract
https://drops.dagstuhl.de/opus/volltexte/2016/6306/
http://export.arxiv.org/pdf/1707.06808
https://arxiv.org/abs/1707.06808
https://arxiv.org/pdf/1707.06808.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.27
https://eprints.sztaki.hu/9354/

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity

Autoři: Tayal, Mumuksh

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2507.09377

Improved kernelization and fixed-parameter algorithms for bicluster editing

Autoři: Manuel Lafond

Zdroj: Journal of Combinatorial Optimization. 47

Témata: graph algorithms, FOS: Computer and information sciences, kernelization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), biclustering, Computer science, parameterized complexity

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2410.13123

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases: complexity, approximation and fixed parameter tractable algorithms, and some special cases

Autoři: Weller, Mathias Chateau, Annie Dallard, Clément a další

Přispěvatelé: Weller, Mathias Chateau, Annie Dallard, Clément a další

Zdroj: Weller, M, Chateau, A, Dallard, C & Giroudeau, R 2018, ' Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases ', Algorithmica, vol. 80 . https://doi.org/10.1007/s00453-018-0405-x

Témata: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, kernel, graph theory, scaffolding, bioinformatics, complexity, lower bound, {ISK4,wheel}-free graph, approximation, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis souboru: application/pdf; text/url

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01833303/file/hal_version.pdf
https://core.ac.uk/display/151190348
https://hal.archives-ouvertes.fr/hal-01833303
https://researchportal.port.ac.uk/en/publications/scaffolding-problems-revisited-complexity-approximation-and-fixed
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#WellerCDG18
https://researchportal.port.ac.uk/portal/files/8690655/algorithmica.pdf
https://hal.archives-ouvertes.fr/hal-01833303/document
https://hal.science/hal-01833303v1
https://hal.science/hal-01833303v1/document
https://doi.org/10.1007/s00453-018-0405-x
https://researchportal.port.ac.uk/portal/en/publications/scaffolding-problems-revisited-complexity-approximation-and-fixed-parameter-tractable-algorithms-and-some-special-cases(e2b21b71-f616-42ba-a3f2-809766b5c645).html
https://repozitorij.upr.si/IzpisGradiva.php?id=12404
https://doi.org/10.1007/s00453-018-0405-x
https://hdl.handle.net/20.500.12556/RUP-12404

Parameterized Complexity of Path Set Packing.

Autoři: Aravind, N. R. Saxena, Roopam

Zdroj: Algorithmica. Dec2025, Vol. 87 Issue 12, p1864-1898. 35p.

Témata: *UNDIRECTED graphs, *COMPUTATIONAL complexity, *APPROXIMATION algorithms, *PARAMETERIZATION, *GRAPH theory

Pairwise rearrangement is fixed-parameter tractable in the Single Cut-and-Join model

Autoři: Lora Bailey Heather Smith Blake Garner Cochran a další

Přispěvatelé: Lora Bailey Heather Smith Blake Garner Cochran a další

Zdroj: Theoretical Computer Science. 1055:115481

Témata: Genomics (q-bio.GN), FOS: Computer and information sciences, Computational Complexity, Genome Rearrangement, Phylogenetics, 92-08, 92D10, 92D20, 68Q17, FOS: Biological sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Quantitative Biology - Genomics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, F.2.2, Single Cut-and-Join

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2402.01942
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.3

Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs

Autoři: Christine Dahn Nils M. Kriege Petra Mutzel a další

Zdroj: Theoretical Computer Science. 852:172-184

Témata: FOS: Computer and information sciences, COMPLEXITY, Fixed-parameter tractable, MAXIMUM CUT, 101011 Graphentheorie, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 102031 Theoretische Informatik, Weighted maximum cut, 101011 Graph theory, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), OPTIMIZATION, 1-planar graphs, APPROXIMATION

Přístupová URL adresa: http://arxiv.org/pdf/1812.03074
http://arxiv.org/abs/1812.03074
https://ui.adsabs.harvard.edu/abs/2018arXiv181203074D/abstract
https://doi.org/10.1016/j.tcs.2020.11.030
https://www.sciencedirect.com/science/article/pii/S0304397520306721
https://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-03074

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut

Autoři: Bentert, Matthias Fomin, Fedor V. Hauser, Fanny a další

Přispěvatelé: Bentert, Matthias Fomin, Fedor V. Hauser, Fanny a další

Témata: Polynomial Kernels, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), XP, Fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, para-NP-Hardness, W[1]-hardness, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2408.13543
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.14

Computing Distances on Graph Associahedra is Fixed-parameter Tractable

Autoři: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. a další

Přispěvatelé: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. a další

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2504.18338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.63

Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns

Autoři: Lassota, Alexandra Ligthart, Koen Alexandra Lassota and Koen Ligthart

Přispěvatelé: Lassota, Alexandra Ligthart, Koen Alexandra Lassota and Koen Ligthart

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Matchings, fixed-parameter Tractability, polyhedral Optimization, ddc:004, Computational Complexity (cs.CC), Integer Programming

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2503.05548
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.112

Parameterized complexity for iterated type partitions and modular-width

Autoři: Cordasco G. Gargano L. Rescigno A. A.

Zdroj: Discrete Applied Mathematics. 350:100-122

Témata: Fixed-parameter tractability, Kernelization algorithms, Modular-width, Neighborhood diversity, Parameterized complexity

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound

Autoři: Lill, Jonas Petrova, Kalina Weber, Simon a další

Přispěvatelé: Lill, Jonas Petrova, Kalina Weber, Simon a další

Zdroj: Algorithmica
Leibniz International Proceedings in Informatics (LIPIcs), 321
19th International Symposium on Parameterized and Exact Computation (IPEC 2024)

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), multigraphs, Multigraphs, Computational Complexity (cs.CC), Edwards-Erdős bound, Fixed-parameter tractability, maximum cut, Poljak-Turzík bound, integer-weighted graphs, Computer Science - Computational Complexity, Edwards-Erd & ouml, s bound, Integer-weighted graphs, Poljak-Turz & iacute, k bound, Computer Science - Data Structures and Algorithms, Maximum cut, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf; application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.01071
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.2
http://hdl.handle.net/20.500.11850/731918
http://hdl.handle.net/20.500.11850/713589

Sparse Integer Programming Is Fixed-Parameter Tractable.

Autoři: Eisenbrand, Friedrich Hunkenschröder, Christoph Klein, Kim-Manuel a další

Zdroj: Mathematics of Operations Research; Aug2025, Vol. 50 Issue 3, p2141-2156, 16p

Témata: INTEGER programming, COMPUTATIONAL complexity, POLYNOMIAL time algorithms, CONVEX functions, INTEGERS, ALGORITHMS

Algorithms and complexity of strongly stable non-crossing matchings.

Autoři: Sachin Panda, B.S.

Zdroj: Discrete Applied Mathematics. Jan2026, Vol. 379, p802-813. 12p.

The Parameterized Complexity of Guarding Almost Convex Polygons

Autoři: Akanksha Agrawal Kristine V. K. Knudsen Daniel Lokshtanov a další

Přispěvatelé: Akanksha Agrawal Kristine V. K. Knudsen Daniel Lokshtanov a další

Zdroj: Leibniz International Proceedings in Informatics
3:1-3:16
Discrete & Computational Geometry

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Art Gallery, 0102 computer and information sciences, Fixed Parameter Tractability, 01 natural sciences, Monotone 2-CSP, Reflex vertices, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, Parameterized Complexity

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2003.07793
https://bora.uib.no/bora-xmlui/handle/11250/2763994
https://drops.dagstuhl.de/opus/volltexte/2020/12161/
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07793
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07793
https://drops.dagstuhl.de/opus/volltexte/2020/12161/pdf/LIPIcs-SoCG-2020-3.pdf/
https://hdl.handle.net/11250/2763994
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.3

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams: Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams

Autoři: Arijit Bishnu Arijit Ghosh Sudeshna Kolay a další

Zdroj: Theory of Computing Systems. 67:1241-1267

Témata: streaming algorithms, Analysis of algorithms and problem complexity, FPT, Combinatorial Optimization and Complexity Theory, Constraint Satisfaction Problems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Algorithmic Applications, 7. Clean energy, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), minor deletion problems, 0202 electrical engineering, electronic engineering, information engineering, Nonnumerical algorithms, Graph Algorithms, Computer science, vertex cover, subgraph deletion problems, Algorithm, Parameterized complexity, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, Fixed-Parameter Algorithms, Computer Science, Physical Sciences, Graph Theory and Algorithms, Parameterized Complexity

Popis souboru: application/xml

A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows

Autoři: Munier Kordon Alix Munier Kordon, Alix

Přispěvatelé: Munier Kordon Alix Munier Kordon, Alix

Zdroj: Discrete Applied Mathematics. 290:1-6

Témata: maximum lateness, 0211 other engineering and technologies, makespan, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, parallel identical machines, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], parameterized complexity

Popis souboru: application/pdf

Přístupová URL adresa: https://www.sciencedirect.com/science/article/am/pii/S0166218X20305126
https://dblp.uni-trier.de/db/journals/dam/dam290.html#Kordon21
https://www.sciencedirect.com/science/article/pii/S0166218X20305126
https://hal.science/hal-03041735v1

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem.

Autoři: Baguley, Samuel Friedrich, Tobias Neumann, Aneta a další

Zdroj: Algorithmica. Apr2025, Vol. 87 Issue 4, p537-571. 35p.

Témata: *LINEAR programming, *ALGORITHMS, *MATHEMATICS, *GENERALIZATION, *EVOLUTIONARY algorithms

An FPT Algorithm for Splitting a Necklace Among Two Thieves.

Autoři: Borzechowski, Michaela Schnider, Patrick Weber, Simon

Zdroj: Algorithmica. Feb2026, Vol. 88 Issue 1, p1-19. 19p.

Témata: *NECKLACES, *COMPUTATIONAL complexity, *PROBLEM solving, *ALGORITHMS