Filling crosswords is very hard (Q6199399): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2023.114275
+Normal rank
@@ Property / OpenAlex ID @@
+W3199786338
@@ Property / OpenAlex ID: W3199786338 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Maximum matching of given weight in complete and complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank