| Publication | Date of Publication | Type |
|---|
| Exponential time approximation scheme for TSP | 2024-02-23 | Paper |
| Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity | 2023-05-23 | Paper |
| Streaming algorithms for multitasking scheduling with shared processing | 2022-08-24 | Paper |
| New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition | 2022-07-21 | Paper |
| Approximate set union via approximate randomization | 2021-10-21 | Paper |
| Polyhedral circuits and their applications | 2021-07-05 | Paper |
| Approximate set union via approximate randomization | 2021-04-21 | Paper |
| Hardness of sparse sets and minimal circuit size problem | 2021-04-21 | Paper |
| An approximation algorithm for the \(l\)-pseudoforest deletion problem | 2020-01-16 | Paper |
| Fast face recognition based on fractal theory | 2019-06-21 | Paper |
| Randomized parameterized algorithms for the kidney exchange problem | 2019-05-14 | Paper |
| Sublinear time motif discovery from multiple sequences | 2019-03-26 | Paper |
| Second-order sliding mode disturbance observer-based adaptive fuzzy tracking control for near-space vehicles with prescribed tracking performance | 2019-02-08 | Paper |
| Partial sublinear time approximation and inapproximation for maximum coverage | 2018-10-04 | Paper |
| Constant factor approximation algorithm for \(l\)-pseudoforest deletion problem | 2018-10-04 | Paper |
| Molecular computing, bounded nondeterminism, and efficient recursion | 2018-07-04 | Paper |
| An improved FPT algorithm for almost forest deletion problem | 2018-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4641275 | 2018-05-25 | Paper |
| Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem | 2018-02-28 | Paper |
| Optimal Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments | 2017-10-19 | Paper |
| Concentration independent random number generation in tile self-assembly | 2017-02-22 | Paper |
| The label cut problem with respect to path length and label frequency | 2016-09-12 | Paper |
| Competitive algorithms for unbounded one-way trading | 2015-12-08 | Paper |
| Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly | 2015-09-30 | Paper |
| Competitive Algorithms for Unbounded One-Way Trading | 2015-05-20 | Paper |
| Discovering almost any hidden motif from multiple sequences | 2014-09-09 | Paper |
| On the approximability of the exemplar adjacency number problem for genomes with gene repetitions | 2014-08-26 | Paper |
| On the Complexity of Approximate Sum of Sorted List | 2014-04-03 | Paper |
| On testing monomials in multivariate polynomials | 2014-01-10 | Paper |
| Algebraic data retrieval algorithms for multi-channel wireless data broadcast | 2014-01-10 | Paper |
| Self-assembly with Geometric Tiles | 2013-08-12 | Paper |
| Constant time approximation scheme for largest well predicted subset | 2013-06-28 | Paper |
| Sublinear Time Approximate Sum via Uniform Random Sampling | 2013-06-11 | Paper |
| Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials | 2013-03-25 | Paper |
| The complexity of influence maximization problem in the deterministic linear threshold model | 2013-01-03 | Paper |
| A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing | 2012-07-16 | Paper |
| Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP | 2012-07-16 | Paper |
| Erratum: The Approximability of the Exemplar Breakpoint Distance Problem | 2012-07-16 | Paper |
| NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets | 2012-06-29 | Paper |
| Coordinated scheduling of production and delivery with production window and delivery capacity constraints | 2012-05-14 | Paper |
| Investigation on transient dynamic behaviors of low-tension undersea cables | 2012-05-09 | Paper |
| Separating NE from some nonuniform nondeterministic complexity classes | 2011-12-15 | Paper |
| Approximation schemes for parallel machine scheduling with availability constraints | 2011-10-27 | Paper |
| The Complexity of Testing Monomials in Multivariate Polynomials | 2011-08-12 | Paper |
| Algorithms for Testing Monomials in Multivariate Polynomials | 2011-08-12 | Paper |
| Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments | 2011-08-12 | Paper |
| Minimum Interval Cover and Its Application to Genome Sequencing | 2011-08-12 | Paper |
| Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem | 2011-08-12 | Paper |
| Linear and sublinear time algorithms for the basis of abelian groups | 2011-07-27 | Paper |
| Theory and application of width bounded geometric separators | 2011-03-28 | Paper |
| XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme | 2011-01-10 | Paper |
| Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials | 2011-01-08 | Paper |
| Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences | 2010-12-03 | Paper |
| Approximation Schemes for Scheduling with Availability Constraints | 2010-09-07 | Paper |
| Improved Sublinear Time Algorithm for Width-Bounded Separators | 2010-09-07 | Paper |
| O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems | 2010-09-07 | Paper |
| Constant Time Approximation Scheme for Largest Well Predicted Subset | 2010-07-20 | Paper |
| A Linear Kernel for Co-Path/Cycle Packing | 2010-07-20 | Paper |
| Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints | 2010-07-20 | Paper |
| Separating sublinear time computations by approximate diameter | 2010-02-24 | Paper |
| Linear and Sublinear Time Algorithms for Basis of Abelian Groups | 2009-12-17 | Paper |
| On recovering syntenic blocks from comparative maps | 2009-12-02 | Paper |
| MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS | 2009-09-22 | Paper |
| Separating NE from Some Nonuniform Nondeterministic Complexity Classes | 2009-07-23 | Paper |
| Exponential inapproximability and FPTAS for scheduling with availability constraints | 2009-07-10 | Paper |
| Makespan Minimization with Machine Availability Constraints | 2009-07-07 | Paper |
| Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability | 2009-06-03 | Paper |
| On the Complexity of Approximation Streaming Algorithms for the k-Center Problem | 2009-03-10 | Paper |
| MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING | 2009-03-02 | Paper |
| Separating Sublinear Time Computations by Approximate Diameter | 2009-01-27 | Paper |
| On Recovering Syntenic Blocks from Comparative Maps | 2009-01-27 | Paper |
| Geometric Separators and Their Applications to Protein Folding in the HP-Model | 2008-08-14 | Paper |
| A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model | 2008-07-10 | Paper |
| Non-breaking Similarity of Genomes with Gene Repetitions | 2008-06-17 | Paper |
| Sublinear time width-bounded separators and their application to the protein side-chain packing problem | 2008-06-04 | Paper |
| Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences | 2008-05-27 | Paper |
| On the inapproximability of the exemplar conserved interval distance problem of genomes | 2008-05-13 | Paper |
| Theory and Application of Width Bounded Geometric Separator | 2008-03-19 | Paper |
| Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem | 2008-01-04 | Paper |
| The Approximability of the Exemplar Breakpoint Distance Problem | 2008-01-04 | Paper |
| An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem | 2008-01-04 | Paper |
| Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes | 2007-09-10 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| A PTAS for a disc covering problem using width-bounded separators | 2006-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5469769 | 2006-05-26 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Circuits over PP and PL | 2001-03-12 | Paper |
| A comparison of resource-bounded molecular computation models | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265108 | 1999-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263688 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258581 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246731 | 1999-06-15 | Paper |
| Molecular computing, bounded nondeterminism, and efficient recursion | 1999-01-01 | Paper |
| Generalized multiplication-free arithmetic codes | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879803 | 1996-10-13 | Paper |
| With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets | 1996-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4285070 | 1995-03-16 | Paper |
| On symmetric differences of NP-hard sets with weakly P-selective sets | 1995-01-26 | Paper |
| Closeness of NP-Hard Sets to Other Complexity Classes | 1994-06-16 | Paper |
| An application of the translational method | 1994-04-17 | Paper |
| Exponential-time and subexponential-time sets | 1993-09-16 | Paper |
| On lower bounds of the closeness between complexity classes | 1993-05-17 | Paper |
| SeparatingPH fromPP by relativization | 1993-02-18 | Paper |
