Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Kaveh Khoshkhah
Complexity and Approximability of Extended Spanning Star Forest Problems in General and Complete Graphs
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Correction To: Weighted Upper Edge Cover: Complexity and Approximability
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Some Applications of Spanning Trees in Complete and Complete Bipartite Graphs
American Journal of Applied Sciences
Multidisciplinary
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Complexity of Products of Some Complete and Complete Bipartite Graphs
Journal of Applied Mathematics
Applied Mathematics
Complexity of Disjoint Paths Problems in Planar Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Complexity of Dissociation Set Problems in Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
On Dominating and Spanning Circuits in Graphs
Discrete Mathematics
Combinatorics
Theoretical Computer Science
Discrete Mathematics
Trees With Α-Labelings and Decompositions of Complete Graphs Into Non-Symmetric Isomorphic Spanning Trees
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
