On the public citation graph
The complexity of finding small separators in temporal graphs
0 signed · 103 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199610)28:3<125::aid-net1>3.0.co;2-popenalex-snapshot
Vulnerability of scheduled networks and a generalization of Menger's Theorem
inferredcites →https://doi.org/10.1006/jcss.2002.1829openalex-snapshot
Connectivity and Inference Problems for Temporal Networks
inferredcites →https://doi.org/10.1007/978-3-030-00256-5_18openalex-snapshot
Temporal Graph Classes: A View Through Temporal Separators
inferredcites →https://doi.org/10.1007/bf02019432openalex-snapshot
Mengerian theorems for paths of bounded length
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/s13278-017-0455-0openalex-snapshot
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
inferredcites →https://doi.org/10.1016/0167-6377(82)90020-7openalex-snapshot
Most vital links and nodes in weighted networks
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/j.dam.2015.05.036openalex-snapshot
Interdiction problems on planar graphs
inferredcites →https://doi.org/10.1016/j.disopt.2010.09.009openalex-snapshot
Paths of bounded length and their cuts: Parameterized complexity and algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2019.02.003openalex-snapshot
Temporal flows in temporal networks
inferredcites →https://doi.org/10.1016/j.jcss.2019.08.002openalex-snapshot
Temporal vertex cover with a sliding time window
inferredcites →https://doi.org/10.1016/j.physrep.2014.07.001openalex-snapshot
The structure and dynamics of multilayer networks
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.1080/15427951.2016.1177801openalex-snapshot
An Introduction to Temporal Graphs: An Algorithmic Perspective *
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.1109/tkde.2016.2594065openalex-snapshot
Efficient Algorithms for Temporal Path Computation
inferredcites →https://doi.org/10.1109/tmc.2011.248openalex-snapshot
Evaluating Temporal Robustness of Mobile Networks
inferredcites →https://doi.org/10.1109/tmc.2016.2636152openalex-snapshot
Survivability in Time-Varying Networks
inferredcites →https://doi.org/10.1137/16m1088740openalex-snapshot
Fractals for Kernelization Lower Bounds
inferredcites →https://doi.org/10.1140/epjb/e2015-60657-4openalex-snapshot
Modern temporal network theory: a colloquium
inferredcites →https://doi.org/10.1145/1868237.1868241openalex-snapshot
Length-bounded cuts and flows
inferredcites →https://doi.org/10.1145/2462896.2462899openalex-snapshot
On multiway cut parameterized above lower bounds
inferredcites →https://doi.org/10.1145/335305.335364openalex-snapshot
Connectivity and inference problems for temporal networks
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
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-00256-5_18openalex-snapshot
Temporal Graph Classes: A View Through Temporal Separators
inferred← citeshttps://doi.org/10.1007/978-3-030-36683-4_40openalex-snapshot
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints
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-60440-0_16openalex-snapshot
Feedback Edge Sets in Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_4openalex-snapshot
On Short Fastest Paths in Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_27openalex-snapshot
Exploration of k-Edge-Deficient Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_21openalex-snapshot
Mengerian Temporal Graphs Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_27openalex-snapshot
On Finding Separators in Temporal Split and Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_17openalex-snapshot
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
inferred← citeshttps://doi.org/10.1007/978-3-030-93409-5_46openalex-snapshot
Finding Colorful Paths in Temporal Graphs
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-34347-6_15openalex-snapshot
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_24openalex-snapshot
On Computing Large Temporal (Unilateral) Connected Components
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_8openalex-snapshot
On Computing Optimal Temporal Branchings
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_22openalex-snapshot
Resolving Sets in 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/978-3-031-92935-9_6openalex-snapshot
Disjoint Temporal Walks Under Waiting Time Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-16723-1_25openalex-snapshot
Interval Separators in Temporal Graphs
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/s00236-022-00421-5openalex-snapshot
Exploration of k-edge-deficient temporal graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00831-wopenalex-snapshot
Finding Temporal Paths Under Waiting Time Constraints
inferred← citeshttps://doi.org/10.1007/s00453-022-01077-wopenalex-snapshot
Multistage s–t Path: Confronting Similarity with Dissimilarity
inferred← citeshttps://doi.org/10.1007/s10115-025-02405-6openalex-snapshot
Restless reachability problems in temporal graphs
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/s13278-020-00664-5openalex-snapshot
Comparing temporal graphs using dynamic time warping
inferred← citeshttps://doi.org/10.1007/s13278-024-01207-yopenalex-snapshot
A two-phase approach for enumeration of maximal $$(\Delta , \gamma )$$-cliques of a temporal network
inferred← citeshttps://doi.org/10.1007/s41109-020-00311-0openalex-snapshot
Efficient computation of optimal temporal walks under waiting-time constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.029openalex-snapshot
Feedback edge sets in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.027openalex-snapshot
Maximum 0-1 timed matching on temporal graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104890openalex-snapshot
Optimizing reachability sets in temporal graphs by delaying
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.ipl.2021.106229openalex-snapshot
The complexity of finding temporal separators under waiting time constraints
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.01.004openalex-snapshot
On finding separators in temporal split and permutation graphs
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.2023.103467openalex-snapshot
Mengerian graphs: Characterization and recognition
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103548openalex-snapshot
On computing large temporal (unilateral) connected components
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103549openalex-snapshot
Temporal reachability minimization: Delaying vs. deleting
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.103587openalex-snapshot
The complexity of growing a graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103596openalex-snapshot
On computing optimal temporal branchings and spanning subgraphs
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.2026.103814openalex-snapshot
Temporal graph realization with bounded stretch
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.114690openalex-snapshot
Snapshot disjointness in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114757openalex-snapshot
Temporally connected components
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115508openalex-snapshot
Temporal graph realization from fastest paths
inferred← citeshttps://doi.org/10.1017/nws.2023.17openalex-snapshot
Colorful path detection in vertex-colored temporal
inferred← citeshttps://doi.org/10.1017/nws.2024.5openalex-snapshot
Algorithmic aspects of temporal betweenness
inferred← citeshttps://doi.org/10.1093/comnet/cnac027openalex-snapshot
An efficient updation approach for enumerating maximal (Δ,γ)-cliques of a temporal network
inferred← citeshttps://doi.org/10.1109/access.2026.3667711openalex-snapshot
Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks
inferred← citeshttps://doi.org/10.1109/iscc53001.2021.9631469openalex-snapshot
An Effective Data Structure for Contact Sequence Temporal Graphs
inferred← citeshttps://doi.org/10.1109/iscc53001.2021.9631526openalex-snapshot
Min Hop and Foremost Paths in Interval Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3418226openalex-snapshot
Span-core Decomposition for Temporal Networks
inferred← citeshttps://doi.org/10.1145/3638529.3654035openalex-snapshot
Optimizing Cyber Response Time on Temporal Active Directory Networks Using Decoys
inferred← citeshttps://doi.org/10.1145/3673038.3673105openalex-snapshot
GPU Algorithms for Fastest Path Problem in Temporal Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017667openalex-snapshot
Sliding Window Temporal Graph Coloring
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6533openalex-snapshot
Optimizing Reachability Sets in Temporal Graphs by Delaying
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.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.4557635openalex-snapshot
Temporal Reachability Minimization: Delaying vs. Deleting
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.3390/a15100361openalex-snapshot
Foremost Walks and Paths in Interval Temporal Graphs
inferred← citeshttps://doi.org/10.3390/a17040148openalex-snapshot
Path Algorithms for Contact Sequence Temporal Graphs
inferred← citeshttps://doi.org/10.4230/lipics.sand.2025.9openalex-snapshot
Finding Structure in Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1910.03645openalex-snapshot
Span-core Decomposition for Temporal Networks: Algorithms and Applications
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.