| Publication | Date of Publication | Type |
|---|
| Approximation and competitive algorithms for single-minded selling problem | 2023-10-16 | Paper |
| Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time | 2023-05-08 | Paper |
| A new subgraph of minimum weight triangulations | 2023-01-25 | Paper |
| A linear-time certifying algorithm for recognizing generalized series-parallel graphs | 2022-12-08 | Paper |
| Constant competitive algorithms for unbounded one-way trading under monotone hazard rate | 2022-03-07 | Paper |
| Offline and online algorithms for single-minded selling problem | 2020-04-22 | Paper |
| Unbounded one-way trading on distributions with monotone hazard rate | 2018-02-26 | Paper |
| Minimum Manhattan network is NP-complete | 2017-10-20 | Paper |
| Constrained pairwise and center-star sequences alignment problems | 2016-10-20 | Paper |
| Triangulations without minimum-weight drawing | 2016-06-16 | Paper |
| Competitive algorithms for unbounded one-way trading | 2015-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501823 | 2015-08-14 | 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 |
| Algorithms for placing monitors in a flow network | 2014-03-25 | Paper |
| Non-adaptive complex group testing with multiple positive sets | 2014-01-16 | Paper |
| Constant-competitive tree node assignment | 2014-01-13 | 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 |
| Online call control in cellular networks revisited | 2012-03-09 | Paper |
| Adaptive Phenotype Testing for AND/OR Items | 2011-12-16 | Paper |
| Online tree node assignment with resource augmentation | 2011-12-15 | Paper |
| A clique-based algorithm for constructing feasible timetables | 2011-10-12 | Paper |
| Competitive Algorithms for Online Pricing | 2011-08-17 | Paper |
| Non-adaptive Complex Group Testing with Multiple Positive Sets | 2011-07-01 | Paper |
| Minimum Manhattan network is NP-complete | 2011-06-03 | Paper |
| Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing | 2011-06-03 | Paper |
| Improved Competitive Algorithms for Online Scheduling with Partial Job Values | 2011-03-18 | 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 |
| Absolute and asymptotic bounds for online frequency allocation in cellular networks | 2010-09-16 | Paper |
| Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks | 2010-09-07 | 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 |
| A constant-competitive algorithm for online OVSF code assignment | 2010-02-23 | Paper |
| Greedy online frequency allocation in cellular networks | 2010-01-29 | Paper |
| Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops | 2010-01-06 | Paper |
| A tight lower bound for job scheduling with cancellation | 2009-12-18 | Paper |
| 1-Bounded Space Algorithms for 2-Dimensional Bin Packing | 2009-12-17 | Paper |
| A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs | 2009-11-25 | Paper |
| Improved on-line broadcast scheduling with deadlines | 2009-08-28 | Paper |
| Online Tree Node Assignment with Resource Augmentation | 2009-07-23 | Paper |
| Variable-Size Rectangle Covering | 2009-07-07 | Paper |
| Algorithms for Placing Monitors in a Flow Network | 2009-07-02 | Paper |
| Online Frequency Assignment in Wireless Communication Networks | 2009-03-06 | Paper |
| A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs | 2009-03-06 | Paper |
| Dynamic Offline Conflict-Free Coloring for Unit Disks | 2009-02-12 | Paper |
| On-line scheduling of parallel jobs on two machines | 2008-11-18 | Paper |
| A Constant-Competitive Algorithm for Online OVSF Code Assignment | 2008-05-27 | Paper |
| Frequency Allocation Problems for Linear Cellular Networks | 2008-04-24 | Paper |
| Online bin packing of fragile objects with application in cellular networks | 2008-04-23 | Paper |
| Construction of the nearest neighbor embracing graph of a point set | 2008-04-04 | Paper |
| Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees | 2008-03-19 | Paper |
| Online OVSF Code Assignment with Resource Augmentation | 2008-01-04 | Paper |
| Online competitive algorithms for maximizing weighted throughput of unit jobs | 2007-11-05 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Improved On-Line Broadcast Scheduling with Deadlines | 2007-09-10 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time | 2006-08-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Approximating the minimum triangulation of convex 3-polytopes with bounded degrees | 2005-09-02 | Paper |
| ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO | 2005-08-01 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Approximate and dynamic rank aggregation | 2004-10-27 | Paper |
| Improved competitive algorithms for online scheduling with partial job values | 2004-10-27 | Paper |
| Online scheduling with partial job values: does timesharing or randomization help? | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474087 | 2004-08-04 | Paper |
| Escaping a grid by edge-disjoint paths | 2003-08-19 | Paper |
| Efficient algorithm for transversal of disjoint convex polygons. | 2003-01-21 | Paper |
| Transversal of disjoint convex polygons. | 2003-01-21 | Paper |
| Maximum weight triangulation and graph drawing | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768283 | 2002-07-22 | Paper |
| Approximation for minimum triangulations of simplicial convex 3-polytopes | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728899 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729090 | 2001-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525744 | 2001-01-24 | Paper |
| Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952693 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218404 | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3985349 | 1992-06-27 | Paper |
| Distributed election in complete networks | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787479 | 1988-01-01 | Paper |
| On embedding rectangular grids in hypercubes | 1988-01-01 | Paper |
| An Information-Based Model for Failure-Handling in Distributed Database Systems | 1987-01-01 | Paper |
| Optimal Termination Protocols for Network Partitioning | 1986-01-01 | Paper |
| Efficient inference control for range SUM queries | 1984-01-01 | Paper |
| Efficient Parallel Algorithms for a Class of Graph Theoretic Problems | 1984-01-01 | Paper |
| A general program scheme for finding bridges | 1983-01-01 | Paper |
| Efficient parallel algorithms for some graph problems | 1982-01-01 | Paper |
| Auditing and Inference Control in Statistical Databases | 1982-01-01 | Paper |
| Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems | 1982-01-01 | Paper |
| Bounds on Schedules for Independent Tasks with Similar Execution Times | 1981-01-01 | Paper |
| On J -maximal and J -minimal Flow-Shop Schedules | 1981-01-01 | Paper |
| Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops) | 1980-01-01 | Paper |
| An O(n) algorithm for determining a near-optimal computation order of matrix chain products | 1978-01-01 | Paper |
| A fast error evaluation algorithm for polynomial approximation | 1977-01-01 | Paper |
| An<tex>O(N^2)</tex>algorithm for partial fraction expansion | 1977-01-01 | Paper |
| The Partial Fraction Expansion Problem and Its Inverse | 1977-01-01 | Paper |
| A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation | 1976-01-01 | Paper |
