| Publication | Date of Publication | Type |
|---|
Proven Impossible
| 2023-10-30 | Paper |
Comparing integer linear programming to SAT-solving for hard problems in computational and systems biology
Algorithms for Computational Biology | 2022-10-13 | Paper |
Efficient solution of the matroid product problem
Operations Research Letters | 2019-07-22 | Paper |
Integer Linear Programming in Computational and Systems Biology
| 2019-05-08 | Paper |
A sparsified Four-Russian algorithm for RNA folding
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Minimum average distance clique trees
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
G\"odel for Goldilocks: A Rigorous, Streamlined Proof of (a variant of) G\"odel's First Incompleteness Theorem
| 2014-09-21 | Paper |
ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
| 2014-07-14 | Paper |
Speedup of RNA pseudoknotted secondary structure recurrence computation with the four-Russians method
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
The fine structure of galls in phylogenetic networks
INFORMS Journal on Computing | 2012-06-08 | Paper |
Generalizing the splits equivalence theorem and four gamete condition: Perfect phylogeny on three-state characters
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
Lecture Notes in Computer Science | 2011-03-18 | Paper |
The three-state perfect phylogeny problem reduces to 2-SAT
Communications in Information and Systems | 2010-04-23 | Paper |
A new recombination lower bound and the minimum perfect phylogenetic forest problem
Journal of Combinatorial Optimization | 2009-07-13 | Paper |
A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data
Lecture Notes in Computer Science | 2009-03-06 | Paper |
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Computational Methods for SNPs and Haplotype Inference
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations
Lecture Notes in Computer Science | 2007-08-30 | Paper |
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
Discrete Applied Mathematics | 2007-04-18 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
scientific article; zbMATH DE number 2185625 (Why is no real title available?)
| 2005-07-04 | Paper |
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
Journal of Computer and System Sciences | 2005-05-04 | Paper |
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Partition-distance: A problem and class of perfect graphs arising in clustering
Information Processing Letters | 2002-07-14 | Paper |
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science | 2002-03-03 | Paper |
The structure and complexity of sports elimination numbers
Algorithmica | 2002-02-28 | Paper |
A More Efficient Approximation Scheme for Tree Alignment
SIAM Journal on Computing | 2000-10-18 | Paper |
scientific article; zbMATH DE number 1301590 (Why is no real title available?)
| 2000-02-20 | Paper |
Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
Discrete Applied Mathematics | 1999-03-22 | Paper |
Algorithms on Strings, Trees and Sequences
| 1999-02-28 | Paper |
Improved Approximation Algorithms for Tree Alignment
Journal of Algorithms | 1998-09-08 | Paper |
A Fast Algorithm for Optimally Increasing the Edge Connectivity
SIAM Journal on Computing | 1998-02-10 | Paper |
Reconstructing a history of recombinations from a set of sequences
Discrete Applied Mathematics | 1998-01-01 | Paper |
scientific article; zbMATH DE number 1003279 (Why is no real title available?)
| 1997-04-23 | Paper |
Faster implementation of a shortest superstring approximation
Information Processing Letters | 1996-02-26 | Paper |
scientific article; zbMATH DE number 826056 (Why is no real title available?)
| 1995-12-13 | Paper |
scientific article; zbMATH DE number 742991 (Why is no real title available?)
| 1995-04-11 | Paper |
Parametric optimization of sequence alignment
Algorithmica | 1994-11-08 | Paper |
scientific article; zbMATH DE number 432789 (Why is no real title available?)
| 1994-09-20 | Paper |
A faster parametric minimum-cut algorithm
Algorithmica | 1994-09-11 | Paper |
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
Extracting maximal information about sets of minimum cuts
Algorithmica | 1993-09-01 | Paper |
scientific article; zbMATH DE number 218386 (Why is no real title available?)
| 1993-06-29 | Paper |
Efficient methods for multiple sequence alignment with guaranteed error bounds
Bulletin of Mathematical Biology | 1993-02-11 | Paper |
scientific article; zbMATH DE number 45086 (Why is no real title available?)
| 1993-01-23 | Paper |
A bounded approximation for the minimum cost 2-sat problem
Algorithmica | 1992-09-27 | Paper |
An efficient algorithm for the all pairs suffix-prefix problem
Information Processing Letters | 1992-09-26 | Paper |
A fast algorithm for the generalized parametric minimum cut problem and applications
Algorithmica | 1992-06-28 | Paper |
Efficient algorithms for generalized cut‐trees
Networks | 1992-06-25 | Paper |
Computing the Strength of a Graph
SIAM Journal on Computing | 1992-06-25 | Paper |
Efficient algorithms for inferring evolutionary trees
Networks | 1991-01-01 | Paper |
Very Simple Methods for All Pairs Network Flow Analysis
SIAM Journal on Computing | 1990-01-01 | Paper |
Parametric stable marriage and minimum cuts
Information Processing Letters | 1989-01-01 | Paper |
A Graph Theoretic Approach to Statistical Data Security
SIAM Journal on Computing | 1988-01-01 | Paper |
The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
SIAM Journal on Computing | 1988-01-01 | Paper |
Three Fast Algorithms for Four Problems in Stable Marriage
SIAM Journal on Computing | 1987-01-01 | Paper |
Fast Algorithms for Bipartite Network Flow
SIAM Journal on Computing | 1987-01-01 | Paper |
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
Journal of Combinatorial Theory. Series A | 1987-01-01 | Paper |
Optimal Mixed Graph Augmentation
SIAM Journal on Computing | 1987-01-01 | Paper |
Equivalent approximation algorithms for node cover
Information Processing Letters | 1986-01-01 | Paper |
Bounds for naive multiple machine scheduling with release times and deadlines
Journal of Algorithms | 1984-01-01 | Paper |
Matroid optimization with the interleaving of two ordered sets
Discrete Applied Mathematics | 1984-01-01 | Paper |
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM | 1983-01-01 | Paper |
A note on Arc tolerances in sparse shortest-path and network flow problems
Networks | 1983-01-01 | Paper |
Connectivity and edge-disjoint spanning trees
Information Processing Letters | 1983-01-01 | Paper |
Simple Constructions for Multiterminal Network Flow Synthesis
SIAM Journal on Computing | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3702681 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3717343 (Why is no real title available?)
| 1980-01-01 | Paper |
