Search Results - "Parameterized Complexity"
-
1
Authors: et al.
Contributors: et al.
Source: Journal of Graph Algorithms and Applications. 29:247-266
Subject Terms: graph drawing, Computational Geometry (cs.CG), FOS: Computer and information sciences, st-orientations, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, parameterized complexity
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: Algorithmica. 87:1669-1709
Subject Terms: FOS: Computer and information sciences, Parameterized complexity, Data Structures and Algorithms, Treewidth, Data Structures and Algorithms (cs.DS), ddc:004, Eulerian graphs
File Description: application/pdf
-
3
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Algorithms. 21:1-28
Subject Terms: FOS: Computer and information sciences, min-max relation, directed disjoint paths, directed graphs, bramble, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, matroids, half-integral linkage, parameterized complexity
File Description: application/pdf
-
4
Authors: et al.
Source: Discrete Applied Mathematics. 378:102-119
-
5
Authors: et al.
Contributors: et al.
Source: Algorithmica. 87:1146-1177
Subject Terms: FOS: Computer and information sciences, Parameterized complexity, Computer Science - Computational Complexity, Bandwidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Cluster vertex deletion number, Computational Complexity (cs.CC), Clique number
File Description: application/pdf
-
6
Authors:
Contributors:
Source: Journal of Scheduling. 28:139-156
Subject Terms: cutting stock, FOS: Computer and information sciences, Cutting stock, Scheduling, ddc:650, 0211 other engineering and technologies, High-multiplicity jobs, 02 engineering and technology, Computational Complexity (cs.CC), hardness, Parameterized complexity, Computer Science - Computational Complexity, Hardness, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), ddc:004, Mathematics - Optimization and Control, parameterized complexity
File Description: application/pdf
-
7
Authors:
Source: Proceedings of the AAAI Conference on Artificial Intelligence. 39:11229-11237
Subject Terms: Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer Science - Computational Complexity, Network of Caches, Fixed-parameter Tractability, Caching, Computational Complexity (cs.CC), Parameterized Complexity
Access URL: http://arxiv.org/abs/2412.16585
-
8
Authors:
Source: ACM Transactions on Computation Theory. 17:1-24
Subject Terms: FOS: Computer and information sciences, Eulerian and Hamiltonian graphs, Discrete Mathematics (cs.DM), Parameterized complexity, tractability and kernelization, Computational Complexity (cs.CC), outerplanar graph, partial search order, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Hamiltonian path, partial order, FOS: Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Paths and cycles, TSP-PC, parameterized complexity, Computer Science - Discrete Mathematics
File Description: application/xml
Access URL: http://arxiv.org/abs/2404.16662
-
9
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics
8:1-8:18
Algorithmica
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
IPECSubject Terms: bandwidth, FOS: Computer and information sciences, XP space requirement, Parameterized complexity, tractability and kernelization, Pathwidth, Linear clique-width, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, 7. Clean energy, Bandwidth, Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), linear mim-width, parameterized complexity, pathwidth, Parameterized complexity, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), XNLP, linear width measures, hardness proofs, ddc:004, W-hierarchy, Linear mim-width, Software, linear clique-width
File Description: application/xml; application/pdf
Access URL: http://arxiv.org/abs/2201.13119
https://research-portal.uu.nl/en/publications/df89aedd-7a2e-4055-938c-d21b56bced16
https://doi.org/10.1007/s00453-024-01274-9
https://hdl.handle.net/11250/3041006
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.8
https://dspace.library.uu.nl/handle/1874/425595
https://hdl.handle.net/11250/3170553 -
10
Authors: et al.
Source: Algorithms for Molecular Biology, Vol 20, Iss 1, Pp 1-25 (2025)
Subject Terms: RNA structure, String design, Parameterized complexity, Uniform sampling, Biology (General), QH301-705.5, Genetics, QH426-470
File Description: electronic resource
Relation: https://doaj.org/toc/1748-7188
-
11
Authors: et al.
Contributors: et al.
Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)Subject Terms: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
-
12
Authors: et al.
Contributors: et al.
Source: Algorithmica.
Subject Terms: k-median, FOS: Computer and information sciences, Parameterized complexity, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC), Parameterized Inapproximability Hypothesis, max coverage, Hardness of Approximation
File Description: application/pdf
-
13
Authors:
Source: ACM Transactions on Computation Theory. 17:1-35
Subject Terms: FOS: Computer and information sciences, Matching models, Discrete Mathematics (cs.DM), stable matching, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, popular matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), master lists, Data Structures and Algorithms (cs.DS), complexity, Computer Science - Discrete Mathematics
File Description: application/xml
Access URL: http://arxiv.org/abs/2205.02189
-
14
Authors: et al.
Source: ACM Transactions on Computation Theory. 17:1-28
Subject Terms: Graph theory (including graph drawing) in computer science, polynomial kernel, treewidth, Parameterized complexity, tractability and kernelization, important separator, directed feedback vertex set
File Description: application/xml
-
15
Authors:
Contributors:
Source: Algorithmica, 87 (3), 344–376
Subject Terms: ddc:004, FOS: Computer and information sciences, F.2.2, G.2.2, DATA processing & computer science, Reduction Rules, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Implicit Hitting Set, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Power Dominating Set, Parameterized Complexity
File Description: application/pdf
-
16
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Computing. 53:1409-1438
Subject Terms: 0301 basic medicine, FOS: Computer and information sciences, parameterised complexity theory, counting problems, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, somewhere dense graphs, Computer Science - Computational Complexity, 03 medical and health sciences, parameterized complexity theory, ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: http://arxiv.org/abs/2209.03402
https://ora.ox.ac.uk/objects/uuid:ec3d7a28-7134-415f-8d64-4aa422b7edaf
https://doi.org/10.1137/22m1535668
https://drops.dagstuhl.de/opus/volltexte/2023/17530/pdf/LIPIcs-ITCS-2023-27.pdf
https://hdl.handle.net/2434/961285
https://doi.org/10.4230/lipics.itcs.2023.27
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.27 -
17
Authors:
Contributors:
Source: ACM Transactions on Computation Theory. 16:1-51
Subject Terms: FOS: Computer and information sciences, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, ETH, Computer Science - Data Structures and Algorithms, SETH, Data Structures and Algorithms (cs.DS), ddc:004, Parameterized Complexity
File Description: application/pdf
-
18
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Computation Theory.
Subject Terms: FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized complexity, algebraic methods, shrubdepth, Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), ddc:004, space complexity
File Description: application/pdf
Access URL: http://arxiv.org/abs/2307.01285
http://10.10.70.176:8080/experts/en/publications/8b2e5cfb-2dbc-4b4f-9a00-19a72f8ebc29
https://doi.org/10.48550/arXiv.2307.01285
https://research-portal.uu.nl/en/publications/80bbb077-5744-4a6a-b94d-46d26a0c57d1
https://doi.org/10.4230/LIPIcs.ESA.2023.18
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.18
https://hal.science/hal-04492602v1
https://hal.science/hal-04492602v1/document
https://doi.org/10.1145/3723880
https://hal.science/hal-04492601v1
https://doi.org/10.4230/lipics.esa.2023.18
https://dspace.library.uu.nl/handle/1874/431814 -
19
Authors: et al.
Contributors: et al.
Source: Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Discrete Algorithms (2025)
IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)Subject Terms: FOS: Computer and information sciences, Domino Treewidth, parameterized algorithms, Discrete Mathematics (cs.DM), Treewidth, 0102 computer and information sciences, 01 natural sciences, Parameterized algorithms, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), QA1-939, treewidth, tree-partition-width, approximation algorithms, parameterized complexity, tree-partitions, Approximation algorithms, computer science - discrete mathematics, tree-cut width, Tree partitions, ddc:004, domino treewidth, Approximation Algorithms, Software, Mathematics, Parameterized Complexity, Computer Science - Discrete Mathematics
File Description: application/xml; application/pdf
-
20
Authors: et al.
Contributors: et al.
Subject Terms: directed pathwidth, FOS: Computer and information sciences, Computer Science, Information and General Works::004: Computer Sciences, congestion, semicomplete digraphs, directed disjoint paths, directed graphs, Natural Sciences and Mathematics::519: Applied Mathematics, Probabilities, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, congestion | directed disjoint paths | directed graphs | directed pathwidth | parameterized complexity | semicomplete digraphs | tournaments, tournaments, parameterized complexity
File Description: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder 
Full Text