Suchergebnisse - "Parameterized algorithms"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SIAM Journal on Discrete Mathematics. 39:1587-1620
Schlagwörter: FOS: Computer and information sciences, Parameterized algorithms, Computer Science - Computational Complexity, ETH, Treewidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), Feedback vertex set, 01 natural sciences
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics
51:1-51:18Schlagwörter: FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), tree-independence number, 0102 computer and information sciences, Combinatorics (math.CO), ddc:004, approximation, 01 natural sciences
Dateibeschreibung: application/pdf
-
3
Autoren:
Weitere Verfasser:
Quelle: Lecture Notes in Computer Science ISBN: 9783032046994
Schlagwörter: FOS: Computer and information sciences, Parameterized algorithms, Temporal graphs, Computational Complexity, Data Structures and Algorithms, Interval-membership-width, Restless temporal paths, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)
Dateibeschreibung: application/pdf
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SIAM Journal on Computing. 53:1602-1640
Schlagwörter: FOS: Computer and information sciences, Parameterized Algorithms, Discrete Mathematics (cs.DM), 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), Exact Algorithms, 01 natural sciences, Max Independent Set, Min Dominating Set, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Coloring, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 05C85, Combinatorics (math.CO), ddc:004, F.2.2, Approximation Algorithms, Twin-width, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2007.14161
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-14161
http://ui.adsabs.harvard.edu/abs/2020arXiv200714161B/abstract
https://arxiv.org/abs/2007.14161
https://arxiv.org/pdf/2007.14161v1
https://basepub.dauphine.psl.eu/handle/123456789/22127
https://drops.dagstuhl.de/opus/volltexte/2021/14104/
https://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#BonnetG0TW21
https://drops.dagstuhl.de/opus/volltexte/2021/14104/pdf/LIPIcs-ICALP-2021-35.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.35 -
5
Autoren:
Quelle: Journal of computer and system sciences (Print). 115:169-186
Schlagwörter: Graph modification, Graph contagion, Influence spreading, Temporal paths, Parameterized algorithms
Dateibeschreibung: electronic
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Discrete Algorithms (2025)
IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)Schlagwörter: 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
Dateibeschreibung: application/xml; application/pdf
-
7
Autoren: et al.
Quelle: 19th International Symposium on Algorithms and Data Structures (WADS 2025) Leibniz International Proceedings in Informatics (LIPIcs).
Schlagwörter: computational geometry, crossing families, crossing-free matchings, parameterized algorithms, segment intersection graphs
Dateibeschreibung: electronic
-
8
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: FOS: Computer and information sciences, domination in graphs, Computational Complexity, parameterized algorithms, Data Structures and Algorithms, classification theorem, fine-grained complexity theory, Data Structures and Algorithms (cs.DS), subgraph isomorphism, ddc:004, Computational Complexity (cs.CC)
Dateibeschreibung: application/pdf
-
9
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, stack layouts, vertex integrity, Ramsey theory, Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, queue layouts
Dateibeschreibung: application/pdf
-
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: polygon aggregation, FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, treewidth, multicriteria optimization problems, multicriteria TSP, Data Structures and Algorithms (cs.DS), multicriteria MST, ddc:004
Dateibeschreibung: application/pdf
-
11
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Integer Linear Programming, Computational Geometry (cs.CG), FOS: Computer and information sciences, Parameterized Algorithms, Treewidth, Graph Drawing, Computational Geometry, ddc:004, Event Graphs
Dateibeschreibung: application/pdf
-
12
Autoren:
Weitere Verfasser:
Schlagwörter: FOS: Computer and information sciences, Path Decomposition, Parameterized Algorithms, Co-Path Packing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Graph Algorithms, ddc:004, Co-Path/Cycle Packing, Cut & Count
Dateibeschreibung: application/pdf
-
13
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: clique detections in hypergraphs, FOS: Computer and information sciences, Computer Science - Computational Complexity, parameterized algorithms, constraint satisfaction, fine-grained complexity theory, ddc:004, Computational Complexity (cs.CC)
Dateibeschreibung: application/pdf
-
14
Autoren:
Weitere Verfasser:
Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, Clustering, Parameterized algorithms, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, FPT approximation, k-Median, k-Center
Dateibeschreibung: application/pdf
-
15
Autoren:
Weitere Verfasser:
Quelle: Discrete Applied Mathematics. 341:102-119
Schlagwörter: FOS: Computer and information sciences, Clique-width, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, parameterized Complexity, 01 natural sciences, Modular-width, All-pairs shortest Paths, efficient parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004
Dateibeschreibung: application/pdf
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Transaction on Algorithms
Schlagwörter: ta113, FOS: Computer and information sciences, Parameterized Algorithms, Treewidth, Computer Science - Data Structures and Algorithms, Mathematik, 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Sparsest Cut
Dateibeschreibung: application/pdf
-
17
Autoren:
Weitere Verfasser:
Schlagwörter: coloring, parameterized algorithms, algebraic algorithms, above-guarantee, below-guarantee, subset convolution, determinants
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.5
-
18
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Cluster editing, cographs, parameterized algorithms, clique-width, trivially perfect graphs
Dateibeschreibung: 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.64
-
19
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: parameterized algorithms, kernelization, spreading points, distant representatives, unit disk packing
Dateibeschreibung: application/pdf
Relation: Is Part Of LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.51
-
20
Autoren:
Quelle: Proceedings of the ACM on Programming Languages. 7:292-317
Nájsť tento článok vo Web of Science 
Full Text Finder