Suchergebnisse - "Fixed-parameter algorithms"

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

Autoren: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi et al.

Schlagwörter: Applied Mathematics, Mathematical Sciences, Fixed-parameter algorithms and complexity, Hardness of approximations, PCP theorems

Zugangs-URL: https://escholarship.org/uc/item/1j64r6k1

Elimination Distance to Dominated Clusters

Autoren: Schirrmacher, Nicole Siebertz, Sebastian Vigny, Alexandre et al.

Weitere Verfasser: Schirrmacher, Nicole Siebertz, Sebastian Vigny, Alexandre et al.

Schlagwörter: Graph theory, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Elimination distance, Discrete Mathematics, ddc:004, Fixed-parameter algorithms, Dominated cluster

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2504.21675
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.90

Fractional domination and fractional total domination on Cayley digraphs of transformation semigroups with fixed sets

Autoren: Nuttawoot Nupo Chollawat Pookpıenlert

Quelle: AIMS Mathematics, Vol 9, Iss 6, Pp 14558-14573 (2024)

Schlagwörter: Combinatorics on Words, transformation semigroup with fixed set, Automata Theory and Formal Languages, Semigroup, Domination analysis, 0102 computer and information sciences, Limits and Structures in Graph Theory, Hypergraphs, 01 natural sciences, Biochemistry, Gene, Cayley graph, Graph, fractional total dominating function, cayley digraph, QA1-939, FOS: Mathematics, Discrete Mathematics and Combinatorics, 0101 mathematics, fractional domination number, Fractional calculus, Pure mathematics, fractional total domination number, Applied mathematics, 16. Peace & justice, Vertex (graph theory), fractional dominating function, Chemistry, Computational Theory and Mathematics, Combinatorics, Graph Theory, Fixed-Parameter Algorithms, Computer Science, Physical Sciences, Transformation (genetics), Semigroups, Mathematics, Graph Theory and Algorithms

Zugangs-URL: https://doaj.org/article/80909ce6f2134a988cb0c27077a5aaff

Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems

Autoren: Kobayashi, Yusuke Lin, Bingkai Yusuke Kobayashi and Bingkai Lin

Weitere Verfasser: Kobayashi, Yusuke Lin, Bingkai Yusuke Kobayashi and Bingkai Lin

Schlagwörter: Pinwheel Scheduling, Polynomial-time Solvability, Packing and Covering, Fixed Parameter Algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.47

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ISAAC.2025.47
https://nbn-resolving.org/urn:nbn:de:0030-drops-249558
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.47

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

Autoren: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon et al.

Weitere Verfasser: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon et al.

Quelle: Algorithmica. 85:2554-2579

Schlagwörter: Algebraic complexity, Fixed-parameter algorithms and complexity, Treewidth, Graph homomorphisms, Fine-grained complexity, Algebraic circuits, Homomorphism polynomials, Pathwidth, Monotone complexity, Treedepth, Algebraic branching programs, Algebraic formulas, ddc:004, Graph algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

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

Autoren: Arijit Bishnu Arijit Ghosh Sudeshna Kolay et al.

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Twin-Width Meets Feedback Edges and Vertex Integrity

Autoren: Balabán, Jakub Ganian, Robert Rocton, Mathis et al.

Weitere Verfasser: Balabán, Jakub Ganian, Robert Rocton, Mathis et al.

Schlagwörter: feedback edge number, FOS: Computer and information sciences, fixed-parameter algorithms, vertex integrity, Computer Science - Data Structures and Algorithms, twin-width, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2407.15514
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.3

Measuring what matters: A hybrid approach to dynamic programming with treewidth

Autoren: Eiben, Eduard Ganian, Robert Hamm, Thekla et al.

Weitere Verfasser: Eiben, Eduard Ganian, Robert Hamm, Thekla et al.

Quelle: Journal of Computer and System Sciences. 121:57-75

Schlagwörter: FOS: Computer and information sciences, fixed-parameter algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, rank-width, 01 natural sciences, Parameterized complexity, Computer Science - Data Structures and Algorithms, treewidth, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1908.10132
https://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-10132
https://www.sciencedirect.com/science/article/pii/S002200002100043X
https://www.sciencedirect.com/science/article/abs/pii/S002200002100043X
https://doi.org/10.1016/j.jcss.2021.04.005
https://arxiv.org/abs/1908.10132
http://arxiv.org/pdf/1908.10132.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.42

Fixed-Parameter Algorithms for Unsplittable Flow Cover

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

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

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

Four-point condition matrices of edge-weighted trees

Autoren: Ali Azimi Rakesh Jana Mukesh Kumar Nagar et al.

Quelle: Special Matrices, Vol 12, Iss 1, Pp 133-150 (2024)

