| Publication | Date of Publication | Type |
|---|
Computing the agreement of trees with bounded degrees
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Optimal cost-sensitive distributed minimum spanning tree algorithm
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Asymptotically optimal election on weighted rings
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
| A sticky multinomial mixture model of strand-coordinated mutational processes in cancer | 2019-05-21 | Paper |
The Optimal Alphabetic Tree problem revisited
Automata, Languages and Programming | 2019-04-29 | Paper |
When and how the perfect phylogeny model explains evolution
Discrete and Topological Models in Molecular Biology | 2014-06-23 | Paper |
An Important Connection Between Network Motifs and Parsimony Models
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Scale-free networks versus evolutionary drift
Computational Biology and Chemistry | 2006-05-16 | Paper |
| scientific article; zbMATH DE number 2185610 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2102786 (Why is no real title available?) | 2004-09-24 | Paper |
An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559522 (Why is no real title available?) | 2001-02-28 | Paper |
The Optimal Alphabetic Tree Problem Revisited
Journal of Algorithms | 1998-10-21 | Paper |
Asymptotically Optimal Election on Weighted Rings
SIAM Journal on Computing | 1998-09-21 | Paper |
A simple construction of high representativity triangulations
Discrete Mathematics | 1998-06-29 | Paper |
| scientific article; zbMATH DE number 1113983 (Why is no real title available?) | 1998-05-04 | Paper |
A simple, efficient algorithm for maximum finding on rings
Information Processing Letters | 1997-02-27 | Paper |
On the agreement of many trees
Information Processing Letters | 1997-02-27 | Paper |
Parallel maximum independent set in convex bipartite graphs
Information Processing Letters | 1997-02-27 | Paper |
On the complexity of string folding
Discrete Applied Mathematics | 1997-02-25 | Paper |
A parallel algorithm for optimum height-limited alphabetic binary trees
Journal of Parallel and Distributed Computing | 1996-11-25 | Paper |
Constructing Huffman Trees in Parallel
SIAM Journal on Computing | 1996-02-25 | Paper |
Parallel construction of binary trees with near optimal weighted path length
Algorithmica | 1996-02-20 | Paper |
A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
SIAM Journal on Computing | 1995-04-06 | Paper |
| scientific article; zbMATH DE number 475596 (Why is no real title available?) | 1994-05-30 | Paper |
| scientific article; zbMATH DE number 475580 (Why is no real title available?) | 1994-01-06 | Paper |
Grid intersection graphs and boxicity
Discrete Mathematics | 1993-10-24 | Paper |
Parallel algorithms for parity graphs
Journal of Algorithms | 1991-01-01 | Paper |
Parallel recognition of complement reducible graphs and cotree construction
Discrete Applied Mathematics | 1990-01-01 | Paper |
On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
