Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032): Difference between revisions

@@ Property / cites work @@
+Reordering Buffer Management with Advice
@@ Property / cites work: Reordering Buffer Management with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+Online makespan minimization with parallel schedules
+Normal rank
@@ Property / cites work @@
+The greedy algorithm is optimal for on-line edge coloring
+Normal rank
@@ Property / cites work @@
+Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+A new measure for the study of on-line algorithms
@@ Property / cites work: A new measure for the study of on-line algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Online coloring of bipartite graphs with and without advice
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the k-Server Problem
@@ Property / cites work: On the Advice Complexity of the k-Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of Online Problems
@@ Property / cites work: On the Advice Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The online knapsack problem: advice and randomization
+Normal rank
@@ Property / cites work @@
+Competitive paging with locality of reference
@@ Property / cites work: Competitive paging with locality of reference / rank @@
+Normal rank
@@ Property / cites work @@
+Q2954988
@@ Property / cites work: Q2954988 / rank @@
+Normal rank
@@ Property / cites work @@
+On the list update problem with advice
@@ Property / cites work: On the list update problem with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Q2965482
@@ Property / cites work: Q2965482 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved edge-coloring algorithms for planar graphs
+Normal rank
@@ Property / cites work @@
+New linear-time algorithms for edge-coloring planar graphs
+Normal rank
@@ Property / cites work @@
+Online Graph Exploration with Advice
@@ Property / cites work: Online Graph Exploration with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+Advice complexity of maximum independent set in sparse and bipartite graphs
+Normal rank
@@ Property / cites work @@
+Measuring the problem-relevant information in input
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity of Online Coloring for Paths
@@ Property / cites work: Advice Complexity of Online Coloring for Paths / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875207
@@ Property / cites work: Q4875207 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Competitive Analysis
@@ Property / cites work: Beyond Competitive Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010309
@@ Property / cites work: Q4010309 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms with advice for bin packing and scheduling problems
+Normal rank
@@ Property / cites work @@
+Advice Complexity of the Online Coloring Problem
@@ Property / cites work: Advice Complexity of the Online Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3118960
@@ Property / cites work: Q3118960 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Coloring and f-Coloring for Various Classes of Graphs
+Normal rank