| Publication | Date of Publication | Type |
|---|
Multitasking scheduling with shared processing
Naval Research Logistics | 2024-05-14 | Paper |
Exponential time approximation scheme for TSP
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
Theoretical Computer Science | 2023-05-23 | Paper |
Streaming algorithms for multitasking scheduling with shared processing
Discrete Applied Mathematics | 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
Theoretical Computer Science | 2021-10-21 | Paper |
Polyhedral circuits and their applications
| 2021-07-05 | Paper |
Hardness of sparse sets and minimal circuit size problem
| 2021-04-21 | Paper |
Approximate set union via approximate randomization
Lecture Notes in Computer Science | 2021-04-21 | Paper |
An approximation algorithm for the \(l\)-pseudoforest deletion problem
Theoretical Computer Science | 2020-01-16 | Paper |
Fast face recognition based on fractal theory
Applied Mathematics and Computation | 2019-06-21 | Paper |
Randomized parameterized algorithms for the kidney exchange problem
Algorithms | 2019-05-14 | Paper |
Sublinear time motif discovery from multiple sequences
Algorithms | 2019-03-26 | Paper |
Second-order sliding mode disturbance observer-based adaptive fuzzy tracking control for near-space vehicles with prescribed tracking performance
Mathematical Problems in Engineering | 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
Automata, Languages and Programming | 2018-07-04 | Paper |
scientific article; zbMATH DE number 6875069 (Why is no real title available?)
| 2018-05-25 | Paper |
An improved FPT algorithm for almost forest deletion problem
Information Processing Letters | 2018-05-25 | Paper |
Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
Algorithmica | 2018-02-28 | Paper |
Optimal Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments
IEEE Transactions on Computers | 2017-10-19 | Paper |
Concentration independent random number generation in tile self-assembly
Theoretical Computer Science | 2017-02-22 | Paper |
The label cut problem with respect to path length and label frequency
Theoretical Computer Science | 2016-09-12 | Paper |
Competitive algorithms for unbounded one-way trading
Theoretical Computer Science | 2015-12-08 | Paper |
Flipping tiles: concentration independent coin flips in tile self-assembly
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Competitive algorithms for unbounded one-way trading
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Theoretical Computer Science | 2014-08-26 | Paper |
On the Complexity of Approximate Sum of Sorted List
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
On testing monomials in multivariate polynomials
Theoretical Computer Science | 2014-01-10 | Paper |
Algebraic data retrieval algorithms for multi-channel wireless data broadcast
Theoretical Computer Science | 2014-01-10 | Paper |
Self-assembly with geometric tiles
Automata, Languages, and Programming | 2013-08-12 | Paper |
Constant time approximation scheme for largest well predicted subset
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
Sublinear time approximate sum via uniform random sampling
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
The complexity of influence maximization problem in the deterministic linear threshold model
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
Erratum: ``The approximability of the exemplar breakpoint distance problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
A dense hierarchy of sublinear time approximation schemes for bin packing
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Multivariate polynomial integration and differentiation are polynomial time inapproximable unless \(\text{P}=\text{NP}\)
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
NE is not NP Turing reducible to nonexponentially dense NP sets
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Theoretical Computer Science | 2012-05-14 | Paper |
Investigation on transient dynamic behaviors of low-tension undersea cables
Journal of Shanghai Jiaotong University (Science) | 2012-05-09 | Paper |
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Approximation schemes for parallel machine scheduling with availability constraints
Discrete Applied Mathematics | 2011-10-27 | Paper |
The complexity of testing monomials in multivariate polynomials
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Algorithms for testing monomials in multivariate polynomials
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Exponential and polynomial time algorithms for the minimum common string partition problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Algebraic algorithm for scheduling data retrieval in multi-channel wireless data broadcast environments
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Minimum interval cover and its application to genome sequencing
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Linear and sublinear time algorithms for the basis of abelian groups
Theoretical Computer Science | 2011-07-27 | Paper |
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences | 2011-03-28 | Paper |
XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
Lecture Notes in Computer Science | 2011-01-08 | Paper |
Probabilistic analysis of a motif discovery algorithm for multiple sequences
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Approximation schemes for scheduling with availability constraints
Frontiers in Algorithmics | 2010-09-07 | Paper |
Improved sublinear time algorithm for width-bounded separators
Frontiers in Algorithmics | 2010-09-07 | Paper |
\(O((\log n)^{2})\) time online approximation schemes for bin packing and subset sum problems
Frontiers in Algorithmics | 2010-09-07 | Paper |
A linear kernel for co-path/cycle packing
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Constant time approximation scheme for largest well predicted subset
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Separating sublinear time computations by approximate diameter
Journal of Combinatorial Optimization | 2010-02-24 | Paper |
Linear and sublinear time algorithms for basis of abelian groups
Algorithms and Computation | 2009-12-17 | Paper |
On recovering syntenic blocks from comparative maps
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
Discrete Mathematics, Algorithms and Applications | 2009-09-22 | Paper |
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Exponential inapproximability and FPTAS for scheduling with availability constraints
Theoretical Computer Science | 2009-07-10 | Paper |
Makespan Minimization with Machine Availability Constraints
Combinatorial Optimization and Applications | 2009-07-07 | 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 |
On the Complexity of Approximation Streaming Algorithms for the k-Center Problem
Frontiers in Algorithmics | 2009-03-10 | Paper |
MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
International Journal of Computational Geometry & Applications | 2009-03-02 | Paper |
Separating Sublinear Time Computations by Approximate Diameter
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On Recovering Syntenic Blocks from Comparative Maps
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Geometric Separators and Their Applications to Protein Folding in the HP-Model
SIAM Journal on Computing | 2008-08-14 | Paper |
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Non-breaking Similarity of Genomes with Gene Repetitions
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Sublinear time width-bounded separators and their application to the protein side-chain packing problem
Journal of Combinatorial Optimization | 2008-06-04 | Paper |
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On the inapproximability of the exemplar conserved interval distance problem of genomes
Journal of Combinatorial Optimization | 2008-05-13 | Paper |
Theory and Application of Width Bounded Geometric Separator
STACS 2006 | 2008-03-19 | Paper |
The Approximability of the Exemplar Breakpoint Distance Problem
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
A PTAS for a disc covering problem using width-bounded separators
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
A novel blind audio watermarking algorithm by adaptive quantization
| 2006-05-26 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Circuits over PP and PL
Journal of Computer and System Sciences | 2001-03-12 | Paper |
A comparison of resource-bounded molecular computation models
Algorithmica | 2000-04-25 | Paper |
scientific article; zbMATH DE number 1349083 (Why is no real title available?)
| 1999-10-07 | Paper |
scientific article; zbMATH DE number 1342107 (Why is no real title available?)
| 1999-09-22 | Paper |
scientific article; zbMATH DE number 1335890 (Why is no real title available?)
| 1999-09-13 | Paper |
scientific article; zbMATH DE number 1301086 (Why is no real title available?)
| 1999-06-15 | Paper |
Molecular computing, bounded nondeterminism, and efficient recursion
Algorithmica | 1999-01-01 | Paper |
Generalized multiplication-free arithmetic codes
IEEE Transactions on Communications | 1998-01-05 | Paper |
scientific article; zbMATH DE number 883352 (Why is no real title available?)
| 1996-10-13 | Paper |
With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets
SIAM Journal on Computing | 1996-01-24 | Paper |
scientific article; zbMATH DE number 527497 (Why is no real title available?)
| 1995-03-16 | Paper |
On symmetric differences of NP-hard sets with weakly P-selective sets
Theoretical Computer Science | 1995-01-26 | Paper |
Closeness of NP-Hard Sets to Other Complexity Classes
SIAM Journal on Computing | 1994-06-16 | Paper |
An application of the translational method
Mathematical Systems Theory | 1994-04-17 | Paper |
Exponential-time and subexponential-time sets
Theoretical Computer Science | 1993-09-16 | Paper |
On lower bounds of the closeness between complexity classes
Mathematical Systems Theory | 1993-05-17 | Paper |
SeparatingPH fromPP by relativization
Acta Mathematica Sinica, English Series | 1993-02-18 | Paper |
