• Suche: "parameterized complexity"

Treffer 141 - 160 von 5.288

141

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
Fomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M. ; et al.
Theory of Computing Systems. 64(2):251-271

Kernelization Descriptive complexity Parameterized complexity Graph modification First-order logic [INFO.INFO-CC]Computer S... …
Zeitschrift
Zu den Favoriten
142

Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Baste, Julien ; Gözüpek, Didem ; Paul, Christophe ; et al.
Networks. 75(3):259-277

Dynamic programming treewidth FPT algorithm parameterized complexity minimum diameter spannin... reload cost problems …
Zeitschrift
Zu den Favoriten
143

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M. ; et al.
SIAM Journal on Discrete Mathematics. 34(3):1623-1648

parameterized complexity graph minors treewidth hitting minors topological minors dynamic programming …
Zeitschrift
Zu den Favoriten
144

Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
Bulteau, Laurent ; Froese, Vincent ; Niedermeier, Rolf ; et al.
SIAM Journal on Discrete Mathematics. 34(3):1854-1883

Exponential Time Hypothe... 68T10 92D20 Parameterized Complexity Lower Bounds Fine-Grained Complexity... …
Zeitschrift
Zu den Favoriten
145

Parameterized complexity of locally minimal defensive alliances
Gaikwad, Ajinkya ; Maity, Soumen ; Tripathi, Shuvam Kant
In Discrete Applied Mathematics 15 September 2025 372:324-340

Fachzeitschrift
Zu den Favoriten
146

On the absolute and relative oriented clique problems’ time complexity
Coelho, E.M.M. ; Coelho, H. ; Faria, L. ; et al.
In Discrete Applied Mathematics 15 July 2025 369:53-65

Fachzeitschrift
Zu den Favoriten
148

Parameterised Counting in Logspace
Haak, Anselm ; Meier, Arne ; Prakash, Om ; et al.
Algorithmica. 85:2923-2961

FOS: Computer and inform... Computer Science - Logic... Logspace edit distance Counting complexity 0102 computer and inform... …
Fachzeitschrift
Zu den Favoriten
149

Sparsification Lower Bounds for List H -Coloring
Hubie Chen ; Bart M. P. Jansen ; Karolina Okrasa ; et al.
31st International Symposium on Algorithms and Computation (ISAAC 2020)

FOS: Computer and inform... sparsification Sparsification Theory of computation →... 0102 computer and inform... Computational Complexity... …
Fachzeitschrift
Zu den Favoriten
150

The Parameterized Complexity of Guarding Almost Convex Polygons
Akanksha Agrawal ; Kristine V. K. Knudsen ; Daniel Lokshtanov ; et al.
Leibniz International Proceedings in Informatics
3:1-3:16
Discrete & Computational Geometry

Computational Geometry (... FOS: Computer and inform... Art Gallery 0102 computer and inform... Fixed Parameter Tractabi... 01 natural sciences …
Fachzeitschrift
Zu den Favoriten
151

Efficient parameterized algorithms for computing all-pairs shortest paths
Stefan Kratsch ; Florian Nelles ; Stefan Kratsch and Florian Nelles
Discrete Applied Mathematics. 341:102-119

FOS: Computer and inform... Clique-width 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... parameterized Complexity …
Fachzeitschrift
Zu den Favoriten
152

Recognizing Map Graphs of Bounded Treewidth: Recognizing map graphs of bounded treewidth
Angelini P. ; Bekos M. A. ; Da Lozzo G. ; et al.
Algorithmica. 86:613-637

FOS: Computer and inform... map graphs Map graphs K-map graphs Fixed-parameter tractabi... Treewidth …
Fachzeitschrift
Zu den Favoriten
153

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
Esther Galby ; Liana Khazaliya ; Fionn Mc Inerney ; et al.
47th International Symposium on Mathematical Foundations of Computer Science
Leibniz International Proceedings in Informatics

FOS: Computer and inform... Discrete Mathematics (cs... 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... Computational Complexity... …
Fachzeitschrift
Zu den Favoriten
154

Computing Generalized Convolutions Faster Than Brute Force
Esmer, Barış Can ; Kulik, Ariel ; Marx, Dániel ; et al.
Algorithmica
17th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics

0301 basic medicine FOS: Computer and inform... Fast Fourier Transform Generalized Convolution 0102 computer and inform... 01 natural sciences …
Fachzeitschrift
Zu den Favoriten
155

Structural and algorithmic aspects of identification problems in graphs
Algorithmique et structure des problèmes d'identification dans les graphes
Chakraborty, Dipayan ; Université Clermont Auvergne (UCA) ; Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS) ; et al.
Combinatorics [math.CO]. Université Clermont Auvergne, 2024. English. ⟨NNT : 2024UCFA0143⟩

Dominating set code number lower bound upper bound parameterized complexity NP-hardness …
Dissertation
Zu den Favoriten
156

Parameterized complexity of quantum knot invariants
Maria, Clément ; Understanding the Shape of Data (DATASHAPE) ; Centre Inria d'Université Côte d'Azur ; et al.
Symposium on Computational Geometry (SoCG), Jun 2021, Buffalo (NY), United States. ⟨10.4230/LIPIcs.SoCG.2021.53⟩

Buffalo (NY), United Sta... Mathematics of computing... Theory of computation →... Theory of computation →... quantum invariants parameterized complexity …
Konferenz
Zu den Favoriten
157

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; et al.
Lecture Notes in Computer Science ISBN: 9783031492747

Computational Geometry (... FOS: Computer and inform... Parameterized complexity Bend minimization Computer Science - Data... bend-minimization …
Fachzeitschrift
Zu den Favoriten
158

New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411)
Fomin, Fedor V. ; Marx, Dániel ; Saurabh, Saket ; et al.

fixed-parameter tractabi... intractability ddc:004 parameterized complexity
Fachzeitschrift
Zu den Favoriten
159

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
Ganian, Robert ; Khazaliya, Liana ; Inerney, Fionn Mc ; et al.

FOS: Computer and inform... Computer Science - Machi... Discrete Mathematics (cs... Machine Learning (stat.M... Computational Complexity... Non-Clashing Teaching …
Fachzeitschrift
Zu den Favoriten
160

Bridging Pattern-Aware Complexity with NP-Hard Optimization: A Unifying Framework and Empirical Study
Saidi, Olivier

FOS: Computer and inform... Solver Portfolio Computational Complexity Pattern Detection Adaptive Optimization Pattern-Aware Complexity …
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter