| Publication | Date of Publication | Type |
|---|
Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Optimal augmentation for bipartite componentwise biconnectivity in linear time | 2023-01-25 | Paper |
Improved parallel depth-first search in undirected planar graphs
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Designing proxies for stock market indices is computationally hard
Quantitative Finance | 2019-01-14 | Paper |
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Optimal search for parameters in Monte Carlo simulation for derivative pricing
European Journal of Operational Research | 2016-10-07 | Paper |
Optimal buy-and-hold strategies for financial markets with bounded daily returns
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
| scientific article; zbMATH DE number 6472591 (Why is no real title available?) | 2015-08-14 | Paper |
| Complexities for generalized models of self-assembly | 2015-08-03 | Paper |
Optimal online scheduling of parallel jobs with dependencies
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Randomized fast design of short DNA words
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The risk profile problem for stock portfolio optimization (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Linear-time accurate lattice algorithms for tail conditional expectation
Algorithmic Finance | 2014-07-04 | Paper |
Computing minimum tile sets to self-assemble color patterns
Algorithms and Computation | 2014-01-14 | Paper |
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science | 2014-01-10 | Paper |
| Testing whether a set of code words satisfies a given set of constraints | 2012-01-05 | Paper |
Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
Lecture Notes in Computer Science | 2011-01-28 | Paper |
Probabilistic analysis of a motif discovery algorithm for multiple sequences
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Reducing tile complexity for self-assembly through temperature programming
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Deterministic polynomial-time algorithms for designing short DNA words
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On constructing an optimal consensus clustering from multiple clusterings
Information Processing Letters | 2010-03-24 | Paper |
Fast accurate algorithms for tail conditional expectation
AIP Conference Proceedings | 2010-01-22 | Paper |
Linear-time haplotype inference on pedigrees without recombinations and mating loops
SIAM Journal on Computing | 2010-01-06 | Paper |
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
Algorithms and Computation | 2009-12-17 | Paper |
The Closest Pair Problem under the Hamming Metric
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Non-shared edges and nearest neighbor interchanges revisited
Information Processing Letters | 2009-07-21 | Paper |
An approximation algorithm for a bottleneck traveling salesman problem
Journal of Discrete Algorithms | 2009-06-24 | Paper |
On approximating four covering and packing problems
Journal of Computer and System Sciences | 2009-06-08 | Paper |
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Randomized Self-assembly for Approximate Shapes
Automata, Languages and Programming | 2008-08-28 | Paper |
Using Nash Implementation to Achieve Better Frugality Ratios
Algorithms and Computation | 2008-05-27 | Paper |
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Flexible Word Design and Graph Labeling
Algorithms and Computation | 2008-04-24 | Paper |
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
Algorithms and Computation | 2008-04-24 | Paper |
Algorithmic DNA Self-assembly
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Average case analysis for tree labelling schemes
Theoretical Computer Science | 2007-07-09 | Paper |
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
| Towards understanding the predictability of stock markets from the perspective of computational complexity | 2006-01-23 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing | 2005-09-16 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
Journal of Computer and System Sciences | 2005-05-12 | Paper |
SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES
International Journal of Foundations of Computer Science | 2005-02-28 | Paper |
Fast Universalization of Investment Strategies
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2086680 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080270 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080274 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081008 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081010 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080237 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2065154 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2065142 (Why is no real title available?) | 2004-05-18 | Paper |
The enhanced double digest problem for DNA physical mapping
Journal of Combinatorial Optimization | 2003-10-27 | Paper |
| scientific article; zbMATH DE number 1945181 (Why is no real title available?) | 2003-07-02 | Paper |
| scientific article; zbMATH DE number 1945161 (Why is no real title available?) | 2003-07-02 | Paper |
Common-Face Embeddings of Planar Graphs
SIAM Journal on Computing | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1875432 (Why is no real title available?) | 2003-03-02 | Paper |
| Towards understanding the predictability of stock markets from the perspective of computational complexity | 2002-07-22 | Paper |
Optimal buy-and-hold strategies for financial markets with bounded daily returns
SIAM Journal on Computing | 2002-04-23 | Paper |
Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets
SIAM Journal on Computing | 2002-04-23 | Paper |
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
Journal of Algorithms | 2002-04-08 | Paper |
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1617274 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1615276 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1445327 (Why is no real title available?) | 2001-07-04 | Paper |
A decomposition theorem for maximum weight bipartite matchings
SIAM Journal on Computing | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1559522 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1559535 (Why is no real title available?) | 2001-02-28 | Paper |
Simple efficient graph compression schemes for dense and complement graphs
Journal of Combinatorial Optimization | 2001-02-09 | Paper |
| scientific article; zbMATH DE number 1555964 (Why is no real title available?) | 2001-01-24 | Paper |
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
SIAM Journal on Computing | 2000-10-18 | Paper |
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1511710 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1444320 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1405794 (Why is no real title available?) | 2000-04-10 | Paper |
| scientific article; zbMATH DE number 1405800 (Why is no real title available?) | 2000-03-27 | Paper |
Reducing Randomness via Irrational Numbers
SIAM Journal on Computing | 2000-03-19 | Paper |
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1414300 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1304319 (Why is no real title available?) | 2000-01-19 | Paper |
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1305408 (Why is no real title available?) | 1999-09-15 | Paper |
Optimal Constructions of Hybrid Algorithms
Journal of Algorithms | 1999-08-23 | Paper |
A unifying augmentation algorithm for two-edge connectivity and biconnectivity
Journal of Combinatorial Optimization | 1999-07-21 | Paper |
On-Line Difference Maximization
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1305415 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1223718 (Why is no real title available?) | 1999-04-19 | Paper |
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions
SIAM Journal on Computing | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1305525 (Why is no real title available?) | 1999-01-01 | Paper |
Tree Contractions and Evolutionary Trees
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1104338 (Why is no real title available?) | 1998-07-27 | Paper |
Optimal on-line scheduling of parallel jobs with dependencies
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
| scientific article; zbMATH DE number 1003269 (Why is no real title available?) | 1997-11-18 | Paper |
Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants
Journal of Combinatorial Optimization | 1997-10-20 | Paper |
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
SIAM Journal on Computing | 1997-09-07 | Paper |
Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
Information and Computation | 1997-03-06 | Paper |
Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 1088273 (Why is no real title available?) | 1997-01-01 | Paper |
Data Security Equals Graph Connectivity
SIAM Journal on Discrete Mathematics | 1996-07-02 | Paper |
An optimal parallel algorithm for planar cycle separators
Algorithmica | 1995-10-25 | Paper |
Planar Strong Connectivity Helps in Parallel Depth-First Search
SIAM Journal on Computing | 1995-03-27 | Paper |
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
Journal of Computer and System Sciences | 1994-09-18 | Paper |
| scientific article; zbMATH DE number 437569 (Why is no real title available?) | 1993-12-15 | Paper |
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
SIAM Journal on Computing | 1993-09-01 | Paper |
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
SIAM Journal on Computing | 1993-09-01 | Paper |
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
SIAM Journal on Computing | 1993-05-16 | Paper |
Not all planar digraphs have small cycle separators
Information Processing Letters | 1993-01-17 | Paper |
Online matching with blocked input
Information Processing Letters | 1992-06-26 | Paper |
Parallel Depth-First Search in General Directed Graphs
SIAM Journal on Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4064511 (Why is no real title available?) | 1988-01-01 | Paper |
