Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2013.12.011
@@ Property / DOI: 10.1016/j.tcs.2013.12.011 / rank @@
-Normal rank
@@ Property / author @@
-Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
-Normal rank
@@ Property / author @@
+Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
+Normal rank
@@ 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.1016/j.tcs.2013.12.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1986069448
@@ Property / OpenAlex ID: W1986069448 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829009
@@ Property / cites work: Q4829009 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Improved parameterized set splitting algorithms: A Probabilistic approach
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+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 @@
+Improved Deterministic Algorithms for Weighted Matching and Packing Problems
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+A parameterized perspective on packing paths of length two
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum triangle packing
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank
@@ Property / cites work @@
+Maximum bounded \(H\)-matching is Max SNP-complete
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Q4385515
@@ Property / cites work: Q4385515 / rank @@
+Normal rank
@@ Property / cites work @@
+The P k Partition Problem and Related Problems in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Looking at the stars
@@ Property / cites work: Looking at the stars / rank @@
+Normal rank
@@ Property / cites work @@
+An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
+Normal rank
@@ Property / cites work @@
+An Improved Parameterized Algorithm for a Generalized Matching Problem
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.12.011
@@ Property / DOI: 10.1016/J.TCS.2013.12.011 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:393902