Schlagwörter: Artificial intelligence, Computational Complexity, Geometry, 0102 computer and information sciences, four-point condition, 01 natural sciences, Point (geometry), QA1-939, FOS: Mathematics, secondary 15a15, 05c12, 0101 mathematics, Graph Labeling and Dimension Problems, edge weights, Graph Spectra and Topological Indices, Edge Coloring, Pure mathematics, Topological Indices, Computer science, tree, Enhanced Data Rates for GSM Evolution, Sonstiges, distance matrix, Computational Theory and Mathematics, Combinatorics, Fixed-Parameter Algorithms, Mathematik, 05c05, Physical Sciences, Computer Science, Geometry and Topology, Mathematics, Graph Theory and Algorithms, Parameterized Complexity

Dateibeschreibung: image/jpeg; application/pdf

Zugangs-URL: https://doaj.org/article/7b093b69ffc54c6f8f455295e1414f1e

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

Autoren: Leo van Iersel Remie Janssen Mark Jones et al.

Quelle: Algorithmica. 84:917-960

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Populations and Evolution (q-bio.PE), 0102 computer and information sciences, 02 engineering and technology, Fixed-parameter algorithms, 01 natural sciences, Phylogenetic networks, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hybridization number, Quantitative Biology - Populations and Evolution, 92D15 05C90 05C85 56R10, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/pdf/1907.08474
http://arxiv.org/abs/1907.08474
http://resolver.tudelft.nl/uuid:70e72477-d616-4b6f-a275-f16df603453b

Combinatorial n-fold integer programming and applications

Autoren: Dušan Knop Matthias Mnich Martin Koutecký et al.

Weitere Verfasser: Dušan Knop Matthias Mnich Martin Koutecký et al.

Quelle: Mathematical Programming. 184:1-34

Schlagwörter: FOS: Computer and information sciences, fixed-parameter algorithms, Closest string, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Fixed-parameter algorithms, 16. Peace & justice, 01 natural sciences, Closest strings, Informatik, Augmentation algorithm, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, F.2.2, integer programming, closest strings

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2017/7861/pdf/LIPIcs-ESA-2017-54.pdf
http://arxiv.org/abs/1705.08657
https://cris.maastrichtuniversity.nl/en/publications/1be120ed-2398-406f-bc46-145b97eac643
https://doi.org/10.4230/LIPIcs.ESA.2017.54
https://dblp.uni-trier.de/db/journals/corr/corr1705.html#KnopKM17
https://link.springer.com/article/10.1007/s10107-019-01402-2
https://cris.maastrichtuniversity.nl/en/publications/combinatorial-n-fold-integer-programming-and-applications
http://doi.org/10.1007/s10107-019-01402-2
https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F1be120ed-2398-406f-bc46-145b97eac643
https://arxiv.org/abs/1705.08657
http://ui.adsabs.harvard.edu/abs/2017arXiv170508657K/abstract
https://arxiv.org/abs/1705.08657
https://arxiv.org/pdf/1705.08657.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.54

Dynamic Parameterized Problems and Algorithms

Autoren: Josh Alman Matthias Mnich Virginia Vassilevska Williams et al.

Weitere Verfasser: Josh Alman Matthias Mnich Virginia Vassilevska Williams et al.

Quelle: arXiv

Schlagwörter: FOS: Computer and information sciences, fixed-parameter algorithms, Computer Science - Computational Complexity, dynamic algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), 01 natural sciences, Dynamic algorithms

Dateibeschreibung: application/pdf; application/octet-stream

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2017/7441/pdf/LIPIcs-ICALP-2017-41.pdf
http://arxiv.org/abs/1707.00362
https://drops.dagstuhl.de/opus/volltexte/2017/7441/pdf/LIPIcs-ICALP-2017-41.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2017.41
https://drops.dagstuhl.de/opus/volltexte/2017/7441/
https://dblp.uni-trier.de/db/conf/icalp/icalp2017.html#AlmanMW17
https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F7aec2be5-9cb6-4352-9f3f-5850248f381c
https://dblp.uni-trier.de/db/journals/corr/corr1707.html#AlmanMW17
https://cris.maastrichtuniversity.nl/en/publications/dynamic-parameterized-problems-and-algorithms
https://arxiv.org/abs/1707.00362
https://dl.acm.org/doi/10.1145/3395037
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.41
https://hdl.handle.net/1721.1/135282

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Autoren: Kanj, Iyad Komusiewicz, Christian Sorge, Manuel et al.

Weitere Verfasser: Kanj, Iyad Komusiewicz, Christian Sorge, Manuel et al.

Quelle: SIAM Journal on Discrete Mathematics
Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18)

