Computing dense and sparse subgraphs of weakly closed graphs (Q6107896): Difference between revisions

@@ Property / cites work @@
+Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
+Normal rank
@@ Property / cites work @@
+Geodetic graphs of diameter two
@@ Property / cites work: Geodetic graphs of diameter two / 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 @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+A note on an induced subgraph characterization of domination perfect graphs
+Normal rank
@@ Property / cites work @@
+Finding large \(k\)-clubs in undirected graphs
@@ Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Bicolored independent sets and bicliques
@@ Property / cites work: Bicolored independent sets and bicliques / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
+Normal rank
@@ Property / cites work @@
+Dominating set is fixed parameter tractable in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and bipartite subgraph listing algorithms
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for edge biclique and related problems
+Normal rank
@@ Property / cites work @@
+Finding Cliques in Social Networks: A New Distribution-Free Model
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On independent sets and bicliques in graphs
@@ Property / cites work: On independent sets and bicliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity for Domination Problems on Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+Deciding First-Order Properties of Nowhere Dense Graphs
+Normal rank
@@ Property / cites work @@
+On structural parameterizations for the 2-club problem
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of maximal induced bicliques
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Essentially tight kernels for (weakly) closed graphs
+Normal rank
@@ Property / cites work @@
+Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
+Normal rank
@@ Property / cites work @@
+Detecting and enumerating small induced subgraphs in \(c\)-closed graphs
+Normal rank
@@ Property / cites work @@
+Multivariate algorithmics for finding cohesive subnetworks
+Normal rank
@@ Property / cites work @@
+Isolation concepts for efficiently enumerating dense subgraphs
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the             <i>k</i>             -Biclique Problem
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum edge biclique problem is NP-complete
@@ Property / cites work: The maximum edge biclique problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Parameterized computational complexity of finding small-diameter subgraphs
+Normal rank
@@ Property / cites work @@
+Q5284545
@@ Property / cites work: Q5284545 / rank @@
+Normal rank
@@ Property / cites work @@
+An induced subgraph characterization of domination perfect graphs
+Normal rank