A survey of parameterized algorithms and the complexity of edge modification (Q6158862): Difference between revisions

@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness results for edge modification problems
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster graph modification problems
@@ Property / cites work: Cluster graph modification problems / rank @@
+Normal rank
@@ Property / cites work @@
+The splittance of a graph
@@ Property / cites work: The splittance of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining planarity by contracting few edges
@@ Property / cites work: Obtaining planarity by contracting few edges / rank @@
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for bipartite contraction
@@ Property / cites work: A faster FPT algorithm for bipartite contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining split graphs by edge contraction
@@ Property / cites work: Obtaining split graphs by edge contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining a Bipartite Graph by Contracting Few Edges
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549636
@@ Property / cites work: Q3549636 / rank @@
+Normal rank
@@ Property / cites work @@
+Wheel-Free Deletion Is W[2]-Hard
@@ Property / cites work: Wheel-Free Deletion Is W[2]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Exploring the Subexponential Complexity of Completion Problems
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for trivially perfect editing
@@ Property / cites work: A polynomial kernel for trivially perfect editing / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank @@
+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 @@
+Polynomial kernels for proper interval completion and related problems
+Normal rank
@@ Property / cites work @@
+On the threshold of intractability
@@ Property / cites work: On the threshold of intractability / rank @@
+Normal rank
@@ Property / cites work @@
+(Sub)linear kernels for edge modification problems toward structured graph classes
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for paw-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Q6168461
@@ Property / cites work: Q6168461 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial kernelization for removing induced claws and diamonds
+Normal rank
@@ Property / cites work @@
+A \(2k\) kernel for the cluster editing problem
@@ Property / cites work: A \(2k\) kernel for the cluster editing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster editing: kernelization based on edge cuts
@@ Property / cites work: Cluster editing: kernelization based on edge cuts / rank @@
+Normal rank
@@ Property / cites work @@
+On Generating Triangle-Free Graphs
@@ Property / cites work: On Generating Triangle-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Kernel for Line Graph Deletion
@@ Property / cites work: A Polynomial Kernel for Line Graph Deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for diamond-free editing
@@ Property / cites work: A polynomial kernel for diamond-free editing / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel for \(K_t\)\textsc{-free Edge Deletion}
@@ Property / cites work: Kernel for \(K_t\)\textsc{-free Edge Deletion} / rank @@
+Normal rank
@@ Property / cites work @@
+Incompressibility of \(H\)-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+Efficient Parameterized Preprocessing for Cluster Editing
+Normal rank
@@ Property / cites work @@
+Two edge modification problems without polynomial kernels
+Normal rank
@@ Property / cites work @@
+BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
+Normal rank
@@ Property / cites work @@
+Complexity and parameterized algorithms for cograph editing
+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 @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
+Normal rank
@@ Property / cites work @@
+Cluster Editing
@@ Property / cites work: Cluster Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-modeled data clustering: Exact algorithms for clique generation
+Normal rank
@@ Property / cites work @@
+A more effective linear kernelization for cluster editing
+Normal rank
@@ Property / cites work @@
+Even faster parameterized cluster deletion and cluster editing
+Normal rank
@@ Property / cites work @@
+A golden ratio parameterized algorithm for cluster editing
+Normal rank
@@ Property / cites work @@
+Parameterizing edge modification problems above lower bounds
+Normal rank
@@ Property / cites work @@
+Kernelization for cycle transversal problems
@@ Property / cites work: Kernelization for cycle transversal problems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge deletion problems: branching facilitated by modular decomposition
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Approximation and Kernelization for Chordal Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal deletion is fixed-parameter tractable
@@ Property / cites work: Chordal deletion is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Completion Is Fixed Parameter Tractable
@@ Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Recognition of Almost Interval Graphs
@@ Property / cites work: Linear Recognition of Almost Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for I             <scp>nterval</scp>             C             <scp>ompletion</scp>
+Normal rank
@@ Property / cites work @@
+Interval Vertex Deletion Admits a Polynomial Kernel
+Normal rank
@@ Property / cites work @@
+Interval Deletion Is Fixed-Parameter Tractable
@@ Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+On Graph Powers for Leaf-Labeled Trees
@@ Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Error compensation in leaf power problems
@@ Property / cites work: Error compensation in leaf power problems / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for 3-leaf power graph modification problems
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Closest 4-leaf power is fixed-parameter tractable
@@ Property / cites work: Closest 4-leaf power is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for distance-hereditary vertex deletion
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XI: Circuits on a surface
@@ Property / cites work: Graph minors. XI: Circuits on a surface / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579375
@@ Property / cites work: Q3579375 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+Edge bipartization faster than \(2^k\)
@@ Property / cites work: Edge bipartization faster than \(2^k\) / rank @@
+Normal rank
@@ Property / cites work @@
+Compression via Matroids
@@ Property / cites work: Compression via Matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Parameterized Algorithms for Co-path Set Problem
+Normal rank
@@ Property / cites work @@
+Proper interval vertex deletion
@@ Property / cites work: Proper interval vertex deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex deletion into perfect graph classes
+Normal rank
@@ Property / cites work @@
+What’s Next? Future Directions in Parameterized Complexity
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Fast FAST
@@ Property / cites work: Fast FAST / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability results for feedback set problems in tournaments
+Normal rank
@@ Property / cites work @@
+Kernels for feedback arc set in tournaments
@@ Property / cites work: Kernels for feedback arc set in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for \textsc{Minimum Fill-in}
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Listing all potential maximal cliques of a graph
@@ Property / cites work: Listing all potential maximal cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Cluster editing with locally bounded modifications
+Normal rank
@@ Property / cites work @@
+Fast biclustering by dual parameterization
@@ Property / cites work: Fast biclustering by dual parameterization / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
+Normal rank
@@ Property / cites work @@
+Editing Simple Graphs
@@ Property / cites work: Editing Simple Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dichotomy Results on the Hardness of $H$-free Edge Modification Problems
+Normal rank
@@ Property / cites work @@
+Tight bounds for parameterized complexity of cluster editing with a small number of clusters
+Normal rank
@@ Property / cites work @@
+A Subexponential Parameterized Algorithm for Proper Interval Completion
+Normal rank
@@ Property / cites work @@
+On the Clique Editing Problem
@@ Property / cites work: On the Clique Editing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing rank of the adjacency matrix by graph modification
+Normal rank
@@ Property / cites work @@
+Rank reduction of oriented graphs by vertex and edge deletions
+Normal rank
@@ Property / cites work @@
+Minimum fill-in: inapproximability and almost tight lower bounds
+Normal rank
@@ Property / cites work @@
+Unit interval editing is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for             <i>H</i>             -free Edge Modification Problems
+Normal rank
@@ Property / cites work @@
+Lower bounds for kernelizations and other preprocessing procedures
+Normal rank
@@ Property / cites work @@
+Diminishable parameterized problems and strict polynomial kernelization
+Normal rank
@@ Property / cites work @@
+Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
+Normal rank
@@ Property / cites work @@
+A cubic-vertex kernel for flip consensus tree
@@ Property / cites work: A cubic-vertex kernel for flip consensus tree / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Bicluster Editing
@@ Property / cites work: Improved Algorithms for Bicluster Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithm for \textsc{Bicluster Editing}
+Normal rank
@@ Property / cites work @@
+Two-Layer Planarization: Improving on Parameterized Algorithmics
+Normal rank
@@ Property / cites work @@
+A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
+Normal rank
@@ Property / cites work @@
+Parameterized analysis and crossing minimization problems
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Tractability of König edge deletion problems
@@ Property / cites work: Tractability of König edge deletion problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small stabilizers for unstable graphs
@@ Property / cites work: Finding small stabilizers for unstable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Simple and improved parameterized algorithms for multiterminal cuts
+Normal rank
@@ Property / cites work @@
+An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem
+Normal rank
@@ Property / cites work @@
+Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
+Normal rank
@@ Property / cites work @@
+Parameterized Tractability of Multiway Cut with Parity Constraints
+Normal rank
@@ Property / cites work @@
+Odd Multiway Cut in Directed Acyclic Graphs
@@ Property / cites work: Odd Multiway Cut in Directed Acyclic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+Q3549698
@@ Property / cites work: Q3549698 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+An FPT algorithm for edge subset feedback edge set
+Normal rank
@@ Property / cites work @@
+Multi-budgeted directed cuts
@@ Property / cites work: Multi-budgeted directed cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimax Theorem for Directed Graphs
@@ Property / cites work: A Minimax Theorem for Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and data reduction for multicut in trees
+Normal rank
@@ Property / cites work @@
+Multicut Is FPT
@@ Property / cites work: Multicut Is FPT / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+FPT Inapproximability of Directed Cut and Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity dichotomy for \textsc{Steiner Multicut}
+Normal rank
@@ Property / cites work @@
+Paths of bounded length and their cuts: parameterized complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Fractals for Kernelization Lower Bounds
@@ Property / cites work: Fractals for Kernelization Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of length-bounded cuts and multicuts
+Normal rank
@@ Property / cites work @@
+A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
+Normal rank
@@ Property / cites work @@
+Length-bounded cuts: proper interval graphs and structural parameters
+Normal rank
@@ Property / cites work @@
+On Algorithms Employing Treewidth for $L$-bounded Cut Problems
+Normal rank
@@ Property / cites work @@
+Metric violation distance: hardness and approximation
+Normal rank
@@ Property / cites work @@
+Generalized Metric Repair on Graphs
@@ Property / cites work: Generalized Metric Repair on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering with local restrictions
@@ Property / cites work: Clustering with local restrictions / rank @@
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Cutting a Few Vertices from a Graph
+Normal rank
@@ Property / cites work @@
+Minimum Bisection Is Fixed-Parameter Tractable
@@ Property / cites work: Minimum Bisection Is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Computing Graph Bisections
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for min-max multiway cut and list digraph homomorphism
+Normal rank
@@ Property / cites work @@
+List H-coloring a graph by removing few vertices
@@ Property / cites work: List H-coloring a graph by removing few vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Q2843923
@@ Property / cites work: Q2843923 / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Finding small separators in linear time via treewidth reduction
+Normal rank
@@ Property / cites work @@
+Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
+Normal rank
@@ Property / cites work @@
+Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
+Normal rank
@@ Property / cites work @@
+Q4320674
@@ Property / cites work: Q4320674 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of vertex integrity and component order connectivity
+Normal rank
@@ Property / cites work @@
+Q3775581
@@ Property / cites work: Q3775581 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3032280
@@ Property / cites work: Q3032280 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Component order connectivity in directed graphs
@@ Property / cites work: Component order connectivity in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-integrity: A survey
@@ Property / cites work: Edge-integrity: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Measuring the vulnerability for classes of intersection graphs
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum augmentation of any graph to aK-edge-connected graph
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Augmenting Undirected Node-Connectivity by One
@@ Property / cites work: Augmenting Undirected Node-Connectivity by One / rank @@
+Normal rank
@@ Property / cites work @@
+Independence free graphs and vertex connectivity augmentation
+Normal rank
@@ Property / cites work @@
+An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
+Normal rank
@@ Property / cites work @@
+Kernelization and complexity results for connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms to Preserve Connectivity
@@ Property / cites work: Parameterized Algorithms to Preserve Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Highly Connected Subgraphs
@@ Property / cites work: Finding Highly Connected Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar disjoint-paths completion
@@ Property / cites work: Planar disjoint-paths completion / rank @@
+Normal rank
@@ Property / cites work @@
+Path-contractions, edge deletions and connectivity preservation
+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 @@
+On the complexity of multi-parameterized cluster editing
+Normal rank
@@ Property / cites work @@
+Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
+Normal rank
@@ Property / cites work @@
+Clustering to Given Connectivities
@@ Property / cites work: Clustering to Given Connectivities / rank @@
+Normal rank
@@ Property / cites work @@
+Going weighted: parameterized algorithms for cluster editing
+Normal rank
@@ Property / cites work @@
+Parameterized dynamic cluster editing
@@ Property / cites work: Parameterized dynamic cluster editing / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster Editing in Multi-Layer and Temporal Graphs.
+Normal rank
@@ Property / cites work @@
+A new temporal interpretation of cluster editing
@@ Property / cites work: A new temporal interpretation of cluster editing / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Editing graphs to satisfy degree constraints: a parameterized approach
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding whether a planar graph has a cubic subgraph is NP-complete
+Normal rank
@@ Property / cites work @@
+Finding regular subgraphs in both arbitrary and planar graphs
+Normal rank
@@ Property / cites work @@
+On locating cubic subgraphs in bounded-degree connected bipartite graphs
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of editing graphs for bounded degeneracy
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractable distances to sparse graph classes
+Normal rank
@@ Property / cites work @@
+Editing to a graph of given degrees
@@ Property / cites work: Editing to a graph of given degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Win-win kernelization for degree sequence completion problems
+Normal rank
@@ Property / cites work @@
+Editing to a planar graph of given degrees
@@ Property / cites work: Editing to a planar graph of given degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Editing to a connected graph of given degrees
@@ Property / cites work: Editing to a connected graph of given degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
+Normal rank
@@ Property / cites work @@
+Optimal covering of cacti by vertex-disjoint paths
+Normal rank
@@ Property / cites work @@
+Editing to Connected F-Degree Graph
@@ Property / cites work: Editing to Connected F-Degree Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A parameterized algorithmics framework for degree sequence completion problems in directed graphs
+Normal rank
@@ Property / cites work @@
+Graph editing problems with extended regularity constraints
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+The spanning subgraphs of eulerian graphs
@@ Property / cites work: The spanning subgraphs of eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Eulerian exposition
@@ Property / cites work: An Eulerian exposition / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Eulerian Extension and Rural Postman
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Editing to Eulerian graphs
@@ Property / cites work: Editing to Eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of even/odd subgraph problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of Eulerian deletion problems
+Normal rank
@@ Property / cites work @@
+Finding even subgraphs even faster
@@ Property / cites work: Finding even subgraphs even faster / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Deficiency of Housing Markets with Duplicate Houses
+Normal rank
@@ Property / cites work @@
+Parameterized Eulerian strong component arc deletion problem on tournaments
+Normal rank
@@ Property / cites work @@
+On Eulerian extensions and their application to no-wait flowshop scheduling
+Normal rank
@@ Property / cites work @@
+From Few Components to an Eulerian Graph by Adding Arcs
+Normal rank
@@ Property / cites work @@
+A new view on rural postman based on Eulerian extension and matching
+Normal rank
@@ Property / cites work @@
+Social Network Data Analytics
@@ Property / cites work: Social Network Data Analytics / rank @@
+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 @@
+Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
+Normal rank
@@ Property / cites work @@
+A refined complexity analysis of degree anonymization in graphs
+Normal rank
@@ Property / cites work @@
+The complexity of degree anonymization by vertex addition
+Normal rank
@@ Property / cites work @@
+The complexity of degree anonymization by graph contractions
+Normal rank
@@ Property / cites work @@
+Graph editing to a given degree sequence
@@ Property / cites work: Graph editing to a given degree sequence / rank @@
+Normal rank
@@ Property / cites work @@
+NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Can we create large \(k\)-cores by adding few edges?
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+The parametric complexity of graph diameter augmentation
+Normal rank
@@ Property / cites work @@
+Augmenting graphs to minimize the diameter
@@ Property / cites work: Augmenting graphs to minimize the diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009489
@@ Property / cites work: Q5009489 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for outerplanar diameter improvement
+Normal rank
@@ Property / cites work @@
+Variants of Plane Diameter Completion
@@ Property / cites work: Variants of Plane Diameter Completion / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027169
@@ Property / cites work: Q4027169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5403059
@@ Property / cites work: Q5403059 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545293
@@ Property / cites work: Q5545293 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width and vertex-minors
@@ Property / cites work: Rank-width and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Partial complementation of graphs
@@ Property / cites work: Partial complementation of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Structured Connectivity Augmentation
@@ Property / cites work: Structured Connectivity Augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Modification to Planarity is Fixed Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Flips in planar graphs
@@ Property / cites work: Flips in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Flip distance between two triangulations of a point set is NP-complete
+Normal rank
@@ Property / cites work @@
+Flip distance between triangulations of a planar point set is APX-hard
+Normal rank
@@ Property / cites work @@
+Q4942049
@@ Property / cites work: Q4942049 / rank @@
+Normal rank
@@ Property / cites work @@
+Rotation distance is fixed-parameter tractable
@@ Property / cites work: Rotation distance is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Rotation Distance, Triangulations, and Hyperbolic Geometry
+Normal rank
@@ Property / cites work @@
+An improved kernel size for rotation distance in binary trees
+Normal rank
@@ Property / cites work @@
+Computing the flip distance between triangulations
+Normal rank
@@ Property / cites work @@
+An improved FPT algorithm for the flip distance problem
+Normal rank
@@ Property / cites work @@
+Q4931752
@@ Property / cites work: Q4931752 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized aspects of strong subgraph closure
@@ Property / cites work: Parameterized aspects of strong subgraph closure / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation of strong triadic closure and cluster deletion
+Normal rank
@@ Property / cites work @@
+Your rugby mates don't need to know your colleagues: triadic closure with edge colors
+Normal rank
@@ Property / cites work @@
+Destroying Bicolored $P_3$s by Deleting Few Edges
@@ Property / cites work: Destroying Bicolored $P_3$s by Deleting Few Edges / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of graph modification to first-order logic properties
+Normal rank