The complexity of finding small separators in temporal graphs (Q2009634): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimal design of temporally connected graphs
+Normal rank
@@ Property / cites work @@
+Temporal Vertex Cover with a Sliding Time Window
@@ Property / cites work: Temporal Vertex Cover with a Sliding Time Window / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal flows in temporal networks
@@ Property / cites work: Temporal flows in temporal networks / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Size and the Approximability of Minimum Temporally Connected Subgraphs
+Normal rank
@@ Property / cites work @@
+Length-bounded cuts and flows
@@ Property / cites work: Length-bounded cuts and flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689807
@@ Property / cites work: Q5689807 / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster Editing in Multi-Layer and Temporal Graphs.
+Normal rank
@@ Property / cites work @@
+Most vital links and nodes in weighted networks
@@ Property / cites work: Most vital links and nodes in weighted networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5005137
@@ Property / cites work: Q5005137 / rank @@
+Normal rank
@@ Property / cites work @@
+On temporal graph exploration
@@ Property / cites work: On temporal graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Fractals for Kernelization Lower Bounds
@@ Property / cites work: Fractals for Kernelization Lower Bounds / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths of bounded length and their cuts: parameterized complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Connectivity and inference problems for temporal networks
+Normal rank
@@ Property / cites work @@
+Mengerian theorems for paths of bounded length
@@ Property / cites work: Mengerian theorems for paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal Network Optimization Subject to Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Traveling salesman problems in temporal graphs
@@ Property / cites work: Traveling salesman problems in temporal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Interdiction problems on planar graphs
@@ Property / cites work: Interdiction problems on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing maximal cliques in link streams
@@ Property / cites work: Computing maximal cliques in link streams / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Finding Small Separators in Temporal Graphs
+Normal rank