Výsledky vyhledávání - "FPT-algorithm"
-
1
Autoři: a další
Zdroj: Discrete Applied Mathematics. 378:102-119
-
2
Autoři:
Přispěvatelé:
Témata: Tensor Rank, Tensor Decomposition, Algebraic circuits, Deterministic algorithms, ddc:004, Reconstruction, Learning circuits, FPT algorithm
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.28
-
3
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, temporal graphs, directed graph recognition, ddc:004, Computational Complexity (cs.CC), feedback edge set, parameterized complexity, FPT algorithm
Popis souboru: application/pdf
-
4
Autoři: a další
Přispěvatelé: a další
Témata: Treewidth, FPT-algorithm, NP-hard problem, Color coding, ddc:004
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.16
-
5
Autoři:
Zdroj: Annals of Operations Research. 351:609-628
Témata: Timeline cover, Temporal graph, NP-hard problem, Approximation algorithm, FPT algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Popis souboru: application/pdf
Přístupová URL adresa: https://hdl.handle.net/10446/279409
https://doi.org/10.1007/s10479-024-05993-8 -
6
Autoři: a další
Zdroj: Journal of computer and system sciences (Print). 102:57-68
Témata: Covering with paths, FPT-algorithm, NP-hardness, Monomial
Popis souboru: print
-
7
Autoři: a další
Přispěvatelé: a další
Popis souboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.5
-
8
Autoři: a další
Přispěvatelé: a další
Témata: Treewidth, ddc:004, Edge coloring, W[1]-hardness, FPT algorithm
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.31
-
9
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, FPT Algorithm, Grundy Coloring, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, K_{i,j}-free graphs, Data Structures and Algorithms (cs.DS), ddc:004, Partial Grundy Coloring, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
10
Autoři:
Přispěvatelé:
Zdroj: 15th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics
AlgorithmicaTémata: FPT Algorithm, ETH, Lower Bound, 0211 other engineering and technologies, Graph Contraction Problems, No Polynomial Kernel, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2020/13329/pdf/LIPIcs-IPEC-2020-26.pdf
https://dblp.uni-trier.de/db/conf/iwpec/ipec2020.html#0001T20
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3281054
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.26
http://hdl.handle.net/21.11116/0000-0007-D6AB-7 -
11
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 84:961-981
Témata: FPT Algorithm, Terrain Guarding, Terrain Minima, Kernelization, 0102 computer and information sciences, ddc:004, 0101 mathematics, XP Algorithm, 01 natural sciences, Reflex Vertices
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.4
-
12
Autoři:
Přispěvatelé:
Zdroj: Algorithmica. 83:1677-1706
Témata: FOS: Computer and information sciences, Treewidth, Combinatorial Optimization and Complexity Theory, 0211 other engineering and technologies, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Graph, FPT algorithm, Data Structures and Algorithms (cs.DS), bounded degree cut, Bipartite graph, Physics, Statistics, polynomial kernel, Discrete mathematics, Approximation algorithm, Vertex (graph theory), Algorithm, 05C15, Computational Theory and Mathematics, Physical Sciences, Matching (statistics), Maximum cut, F.2.2, Approximation Algorithms, Graph Theory and Algorithms, Computer Networks and Communications, Independent set, Pathwidth, G.2.2, 0102 computer and information sciences, Mathematical analysis, Bounded function, Vertex cover, Computer Science - Data Structures and Algorithms, FOS: Mathematics, matching cut, Degree (music), parameterized complexity, Line graph, Acoustics, distance to cluster, Computer Science - Computational Complexity, Parameterized complexity, Networks on Chip in System-on-Chip Design, Combinatorics, Time complexity, Computer Science, Kernelization, ddc:004, Mathematics
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/11480/pdf/LIPIcs-IPEC-2019-19.pdf
http://arxiv.org/abs/1905.03134
https://dblp.uni-trier.de/db/journals/corr/corr1905.html#abs-1905-03134
https://link.springer.com/article/10.1007/s00453-021-00798-8
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03374542
https://arxiv.org/abs/1905.03134
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03374542/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02410703/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02410703
https://dblp.uni-trier.de/db/conf/iwpec/ipec2019.html#GomesS19
https://drops.dagstuhl.de/opus/volltexte/2019/11480/pdf/LIPIcs-IPEC-2019-19.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.19 -
13
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 83:1861-1884
Témata: bisection, polynomial kernel, splitters, 0102 computer and information sciences, ddc:004, fpt algorithm, chromatic coding, semicomplete digraph, 01 natural sciences, tournament
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/10972/pdf/LIPIcs-MFCS-2019-28.pdf
https://repository.iitgn.ac.in/handle/123456789/6334
https://link.springer.com/article/10.1007/s00453-021-00806-x
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#MadathilSZ21
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3293156
https://link.springer.com/content/pdf/10.1007/s00453-021-00806-x.pdf
https://doi.org/10.1007/s00453-021-00806-x
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.28 -
14
Autoři:
Zdroj: Bliznets, I, Bukov, A & Sagunov, D 2024, 'Fair division with minimal withheld information in social networks', Theoretical Computer Science, vol. 991, 114446. https://doi.org/10.1016/j.tcs.2024.114446
Popis souboru: application/pdf
Dostupnost: https://hdl.handle.net/11370/62938168-9976-4435-aff9-22d2fa41d73d
https://research.rug.nl/en/publications/62938168-9976-4435-aff9-22d2fa41d73d
https://doi.org/10.1016/j.tcs.2024.114446
https://pure.rug.nl/ws/files/938849205/1-s2.0-S0304397524000616-main_1_.pdf
http://www.scopus.com/inward/record.url?scp=85184992621&partnerID=8YFLogxK -
15
Autoři: a další
Přispěvatelé: a další
Témata: Phylogenetic Networks, Tree-Child Networks, Acyclic Graph Orientation, FPT Algorithm, Exact Algorithm, Heuristic Algorithm
-
16
Autoři: a další
Přispěvatelé: a další
Zdroj: Leibniz International Proceedings in Informatics
35:1--35:15Témata: W[1]-hard, Shortest Path, Matching, Conflict-free, 0102 computer and information sciences, ddc:004, 16. Peace & justice, 01 natural sciences, FPT algorithm, Matroid
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/10979/pdf/LIPIcs-MFCS-2019-35.pdf
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#AgrawalJKS20
https://link.springer.com/article/10.1007/s00453-020-00681-y
https://doi.org/10.1007/s00453-020-00681-y
https://hdl.handle.net/11250/2722526
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.35 -
17
Autoři: a další
Přispěvatelé: a další
Témata: Tripartite, linear kernel, FPT-algorithm, chordal, ddc:004, 3-colorable, maximum cut
Popis souboru: application/pdf
-
18
Autoři: a další
Přispěvatelé: a další
Zdroj: Networks. 75:259-277
Témata: FOS: Computer and information sciences, Treewidth, [MATH] Mathematics [math], G.2.2, 0102 computer and information sciences, [INFO] Computer Science [cs], G.2.3, Computational Complexity (cs.CC), Dynamic programming, 01 natural sciences, minimum diameter spanning tree, FPT algorithm, Computer Science - Data Structures and Algorithms, treewidth, Minimum diameter spanning tree, Data Structures and Algorithms (cs.DS), parameterized complexity, dynamic programming, 05C85, 05C10, Reload cost problems, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Parameterized complexity, Computer Science - Computational Complexity, reload cost problems, ddc:004
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/8554/pdf/LIPIcs-IPEC-2017-3.pdf
http://arxiv.org/abs/1703.01686
https://hal.science/hal-01733767v1/document
https://hal.science/hal-01733767v1
https://doi.org/10.4230/lipics.ipec.2017.3
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02989889v1
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02989889v1/document
https://doi.org/10.1002/net.21923
https://hal.archives-ouvertes.fr/hal-01733767
https://hal.archives-ouvertes.fr/hal-01733767/document
https://drops.dagstuhl.de/opus/volltexte/2018/8554/pdf/LIPIcs-IPEC-2017-3.pdf/
https://ui.adsabs.harvard.edu/abs/2017arXiv170301686B/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1703.html#BasteGPSST17
https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002285404679013
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02989889
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02989889/document
https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21923
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.3
https://pergamos.lib.uoa.gr/uoa/dl/object/3070864
https://aperta.ulakbim.gov.tr/record/9305 -
19
Autoři:
Zdroj: Andersen, J B, Bang-Jensen, J & Yeo, A 2020, ' On the parameterized complexity of 2-partitions ', Theoretical Computer Science, vol. 844, pp. 97-105 . https://doi.org/10.1016/j.tcs.2020.08.008
Témata: FOS: Computer and information sciences, F.2.2, G.2.2, 2-partition, Directed graph, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Out-branching, 01 natural sciences, FPT algorithm, Parameterized complexity, Computer Science - Computational Complexity, 05C20
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/pdf/2003.07190
http://arxiv.org/abs/2003.07190
https://www.sciencedirect.com/science/article/abs/pii/S0304397520304606
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07190
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07190
https://arxiv.org/abs/2003.07190
https://portal.findresearcher.sdu.dk/da/publications/5d743918-42a3-4616-bce2-cd50823946a4
https://doi.org/10.1016/j.tcs.2020.08.008
https://findresearcher.sdu.dk:8443/ws/files/172150986/On_the_para.pdf -
20
Autoři:
Zdroj: International Journal of Computational Geometry & Applications. 30:97-120
Témata: 4. Education, visibility, 0102 computer and information sciences, 02 engineering and technology, 15. Life on land, 01 natural sciences, 7. Clean energy, 12. Responsible consumption, 11. Sustainability, 8. Economic growth, 0202 electrical engineering, electronic engineering, information engineering, guarding, FPT-algorithm, approximation algorithm
Full Text Finder
Nájsť tento článok vo Web of Science