Q5091168 (Q5091168): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.ICALP.2019.19
@@ Property / DOI: 10.4230/LIPIcs.ICALP.2019.19 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
+Normal rank
@@ Property / cites work @@
+Better Approximations for Tree Sparsity in Nearly-Linear Time
+Normal rank
@@ Property / cites work @@
+Fast algorithms for knapsack via convolution and prediction
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
+Normal rank
@@ Property / cites work @@
+The union-closed sets conjecture almost holds for almost all random bipartite graphs
+Normal rank
@@ Property / cites work @@
+Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
+Normal rank
@@ Property / cites work @@
+On Problems Equivalent to (min,+)-Convolution
@@ Property / cites work: On Problems Equivalent to (min,+)-Convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607934
@@ Property / cites work: Q4607934 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Configuration-LP of the Restricted Assignment Problem
+Normal rank
@@ Property / cites work @@
+A Faster Pseudopolynomial Time Algorithm for Subset Sum
+Normal rank
@@ Property / cites work @@
+Q5111351
@@ Property / cites work: Q5111351 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Knapsack Problems with Bounded Weights
+Normal rank
@@ Property / cites work @@
+Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
+Normal rank
@@ Property / cites work @@
+The concave least-weight subsequence problem revisited
+Normal rank
@@ Property / cites work @@
+Faster all-pairs shortest paths via circuit complexity
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ICALP.2019.19
@@ Property / DOI: 10.4230/LIPICS.ICALP.2019.19 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5091168