• Suche: "parameterized complexity"

Treffer 61 - 80 von 5.288

61

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Benjamin Bergougnoux ; Vera Chekan ; Robert Ganian ; et al.
ACM Transactions on Computation Theory.

FOS: Computer and inform... [INFO.INFO-DM] Computer... Parameterized complexity algebraic methods shrubdepth Data Structures and Algo... …
Fachzeitschrift
Zu den Favoriten
62

On the parameterized complexity of computing tree-partitions
Bodlaender, Hans L. ; Groenland, Carla ; Jacob, Hugo ; et al.
Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Discrete Algorithms (2025)
IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

FOS: Computer and inform... Domino Treewidth parameterized algorithms Discrete Mathematics (cs... Treewidth 0102 computer and inform... …
Fachzeitschrift
Zu den Favoriten
63

Revisiting directed disjoint paths on tournaments (and relatives)
De Castro Mendes Gomes Guilherme ; Teixeira Lopes, Raul Wayne ; Sau, Ignasi ; et al.

directed pathwidth FOS: Computer and inform... Computer Science, Inform... congestion semicomplete digraphs directed disjoint paths …
Konferenz
Zu den Favoriten
64

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
Foucaud, Florent ; Hocquard, Hervé ; Lajou, Dimitri ; et al.
Algorithmica. 84(5):1183-1212

Parameterized complexity Graph homomorphism Graph modification Edge-coloured graph Signed graph [INFO.INFO-DS]Computer S... …
Zeitschrift
Zu den Favoriten
65

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
Lopes, Raul ; Sau, Ignasi ; Universidade Federal do Ceará = Federal University of Ceará (UFC) ; et al.
Theoretical Computer Science. 898:75-91

Directed disjoint paths Congestion Dual parameterization Kernelization Directed tree-width Parameterized complexity …
Zeitschrift
Zu den Favoriten
66

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
Baril, Ambroise ; Couceiro, Miguel ; Lagerkvist, Victor ; et al.

cliquewidth component twin-width graph coloring parameterized complexity fine-grained complexity [INFO]Computer Science [... …
E-Ressource
Zu den Favoriten
67

Linear Bounds between Component Twin-Width and Clique-Width with Algorithmic Applications to Counting Graph Colorings
Baril, Ambroise ; Couceiro, Miguel ; Lagerkvist, Victor ; et al.

cliquewidth component twin-width graph coloring parameterized complexity fine-grained complexity [INFO]Computer Science [... …
E-Ressource
Zu den Favoriten
68

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
Baguley, Samuel ; Friedrich, Tobias ; Neumann, Aneta ; et al.
Algorithmica. :1-35

Fachzeitschrift
Zu den Favoriten
69

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
Marx, Dániel ; Sankar, Govind S. ; Schepper, Philipp
Algorithmica. 87(1):22-88

Fachzeitschrift
Zu den Favoriten
70

On Graphs Coverable by \({k}\) Shortest Paths
Dumas, Maël ; Foucaud, Florent ; Perez, Anthony ; et al.
SIAM Journal on Discrete Mathematics. 38:1840-1862

FOS: Computer and inform... Computational Complexity covering problems Data Structures and Algo... Discrete Mathematics (cs... Discrete Mathematics …
Fachzeitschrift
Zu den Favoriten
71

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian ; Thekla Hamm ; Viktoriia Korchemna ; et al.
ACM Transactions on Algorithms. 20:1-26

FOS: Computer and inform... homomorphism 68R10 0102 computer and inform... G.2.2 Computational Complexity... …
Fachzeitschrift
Zu den Favoriten
72

Reducing graph transversals via edge contractions
Lima, Paloma, T ; dos Santos, Vinicius, F ; Sau, Ignasi ; et al.
Journal of Computer and System Sciences. 120:62-74

graph transversal parameterized complexity vertex cover feedback vertex set odd cycle transversal edge contraction …
Zeitschrift
Zu den Favoriten
73

On the complexity of finding large odd induced subgraphs and odd colorings
Belmonte, Rémy ; Sau, Ignasi ; University of Electro-Communications [Tokyo] (UEC) ; et al.
Algorithmica. 83(8):2351-2373

odd subgraph odd coloring rank-width parameterized complexity single-exponential algor... Exponential Time Hypothe... …
Zeitschrift
Zu den Favoriten
74

Finding Cuts of Bounded Degree
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
Gomes, Guilherme, C M ; Sau, Ignasi ; Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil] (UFMG) ; et al.
Algorithmica. 83(6):1677-1706

matching cut bounded degree cut parameterized complexity FPT algorithm polynomial kernel distance to cluster …
Zeitschrift
Zu den Favoriten
75

On the complexity of temporal arborescence reconfiguration
Riccardo Dondi ; Manuel Lafond ; Riccardo Dondi and Manuel Lafond
Theoretical Computer Science. 1055:115502

Approximation Complexity Arborescence Graph Algorithms Parameterized Complexity Temporal Graphs ddc:004
Fachzeitschrift
Zu den Favoriten
76

Temporal graph realization from fastest paths
Klobas, Nina ; Mertzios, George B. ; Molter, Hendrik ; et al.
Theoretical Computer Science. 1056:115508

Temporal graph fastest temporal path periodic temporal labeli... ddc:004 graph realization temporal connectivity …
Fachzeitschrift
Zu den Favoriten
77

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
Casel, Katrin ; Fernau, Henning ; Khosravian Ghadikolaei, Mehdi ; et al.
22nd International Symposium. :185-200

Copenhagen, Denmark Extension problems Edge cover Matching Edge domination NP-completeness …
Konferenz
Zu den Favoriten
78

Parameterized Complexity of Safe Set
Belmonte, Rémy ; Hanaka, Tesshu ; Katsikarelis, Ioannis ; et al.
11th International Conference on Algorithms and Complexity (CIAC 2019). :38-49

Rome, Italy Safe set Parameterized complexity Vulnerability parameter Pathwidth Clique-width …
Konferenz
Zu den Favoriten
79

Minimum Reload Cost Graph Factors
Baste, Julien ; Gözüpek, Didem ; Shalom, Mordechai ; et al.
SOFSEM 2019 - 45th International Conference on Current Trends in Theory and Practice of Informatics. :67-80

Nový Smokovec, Slovakia Parameterized complexity Graph factors Reload costs [INFO.INFO-DM]Computer S... Discrete Mathematics [cs... …
Konferenz
Zu den Favoriten
80

Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games
Allamigeon, Xavier ; Gaubert, Stéphane ; Katz, Ricardo, David ; et al.
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Jul 2022, Paris, France

Paris, France Mean-payoff games entropy games value iteration Perron root separation bounds …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter