| Publication | Date of Publication | Type |
|---|
| Greedy algorithms for the profit-aware social team formation problem | 2022-08-26 | Paper |
| Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs | 2019-02-12 | Paper |
| A simple greedy algorithm for the profit-aware social team formation problem | 2018-03-26 | Paper |
| A polynomial time solution for labeling a rectilinear map | 2016-06-09 | Paper |
| An optimal EREW PRAM algorithm for minimum spanning tree verification | 2016-06-01 | Paper |
| Improved randomized online scheduling of intervals and jobs | 2015-02-05 | Paper |
| Online algorithms for 1-space bounded 2-dimensional bin packing and square packing | 2014-10-06 | Paper |
| Streaming with minimum space: an algorithm for covering by two congruent balls | 2014-01-16 | Paper |
| Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing | 2013-06-11 | Paper |
| A Faster CREW PRAM Algorithm for Computing Cartesian Trees | 2013-06-07 | Paper |
| The ski-rental problem with multiple discount options | 2013-04-04 | Paper |
| Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls | 2012-11-02 | Paper |
| On-line scheduling of equal-length intervals on parallel machines | 2012-07-20 | Paper |
| A tight lower bound for job scheduling with cancellation | 2009-12-18 | Paper |
| Improved on-line broadcast scheduling with deadlines | 2009-08-28 | Paper |
| Two-dimensional packet classification and filter conflict resolution in the internet | 2009-08-06 | Paper |
| Online interval scheduling: Randomized and multiprocessor cases | 2009-07-13 | Paper |
| On Job Scheduling with Preemption Penalties | 2009-07-02 | Paper |
| Approximate colored range and point enclosure queries | 2009-05-13 | Paper |
| Verifying minimum stable circuit values | 2009-03-23 | Paper |
| Two improved range-efficient algorithms for \(F_0\) estimation | 2009-03-20 | Paper |
| Online Interval Scheduling: Randomized and Multiprocessor Cases | 2009-03-06 | Paper |
| Improved Randomized Online Scheduling of Unit Length Intervals and Jobs | 2009-02-12 | Paper |
| Two Improved Range-Efficient Algorithms for F 0 Estimation | 2007-11-13 | Paper |
| Improved On-Line Broadcast Scheduling with Deadlines | 2007-09-10 | Paper |
| Solitary wave solution for a non-integrable, variable coefficient nonlinear Schrödinger equation | 2007-07-11 | Paper |
| ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES | 2007-04-25 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Opportunistic data structures for range queries | 2006-08-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692347 | 2005-09-28 | Paper |
| Approximating the minimum triangulation of convex 3-polytopes with bounded degrees | 2005-09-02 | Paper |
| ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING | 2005-06-22 | Paper |
| EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING | 2005-06-10 | Paper |
| On-line scheduling algorithms for a batch machine with finite capacity | 2005-06-08 | Paper |
| A flexible on-line scheduling algorithm for batch machine with infinite capacity | 2005-04-22 | Paper |
| OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS | 2005-04-18 | Paper |
| Minimizing makespan in batch machine scheduling | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472513 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473281 | 2004-08-04 | Paper |
| Approximation algorithms in batch processing | 2004-01-06 | Paper |
| Dynamic orthogonal range queries in OLAP. | 2003-08-17 | Paper |
| A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414532 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729097 | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729098 | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234060 | 2001-08-27 | Paper |
| A space lower bound for \(st\)-connectivity on node-named JAGs | 2000-06-04 | Paper |
| Tight Lower Bounds for st-Connectivity on the NNJAG Model | 1999-10-28 | Paper |
| Performance analysis of some simple heuristics for computing longest common subsequences | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3985349 | 1992-06-27 | Paper |
