On the public citation graph

Using Max Cut to Enhance Rooted Trees Consistency

0 signed · 74 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/(sici)1098-2418(199903)14:2<153::aid-rsa3>3.0.co;2-ropenalex-snapshot
A few logs suffice to build (almost) all trees (I)
inferredcites →https://doi.org/10.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1006/aama.1995.1020openalex-snapshot
Extension Operations on Sets of Leaf-Labeled 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/11557067_8openalex-snapshot
Using Semi-definite Programming to Enhance Supertree Resolvability
inferredcites →https://doi.org/10.1007/3-540-45655-4_42openalex-snapshot
Supertrees by Flipping
inferredcites →https://doi.org/10.1007/3-540-45784-4_41openalex-snapshot
Modified Mincut Supertrees
inferredcites →https://doi.org/10.1007/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferredcites →https://doi.org/10.1007/pl00009268openalex-snapshot
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology
inferredcites →https://doi.org/10.1016/0303-2647(92)90007-lopenalex-snapshot
Matrix representation in reconstructing phylogenetic relationships among the eukaryotes
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(00)00202-xopenalex-snapshot
A supertree method for rooted trees
inferredcites →https://doi.org/10.1017/s0952836904005539openalex-snapshot
A species‐level phylogenetic supertree of marsupials
inferredcites →https://doi.org/10.1080/10635150490423719openalex-snapshot
Performance of Flip Supertree Construction with a Heuristic Algorithm
inferredcites →https://doi.org/10.1080/10635159950173870openalex-snapshot
Points of View Simple but Fundamental Limitations on Supertree and Consensus Tree Methods
inferredcites →https://doi.org/10.1089/106652799318337openalex-snapshot
Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction
inferredcites →https://doi.org/10.1089/cmb.1998.5.377openalex-snapshot
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships
inferredcites →https://doi.org/10.1093/sysbio/46.3.554openalex-snapshot
Analyzing Large Data Sets: rbcL 500 Revisited
inferredcites →https://doi.org/10.1093/sysbio/49.2.363openalex-snapshot
Simple but Fundamental Limitations on Supertree and Consensus Tree Methods
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1109/tcbb.2007.1010openalex-snapshot
Distorted Metrics on Trees and Phylogenetic Forests
inferredcites →https://doi.org/10.1137/0210030openalex-snapshot
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
inferredcites →https://doi.org/10.1137/1038003openalex-snapshot
Semidefinite Programming
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/263867.263872openalex-snapshot
A simple min-cut algorithm
inferredcites →https://doi.org/10.2307/1222480openalex-snapshot
Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees
inferredcites →https://doi.org/10.26021/2479openalex-snapshot
Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis

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-030-10837-3_6openalex-snapshot
Divide-and-Conquer Tree Estimation: Opportunities and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_15openalex-snapshot
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_23openalex-snapshot
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
inferred← citeshttps://doi.org/10.1007/978-3-319-56970-3_6openalex-snapshot
Determining the Consistency of Resolved Triplets and Fan Triplets
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_7openalex-snapshot
Comparing and Aggregating Partially Resolved Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_44openalex-snapshot
New Results on Optimizing Rooted Triplets Consistency
inferred← citeshttps://doi.org/10.1007/978-3-642-02008-7_4openalex-snapshot
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-642-15294-8_22openalex-snapshot
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_24openalex-snapshot
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
inferred← citeshttps://doi.org/10.1007/s00239-018-9833-0openalex-snapshot
The Performance of Two Supertree Schemes Compared Using Synthetic and Real Data Quartet Input
inferred← citeshttps://doi.org/10.1016/j.dam.2010.03.004openalex-snapshot
New results on optimizing rooted triplets consistency
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.028openalex-snapshot
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.027openalex-snapshot
Comparing and aggregating partially resolved trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.032openalex-snapshot
Kernel and fast algorithm for dense triplet inconsistency
inferred← citeshttps://doi.org/10.1016/j.ympev.2011.06.021openalex-snapshot
Quartet MaxCut: A fast algorithm for amalgamating quartet trees
inferred← citeshttps://doi.org/10.1080/09298215.2012.668194openalex-snapshot
A Phylogenetic Approach to Music Performance Analysis
inferred← citeshttps://doi.org/10.1089/cmb.2009.0028openalex-snapshot
Phylogeny Inference Based on Spectral Graph Clustering
inferred← citeshttps://doi.org/10.1089/cmb.2017.0256openalex-snapshot
Determining the Consistency of Resolved Triplets and Fan Triplets
inferred← citeshttps://doi.org/10.1093/sysbio/syaf054openalex-snapshot
ConvexML: Fast and Accurate Branch Length Estimation under Irreversible Mutation Models, Illustrated through Applications to CRISPR/Cas9-Based Lineage Tracing
inferred← citeshttps://doi.org/10.1093/sysbio/syu087openalex-snapshot
Weighted Quartets Phylogenetics
inferred← citeshttps://doi.org/10.1093/sysbio/syv016openalex-snapshot
On the Robustness to Gene Tree Estimation Error (or lack thereof) of Coalescent-Based Species Tree Methods
inferred← citeshttps://doi.org/10.1101/2025.07.27.667007openalex-snapshot
Can you trust your reconstructed lineage tree? A homoplasy-based approach for irreversible evolution
inferred← citeshttps://doi.org/10.1101/gr.280564.125openalex-snapshot
Tree reconstruction guarantees from CRISPR-Cas9 lineage tracing data using Neighbor-Joining
inferred← citeshttps://doi.org/10.1109/icvrv.2014.72openalex-snapshot
Image-Based Hierarchical Method of 3D Model Retrieval
inferred← citeshttps://doi.org/10.1109/tcbb.2008.133openalex-snapshot
Quartets MaxCut: A Divide and Conquer Quartets Algorithm
inferred← citeshttps://doi.org/10.1109/tcbb.2008.51openalex-snapshot
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data
inferred← citeshttps://doi.org/10.1109/tcbb.2010.17openalex-snapshot
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks
inferred← citeshttps://doi.org/10.1109/tcbb.2010.74openalex-snapshot
A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem
inferred← citeshttps://doi.org/10.1111/2041-210x.12606openalex-snapshot
Triplet MaxCut: a new toolkit for rooted supertree
inferred← citeshttps://doi.org/10.1137/100811489openalex-snapshot
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
inferred← citeshttps://doi.org/10.1137/11086964xopenalex-snapshot
Reconstructing Approximate Phylogenetic Trees from Quartet Samples
inferred← citeshttps://doi.org/10.1142/s0219720009004308openalex-snapshot
UNIQUENESS, INTRACTABILITY AND EXACT ALGORITHMS: REFLECTIONS ON LEVEL-K PHYLOGENETIC NETWORKS
inferred← citeshttps://doi.org/10.1145/2020408.2020564openalex-snapshot
Clustering with relative constraints
inferred← citeshttps://doi.org/10.1186/1471-2105-10-s1-s8openalex-snapshot
Triplet supertree heuristics for the tree of life
inferred← citeshttps://doi.org/10.1186/1471-2105-9-413openalex-snapshot
PhySIC_IST: cleaning source trees to infer more informative supertrees
inferred← citeshttps://doi.org/10.1186/1748-7188-5-18openalex-snapshot
Robinson-Foulds Supertrees
inferred← citeshttps://doi.org/10.1186/1748-7188-5-37openalex-snapshot
Accuracy of phylogeny reconstruction methods combining overlapping gene data sets
inferred← citeshttps://doi.org/10.1186/1748-7188-7-31openalex-snapshot
Gene tree correction for reconciliation and species tree inference
inferred← citeshttps://doi.org/10.3390/a1020100openalex-snapshot
Mathematical Programming in Computational Biology: an Annotated Bibliography
inferred← citeshttps://doi.org/10.3934/medsci.2018.2.181openalex-snapshot
Minimal Phylogenetic Supertrees and Local Consensus Trees
inferred← citeshttps://doi.org/10.48550/arxiv.0901.3299openalex-snapshot
Computing Rooted and Unrooted Maximum Consistent Supertrees
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03530openalex-snapshot
Supertree Construction: Opportunities and Challenges
inferred← citeshttps://doi.org/10.48550/arxiv.1903.01859openalex-snapshot
An $\widetilde{\mathcal{O}}(m/\varepsilon^{3.5})$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11548openalex-snapshot
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT
inferred← citeshttps://doi.org/10.5555/1873601.1873685openalex-snapshot
Reconstructing approximate phylogenetic trees from quartet samples
inferred← citeshttps://doi.org/10.6100/ir639548openalex-snapshot
Algorithms, haplotypes and phylogenetic networks
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.