| Publication | Date of Publication | Type |
|---|
| Approximation and competitive algorithms for single-minded selling problem | 2023-10-16 | Paper |
| Computing the unrooted maximum agreement subtree in sub-quadratic time | 2022-12-09 | Paper |
| A linear-time certifying algorithm for recognizing generalized series-parallel graphs | 2022-12-08 | Paper |
| Principal-agent problem under the linear contract | 2022-10-18 | Paper |
| Constant competitive algorithms for unbounded one-way trading under monotone hazard rate | 2022-03-07 | Paper |
| Robustness and approximation for the linear contract design | 2021-07-05 | Paper |
| Approximation algorithms for the partial assignment problem | 2020-09-01 | Paper |
| Approximation algorithms for the selling with preference | 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 | 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 | 2019-03-26 | Paper |
| Dictionary matching with a bounded gap in pattern or in text | 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 | 2017-02-22 | Paper |
| Constrained pairwise and center-star sequences alignment problems | 2016-10-20 | Paper |
| Black and White Bin Packing Revisited | 2016-02-05 | Paper |
| Competitive algorithms for unbounded one-way trading | 2015-12-08 | Paper |
| Dictionary Matching with Uneven Gaps | 2015-08-20 | Paper |
| Online bin packing with \((1,1)\) and \((2,R)\) bins | 2015-07-28 | Paper |
| Competitive Algorithms for Unbounded One-Way Trading | 2015-05-20 | Paper |
| Online algorithms for 1-space bounded 2-dimensional bin packing and square packing | 2014-10-06 | Paper |
| Online pricing for bundles of multiple items | 2014-09-18 | Paper |
| A new upper bound 2.5545 on 2D Online Bin Packing | 2014-09-09 | Paper |
| On the Complexity of Constrained Sequences Alignment Problems | 2014-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414590 | 2014-05-06 | Paper |
| Constant-competitive tree node assignment | 2014-01-13 | Paper |
| Online Bin Packing with (1,1) and (2,R) Bins | 2013-12-10 | Paper |
| A note on a selfish bin packing problem | 2013-08-07 | Paper |
| Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing | 2013-08-02 | Paper |
| Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing | 2013-06-11 | Paper |
| Uniformly inserting points on square grid | 2013-04-04 | Paper |
| COMPETITIVE ALGORITHMS FOR ONLINE PRICING | 2012-10-15 | Paper |
| Online Pricing for Multi-type of Items | 2012-07-16 | Paper |
| Continuous monitoring of distributed data streams over a time-based sliding window | 2012-04-26 | Paper |
| Online call control in cellular networks revisited | 2012-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113747 | 2012-01-23 | Paper |
| Edit Distance to Monotonicity in Sliding Windows | 2011-12-16 | Paper |
| Online tree node assignment with resource augmentation | 2011-12-15 | Paper |
| Competitive Algorithms for Online Pricing | 2011-08-17 | Paper |
| Sleep Management on Multiple Machines for Energy and Flow Time | 2011-07-06 | Paper |
| Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing | 2011-06-03 | Paper |
| Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data | 2011-02-15 | Paper |
| ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING | 2011-01-19 | Paper |
| Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing | 2010-12-09 | Paper |
| Finding frequent items over sliding windows with constant update time | 2010-09-07 | Paper |
| Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks | 2010-09-07 | Paper |
| Maintaining significant stream statistics over sliding windows | 2010-08-16 | Paper |
| A unified analysis of hot video schedulers | 2010-08-05 | Paper |
| Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs | 2010-07-20 | Paper |
| Online Uniformly Inserting Points on Grid | 2010-07-20 | Paper |
| Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window | 2010-05-11 | Paper |
| A constant-competitive algorithm for online OVSF code assignment | 2010-02-23 | Paper |
| 1-Bounded Space Algorithms for 2-Dimensional Bin Packing | 2009-12-17 | Paper |
| Online Tree Node Assignment with Resource Augmentation | 2009-07-23 | Paper |
| Sleep with Guilt and Work Faster to Minimize Flow Plus Energy | 2009-07-14 | Paper |
| Variable-Size Rectangle Covering | 2009-07-07 | Paper |
| Dynamic Offline Conflict-Free Coloring for Unit Disks | 2009-02-12 | Paper |
| A Constant-Competitive Algorithm for Online OVSF Code Assignment | 2008-05-27 | Paper |
| On-line stream merging with max span and min coverage | 2006-02-08 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472521 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437498 | 2003-12-02 | Paper |
| Escaping a grid by edge-disjoint paths | 2003-08-19 | Paper |
| On-line stream merging in a general setting. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708569 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553240 | 2002-11-04 | Paper |
| An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings | 2002-04-08 | Paper |
| On-line load balancing of temporary tasks revisited | 2002-03-03 | Paper |
| The greedier the better: an efficient algorithm for approximating maximum independent set | 2002-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729090 | 2001-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723946 | 2001-07-08 | Paper |
| A Decomposition Theorem for Maximum Weight Bipartite Matchings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526970 | 2001-02-28 | Paper |
| Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938679 | 2000-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952693 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953351 | 2000-05-09 | Paper |
| Selecting the \(k\) largest elements with parity tests | 2000-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938785 | 2000-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249526 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370211 | 1998-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129918 | 1997-04-22 | Paper |
| A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests | 1994-03-22 | Paper |
