Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2410736468
@@ Property / OpenAlex ID: W2410736468 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03268
@@ Property / arXiv ID: 1606.03268 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of dynamic problems
+Normal rank
@@ Property / cites work @@
+Finding large degree-anonymous subgraphs is hard
@@ Property / cites work: Finding large degree-anonymous subgraphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Clustering with partial information
@@ Property / cites work: Clustering with partial information / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of degree anonymization by vertex addition
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Approach to a Communications Problem
+Normal rank
@@ Property / cites work @@
+Editing Simple Graphs
@@ Property / cites work: Editing Simple Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of consensus clustering
+Normal rank
@@ Property / cites work @@
+Local search: is brute-force avoidable?
@@ Property / cites work: Local search: is brute-force avoidable? / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-based data clustering with overlaps
@@ Property / cites work: Graph-based data clustering with overlaps / rank @@
+Normal rank
@@ Property / cites work @@
+Win-win kernelization for degree sequence completion problems
+Normal rank
@@ Property / cites work @@
+Graph-modeled data clustering: Exact algorithms for clique generation
+Normal rank
@@ Property / cites work @@
+A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing
+Normal rank
@@ Property / cites work @@
+A refined complexity analysis of degree anonymization in graphs
+Normal rank
@@ Property / cites work @@
+Incremental list coloring of graphs, parameterized by conservation
+Normal rank
@@ Property / cites work @@
+The Complexity of Degree Anonymization by Graph Contractions
+Normal rank
@@ Property / cites work @@
+A clustering algorithm based on graph connectivity
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms in computational molecular biology
+Normal rank
@@ Property / cites work @@
+On Editing Graphs into 2-Club Clusters
@@ Property / cites work: On Editing Graphs into 2-Club Clusters / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of vertex packing and independence system polyhedra
+Normal rank