On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-18381-2_10
+Normal rank
@@ Property / OpenAlex ID @@
+W1560183925
@@ Property / OpenAlex ID: W1560183925 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of candidate control in elections and related digraph problems
+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: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
+Normal rank
@@ Property / cites work @@
+A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4397004
@@ Property / cites work: Q4397004 / rank @@
+Normal rank