On the parameterized complexity of the edge monitoring problem (Q509893): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2017.01.008
@@ Property / DOI: 10.1016/j.ipl.2017.01.008 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2017.01.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2583078788
@@ Property / OpenAlex ID: W2583078788 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Linearity of grid minors in treewidth with applications through bidimensionality
+Normal rank
@@ Property / cites work @@
+Q5501345
@@ Property / cites work: Q5501345 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+The extremal function for complete minors
@@ Property / cites work: The extremal function for complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction obstructions for treewidth
@@ Property / cites work: Contraction obstructions for treewidth / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2017.01.008
@@ Property / DOI: 10.1016/J.IPL.2017.01.008 / rank @@
+Normal rank