On the public citation graph
Spanning Directed Trees with Many Leaves
0 signed · 67 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.1006/jagm.1993.1001openalex-snapshot
On Linear Time Minor Tests with Depth-First Search
inferredcites →https://doi.org/10.1006/jagm.1998.0944openalex-snapshot
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
inferredcites →https://doi.org/10.1007/11944836_16openalex-snapshot
Solving Connected Dominating Set Faster Than 2 n
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-44450-5_19openalex-snapshot
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/978-3-540-45138-9_20openalex-snapshot
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_32openalex-snapshot
Parameterized Algorithms for Directed Maximum Leaf Problems
inferredcites →https://doi.org/10.1007/978-3-540-77050-3_26openalex-snapshot
Better Algorithms and Bounds for Directed Maximum Leaf Problems
inferredcites →https://doi.org/10.1007/978-3-540-92182-0_26openalex-snapshot
A New Algorithm for Finding Trees with Many Leaves
inferredcites →https://doi.org/10.1007/bf01787474openalex-snapshot
Transversal numbers of uniform hypergraphs
inferredcites →https://doi.org/10.1007/s00453-007-9145-zopenalex-snapshot
Solving Connected Dominating Set Faster than 2 n
inferredcites →https://doi.org/10.1016/0012-365x(85)90046-9openalex-snapshot
Interval graphs and seatching
inferredcites →https://doi.org/10.1016/0012-365x(92)90331-9openalex-snapshot
Spanning trees in graphs of minimum degree 4 or 5
inferredcites →https://doi.org/10.1016/0020-0190(92)90234-mopenalex-snapshot
The vertex separation number of a graph equals its path-width
inferredcites →https://doi.org/10.1016/0095-8956(91)90068-uopenalex-snapshot
Quickly excluding a forest
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/s0304-3975(96)00265-4openalex-snapshot
On the approximability of some maximum spanning tree problems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/comjnl/bxm039openalex-snapshot
Some Parameterized Problems On Digraphs
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s0895480199353780openalex-snapshot
Connected Domination and Spanning Trees with Many Leaves
inferredcites →https://doi.org/10.1145/1798596.1798599openalex-snapshot
An approximation algorithm for the maximum leaf spanning arborescence problem
inferredcites →https://doi.org/10.14279/depositonce-14380openalex-snapshot
An FPT Algorithm for Directed Spanning k-Leaf
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_37openalex-snapshot
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_5openalex-snapshot
Leafy Spanning Arborescences in DAGs
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_25openalex-snapshot
A $$\nicefrac {4}{3}$$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_1openalex-snapshot
Basic Terminology, Notation and Results
inferred← citeshttps://doi.org/10.1007/978-3-319-94830-0_5openalex-snapshot
Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_23openalex-snapshot
Minimum Leaf Out-Branching Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_23openalex-snapshot
On the Directed Degree-Preserving Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_7openalex-snapshot
On Finding Directed Trees with Many Leaves
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_7openalex-snapshot
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9454-5openalex-snapshot
A New Algorithm for Finding Trees with Many Leaves
inferred← citeshttps://doi.org/10.1007/s00453-015-0037-3openalex-snapshot
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs
inferred← citeshttps://doi.org/10.1007/s10107-025-02233-0openalex-snapshot
A $$\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs
inferred← citeshttps://doi.org/10.1007/s10255-010-0011-4openalex-snapshot
Some results on spanning trees
inferred← citeshttps://doi.org/10.1007/s11424-017-6074-zopenalex-snapshot
Leader selection for strong structural controllability of single-integrator multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.012openalex-snapshot
On complexity of Minimum Leaf Out-Branching problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.018openalex-snapshot
Leafy Spanning Arborescences in DAGs
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.09.001openalex-snapshot
On the directed Full Degree Spanning Tree problem
inferred← citeshttps://doi.org/10.1016/j.endm.2009.02.011openalex-snapshot
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
inferred← citeshttps://doi.org/10.1016/j.ic.2013.11.006openalex-snapshot
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.06.005openalex-snapshot
FPT algorithms and kernels for the Directed k-Leaf problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.01.003openalex-snapshot
k-distinct in- and out-branchings in digraphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.02.006openalex-snapshot
How heavy independent sets help to find arborescences with many leaves in DAGs
inferred← citeshttps://doi.org/10.1109/csss.2011.5974942openalex-snapshot
Simulated annealing algorithm for finding the spanning directed trees with many leaves
inferred← citeshttps://doi.org/10.1109/tcbb.2020.3040910openalex-snapshot
Maximum Covering Subtrees for Phylogenetic Networks
inferred← citeshttps://doi.org/10.1134/s1064226921130040openalex-snapshot
Note on Dominating Set Problems
inferred← citeshttps://doi.org/10.1134/s1064226921130052openalex-snapshot
Balanced Clustering with a Tree over Clusters
inferred← citeshttps://doi.org/10.1137/100801251openalex-snapshot
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
inferred← citeshttps://doi.org/10.1145/2344422.2344428openalex-snapshot
Kernel(s) for problems with no kernel
inferred← citeshttps://doi.org/10.13140/rg.2.2.15798.75842openalex-snapshot
Balanced clustering with tree-like structures over clusters
inferred← citeshttps://doi.org/10.13140/rg.2.2.34919.68006openalex-snapshot
On combinatorial optimization for dominating sets (literature survey, new models)
inferred← citeshttps://doi.org/10.3390/a14010008openalex-snapshot
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2010.01431openalex-snapshot
Study of directed maximum leaf out-branching
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0821openalex-snapshot
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1735openalex-snapshot
Towards Design of System Hierarchy (research survey)
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0128openalex-snapshot
Towards Detection of Bottlenecks in Modular Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03863openalex-snapshot
Discrete Route/Trajectory Decision Making Problems
inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot
Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.
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.