| Publication | Date of Publication | Type |
|---|
| Optimal bi-level augmentation for selective! enhancing graph connectivity with applications | 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 | 2023-01-18 | Paper |
| Designing proxies for stock market indices is computationally hard* | 2019-01-14 | Paper |
| A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis | 2017-02-22 | Paper |
| Optimal search for parameters in Monte Carlo simulation for derivative pricing | 2016-10-07 | Paper |
| Optimal buy-and-hold strategies for financial markets with bounded daily returns | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501794 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501350 | 2015-08-03 | Paper |
| Optimal online scheduling of parallel jobs with dependencies | 2015-05-07 | Paper |
| Randomized fast design of short DNA words | 2014-11-18 | Paper |
| The risk profile problem for stock portfolio optimization (extended abstract) | 2014-09-26 | Paper |
| Discovering almost any hidden motif from multiple sequences | 2014-09-09 | Paper |
| Linear-time accurate lattice algorithms for tail conditional expectation | 2014-07-04 | Paper |
| Computing Minimum Tile Sets to Self-Assemble Color Patterns | 2014-01-14 | Paper |
| Deterministic polynomial-time algorithms for designing short DNA words | 2014-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3105285 | 2012-01-05 | Paper |
| Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems | 2011-01-28 | Paper |
| Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences | 2010-12-03 | Paper |
| Reducing tile complexity for self-assembly through temperature programming | 2010-08-16 | Paper |
| Deterministic Polynomial-Time Algorithms for Designing Short DNA Words | 2010-06-17 | Paper |
| On constructing an optimal consensus clustering from multiple clusterings | 2010-03-24 | Paper |
| Fast Accurate Algorithms for Tail Conditional Expectation | 2010-01-22 | Paper |
| Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops | 2010-01-06 | Paper |
| Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) | 2009-12-17 | Paper |
| The Closest Pair Problem under the Hamming Metric | 2009-07-23 | Paper |
| Non-shared edges and nearest neighbor interchanges revisited | 2009-07-21 | Paper |
| An approximation algorithm for a bottleneck traveling salesman problem | 2009-06-24 | Paper |
| On approximating four covering and packing problems | 2009-06-08 | Paper |
| Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability | 2009-06-03 | Paper |
| Randomized Self-assembly for Approximate Shapes | 2008-08-28 | Paper |
| Using Nash Implementation to Achieve Better Frugality Ratios | 2008-05-27 | Paper |
| Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences | 2008-05-27 | Paper |
| Flexible Word Design and Graph Labeling | 2008-04-24 | Paper |
| A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees | 2008-04-24 | Paper |
| Algorithmic DNA Self-assembly | 2008-01-04 | Paper |
| Average case analysis for tree labelling schemes | 2007-07-09 | Paper |
| An Approximation Algorithm for a Bottleneck Traveling Salesman Problem | 2007-05-02 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3365739 | 2006-01-23 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Complexities for Generalized Models of Self-Assembly | 2005-09-16 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Tight approximability results for test set problems in bioinformatics | 2005-08-03 | Paper |
| Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications | 2005-05-12 | Paper |
| SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES | 2005-02-28 | Paper |
| Fast Universalization of Investment Strategies | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737217 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472521 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472525 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474109 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474111 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472482 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459826 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459808 | 2004-05-18 | Paper |
| The enhanced double digest problem for DNA physical mapping | 2003-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410158 | 2003-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410125 | 2003-07-02 | Paper |
| Common-Face Embeddings of Planar Graphs | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796191 | 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 | 2002-04-23 | Paper |
| Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets | 2002-04-23 | Paper |
| An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings | 2002-04-08 | Paper |
| Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721996 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723946 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952644 | 2001-07-04 | Paper |
| A decomposition theorem for maximum weight bipartite matchings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526970 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526983 | 2001-02-28 | Paper |
| Simple efficient graph compression schemes for dense and complement graphs | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525735 | 2001-01-24 | Paper |
| A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs | 2000-10-18 | Paper |
| Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505398 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953351 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938779 | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938785 | 2000-03-27 | Paper |
| Reducing Randomness via Irrational Numbers | 2000-03-19 | Paper |
| Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942637 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251050 | 2000-01-19 | Paper |
| Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252289 | 1999-09-15 | Paper |
| Optimal Constructions of Hybrid Algorithms | 1999-08-23 | Paper |
| A unifying augmentation algorithm for two-edge connectivity and biconnectivity | 1999-07-21 | Paper |
| On-Line Difference Maximization | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252296 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219033 | 1999-04-19 | Paper |
| Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252417 | 1999-01-01 | Paper |
| Tree Contractions and Evolutionary Trees | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370211 | 1998-07-27 | Paper |
| Optimal on-line scheduling of parallel jobs with dependencies | 1998-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128898 | 1997-11-18 | Paper |
| Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants | 1997-10-20 | Paper |
| Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables | 1997-09-07 | Paper |
| Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem | 1997-03-06 | Paper |
| Linear-time optimal augmentation for componentwise bipartite-completeness of graphs | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364589 | 1997-01-01 | Paper |
| Data Security Equals Graph Connectivity | 1996-07-02 | Paper |
| An optimal parallel algorithm for planar cycle separators | 1995-10-25 | Paper |
| Planar Strong Connectivity Helps in Parallel Depth-First Search | 1995-03-27 | Paper |
| Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs | 1994-12-20 | Paper |
| Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs | 1994-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140448 | 1993-12-15 | Paper |
| Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test | 1993-10-14 | Paper |
| Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components | 1993-09-01 | Paper |
| Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees | 1993-09-01 | Paper |
| Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity | 1993-05-16 | Paper |
| Not all planar digraphs have small cycle separators | 1993-01-17 | Paper |
| Online matching with blocked input | 1992-06-26 | Paper |
| Parallel Depth-First Search in General Directed Graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798260 | 1988-01-01 | Paper |
