Výsledky vyhledávání - "fixed-parameter algorithms"
-
1
Autoři: a další
Témata: Applied Mathematics, Mathematical Sciences, Fixed-parameter algorithms and complexity, Hardness of approximations, PCP theorems
Přístupová URL adresa: https://escholarship.org/uc/item/1j64r6k1
-
2
Autoři: a další
Přispěvatelé: a další
Témata: Graph theory, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Elimination distance, Discrete Mathematics, ddc:004, Fixed-parameter algorithms, Dominated cluster
Popis souboru: application/pdf
-
3
Autoři:
Zdroj: AIMS Mathematics, Vol 9, Iss 6, Pp 14558-14573 (2024)
Témata: 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
Přístupová URL adresa: https://doaj.org/article/80909ce6f2134a988cb0c27077a5aaff
-
4
Autoři:
Přispěvatelé:
Témata: Pinwheel Scheduling, Polynomial-time Solvability, Packing and Covering, Fixed Parameter Algorithms
Popis souboru: 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
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 85:2554-2579
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83
-
6
Autoři: 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
-
7
Autoři: a další
Přispěvatelé: a další
Témata: 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
Popis souboru: application/pdf
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Computer and System Sciences. 121:57-75
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
9
Autoři: a další
Přispěvatelé: a další
Zdroj: Theory of Computing Systems. 67:89-124
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
10
Autoři: a další
Zdroj: Special Matrices, Vol 12, Iss 1, Pp 133-150 (2024)
Témata: 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
Popis souboru: image/jpeg; application/pdf
Přístupová URL adresa: https://doaj.org/article/7b093b69ffc54c6f8f455295e1414f1e
-
11
Autoři: a další
Zdroj: Algorithmica. 84:917-960
Témata: 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
-
12
Autoři: a další
Přispěvatelé: a další
Zdroj: Mathematical Programming. 184:1-34
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
13
Autoři: a další
Přispěvatelé: a další
Zdroj: arXiv
Témata: 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
Popis souboru: application/pdf; application/octet-stream
Přístupová URL adresa: 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 -
14
Autoři: a další
Přispěvatelé: a další
Zdroj: SIAM Journal on Discrete Mathematics
Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18)Témata: 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
Popis souboru: application/pdf; image/pdf
Přístupová URL adresa: 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 -
15
Autoři: a další
Přispěvatelé: a další
Témata: Algebraic algorithms, ddc:004, Fixed-parameter algorithms, Matroid intersection, Motif discovery
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.25
-
16
Autoři: a další
Přispěvatelé: a další
Zdroj: 15th Scandinavian Symposium and Workshops on Algorithm Theory
Leibniz International Proceedings in InformaticsTémata: 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
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
17
Autoři: a další
Přispěvatelé: a další
Zdroj: Discrete Applied Mathematics. 259:76-99
Témata: fixed-parameter algorithms, dominating set, edge dominating set, 0102 computer and information sciences, ddc:004, directed graph, 01 natural sciences, vertex cover
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
18
Autoři:
Zdroj: Algorithmica
Témata: 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
Popis souboru: text
-
19
Autoři: a další
Témata: Integer programming, Configuration IP, Fixed-parameter algorithms, Scheduling, 510: Mathematik
Popis souboru: 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
-
20
Autoři: a další
Přispěvatelé: a další
Témata: Combinatorics and graph theory, Computational applications of logic, Data structures, Fixed-parameter algorithms and complexity, Graph algorithms
Popis souboru: 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
Nájsť tento článok vo Web of Science
Full Text Finder