Search Results - Fixed-parameter algorithms*

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

Authors: Cornelius Brand Robert Ganian Sebastian Röder et al.

Source: Journal of Graph Algorithms and Applications. 28:131-150

Subject Terms: 0102 computer and information sciences, 01 natural sciences

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs.

Authors: Yamada, Suguru Hanaka, Tesshu

Source: Discrete Applied Mathematics. Oct2025, Vol. 373, p343-354. 12p.

Subject Terms: *REAL numbers, *GRAPH algorithms, *UNDIRECTED graphs, *SPARSE graphs, *INTEGERS, *WEIGHTED graphs

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems

Authors: Ishay Haviv

Source: SIAM Journal on Computing. 53:287-314

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences

Access URL: http://arxiv.org/abs/2204.09009

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond

Authors: Bumpus, Benjamin Merlin Jansen, Bart M. P. Venne, Jaime et al.

Contributors: Bumpus, Benjamin Merlin Jansen, Bart M. P. Venne, Jaime et al.

Subject Terms: certified algorithms, fixed-parameter tractability, ddc:004

File Description: application/pdf

Access URL: https://research.tue.nl/en/publications/33376f2e-73b6-4806-a0fd-fdc39dbf36b9
https://doi.org/10.4230/LIPICS.SWAT.2024.19
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.19

Fixed-Parameter Algorithms for Unsplittable Flow Cover

Authors: Andrés Cristi Mathieu Mari Andreas Wiese et al.

Contributors: Andrés Cristi Mathieu Mari Andreas Wiese et al.

Source: Theory of Computing Systems. 67:89-124

Subject Terms: Unsplittable Flow Cover, fixed parameter algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, [INFO] Computer Science [cs], approximation algorithms, 01 natural sciences, approximation al- gorithms

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2020/11903/pdf/LIPIcs-STACS-2020-42.pdf
https://hal.science/hal-03587595v1
https://doi.org/10.4230/lipics.stacs.2020.42
https://hal.science/hal-03587595v1/document
https://link.springer.com/article/10.1007/s00224-021-10048-7
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F07d0abbe-3029-4af0-b7a5-5e4c427cbe08
https://research.vu.nl/en/publications/fixed-parameter-algorithms-for-unsplittable-flow-cover
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.42

Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements

Authors: Remi Raman Shahin John J S R. Subashini et al.

Source: International Journal of Computer Mathematics: Computer Systems Theory. 9:131-138

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

Authors: Baguley, Samuel Friedrich, Tobias Neumann, Aneta et al.

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

Subject Terms: *LINEAR programming, *ALGORITHMS, *MATHEMATICS, *GENERALIZATION, *EVOLUTIONARY algorithms

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

Authors: Christine Dahn Nils M. Kriege Petra Mutzel et al.

Source: Theoretical Computer Science. 852:172-184

Subject Terms: 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

Access URL: 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

Improved kernelization and fixed-parameter algorithms for bicluster editing

Authors: Manuel Lafond

Source: Journal of Combinatorial Optimization. 47

Subject Terms: 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

File Description: application/xml

Access URL: http://arxiv.org/abs/2410.13123

Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants

Authors: Banerjee, Sandip Bartal, Yair Gottlieb, Lee-Ad et al.

Source: Proceedings of the AAAI Conference on Artificial Intelligence. 39:15481-15488

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2501.17708

Fixed-parameter algorithms for Fair Hitting Set problems

Authors: Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu et al.

Contributors: Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu et al.

Source: Information and Computation. 302:105261

Subject Terms: FOS: Computer and information sciences, Fairness, Parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Hitting Set

File Description: application/pdf

Access URL: http://arxiv.org/abs/2307.08854
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.55

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

Authors: Samuel Baguley Tobias Friedrich Aneta Neumann et al.

Source: Proceedings of the Genetic and Evolutionary Computation Conference. :1537-1545

Subject Terms: FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/abs/2303.11281

Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs

Authors: Guo, Mingyu Li, Jialiang Neumann, Aneta et al.

Source: Proceedings of the AAAI Conference on Artificial Intelligence. 36:9360-9367

Subject Terms: FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Computer Science and Game Theory, Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences, Computer Science and Game Theory (cs.GT)

Access URL: http://arxiv.org/abs/2112.13175

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

Authors: Cornelius Brand Robert Ganian Sebastian Röder et al.

Source: Lecture Notes in Computer Science ISBN: 9783031492747

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2308.10600

Criterion and Methodology Selecting Fixed Parameters of Algorithms for Tracking Aerial Objects

Authors: Volodymyr Karlov Andrii Kovalchuk Mykola Barkhudaryan et al.

Source: 2022 IEEE 41st International Conference on Electronics and Nanotechnology (ELNANO). :716-720

Fixed-parameter tractable algorithms for Tracking Shortest Paths

Authors: Aritra Banik Pratibha Choudhary Venkatesh Raman et al.

Source: Theoretical Computer Science. 846:1-13

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/pdf/2001.08977
http://arxiv.org/abs/2001.08977
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002290799526426
https://ui.adsabs.harvard.edu/abs/2020arXiv200108977B/abstract
https://www.sciencedirect.com/science/article/abs/pii/S0304397520305053
http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977
https://doi.org/10.1016/j.tcs.2020.09.006
https://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977

Computing Distances on Graph Associahedra is Fixed-parameter Tractable

Authors: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. et al.

Contributors: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. et al.

Subject Terms: 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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.18338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.63

The Belachhab Framework: From Fixed Parameters to Adaptive Algorithms in Generalized Collatz Theory

Authors: Belachhab, Amine

Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing

Authors: Lafond, Manuel

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2410.13123

The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems

Authors: Andreas Emil Feldmann Dániel Marx Andreas Emil Feldmann and Dániel Marx et al.

Contributors: Andreas Emil Feldmann Dániel Marx Andreas Emil Feldmann and Dániel Marx et al.

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

Subject Terms: 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

File Description: application/pdf; text

Access URL: 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/