| Publication | Date of Publication | Type |
|---|
| Universal convex covering problems under translations and discrete rotations | 2023-11-06 | Paper |
| Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays | 2023-02-07 | Paper |
| Interval finding and its application to data mining | 2023-01-25 | Paper |
| Greedily finding a dense subgraph | 2022-12-09 | Paper |
| Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays | 2022-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077652 | 2022-05-18 | Paper |
| Consistent digital curved rays and pseudoline arrangements | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967180 | 2019-07-03 | Paper |
| Dense subgraph problems with output-density conditions | 2018-11-05 | Paper |
| Buyback problem with discrete concave valuation functions | 2018-05-24 | Paper |
| Weight Balancing on Boundaries and Skeletons | 2018-04-23 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| Efficiently correcting matrix products | 2017-10-10 | Paper |
| Notes on computing peaks in k-levels and parametric spanning trees | 2017-09-29 | Paper |
| A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks | 2016-12-19 | Paper |
| Buyback Problem with Discrete Concave Valuation Functions | 2016-02-26 | Paper |
| Minimax parametric optimization problems and multi-dimensional parametric searching | 2015-02-27 | Paper |
| A generalization of the convex Kakeya problem | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934662 | 2014-12-18 | Paper |
| The distance trisector curve | 2014-11-25 | Paper |
| Base-object location problems for base-monotone regions | 2014-10-06 | Paper |
| Efficient algorithms for network localization using cores of underlying graphs | 2014-09-18 | Paper |
| Distance k -sectors exist | 2014-04-03 | Paper |
| Zone diagrams in Euclidean spaces and in other normed spaces | 2014-04-03 | Paper |
| Order-preserving matching | 2014-03-13 | Paper |
| Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information | 2014-01-14 | Paper |
| Base Location Problems for Base-Monotone Regions | 2013-04-12 | Paper |
| Zone diagrams in Euclidean spaces and in other normed spaces | 2012-12-20 | Paper |
| A generalization of the convex Kakeya problem | 2012-06-29 | Paper |
| EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX | 2011-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084810 | 2011-03-25 | Paper |
| The Structure and Number of Global Roundings of a Graph | 2011-03-18 | Paper |
| Distance \(k\)-sectors exist | 2010-09-02 | Paper |
| Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux | 2010-07-20 | Paper |
| Distance Trisector of a Segment and a Point | 2010-05-28 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Efficiently pricing European-Asian options-ultimate implementation and analysis of the AMO algorithm | 2010-01-29 | Paper |
| Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes | 2009-12-17 | Paper |
| Consistent digital rays | 2009-08-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Directional Geometric Routing on Mobile Ad Hoc Networks | 2009-07-23 | Paper |
| All Farthest Neighbors in the Presence of Highways and Obstacles | 2009-02-24 | Paper |
| Fixed-Parameter Tractability for Non-Crossing Spanning Trees | 2009-02-17 | Paper |
| Consistent digital rays | 2009-02-12 | Paper |
| Voronoi diagrams with respect to criteria on vision information | 2008-09-25 | Paper |
| Minimizing interference of a wireless ad-hoc network in a plane | 2008-08-14 | Paper |
| Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge | 2008-08-14 | Paper |
| Optimal Insertion of a Segment Highway in a City Metric | 2008-07-10 | Paper |
| Data Mining with optimized two-dimensional association rules | 2008-06-18 | Paper |
| Recent progress on combinatorics and algorithms for low discrepancy roundings | 2007-07-19 | Paper |
| The distance trisector curve | 2007-05-23 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Linear time algorithm for approximating a curve by a single-peaked curve | 2006-06-14 | Paper |
| POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA | 2006-05-29 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| A fast, accurate, and simple method for pricing European-Asian and saving-Asian options | 2005-08-02 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION | 2005-06-10 | Paper |
| On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs | 2005-05-23 | Paper |
| Minimax Parametric Optimization Problems and Multidimensional Parametric Searching | 2005-05-23 | Paper |
| Combinatorics and algorithms for low-discrepancy roundings of a real sequence | 2005-04-06 | Paper |
| Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829028 | 2004-11-29 | Paper |
| The structure and number of global roundings of a graph | 2004-10-27 | Paper |
| PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS | 2004-09-29 | Paper |
| LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472295 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474085 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474128 | 2004-08-04 | Paper |
| Quasi-Norms for a Double Sequence | 2003-11-16 | Paper |
| Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning | 2003-09-28 | Paper |
| A characterization of planar graphs by pseudo-line arrangements | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418982 | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4419004 | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411409 | 2003-07-08 | Paper |
| Efficient algorithms for the minimum diameter bridge problem | 2003-04-28 | Paper |
| \(k\)-levels of concave surfaces | 2003-04-27 | Paper |
| Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization | 2003-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547824 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4538131 | 2002-07-11 | Paper |
| Optimal online algorithms for an electronic commerce money distribution system | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535017 | 2002-06-12 | Paper |
| Quantum Computation in Computational Geometry | 2002-01-01 | Paper |
| A unified scheme for detecting fundamental curves in binary edge images | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708237 | 2001-08-14 | Paper |
| Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication. | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722004 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526992 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761862 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525741 | 2001-01-24 | Paper |
| Greedily Finding a Dense Subgraph | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250212 | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252329 | 2000-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953341 | 2000-05-09 | Paper |
| Mining optimized association rules for numeric attributes | 2000-02-17 | Paper |
| Finding Subsets Maximizing Minimum Structures | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268442 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252328 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230364 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370205 | 1998-09-07 | Paper |
| Consecutive interval query and dynamic programming on intervals | 1998-07-28 | Paper |
| Implementation and evaluation of decision trees with range and region splitting | 1998-06-11 | Paper |
| How to cut pseudoparabolas into segments | 1998-03-11 | Paper |
| Orthogonal queries in segments | 1997-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875174 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886044 | 1996-08-22 | Paper |
| Geometric algorithms for the minimum cost assignment problem | 1996-05-28 | Paper |
| A note on polynomial arithmetic analogue of Halton sequences | 1996-04-28 | Paper |
| Efficient Algorithms for the Hitchcock Transportation Problem | 1996-02-13 | Paper |
| An Improved Algorithm for the Traveler′s Problem | 1995-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763404 | 1995-04-11 | Paper |
| Complexity of projected images of convex subdivisions | 1995-04-09 | Paper |
| On minimum and maximum spanning trees of linearly moving points | 1995-03-20 | Paper |
| Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications | 1994-11-27 | Paper |
| WALKING IN AN ARRANGEMENT TOPOLOGICALLY | 1994-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283554 | 1994-02-23 | Paper |
| A theorem on the average number of subfaces in arrangements and oriented matroids | 1993-09-30 | Paper |
| Algorithms for projecting points to give the most uniform distribution with applications to hashing | 1993-06-29 | Paper |
| Splitting a configuration in a simplex | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3981722 | 1992-06-26 | Paper |
| Bounding the number of \(k\)-faces in arrangements of hyperplanes | 1992-06-25 | Paper |
| The generating function of strict Gelfand patterns and some formulas on characters of general linear groups | 1988-01-01 | Paper |
| Determinantal method and the Littlewood-Richardson rule | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800270 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3749258 | 1986-01-01 | Paper |
| On the decomposition rules of tensor products of the representations of the classical Weyl groups | 1984-01-01 | Paper |
| A theorem on the representations of the Weyl groups of type \(D_ n\) and \(B_ n\) | 1984-01-01 | Paper |
