On the public citation graph

Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms

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/3-540-45655-4_42openalex-snapshot
Supertrees by Flipping
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/bf01733209openalex-snapshot
A non-sequential method for constructing trees and hierarchical classifications
inferredcites →https://doi.org/10.1007/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferredcites →https://doi.org/10.1016/0893-9659(92)90026-6openalex-snapshot
Convex tree realizations of partitions
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/s0196-6774(03)00086-5openalex-snapshot
Selecting the branches for an evolutionary tree.
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1038/35020115openalex-snapshot
Molecular classification of cutaneous malignant melanoma by gene expression profiling
inferredcites →https://doi.org/10.1073/pnas.0305627101openalex-snapshot
Stable association between strains of Mycobacterium tuberculosis and their human host populations
inferredcites →https://doi.org/10.1093/oso/9780198509424.001.0001openalex-snapshot
Phylogenetics
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/s0097539799350839openalex-snapshot
A Polynomial-Time Algorithm for Near-Perfect Phylogeny
inferredcites →https://doi.org/10.1142/s0129054196000038openalex-snapshot
SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS
inferredcites →https://doi.org/10.1145/369133.369167openalex-snapshot
Class discovery in gene expression data
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/11538462_17openalex-snapshot
Efficient Approximation of Convex Recolorings
inferred← citeshttps://doi.org/10.1007/11557067_8openalex-snapshot
Using Semi-definite Programming to Enhance Supertree Resolvability
inferred← citeshttps://doi.org/10.1007/11671411_5openalex-snapshot
Improved Approximation Algorithm for Convex Recoloring of Trees
inferred← citeshttps://doi.org/10.1007/978-1-60327-159-2_24openalex-snapshot
Fixed-Parameter Algorithms in Phylogenetics
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-319-98355-4_20openalex-snapshot
A Survey on the Complexity of Flood-Filling Games
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_10openalex-snapshot
Testing Convexity Properties of Tree Colorings
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_31openalex-snapshot
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
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.1007/978-3-642-38768-5_47openalex-snapshot
Parameterized Complexity of Flood-Filling Games on Trees
inferred← citeshttps://doi.org/10.1007/s00224-007-9069-7openalex-snapshot
Improved Approximation Algorithm for Convex Recoloring of Trees
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.ipl.2007.05.007openalex-snapshot
A algorithm for the parameterized Convex Recoloring problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.006openalex-snapshot
Efficient approximation of convex recolorings
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.003openalex-snapshot
Upper and lower bounds for finding connected motifs in vertex-colored graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.008openalex-snapshot
Tractability and hardness of flood-filling games on trees
inferred← citeshttps://doi.org/10.1109/bibe.2013.6701650openalex-snapshot
Some results on topological colored motifs in metabolic networks
inferred← citeshttps://doi.org/10.1109/tcbb.2006.58openalex-snapshot
Using Max Cut to Enhance Rooted Trees Consistency
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
inferred← citeshttps://doi.org/10.11606/t.45.2017.tde-23052017-100619openalex-snapshot
Graph colorings and digraph subdivisions
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.