Schlagwörter: FOS: Computer and information sciences, 000 Computer science, knowledge, general works, Cross-composition, 0102 computer and information sciences, Reduction rules, Computational Complexity (cs.CC), Fixed-parameter algorithms, Vertex-partition problems, 01 natural sciences, Computer Science - Computational Complexity, Computer Science, Computer Science - Data Structures and Algorithms, Kernelization, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf; image/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2018/9514/pdf/LIPIcs-ESA-2018-51.pdf
http://arxiv.org/abs/1808.08772
https://research-portal.uu.nl/en/publications/6f47aa1c-7dea-4be8-bbdd-783c4fd026e3
https://doi.org/10.4230/LIPIcs.ESA.2018.51
https://dblp.uni-trier.de/db/journals/corr/corr1808.html#abs-1808-08772
https://doi.org/10.1137/19M1239362
https://epubs.siam.org/doi/abs/10.1137/19M1239362
https://arxiv.org/pdf/1808.08772.pdf
https://ui.adsabs.harvard.edu/abs/2018arXiv180808772K/abstract
https://arxiv.org/abs/1808.08772
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.51
https://dspace.library.uu.nl/handle/1874/376895

Deterministic Constrained Multilinear Detection

Autoren: Brand, Cornelius Korchemna, Viktoriia Skotnica, Michael et al.

Weitere Verfasser: Brand, Cornelius Korchemna, Viktoriia Skotnica, Michael et al.

Schlagwörter: Algebraic algorithms, ddc:004, Fixed-parameter algorithms, Matroid intersection, Motif discovery

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.25

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs

Autoren: Iyad Kanj Christian Komusiewicz Manuel Sorge et al.

Weitere Verfasser: Iyad Kanj Christian Komusiewicz Manuel Sorge et al.

Quelle: 15th Scandinavian Symposium and Workshops on Algorithm Theory
Leibniz International Proceedings in Informatics

Schlagwörter: FOS: Computer and information sciences, fixed-parameter algorithms, subcolorings, Graph classes, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Unipolar graphs, Computational Complexity (cs.CC), Vertex-partition problems, Fixed-parameter algorithms, 01 natural sciences, Computer Science - Computational Complexity, monopolar graphs, Taverne, split graphs, Monopolar graphs, Computer Science - Data Structures and Algorithms, Subcolorings, Split graphs, Data Structures and Algorithms (cs.DS), vertex-partition problems, ddc:004, unipolar graphs

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1702.04322
http://dspace.library.uu.nl/handle/1874/362611
https://dblp.uni-trier.de/db/journals/jcss/jcss92.html#KanjKSL18
https://www.sciencedirect.com/science/article/pii/S0022000017301149
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F362611
https://doi.org/10.1016/j.jcss.2017.08.002
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.14
http://hdl.handle.net/11858/00-001M-0000-002C-5367-9
https://dspace.library.uu.nl/handle/1874/362611

On directed covering and domination problems

Autoren: Tesshu Hanaka Naomi Nishimura Hirotaka Ono et al.

Weitere Verfasser: Tesshu Hanaka Naomi Nishimura Hirotaka Ono et al.

Quelle: Discrete Applied Mathematics. 259:76-99

Schlagwörter: fixed-parameter algorithms, dominating set, edge dominating set, 0102 computer and information sciences, ddc:004, directed graph, 01 natural sciences, vertex cover

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2017/8246/pdf/LIPIcs-ISAAC-2017-45.pdf
https://www.sciencedirect.com/science/article/pii/S0166218X18306553
https://dblp.uni-trier.de/db/journals/dam/dam259.html#HanakaNO19
https://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#HanakaNO17
http://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#HanakaNO17
https://drops.dagstuhl.de/opus/volltexte/2017/8246/
https://drops.dagstuhl.de/opus/volltexte/2017/8246/pdf/LIPIcs-ISAAC-2017-45.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.45

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy

Autoren: Matthias Mnich Ildikó Schlotter

Quelle: Algorithmica

Schlagwörter: Lower quotas, QA Mathematics / matematika, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Fixed-parameter algorithms, 01 natural sciences, Article, Stable marriage, 3. Good health

Dateibeschreibung: text

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-019-00636-y.pdf
https://pubmed.ncbi.nlm.nih.gov/32214574

High multiplicity N-fold IP via configuration LP

Autoren: Knop, Dušan Koutecký, Martin Levin, Asaf et al.

Schlagwörter: Integer programming, Configuration IP, Fixed-parameter algorithms, Scheduling, 510: Mathematik

Dateibeschreibung: application/pdf

Relation: Mathematical programming; Multivariate Algorithmen für Scheduling mit hoher Multiplizität; Projekt DEAL; Mathematical Programming (2023); http://hdl.handle.net/11420/13427

Verfügbarkeit: http://hdl.handle.net/11420/13427
https://doi.org/10.15480/882.4606

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoren: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian et al.

Weitere Verfasser: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian et al.

Schlagwörter: Combinatorics and graph theory, Computational applications of logic, Data structures, Fixed-parameter algorithms and complexity, Graph algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ICALP.2022.102
https://nbn-resolving.org/urn:nbn:de:0030-drops-164432
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102