Showing 1 - 20 of 5,287

1

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages
Campos, Victor ; Costa, Jonas ; Lopes, Raul ; et al.
ACM Transactions on Algorithms. 21(3):1-28

Bramble Parameterized complexity Matroids Directed disjoint paths Half-integral linkage Min-max relation
Journal
Save to List
2

Correcting a graph into a linegraph minimizing hamming distance edition is NP-complete and FPT by treewidth
Barth, Dominique ; Watel, Dimitri ; Weisser, Marc-Antoine ; et al.
Journal of Graph Algorithms and Applications. 29(1):63-90

Linegraphs Graph Hypergraph Graph edit distance Parameterized complexity [INFO]Computer Science [...
Journal
Save to List
3

The Parameterized Complexity of Local Search for Multi-objective TSP
Baste, Julien ; Jourdan, Laetitia ; Kessaci, Marie-Eléonore ; et al.
European Symposium on Algorithms (Submitted), Sep 2025, Varsovie, Poland

Varsovie, Poland Multi-Objective Parameterized Complexity Traveling Salesperson Pr... Local Search Fixed-Parameter Tractabl...
Conference
Save to List
4

Fast winning strategies for the attacker in eternal domination
Bagan, Guillaume ; Bousquet, Nicolas ; Oijid, Nacim ; et al.
Graph-Theoretic Concepts in Computer Science WG 2024. :21-34

parameterized complexity PSPACE-completeness tree-depth eternal dominating set [INFO]Computer Science [... [MATH]Mathematics [math]
Journal
Save to List
5

Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Christodoulou, Filippos ; Marino, Andrea ; Silva, Ana ; et al.
IWOCA 2024 - 35th International Workshop on Combinatorial Algorithms. :247-258

Ischia, Italy Temporal graphs Eulerian trails Temporal coloring Firefighter Parameterized complexity
Conference
Save to List
6

On the Complexity of 2-Club Cluster Editing with Vertex Splitting ⋆
Abu-Khzam, Faisal ; Davot, Tom ; Isenmann, Lucas ; et al.
31st International Computing and Combinatorics Conference. :3-14

Chengdu, China Parameterized Complexity Vertex Splitting 2-Club Cluster Vertex Sp... 2-Club Cluster Edge Dele... Cluster Editing
Conference
Save to List
7

Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable
Cunha, Luís Felipe I. ; Sau, Ignasi ; Souza, Uéverton ; et al.
ICALP 2025 - 52nd International Colloquium on Automata. :63-63

Aarhus, Denmark Rotation distance Parameterized complexity... Combinatorics Graph associahedra Elimination tree
Conference
Save to List
8

The Parameterized Complexity of Local Search for MO-TSP
Baste, Julien ; Jourdan, Laetitia ; Kessaci, Marie-Eléonore ; et al.
26ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2025, Champs-sur-Marne, France

Champs-sur-Marne, France running time local search parameterized complexity [INFO]Computer Science [...
Conference
Save to List
9

An Algorithmic Framework for Locally Constrained Homomorphisms
Bulteau, Laurent ; Dabrowski, Konrad ; Köhler, Noleen ; et al.
SIAM Journal on Discrete Mathematics. 38(2):1315-1350

(locally constrained) gr... (locally constrained) gr... parameterized complexity fracture number [INFO]Computer Science [...
Journal
Save to List
10

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
Binucci C. ; Liotta G. ; Montecchiani F. ; et al.
Journal of Graph Algorithms and Applications. 29:247-266

graph drawing Computational Geometry (... FOS: Computer and inform... st-orientations Computer Science - Data... Computer Science - Compu...
Academic journal
Save to List
11

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
Blažej, Václav ; Jana, Satyabrata ; Ramanujan, M. S. ; et al.
Algorithmica. 87:1669-1709

FOS: Computer and inform... Parameterized complexity Data Structures and Algo... Treewidth Data Structures and Algo... ddc:004
Academic journal
Save to List
12

Revisiting Directed Disjoint Paths on Tournaments (And Relatives)
de C. M. Gomes, Guilherme ; Lopes, Raul ; Sau, Ignasi ; et al.
ICALP 2025 - 52nd International Colloquium on Automata. :90-90

Aarhus, Denmark Tournaments Directed pathwidth Semicomplete digraphs Directed disjoint paths Congestion
Conference
Save to List
13

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
Focke, Jacob ; Hörsch, Florian ; Li, Shaohua ; et al.
Discrete & Computational Geometry. :1-60

Academic journal
Save to List
14

Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
Emmanuel Arrighi ; Niels Grüttemeier ; Nils Morawietz ; et al.
Discrete Applied Mathematics. 378:102-119

Minor containment Parameterized complexity Temporal graphs Minor-free FPT-algorithm Induced subgraph contain...
Academic journal
Save to List
15

FPT implicit enumeration of active schedules
Tarhan, İstenç ; Hanen, Claire, C. ; Munier-Kordon, Alix ; et al.
Discrete Applied Mathematics. 376:235-250

Scheduling Parameterized complexity Active schedules Fixed parameter tractabl... [INFO]Computer Science [...
Journal
Save to List
16

RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs
Boury, Théo ; Gardelle, Samuel ; Bulteau, Laurent ; et al.
Algorithms for Molecular Biology. 20(1):20-20

RNA structure String Design Parameterized Complexity Uniform Sampling [INFO.INFO-BI]Computer S... Bioinformatics [q-bio.QM...
Journal
Save to List
17

Eliminating Majority Illusion
Fioravantes, Foivos ; Lahiri, Abhiruk ; Lauerbach, Antonio ; et al.

Social netwoks Parameterized Complexity Approximation Algorithms [INFO.INFO-DM]Computer S... Discrete Mathematics [cs... [INFO.INFO-AI]Computer S...
Electronic Resource
Save to List
18

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
Bodlaender, Hans, L. ; Groenland, Carla ; Jacob, Hugo ; et al.
Algorithmica, In press, IPEC 2022, ⟨10.1007/s00453-024-01274-9⟩

Parameterized complexity XNLP Linear clique-width Pathwidth Linear mim-width Bandwidth
Journal
Save to List
19

FPT algorithms for packing k-safe spanning rooted sub(di)graphs
Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna ; et al.
Discrete Applied Mathematics. 346:80-94

Digraphs Packing problems Arborescences Branching flows Safe spanning trees Parameterized complexity
Journal
Save to List
20

Bandwidth Parameterized by Cluster Vertex Deletion Number
Tatsuya Gima ; Eun Jung Kim ; Noleen Köhler ; et al.
Algorithmica. 87:1146-1177

FOS: Computer and inform... Parameterized complexity Computer Science - Compu... Bandwidth Computer Science - Data... Data Structures and Algo...
Academic journal
Save to List

Filter