| Publication | Date of Publication | Type |
|---|
Approximation and competitive algorithms for single-minded selling problem
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Computing the unrooted maximum agreement subtree in sub-quadratic time
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
A linear-time certifying algorithm for recognizing generalized series-parallel graphs
Discrete Applied Mathematics | 2022-12-08 | Paper |
Principal-agent problem under the linear contract
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Constant competitive algorithms for unbounded one-way trading under monotone hazard rate
Mathematical Foundations of Computing | 2022-03-07 | Paper |
| Robustness and approximation for the linear contract design | 2021-07-05 | Paper |
Approximation algorithms for the partial assignment problem
Theoretical Computer Science | 2020-09-01 | Paper |
Approximation algorithms for the selling with preference
Journal of Combinatorial Optimization | 2020-07-29 | Paper |
| Algorithmic pricing for the partial assignment | 2020-05-13 | Paper |
| Approximation algorithm and incentive ratio of the selling with preference | 2020-05-13 | Paper |
Offline and online algorithms for single-minded selling problem
Theoretical Computer Science | 2020-04-22 | Paper |
| RENET: a deep learning approach for extracting gene-disease associations from literature | 2019-05-21 | Paper |
Approximating frequent items in asynchronous data stream over a sliding window
Algorithms | 2019-03-26 | Paper |
Dictionary matching with a bounded gap in pattern or in text
Algorithmica | 2018-04-06 | Paper |
| Unbounded one-way trading on distributions with monotone hazard rate | 2018-02-26 | Paper |
Online bin packing problem with buffer and bounded size revisited
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Constrained pairwise and center-star sequences alignment problems
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Black and White Bin Packing Revisited
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Competitive algorithms for unbounded one-way trading
Theoretical Computer Science | 2015-12-08 | Paper |
Dictionary matching with uneven gaps
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Online bin packing with \((1,1)\) and \((2,R)\) bins
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
Competitive algorithms for unbounded one-way trading
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Theoretical Computer Science | 2014-10-06 | Paper |
Online pricing for bundles of multiple items
Journal of Global Optimization | 2014-09-18 | Paper |
A new upper bound 2.5545 on 2D Online Bin Packing
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the complexity of constrained sequences alignment problems
Frontiers in Algorithmics | 2014-09-02 | Paper |
Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Constant-competitive tree node assignment
Theoretical Computer Science | 2014-01-13 | Paper |
Online Bin Packing with (1,1) and (2,R) Bins
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
A note on a selfish bin packing problem
Journal of Global Optimization | 2013-08-07 | Paper |
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Uniformly inserting points on square grid
Information Processing Letters | 2013-04-04 | Paper |
COMPETITIVE ALGORITHMS FOR ONLINE PRICING
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Online pricing for multi-type of items
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Continuous monitoring of distributed data streams over a time-based sliding window
Algorithmica | 2012-04-26 | Paper |
Online call control in cellular networks revisited
Information Processing Letters | 2012-03-09 | Paper |
| Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window | 2012-01-23 | Paper |
Edit Distance to Monotonicity in Sliding Windows
Algorithms and Computation | 2011-12-16 | Paper |
Online tree node assignment with resource augmentation
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Competitive algorithms for online pricing
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Sleep management on multiple machines for energy and flow time
Automata, Languages and Programming | 2011-07-06 | Paper |
Online algorithm for 1-space bounded multi-dimensional bin packing
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Online tracking of the dominance relationship of distributed multi-dimensional data
Approximation and Online Algorithms | 2011-02-15 | Paper |
One-space bounded algorithms for two-dimensional bin packing
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
Algorithms and Computation | 2010-12-09 | Paper |
Finding frequent items over sliding windows with constant update time
Information Processing Letters | 2010-09-07 | Paper |
Deterministic online call control in cellular networks and triangle-free cellular networks
Frontiers in Algorithmics | 2010-09-07 | Paper |
Maintaining significant stream statistics over sliding windows
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A unified analysis of hot video schedulers
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Online uniformly inserting points on grid
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Approximated distributed minimum vertex cover algorithms for bounded degree graphs
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Approximating frequent items in asynchronous data stream over a sliding window
Approximation and Online Algorithms | 2010-05-11 | Paper |
A constant-competitive algorithm for online OVSF code assignment
Algorithmica | 2010-02-23 | Paper |
1-bounded space algorithms for 2-dimensional bin packing
Algorithms and Computation | 2009-12-17 | Paper |
Online Tree Node Assignment with Resource Augmentation
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
Automata, Languages and Programming | 2009-07-14 | Paper |
Variable-Size Rectangle Covering
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Dynamic Offline Conflict-Free Coloring for Unit Disks
Approximation and Online Algorithms | 2009-02-12 | Paper |
A Constant-Competitive Algorithm for Online OVSF Code Assignment
Algorithms and Computation | 2008-05-27 | Paper |
On-line stream merging with max span and min coverage
Theory of Computing Systems | 2006-02-08 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2080270 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2011846 (Why is no real title available?) | 2003-12-02 | Paper |
Escaping a grid by edge-disjoint paths
Algorithmica | 2003-08-19 | Paper |
On-line stream merging in a general setting.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1929937 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1798170 (Why is no real title available?) | 2002-11-04 | Paper |
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
Journal of Algorithms | 2002-04-08 | Paper |
On-line load balancing of temporary tasks revisited
Theoretical Computer Science | 2002-03-03 | Paper |
The greedier the better: an efficient algorithm for approximating maximum independent set
Journal of Combinatorial Optimization | 2002-01-08 | Paper |
| scientific article; zbMATH DE number 1629971 (Why is no real title available?) | 2001-10-18 | Paper |
| scientific article; zbMATH DE number 1615276 (Why is no real title available?) | 2001-07-08 | 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 |
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1405697 (Why is no real title available?) | 2000-07-05 | Paper |
| scientific article; zbMATH DE number 1445371 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1444320 (Why is no real title available?) | 2000-05-09 | Paper |
Selecting the k largest elements with parity tests
Discrete Applied Mathematics | 2000-04-09 | Paper |
| scientific article; zbMATH DE number 1405800 (Why is no real title available?) | 2000-03-27 | Paper |
| scientific article; zbMATH DE number 1303027 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1104338 (Why is no real title available?) | 1998-07-27 | Paper |
| scientific article; zbMATH DE number 1002201 (Why is no real title available?) | 1997-04-22 | Paper |
A randomized algorithm for finding maximum with O(( n)^2) polynomial tests
Information Processing Letters | 1994-03-22 | Paper |
