On the public citation graph

Partial convex recolorings of trees and galled networks

0 signed · 46 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/net.3230210104openalex-snapshot
Efficient algorithms for inferring evolutionary trees
inferredcites →https://doi.org/10.1007/11415770_17openalex-snapshot
A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters
inferredcites →https://doi.org/10.1007/11671411_5openalex-snapshot
Improved Approximation Algorithm for Convex Recoloring of Trees
inferredcites →https://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-540-73545-8_10openalex-snapshot
Connected Coloring Completion for General Graphs: Algorithms and Complexity
inferredcites →https://doi.org/10.1007/978-3-540-73545-8_11openalex-snapshot
Quadratic Kernelization for Convex Recoloring of Trees
inferredcites →https://doi.org/10.1007/bf00182187openalex-snapshot
A heuristic method to reconstruct the history of sequences subject to recombination
inferredcites →https://doi.org/10.1007/bf00390110openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1007/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferredcites →https://doi.org/10.1007/s10878-006-7135-8openalex-snapshot
Inapproximability and approximability of maximal tree routing and coloring
inferredcites →https://doi.org/10.1016/0025-5564(90)90123-gopenalex-snapshot
Reconstructing evolution of sequences subject to recombination using parsimony
inferredcites →https://doi.org/10.1016/b978-0-12-289260-8.50010-8openalex-snapshot
Perfect Graphs
inferredcites →https://doi.org/10.1016/j.ipl.2007.05.007openalex-snapshot
A algorithm for the parameterized Convex Recoloring problem
inferredcites →https://doi.org/10.1016/j.jcss.2007.03.006openalex-snapshot
Efficient approximation of convex recolorings
inferredcites →https://doi.org/10.1016/j.jcss.2007.10.003openalex-snapshot
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
inferredcites →https://doi.org/10.1016/s0166-218x(96)00060-1openalex-snapshot
Minimizing phylogenetic number to find good evolutionary trees
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/bioinformatics/btl313openalex-snapshot
Efficient parsimony-based methods for phylogenetic network reconstruction
inferredcites →https://doi.org/10.1093/oso/9780198509424.001.0001openalex-snapshot
Phylogenetics
inferredcites →https://doi.org/10.1093/sysbio/20.4.406openalex-snapshot
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
inferredcites →https://doi.org/10.1109/csb.2003.1227337openalex-snapshot
Efficient reconstruction of phylogenetic networks with constrained recombination
inferredcites →https://doi.org/10.1109/csb.2005.47openalex-snapshot
Reconstructing phylogenetic networks using maximum parsimony
inferredcites →https://doi.org/10.1109/tcbb.2007.1018openalex-snapshot
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem
inferredcites →https://doi.org/10.1126/science.284.5423.2124openalex-snapshot
Phylogenetic Classification and the Universal Tree
inferredcites →https://doi.org/10.1137/0128004openalex-snapshot
Minimal Mutation Trees of Sequences
inferredcites →https://doi.org/10.1137/s0097539791222171openalex-snapshot
Inferring Evolutionary History From DNA Sequences
inferredcites →https://doi.org/10.1142/s0129054196000038openalex-snapshot
SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS
inferredcites →https://doi.org/10.1142/s0219720004000521openalex-snapshot
OPTIMAL, EFFICIENT RECONSTRUCTION OF PHYLOGENETIC NETWORKS WITH CONSTRAINED RECOMBINATION
inferredcites →https://doi.org/10.5555/313651.313823openalex-snapshot
A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-66616-7_3openalex-snapshot
Column Generation Approach to the Convex Recoloring Problem on a Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_10openalex-snapshot
Connected Coloring Completion for General Graphs: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_43openalex-snapshot
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_5openalex-snapshot
The Complexity of Minimum Convex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_54openalex-snapshot
On the Complexity of Solving or Approximating Convex Recoloring Problems
inferred← citeshttps://doi.org/10.1007/s10107-015-0880-7openalex-snapshot
The convex recoloring problem: polyhedra, facets and computational experiments
inferred← citeshttps://doi.org/10.1007/s10107-016-1094-3openalex-snapshot
An extended formulation of the convex recoloring problem on a tree
inferred← citeshttps://doi.org/10.1016/j.dam.2011.09.022openalex-snapshot
The complexity of minimum convex coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.002openalex-snapshot
Strong intractability results for generalized convex recoloring problems
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.034openalex-snapshot
A GRASP for the Convex Recoloring Problem in Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.017openalex-snapshot
Hardness and inapproximability of convex recoloring problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.016openalex-snapshot
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
inferred← citeshttps://doi.org/10.1111/itor.12896openalex-snapshot
A heuristic for the convex recoloring problem in graphs
inferred← citeshttps://doi.org/10.11606/t.45.2011.tde-23012012-144246openalex-snapshot
Recoloração convexa de caminhos
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.