Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218): Difference between revisions

@@ Property / cites work @@
+Q4228508
@@ Property / cites work: Q4228508 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
+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 @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
+Normal rank
@@ Property / cites work @@
+Q3070898
@@ Property / cites work: Q3070898 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q4471994
@@ Property / cites work: Q4471994 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing maps with advice
@@ Property / cites work: Drawing maps with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Measuring the problem-relevant information in input
+Normal rank
@@ Property / cites work @@
+Semi-online preemptive scheduling: one algorithm for all variants
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+On-line models and algorithms for max independent set
+Normal rank
@@ Property / cites work @@
+Distributed computing with advice: information sensitivity of graph coloring
+Normal rank
@@ Property / cites work @@
+Tree exploration with advice
@@ Property / cites work: Tree exploration with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Communication algorithms with advice
@@ Property / cites work: Communication algorithms with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Local MST computation with short advice
@@ Property / cites work: Local MST computation with short advice / rank @@
+Normal rank
@@ Property / cites work @@
+Trade-offs between the size of advice and broadcasting time in trees
+Normal rank
@@ Property / cites work @@
+On-line and first fit colorings of graphs
@@ Property / cites work: On-line and first fit colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252408
@@ Property / cites work: Q4252408 / rank @@
+Normal rank
@@ Property / cites work @@
+Online independent sets.
@@ Property / cites work: Online independent sets. / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast radio broadcasting with advice
@@ Property / cites work: Fast radio broadcasting with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Colorings
@@ Property / cites work: Graph Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128889
@@ Property / cites work: Q3128889 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank