On the public citation graph

Spanning Trees with Many Leaves

https://doi.org/10.1137/0404010
0 signed · 186 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.3190130604openalex-snapshot
Spanning trees with many leaves in cubic graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90163-8openalex-snapshot
Arbres avec un nombre maximum de sommets pendants
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(81)90141-1openalex-snapshot
Constructing full spanning trees for cubic graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0266openalex-snapshot
Domination Problems
inferred← citeshttps://doi.org/10.1002/jgt.22021openalex-snapshot
Minimum Degree and Dominating Paths
inferred← citeshttps://doi.org/10.1002/jgt.22793openalex-snapshot
The number and average size of connected sets in graphs with degree constraints
inferred← citeshttps://doi.org/10.1006/jagm.1998.0944openalex-snapshot
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0019openalex-snapshot
Site Partitioning for Redundant Arrays of Distributed Disks
inferred← citeshttps://doi.org/10.1007/11429647_17openalex-snapshot
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_60openalex-snapshot
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_55openalex-snapshot
Approximation algorithms for connected dominating sets
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-0-387-30162-4_228openalex-snapshot
Max Leaf Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_4openalex-snapshot
Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_7openalex-snapshot
Further Elementary Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_228openalex-snapshot
Max Leaf Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_4openalex-snapshot
Connected Domination
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_135openalex-snapshot
Robust Connectivity of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-031-46826-1_7openalex-snapshot
Discrepancies of Subtrees
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_20openalex-snapshot
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_32openalex-snapshot
Parameterized Algorithms for Directed Maximum Leaf Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_26openalex-snapshot
Better Algorithms and Bounds for Directed Maximum Leaf Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_78openalex-snapshot
Spanning Trees with Many Leaves in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77918-6_15openalex-snapshot
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_46openalex-snapshot
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_19openalex-snapshot
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_26openalex-snapshot
A New Algorithm for Finding Trees with Many Leaves
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_7openalex-snapshot
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_11openalex-snapshot
Pricing Strategies for Viral Marketing on Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_18openalex-snapshot
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
inferred← citeshttps://doi.org/10.1007/978-3-642-13580-4_1openalex-snapshot
High Degree Graphs Contain Large-Star Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_47openalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_33openalex-snapshot
Parameterized Algorithms for Boxicity
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_12openalex-snapshot
Kernel Bounds for Path and Cycle Problems
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/978-3-642-32278-5_4openalex-snapshot
Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_21openalex-snapshot
On Tractable Parameterizations of Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_18openalex-snapshot
A 9k Kernel for Nonseparating Independent Set in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_32openalex-snapshot
How to Eliminate a Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_39openalex-snapshot
Tractable Parameterizations for the Minimum Linear Arrangement Problem
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_12openalex-snapshot
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
inferred← citeshttps://doi.org/10.1007/s00224-009-9167-9openalex-snapshot
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
inferred← citeshttps://doi.org/10.1007/s00373-010-0973-2openalex-snapshot
Spanning Trees: A Survey
inferred← citeshttps://doi.org/10.1007/s00373-011-1028-zopenalex-snapshot
Connected Domination Number of a Graph and its Complement
inferred← citeshttps://doi.org/10.1007/s00373-018-1957-xopenalex-snapshot
Bounds on the Connected Forcing Number of a Graph
inferred← citeshttps://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
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-011-9554-xopenalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-013-9848-2openalex-snapshot
Modifying a Graph Using Vertex Elimination
inferred← citeshttps://doi.org/10.1007/s00453-022-00962-8openalex-snapshot
Parameterized Complexity of Graph Burning
inferred← citeshttps://doi.org/10.1007/s10255-010-0011-4openalex-snapshot
Some results on spanning trees
inferred← citeshttps://doi.org/10.1007/s10458-022-09594-2openalex-snapshot
A refined complexity analysis of fair districting over graphs
inferred← citeshttps://doi.org/10.1007/s10474-017-0716-4openalex-snapshot
Hamiltonicity, minimum degree and leaf number
inferred← citeshttps://doi.org/10.1007/s10586-018-1760-8openalex-snapshot
Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET
inferred← citeshttps://doi.org/10.1007/s10587-013-0036-yopenalex-snapshot
Minimum degree, leaf number and traceability
inferred← citeshttps://doi.org/10.1007/s10878-014-9815-0openalex-snapshot
The 3-rainbow index and connected dominating sets
inferred← citeshttps://doi.org/10.1007/s10878-015-9874-xopenalex-snapshot
Upper bounds for the total rainbow connection of graphs
inferred← citeshttps://doi.org/10.1007/s10878-018-0258-xopenalex-snapshot
Some extremal results on the colorful monochromatic vertex-connectivity of a graph
inferred← citeshttps://doi.org/10.1007/s10878-022-00850-5openalex-snapshot
Further results on the total monochromatic connectivity of graphs
inferred← citeshttps://doi.org/10.1007/s10958-011-0611-4openalex-snapshot
Constructing a spanning tree with many leaves
inferred← citeshttps://doi.org/10.1007/s10958-011-0613-2openalex-snapshot
Spanning trees with many leaves
inferred← citeshttps://doi.org/10.1007/s10958-012-0880-6openalex-snapshot
Bounds of the number of leaves of spanning trees in graphs without triangles
inferred← citeshttps://doi.org/10.1007/s10958-012-0881-5openalex-snapshot
Bounds of the number of leaves of spanning trees
inferred← citeshttps://doi.org/10.1007/s10958-014-1691-8openalex-snapshot
Spanning Trees with many Leaves: New Lower Bounds in Terms of the Number of Vertices of Degree 3 and at Least 4
inferred← citeshttps://doi.org/10.1007/s10958-014-1692-7openalex-snapshot
Spanning Trees With Many Leaves: Lower Bounds in Terms of the Number of Vertices of Degree 1, 3 and at Least 4
inferred← citeshttps://doi.org/10.1007/s10958-018-3857-2openalex-snapshot
Lower Bounds on the Number of Leaves in Spanning Trees
inferred← citeshttps://doi.org/10.1007/s10958-018-4132-2openalex-snapshot
A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6
inferred← citeshttps://doi.org/10.1007/s11856-023-2499-3openalex-snapshot
Spanning trees with few non-leaves
inferred← citeshttps://doi.org/10.1007/s13370-017-0503-yopenalex-snapshot
Leaf number and Hamiltonian $$C_4$$ C 4 -free graphs
inferred← citeshttps://doi.org/10.1007/s13370-018-0605-1openalex-snapshot
Graphs with forbidden subgraphs and leaf number
inferred← citeshttps://doi.org/10.1007/s40305-022-00419-3openalex-snapshot
The Minimum Centroid Branch Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/s40840-021-01092-0openalex-snapshot
Note on the Vertex-Rainbow Index of a Graph
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90331-9openalex-snapshot
Spanning trees in graphs of minimum degree 4 or 5
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90591-3openalex-snapshot
On the r-domination number of a graph
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.018openalex-snapshot
On spanning cycles, paths and trees
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.016openalex-snapshot
The Graph Motif problem parameterized by the structure of the input graph
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.028openalex-snapshot
On minimum degree, leaf number, traceability and Hamiltonicity in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.001openalex-snapshot
Spanning paths in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.010openalex-snapshot
Full degree spanning trees in random regular graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.043openalex-snapshot
Improved bounds for spanning trees with many leaves
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113228openalex-snapshot
A note on connected domination number and leaf number
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114884openalex-snapshot
Connected domination versus dominating sets inducing large components
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.07.004openalex-snapshot
On graphs with few disjoint t -star minors
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.04.008openalex-snapshot
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.06.002openalex-snapshot
On maximum leaf trees and connections to connected maximum cut problems
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.jda.2011.06.005openalex-snapshot
Max-leaves spanning tree is APX-hard for cubic graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2015.07.401openalex-snapshot
Minimum Connected Dominating Set for Certain Circulant Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.024openalex-snapshot
Hardness and approximation results for Black Hole Search in arbitrary networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.006openalex-snapshot
Kernel bounds for path and cycle problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.021openalex-snapshot
A 9 k kernel for nonseparating independent set in planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115092openalex-snapshot
Finding a minimum spanning tree with a small non-terminal set
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00595-2openalex-snapshot
Kleitman and Combinatorics: A Celebration
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00117-xopenalex-snapshot
An exact algorithm for the maximum leaf spanning tree problem
inferred← citeshttps://doi.org/10.1016/s0893-9659(01)00047-7openalex-snapshot
Leafy spanning trees in hypercubes
inferred← citeshttps://doi.org/10.1017/9781107415157openalex-snapshot
Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781107415157.002openalex-snapshot
Acknowledgements
inferred← citeshttps://doi.org/10.1017/9781107415157.003openalex-snapshot
What Is a Kernel?
inferred← citeshttps://doi.org/10.1017/9781107415157.004openalex-snapshot
Warm Up
inferred← citeshttps://doi.org/10.1017/9781107415157.005openalex-snapshot
Inductive Priorities
inferred← citeshttps://doi.org/10.1017/9781107415157.006openalex-snapshot
Crown Decomposition
inferred← citeshttps://doi.org/10.1017/9781107415157.007openalex-snapshot
Expansion Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.008openalex-snapshot
Linear Programming
inferred← citeshttps://doi.org/10.1017/9781107415157.009openalex-snapshot
Hypertrees
inferred← citeshttps://doi.org/10.1017/9781107415157.010openalex-snapshot
Sunflower Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.011openalex-snapshot
Modules
inferred← citeshttps://doi.org/10.1017/9781107415157.012openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1017/9781107415157.013openalex-snapshot
Representative Families
inferred← citeshttps://doi.org/10.1017/9781107415157.014openalex-snapshot
Greedy Packing
inferred← citeshttps://doi.org/10.1017/9781107415157.015openalex-snapshot
Euler–s Formula
inferred← citeshttps://doi.org/10.1017/9781107415157.016openalex-snapshot
Introduction to Treewidth
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.018openalex-snapshot
Surgery on Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157.019openalex-snapshot
Framework
inferred← citeshttps://doi.org/10.1017/9781107415157.020openalex-snapshot
Instance Selectors
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1017/9781107415157.022openalex-snapshot
Polynomial Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781107415157.023openalex-snapshot
Extending Distillation
inferred← citeshttps://doi.org/10.1017/9781107415157.024openalex-snapshot
Turing Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.025openalex-snapshot
Lossy Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.026openalex-snapshot
Open Problems
inferred← citeshttps://doi.org/10.1017/9781107415157.027openalex-snapshot
Graphs and SAT Notation
inferred← citeshttps://doi.org/10.1017/9781107415157.028openalex-snapshot
Problem Definitions
inferred← citeshttps://doi.org/10.1017/9781107415157.029openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1017/9781107415157.030openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1080/08957340802558367openalex-snapshot
Using a Taxonomy of Differential Step Functioning to Improve the Interpretation of DIF in Polytomous Items: An Illustration
inferred← citeshttps://doi.org/10.1089/cmb.2020.0500openalex-snapshot
Scale-Free Spanning Trees and Their Application in Genomic Epidemiology
inferred← citeshttps://doi.org/10.1093/imrn/rnag219openalex-snapshot
The dominating 4-colour theorem
inferred← citeshttps://doi.org/10.1109/icpp.1993.42openalex-snapshot
Assigning Sites to Redundant Clusters in a Distributed Storage System
inferred← citeshttps://doi.org/10.1109/ispan.1997.645119openalex-snapshot
A fast approximation algorithm for maximum-leaf spanning tree
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646121openalex-snapshot
Truly online paging with locality of reference
inferred← citeshttps://doi.org/10.1109/tnet.2017.2740328openalex-snapshot
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/tst.2014.6867520openalex-snapshot
Parameter ecology for Feedback Vertex Set
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/060664318openalex-snapshot
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
inferred← citeshttps://doi.org/10.1137/070710494openalex-snapshot
Spanning Directed Trees with Many Leaves
inferred← citeshttps://doi.org/10.1137/1.9781611973082.59openalex-snapshot
Bidimensionality and EPTAS
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.1137/120903518openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferred← citeshttps://doi.org/10.1137/130924056openalex-snapshot
Immersions in Highly Edge Connected Graphs
inferred← citeshttps://doi.org/10.1137/21m1417077openalex-snapshot
Robust Connectivity of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1137/s0895480199353780openalex-snapshot
Connected Domination and Spanning Trees with Many Leaves
inferred← citeshttps://doi.org/10.1142/s0129054123420029openalex-snapshot
A Simple 2-Approximation for Maximum-Leaf Spanning Tree
inferred← citeshttps://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferred← citeshttps://doi.org/10.1145/2000807.2000812openalex-snapshot
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
inferred← citeshttps://doi.org/10.1145/2344422.2344428openalex-snapshot
Kernel(s) for problems with no kernel
inferred← citeshttps://doi.org/10.1145/2898352openalex-snapshot
Tractable Parameterizations for the Minimum Linear Arrangement Problem
inferred← citeshttps://doi.org/10.1145/3154833openalex-snapshot
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes
inferred← citeshttps://doi.org/10.1145/3717823.3718184openalex-snapshot
Disjoint Connected Dominating Sets in Pseudorandom Graphs
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0775openalex-snapshot
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0776openalex-snapshot
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
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.14279/depositonce-1750openalex-snapshot
Geometric and Combinatorial Structures on Graphs
inferred← citeshttps://doi.org/10.1515/9783110754216-013openalex-snapshot
Spanning trees and domination in hypercubes
inferred← citeshttps://doi.org/10.20429/tag.2017.000104openalex-snapshot
A Survey on Monochromatic Connections of Graphs
inferred← citeshttps://doi.org/10.2989/16073606.2017.1282892openalex-snapshot
Lower bounds on the leaf number in graphs with forbidden subgraphs
inferred← citeshttps://doi.org/10.2989/16073606.2022.2050958openalex-snapshot
Radius, leaf number, connected domination number and minimum degree
inferred← citeshttps://doi.org/10.37236/11113openalex-snapshot
Improved Pyrotechnics: Closer to the Burning Number Conjecture
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.01073openalex-snapshot
A Survey on Exact Algorithms for Dominating Set Related Problems in Arbitrary Graphs
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.02211openalex-snapshot
Kernelization Algorithm of Maximum Leaf Spanning Tree
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2010.01431openalex-snapshot
Study of directed maximum leaf out-branching
inferred← citeshttps://doi.org/10.3990/1.978-9036523707openalex-snapshot
Sparse cuts, matching-cuts and leafy trees in graphs
inferred← citeshttps://doi.org/10.3990/1.9789036523707openalex-snapshot
Sparse cuts, matching-cuts and leafy trees in graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.13116openalex-snapshot
Spanning trees for many different numbers of leaves
inferred← citeshttps://doi.org/10.47443/ejm.2023.027openalex-snapshot
Connected domination number and traceable graphs
inferred← citeshttps://doi.org/10.48456/tr-903openalex-snapshot
Parameterized complexity of distances to sparse graph classes
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4217openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4666openalex-snapshot
A 9k kernel for nonseparating independent set in planar 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.1305.1331openalex-snapshot
Immersions in highly edge connected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01806openalex-snapshot
Good upper bounds for the total rainbow connection of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03863openalex-snapshot
Discrete Route/Trajectory Decision Making Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1607.05460openalex-snapshot
On spanning trees with high internal degree
inferred← citeshttps://doi.org/10.48550/arxiv.2003.00538openalex-snapshot
On the Decycling Number of $4$-regular Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.13703openalex-snapshot
Scale-free spanning trees: complexity, bounds and algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2103.06853openalex-snapshot
Expansion, divisibility and parity
inferred← citeshttps://doi.org/10.48550/arxiv.2110.10530openalex-snapshot
Improved pyrotechnics : Closer to the burning graph conjecture
inferred← citeshttps://doi.org/10.5861/ijrsc.2014.603openalex-snapshot
Spanning tree with many leaves in quadratic graph
inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot
Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.
inferred← citeshttps://doi.org/10.7151/dmgt.1664openalex-snapshot
On the rainbow vertex-connection
inferred← citeshttps://doi.org/10.7155/jgaa.00295openalex-snapshot
A Note on Minimum-Segment Drawings of Planar 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.