| Publication | Date of Publication | Type |
|---|
Algorithms and complexity of sandwich problems in graphs (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Interval graphs with side (and size) constraints
Lecture Notes in Computer Science | 2023-05-08 | Paper |
A polynomial algorithm for balancing acyclic data flow graphs
IEEE Transactions on Computers | 2018-09-14 | Paper |
Copy-number evolution problems: complexity and algorithms
| 2018-03-23 | Paper |
A linear-time algorithm for the copy number transformation problem
| 2017-10-17 | Paper |
Sorting by Cuts, Joins and Whole Chromosome Duplications
Combinatorial Pattern Matching | 2015-08-20 | Paper |
scientific article; zbMATH DE number 6472609 (Why is no real title available?)
| 2015-08-14 | Paper |
Computational problems in noisy SNP and haplotype analysis: block scores, block identification, and population stratification
INFORMS Journal on Computing | 2012-06-08 | Paper |
An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms | 2012-01-04 | Paper |
Matching with don't-cares and a small number of mismatches
Information Processing Letters | 2010-06-16 | Paper |
Increasing the power of association studies by imputation-based sparse tag SNP selection
Communications in Information and Systems | 2010-04-15 | Paper |
Faster pattern matching with character classes using prime number encoding
Journal of Computer and System Sciences | 2009-03-02 | Paper |
Approximation algorithms for the median problem in the breakpoint model
| 2008-04-14 | Paper |
Some Computational Challenges in Today’s Bio-medicine
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Improved algorithms for the random cluster graph model
Random Structures & Algorithms | 2008-01-08 | Paper |
An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Reconstructing Chain Functions in Genetic Networks
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation | 2006-04-28 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
scientific article; zbMATH DE number 2185634 (Why is no real title available?)
| 2005-07-04 | Paper |
Incomplete Directed Perfect Phylogeny
SIAM Journal on Computing | 2005-02-21 | Paper |
A note on tolerance graph recognition
Discrete Applied Mathematics | 2004-11-23 | Paper |
Cluster graph modification problems
Discrete Applied Mathematics | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2089226 (Why is no real title available?)
| 2004-08-12 | Paper |
On the Generality of Phylogenies from Incomplete Directed Characters
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
A fully dynamic algorithm for modular decomposition and recognition of cographs.
Discrete Applied Mathematics | 2004-03-14 | Paper |
scientific article; zbMATH DE number 1953109 (Why is no real title available?)
| 2003-07-25 | Paper |
A Chemical-Distance-Based Test for Positive Darwinian Selection
Lecture Notes in Computer Science | 2003-04-06 | Paper |
scientific article; zbMATH DE number 1775386 (Why is no real title available?)
| 2002-08-01 | Paper |
A clustering algorithm based on graph connectivity
Information Processing Letters | 2002-07-25 | Paper |
A Fully dynamic algorithm for recognizing and representing proper interval graphs
SIAM Journal on Computing | 2002-04-23 | Paper |
Complexity classification of some edge modification problems
Discrete Applied Mathematics | 2002-01-16 | Paper |
scientific article; zbMATH DE number 1615277 (Why is no real title available?)
| 2001-07-08 | Paper |
scientific article; zbMATH DE number 1420899 (Why is no real title available?)
| 2001-01-14 | Paper |
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
SIAM Journal on Computing | 2000-10-18 | Paper |
Bounded degree interval sandwich problems
Algorithmica | 2000-04-03 | Paper |
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing | 2000-03-19 | Paper |
Faster Subtree Isomorphism
Journal of Algorithms | 2000-03-19 | Paper |
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1303580 (Why is no real title available?)
| 1999-06-17 | Paper |
Satisfiability problems on intervals and unit intervals
Theoretical Computer Science | 1998-07-23 | Paper |
Realizing Interval Graphs with Size and Distance Constraints
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing | 1996-12-11 | Paper |
Graph Sandwich Problems
Journal of Algorithms | 1996-05-27 | Paper |
On the complexity of DNA physical mapping
Advances in Applied Mathematics | 1994-11-23 | Paper |
Complexity and algorithms for reasoning about time
Journal of the ACM | 1994-09-11 | Paper |
Balancing problems in acyclic networks
Discrete Applied Mathematics | 1994-06-15 | Paper |
The domatic number problem on some perfect graph families
Information Processing Letters | 1994-05-19 | Paper |
Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
Algorithmica | 1994-04-17 | Paper |
Monge and feasibility sequences in general flow problems
Discrete Applied Mathematics | 1994-01-23 | Paper |
scientific article; zbMATH DE number 432782 (Why is no real title available?)
| 1994-01-02 | Paper |
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
Discrete Mathematics | 1993-10-24 | Paper |
scientific article; zbMATH DE number 176072 (Why is no real title available?)
| 1993-05-18 | Paper |
A polynomial algorithm for an integer quadratic non-separable transportation problem
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Operations Research | 1992-06-26 | Paper |
Minimizing the number of tardy job units under release time constraints
Discrete Applied Mathematics | 1990-01-01 | Paper |
An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
Information Processing Letters | 1989-01-01 | Paper |
An algorithm for the detection and construction of Monge sequences
Linear Algebra and its Applications | 1989-01-01 | Paper |
The Efficiency of the Simplex Method: A Survey
Management Science | 1987-01-01 | Paper |
A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
Journal of Complexity | 1987-01-01 | Paper |
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
Mathematics of Operations Research | 1986-01-01 | Paper |
