On the public citation graph
On the Approximation of Computing Evolutionary Trees
0 signed · 49 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.2001.1163openalex-snapshot
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
inferredcites →https://doi.org/10.1007/3-540-44436-xopenalex-snapshot
Approximation Algorithms for Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-44696-6_12openalex-snapshot
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
inferredcites →https://doi.org/10.1007/3-540-45753-4_12openalex-snapshot
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
inferredcites →https://doi.org/10.1007/3-540-48481-7_38openalex-snapshot
A Decomposition Theorem for MaximumWeight Bipartite Matchings with Applications to Evolutionary Trees
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_53openalex-snapshot
Rooted Maximum Agreement Supertrees
inferredcites →https://doi.org/10.1007/978-3-540-27801-6_15openalex-snapshot
Maximum Agreement and Compatible Supertrees
inferredcites →https://doi.org/10.1007/b95852openalex-snapshot
LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
inferredcites →https://doi.org/10.1007/bf00276095openalex-snapshot
When is one estimate of evolutionary relationships a refinement of another?
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/pl00009212openalex-snapshot
Finding Largest Subtrees and Smallest Supertrees
inferredcites →https://doi.org/10.1016/0020-0190(93)90181-8openalex-snapshot
Kaikoura tree theorems: Computing the maximum agreement subtree
inferredcites →https://doi.org/10.1016/0020-0190(95)00110-xopenalex-snapshot
On the agreement of many trees
inferredcites →https://doi.org/10.1016/0893-9659(96)00012-2openalex-snapshot
Finding a maximum compatible tree is NP-hard for sequences and trees
inferredcites →https://doi.org/10.1016/s0166-218x(96)00062-5openalex-snapshot
On the complexity of comparing evolutionary trees
inferredcites →https://doi.org/10.1016/s0304-3975(02)00535-2openalex-snapshot
Towards optimal lower bounds for clique and chromatic number
inferredcites →https://doi.org/10.1016/s0304-3975(98)00158-3openalex-snapshot
Some APX-completeness results for cubic graphs
inferredcites →https://doi.org/10.1109/sfcs.1996.548522openalex-snapshot
Clique is hard to approximate within n/sup 1-ε/
inferredcites →https://doi.org/10.1109/tcbb.2006.39openalex-snapshot
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems
inferredcites →https://doi.org/10.1137/s009753979223842xopenalex-snapshot
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
inferredcites →https://doi.org/10.1137/s0097539794269461openalex-snapshot
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
inferredcites →https://doi.org/10.1137/s0097539796313477openalex-snapshot
An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
inferredcites →https://doi.org/10.1142/s0129054100000363openalex-snapshot
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
inferredcites →https://doi.org/10.1287/moor.18.1.1openalex-snapshot
The Traveling Salesman Problem with Distances One and Two
inferredcites →https://doi.org/10.26021/2479openalex-snapshot
Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis
inferredcites →https://doi.org/10.7155/jgaa.00020openalex-snapshot
Approximations of Weighted Independent Set and Hereditary Subset Problems
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-0-387-30162-4_223openalex-snapshot
Maximum Compatible Tree
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_221openalex-snapshot
Maximum Agreement Subtree (of 3 or More Trees)
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_223openalex-snapshot
Maximum Compatible Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_4openalex-snapshot
Improved Approximation Algorithms for the Spanning Star Forest Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_9openalex-snapshot
An Improved Approximation Bound for Spanning Star Forest and Color Saving
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_13openalex-snapshot
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_11openalex-snapshot
On Variants of the Spanning Star Forest Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_221-2openalex-snapshot
Maximum Agreement Subtree (of 3 or More Trees)
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_223-2openalex-snapshot
Maximum Compatible Tree
inferred← citeshttps://doi.org/10.1007/s00453-011-9607-1openalex-snapshot
Improved Approximation Algorithms for the Spanning Star Forest Problem
inferred← citeshttps://doi.org/10.1007/s10878-012-9499-2openalex-snapshot
Improved approximation for spanning star forest in dense graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.007openalex-snapshot
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.06.013openalex-snapshot
An -time algorithm for the maximum constrained agreement subtree problem for binary trees
inferred← citeshttps://doi.org/10.1016/j.jda.2006.08.005openalex-snapshot
Maximum agreement and compatible supertrees
inferred← citeshttps://doi.org/10.1051/ro/2018076openalex-snapshot
On the star forest polytope for trees and cycles
inferred← citeshttps://doi.org/10.1080/10635150701639754openalex-snapshot
PhySIC: A Veto Supertree Method with Desirable Properties
inferred← citeshttps://doi.org/10.1109/codit.2014.6996904openalex-snapshot
On the star forest polytope
inferred← citeshttps://doi.org/10.1109/tcbb.2006.39openalex-snapshot
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems
inferred← citeshttps://doi.org/10.1137/070682150openalex-snapshot
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
inferred← citeshttps://doi.org/10.1142/s0129054112500232openalex-snapshot
APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM
inferred← citeshttps://doi.org/10.5555/1283383.1283453openalex-snapshot
Approximating the spanning star forest problem and its applications to genomic sequence alignment
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.