On the public citation graph

Improved Approximation Algorithm for Convex Recoloring of Trees

0 signed · 26 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/net.3230210104openalex-snapshot
Efficient algorithms for inferring evolutionary trees
inferredcites →https://doi.org/10.1007/11534273_20openalex-snapshot
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
inferredcites →https://doi.org/10.1007/11538462_17openalex-snapshot
Efficient Approximation of Convex Recolorings
inferredcites →https://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferredcites →https://doi.org/10.1007/s004530010009openalex-snapshot
One for the Price of Two: a Unified Approach for Approximating Covering Problems
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/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1093/oso/9780198509424.001.0001openalex-snapshot
Phylogenetics
inferredcites →https://doi.org/10.1109/tc.1984.5009360openalex-snapshot
On Generating the N-ary Reflected Gray Codes
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.1137/s0097539794279067openalex-snapshot
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
inferredcites →https://doi.org/10.1137/s0895480196305124openalex-snapshot
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1145/1041680.1041683openalex-snapshot
Local ratio
inferredcites →https://doi.org/10.1145/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling

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-540-73545-8_10openalex-snapshot
Connected Coloring Completion for General Graphs: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_11openalex-snapshot
Quadratic Kernelization for Convex Recoloring of Trees
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.1016/j.dam.2011.09.022openalex-snapshot
The complexity of minimum convex coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.034openalex-snapshot
Convex recoloring of paths
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.029openalex-snapshot
Convex Recoloring of Paths
inferred← citeshttps://doi.org/10.1145/2000807.2000810openalex-snapshot
Partial convex recolorings of trees and galled networks
inferred← citeshttps://doi.org/10.11606/d.45.2013.tde-19112013-193725openalex-snapshot
Recoloração convexa de grafos: algoritmos e poliedros
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.