On the public citation graph

Arc-Disjoint Paths in Decomposable Digraphs

0 signed · 35 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.1002/jgt.3190140310openalex-snapshot
Locally semicomplete digraphs: A generalization of tournaments
inferredcites →https://doi.org/10.1002/jgt.3190180306openalex-snapshot
Connectivity properties of locally semicomplete digraphs
inferredcites →https://doi.org/10.1002/jgt.3190200205openalex-snapshot
Quasi‐transitive digraphs
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1006/jctb.1995.1016openalex-snapshot
On the Structure of Local Tournaments
inferredcites →https://doi.org/10.1006/jctb.2000.2031openalex-snapshot
Directed Tree-Width
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/bf01275674openalex-snapshot
Highly connected non-2-linked digraphs
inferredcites →https://doi.org/10.1016/0095-8956(91)90002-2openalex-snapshot
Edge-disjoint in- and out-branchings in tournaments and related path problems
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/j.aim.2014.11.011openalex-snapshot
Disjoint paths in tournaments
inferredcites →https://doi.org/10.1016/j.dam.2006.03.005openalex-snapshot
Fully dynamic recognition algorithm and certificate for directed cographs
inferredcites →https://doi.org/10.1016/j.jctb.2014.07.002openalex-snapshot
Edge-disjoint paths in digraphs with bounded independence number
inferredcites →https://doi.org/10.1016/s0012-365x(98)00194-0openalex-snapshot
Linkages in locally semicomplete digraphs and quasi-transitive digraphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1137/0405027openalex-snapshot
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
inferredcites →https://doi.org/10.1145/322047.322048openalex-snapshot
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

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.22090openalex-snapshot
Disjoint Paths in Decomposable Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_20openalex-snapshot
Characterizations for Special Directed Co-graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_45openalex-snapshot
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_8openalex-snapshot
Acyclic Coloring Parameterized by Directed Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_11openalex-snapshot
Miscellaneous Digraph Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_6openalex-snapshot
Locally Semicomplete Digraphs and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_8openalex-snapshot
Quasi-Transitive Digraphs and Their Extensions
inferred← citeshttps://doi.org/10.1007/s00186-020-00718-6openalex-snapshot
Solutions for subset sum problems with special digraph constraints
inferred← citeshttps://doi.org/10.1007/s00186-021-00767-5openalex-snapshot
The knapsack problem with special neighbor constraints
inferred← citeshttps://doi.org/10.1007/s00453-015-0038-2openalex-snapshot
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments
inferred← citeshttps://doi.org/10.1007/s10878-020-00670-5openalex-snapshot
On characterizations for subclasses of directed co-graphs
inferred← citeshttps://doi.org/10.1007/s10878-021-00781-7openalex-snapshot
Computing directed Steiner path covers
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.047openalex-snapshot
How to compute digraph width measures on directed co-graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.013openalex-snapshot
Efficient computation of the oriented chromatic number of recursively defined digraphs
inferred← citeshttps://doi.org/10.19139/soic.v5i1.260openalex-snapshot
Dynamic Programming Algorithms on Directed Cographs
inferred← citeshttps://doi.org/10.3390/a12040087openalex-snapshot
Oriented Coloring on Recursively Defined Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13203openalex-snapshot
Parametrised Algorithms for Directed Modular Width
inferred← citeshttps://doi.org/10.48550/arxiv.2006.13911openalex-snapshot
Acyclic coloring of special digraphs
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.