On the public citation graph

Temporal vertex cover with a sliding time window

0 signed · 102 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.2000.1727openalex-snapshot
On the Complexity of k-SAT
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/978-3-030-17402-6_2openalex-snapshot
The Temporal Explorer Who Returns to the Base
inferredcites →https://doi.org/10.1007/978-3-319-12340-0_3openalex-snapshot
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
inferredcites →https://doi.org/10.1007/978-3-319-21275-3_14openalex-snapshot
Lower Bounds Based on the Exponential-Time Hypothesis
inferredcites →https://doi.org/10.1007/978-3-319-28472-9_3openalex-snapshot
Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors
inferredcites →https://doi.org/10.1007/978-3-319-71249-9_42openalex-snapshot
The Network-Untangling Problem: From Interactions to Activity Timelines
inferredcites →https://doi.org/10.1007/978-3-319-72150-7_42openalex-snapshot
On Mining Temporal Patterns in Dynamic Graphs, and Other Unrelated Problems
inferredcites →https://doi.org/10.1007/978-3-642-10631-6_55openalex-snapshot
Exploration of Periodically Varying Graphs
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_42openalex-snapshot
Randomized Rumor Spreading in Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_36openalex-snapshot
On Temporal Graph Exploration
inferredcites →https://doi.org/10.1007/s00224-017-9757-xopenalex-snapshot
The Complexity of Optimal Design of Temporally Connected Graphs
inferredcites →https://doi.org/10.1007/s00446-016-0267-xopenalex-snapshot
Distributed algorithms for barrier coverage using relocatable sensors
inferredcites →https://doi.org/10.1007/s00453-018-0478-6openalex-snapshot
Temporal Network Optimization Subject to Connectivity Constraints
inferredcites →https://doi.org/10.1007/s10618-017-0515-0openalex-snapshot
Discovering recurring activity in temporal networks
inferredcites →https://doi.org/10.1007/s13278-017-0455-0openalex-snapshot
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2020.05.005openalex-snapshot
How fast can we reach a target vertex in stochastic temporal graphs?
inferredcites →https://doi.org/10.1016/j.jcss.2021.01.007openalex-snapshot
Deleting edges to restrict the size of an epidemic in temporal networks
inferredcites →https://doi.org/10.1016/j.jnca.2011.11.016openalex-snapshot
A survey on coverage and connectivity issues in wireless sensor networks
inferredcites →https://doi.org/10.1016/j.jpdc.2015.10.002openalex-snapshot
Ephemeral networks with random availability of links: The case of fast networks
inferredcites →https://doi.org/10.1016/j.tcs.2015.02.006openalex-snapshot
Complexity of barrier coverage with relocatable sensors in the plane
inferredcites →https://doi.org/10.1016/j.tcs.2015.09.030openalex-snapshot
Computing maximal cliques in link streams
inferredcites →https://doi.org/10.1016/j.tcs.2016.04.006openalex-snapshot
Traveling salesman problems in temporal graphs
inferredcites →https://doi.org/10.1016/s0304-3975(98)00158-3openalex-snapshot
Some APX-completeness results for cubic graphs
inferredcites →https://doi.org/10.1016/s1570-8667(03)00009-1openalex-snapshot
An efficient fixed-parameter algorithm for 3-Hitting Set
inferredcites →https://doi.org/10.1080/17445760.2012.668546openalex-snapshot
Time-varying graphs and dynamic networks
inferredcites →https://doi.org/10.1109/mnet.2004.1337732openalex-snapshot
Building a reference combinatorial model for MANETs
inferredcites →https://doi.org/10.1137/090756053openalex-snapshot
Flooding Time of Edge-Markovian Evolving Graphs
inferredcites →https://doi.org/10.1142/s0129054103001728openalex-snapshot
COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
inferredcites →https://doi.org/10.1145/1217299.1217301openalex-snapshot
Graph evolution
inferredcites →https://doi.org/10.1145/1672308.1672329openalex-snapshot
Characterising temporal distance and reachability in mobile and online social networks
inferredcites →https://doi.org/10.1145/258533.258599openalex-snapshot
Approximation of k -set cover by semi-local optimization
inferredcites →https://doi.org/10.1145/2808797.2809291openalex-snapshot
Revealing contact patterns among high-school students using maximal cliques in link streams
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/2925416openalex-snapshot
On Problems as Hard as CNF-SAT
inferredcites →https://doi.org/10.1145/3156693openalex-snapshot
Elements of the theory of dynamic networks
inferredcites →https://doi.org/10.1145/335305.335364openalex-snapshot
Connectivity and inference problems for temporal networks
inferredcites →https://doi.org/10.1609/aaai.v33i01.33017667openalex-snapshot
Sliding Window Temporal Graph Coloring
inferredcites →https://doi.org/10.2139/ssrn.4117558openalex-snapshot
Computing Maximum Matchings in Temporal Graphs
inferredcites →https://doi.org/10.3390/a2010121openalex-snapshot
Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks
inferredcites →https://doi.org/10.48550/arxiv.1107.2722openalex-snapshot
On the Feasibility of Maintenance Algorithms in Dynamic Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_2openalex-snapshot
The Temporal Explorer Who Returns to the Base
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_6openalex-snapshot
As Time Goes By: Reflections on Treewidth for Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-65351-4_52openalex-snapshot
Computing Temporal Twins in Time Logarithmic in History Length
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_28openalex-snapshot
Temporal Matching on Geometric Graph Data
inferred← citeshttps://doi.org/10.1007/978-3-030-78811-7_5openalex-snapshot
Dynamic Multi-objective Optimization via Sliding Time Window and Parallel Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_39openalex-snapshot
Approximating Multistage Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-22050-0_9openalex-snapshot
The Complexity of Growing a Graph
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_18openalex-snapshot
Payment Scheduling in the Interval Debt Model
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_19openalex-snapshot
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_15openalex-snapshot
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-48882-5_8openalex-snapshot
Temporal Reachability Dominating Sets: Contagion in Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_5openalex-snapshot
Parity Games on Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_10openalex-snapshot
The Threshold of Existence of $$\delta $$-Temporal Cliques in Random Simple Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s00224-022-10069-wopenalex-snapshot
Multistage Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00224-023-10150-yopenalex-snapshot
Disentangling the Computational Complexity of Network Untangling
inferred← citeshttps://doi.org/10.1007/s00224-024-10174-yopenalex-snapshot
Cluster Editing for Multi-Layer and Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00951-xopenalex-snapshot
Approximating Multistage Matching Problems
inferred← citeshttps://doi.org/10.1007/s10458-022-09583-5openalex-snapshot
Interference-free walks in time: temporally disjoint paths
inferred← citeshttps://doi.org/10.1007/s10479-024-05993-8openalex-snapshot
Exact and approximation algorithms for covering timeline in temporal graphs
inferred← citeshttps://doi.org/10.1007/s11280-025-01387-3openalex-snapshot
Towards understanding news plagiarism: theoretical and experimental analysis
inferred← citeshttps://doi.org/10.1007/s11390-022-2431-zopenalex-snapshot
Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration
inferred← citeshttps://doi.org/10.1007/s12626-025-00187-5openalex-snapshot
A Review of Temporal Networks: Operations and Applications
inferred← citeshttps://doi.org/10.1007/s13278-023-01136-2openalex-snapshot
Dense subgraphs in temporal social networks
inferred← citeshttps://doi.org/10.1007/s13278-025-01556-2openalex-snapshot
Exdiff: a modular and explainable framework combining network simulation and graph neural networks for diffusion modelling
inferred← citeshttps://doi.org/10.1007/s13721-022-00406-xopenalex-snapshot
Temporal networks in biology and medicine: a survey on models, algorithms, and tools
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.024openalex-snapshot
Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106181openalex-snapshot
A faster parameterized algorithm for temporal matching
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.006openalex-snapshot
The complexity of finding small separators in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.007openalex-snapshot
Deleting edges to restrict the size of an epidemic in temporal networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.03.005openalex-snapshot
Sliding window temporal graph coloring
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.01.003openalex-snapshot
Parameterised temporal exploration problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.04.005openalex-snapshot
Computing maximum matchings in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103551openalex-snapshot
A new temporal interpretation of cluster editing
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103564openalex-snapshot
The complexity of computing optimum labelings for temporal connectivity
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103587openalex-snapshot
The complexity of growing a graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103630openalex-snapshot
The complexity of transitively orienting temporal graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103679openalex-snapshot
An FPT algorithm for timeline cover
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103701openalex-snapshot
Temporal Reachability Dominating Sets: Contagion in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.jocs.2021.101518openalex-snapshot
A localized distributed algorithm for vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113885openalex-snapshot
Temporal interval cliques and independent sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114040openalex-snapshot
Untangling temporal graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115028openalex-snapshot
Payment scheduling in the Interval Debt Model
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115964openalex-snapshot
Partial temporal vertex cover with bounded activity intervals
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116170openalex-snapshot
Temporal dominating set and temporal vertex cover under the lens of degree restrictions
inferred← citeshttps://doi.org/10.1017/9781009766012.004openalex-snapshot
Techniques for Taming Temporal Graphs
inferred← citeshttps://doi.org/10.1049/cit2.12249openalex-snapshot
Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation
inferred← citeshttps://doi.org/10.1109/access.2024.3435741openalex-snapshot
Predicting Lane Change and Vehicle Trajectory With Driving Micro-Data and Deep Learning
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00040openalex-snapshot
Sharp Thresholds in Random Simple Temporal Graphs
inferred← citeshttps://doi.org/10.1109/tnse.2021.3108974openalex-snapshot
CHIEF: Clustering With Higher-Order Motifs in Big Networks
inferred← citeshttps://doi.org/10.1137/22m1511916openalex-snapshot
Sharp Thresholds in Random Simple Temporal Graphs
inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0111232openalex-snapshot
A Smart Approximation Algorithm for Minimum Vertex Cover Problem based on Min-to-Min (MtM) Strategy
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21259openalex-snapshot
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2759843/v1openalex-snapshot
Cluster Editing for Multi-Layer and Temporal Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.4117558openalex-snapshot
Computing Maximum Matchings in Temporal Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.4184782openalex-snapshot
A New Temporal Interpretation of Cluster Editing
inferred← citeshttps://doi.org/10.2139/ssrn.5272704openalex-snapshot
Towards Understanding News Plagiarism: Theoretical and Experimental Analysis
inferred← citeshttps://doi.org/10.2139/ssrn.6411400openalex-snapshot
Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
inferred← citeshttps://doi.org/10.24963/ijcai.2022/283openalex-snapshot
Disentangling the Computational Complexity of Network Untangling
inferred← citeshttps://doi.org/10.48550/arxiv.2005.08263openalex-snapshot
Matching in Stochastically Evolving Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.