On the public citation graph
The even‐path problem for graphs and digraphs
0 signed · 72 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.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0022-0000(80)90057-4openalex-snapshot
The subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/322203.322207openalex-snapshot
A Polynomial Solution to the Undirected Two Paths Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190100203openalex-snapshot
On digraphs with the odd cycle property
inferred← citeshttps://doi.org/10.1006/jagm.1994.1031openalex-snapshot
Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_37openalex-snapshot
DFS tree construction: Algorithms and characterizations
inferred← citeshttps://doi.org/10.1007/978-0-387-98197-0_5openalex-snapshot
Complexity of Abstract Argumentation
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_8openalex-snapshot
Knowledge Graphs: Research Directions
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_8openalex-snapshot
Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_23openalex-snapshot
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs
inferred← citeshttps://doi.org/10.1007/978-3-642-05082-4_16openalex-snapshot
The Perfect Match: RPL and RDF Rule Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_30openalex-snapshot
Finding Induced Paths of Given Parity in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31467-4_6openalex-snapshot
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_63openalex-snapshot
Parameterized Tractability of Multiway Cut with Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_65openalex-snapshot
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
inferred← citeshttps://doi.org/10.1007/bf02592077openalex-snapshot
LP extreme points and cuts for the fixed-charge network design problem
inferred← citeshttps://doi.org/10.1007/s00453-010-9470-5openalex-snapshot
Finding Induced Paths of Given Parity in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0142-yopenalex-snapshot
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation
inferred← citeshttps://doi.org/10.1007/s00453-017-0317-1openalex-snapshot
Quick but Odd Growth of Cacti
inferred← citeshttps://doi.org/10.1007/s00493-021-4736-xopenalex-snapshot
Finding a Shortest Non-Zero Path in Group-Labeled Graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90125-4openalex-snapshot
A note on odd/even cycles
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00086-7openalex-snapshot
A polynomial algorithm for the parity path problem on perfectly orientable graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90032-3openalex-snapshot
The NP-completeness column: An ongoing gulde
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/j.artint.2007.06.003openalex-snapshot
Redundancy in logic II: 2CNF and Horn propositional formulae
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.artint.2017.06.002openalex-snapshot
Understanding the complexity of axiom pinpointing in lightweight description logics
inferred← citeshttps://doi.org/10.1016/j.comnet.2022.108832openalex-snapshot
SplitPath: High throughput using multipath routing in dual-radio Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.022openalex-snapshot
How many attackers can selfish defenders catch?
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.044openalex-snapshot
Shortest odd paths in undirected graphs with conservative weight functions
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106613openalex-snapshot
EvenPath in directed single-crossing graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.08.006openalex-snapshot
A trichotomy for regular simple path queries on graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.12.001openalex-snapshot
Finding a path with two labels forbidden in group-labeled graphs
inferred← citeshttps://doi.org/10.1080/10556789408805566openalex-snapshot
Even/odd dipaths in planar digraphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq342openalex-snapshot
TRANSWESD: inferring cellular networks with transitive reduction
inferred← citeshttps://doi.org/10.1109/hicss.2008.193openalex-snapshot
How Many Attackers Can Selfish Defenders Catch?
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00013openalex-snapshot
A Reachability Index for Recursive Label-Concatenated Graph Queries
inferred← citeshttps://doi.org/10.1137/18m1176087openalex-snapshot
Odd Multiway Cut in Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1137/23m158156xopenalex-snapshot
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms
inferred← citeshttps://doi.org/10.1137/23m1589347openalex-snapshot
Search-Space Reduction via Essential Vertices
inferred← citeshttps://doi.org/10.1137/s009753979122370xopenalex-snapshot
Finding Regular Simple Paths in Graph Databases
inferred← citeshttps://doi.org/10.1137/s0097539797330343openalex-snapshot
Finding an Even Simple Path in a Directed Planar Graph
inferred← citeshttps://doi.org/10.1142/s0219498815400113openalex-snapshot
Graphs and complete intersection toric ideals
inferred← citeshttps://doi.org/10.1145/103516.103517openalex-snapshot
Modularity of cycles and paths in graphs
inferred← citeshttps://doi.org/10.1145/113413.113415openalex-snapshot
On Datalog vs. polynomial time (extended abstract)
inferred← citeshttps://doi.org/10.1145/2494529openalex-snapshot
The complexity of regular expressions and property paths in SPARQL
inferred← citeshttps://doi.org/10.1145/3331446openalex-snapshot
Dichotomies for Evaluating Simple Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3517804.3524149openalex-snapshot
The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3555776.3577630openalex-snapshot
Treating Role Assertions as First-class Citizens in Repair and Error-tolerant Reasoning
inferred← citeshttps://doi.org/10.1145/3618260.3649682openalex-snapshot
Packing Even Directed Circuits Quarter-Integrally
inferred← citeshttps://doi.org/10.1145/3722234.3725822openalex-snapshot
Querying Graph Data: Where We Are and Where To Go
inferred← citeshttps://doi.org/10.1145/3735546.3735855openalex-snapshot
Extending Pattern Matching Queries in Property Graphs with Interpreted Predicates
inferred← citeshttps://doi.org/10.1186/1471-2105-10-181openalex-snapshot
Computing paths and cycles in biological interaction graphs
inferred← citeshttps://doi.org/10.24963/ijcai.2019/227openalex-snapshot
Explanations for Query Answers under Existential Rules
inferred← citeshttps://doi.org/10.25368/2022.209openalex-snapshot
Error-Tolerant Reasoning in the Description Logic EL
inferred← citeshttps://doi.org/10.3166/jancl.19.311-369openalex-snapshot
Handling controversial arguments
inferred← citeshttps://doi.org/10.3233/faia200153openalex-snapshot
Explanations for Ontology-Mediated Query Answering in Description Logics
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.254openalex-snapshot
Improved Bounds for Bipartite Matching on Surfaces
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:20)2023openalex-snapshot
A Trichotomy for Regular Trail Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02135openalex-snapshot
Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs
inferred← citeshttps://doi.org/10.5555/2095116.2095171openalex-snapshot
Finding an induced path of given parity in planar graphs in polynomial time
inferred← citeshttps://doi.org/10.5753/etc.2023.230579openalex-snapshot
O Problema do Caminho Positivo Mínimo
inferred← citeshttps://doi.org/10.5753/etc.2026.23617openalex-snapshot
Hardness results on parity subdivisions in digraphs
inferred← citeshttps://doi.org/10.5753/sbrc_estendido.2018.14182openalex-snapshot
Multipath Routing for Dual-Radio Wireless Sensor Networks
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.