Temporal vertex cover with a sliding time window (Q2009637): Difference between revisions

@@ Property / author @@
-Q1125794
@@ Property / author: Q1125794 / rank @@
-Normal rank
@@ Property / author @@
-Victor Zamaraev
@@ Property / author: Victor Zamaraev / rank @@
-Normal rank
@@ Property / author @@
+Paul G. Spirakis
@@ Property / author: Paul G. Spirakis / rank @@
+Normal rank
@@ Property / author @@
+Victor Zamaraev
@@ Property / author: Victor Zamaraev / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+cliques
@@ Property / describes a project that uses: cliques / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963993884
@@ Property / OpenAlex ID: W2963993884 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07103
@@ Property / arXiv ID: 1802.07103 / rank @@
+Normal rank
@@ Property / cites work @@
+DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of optimal design of temporally connected graphs
+Normal rank
@@ Property / cites work @@
+How fast can we reach a target vertex in stochastic temporal graphs
+Normal rank
@@ Property / cites work @@
+The temporal explorer who returns to the base
@@ Property / cites work: The temporal explorer who returns to the base / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal Vertex Cover with a Sliding Time Window
@@ Property / cites work: Temporal Vertex Cover with a Sliding Time Window / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Flooding Time of Edge-Markovian Evolving Graphs
@@ Property / cites work: Flooding Time of Edge-Markovian Evolving Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems as Hard as CNF-SAT
@@ Property / cites work: On Problems as Hard as CNF-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of barrier coverage with relocatable sensors in the plane
+Normal rank
@@ Property / cites work @@
+On temporal graph exploration
@@ Property / cites work: On temporal graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Exploration of Periodically Varying Graphs
@@ Property / cites work: Exploration of Periodically Varying Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Rumor Spreading in Dynamic Graphs
@@ Property / cites work: Randomized Rumor Spreading in Dynamic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed algorithms for barrier coverage using relocatable sensors
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Connectivity and inference problems for temporal networks
+Normal rank
@@ Property / cites work @@
+Discovering recurring activity in temporal networks
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal network optimization subject to connectivity constraints
+Normal rank
@@ Property / cites work @@
+Sliding window temporal graph coloring
@@ Property / cites work: Sliding window temporal graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling salesman problems in temporal graphs
@@ Property / cites work: Traveling salesman problems in temporal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient fixed-parameter algorithm for 3-hitting set
+Normal rank
@@ Property / cites work @@
+Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+Q4258215
@@ Property / cites work: Q4258215 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing maximal cliques in link streams
@@ Property / cites work: Computing maximal cliques in link streams / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127350233
@@ Property / Wikidata QID: Q127350233 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2009637