| Publication | Date of Publication | Type |
|---|
| New algorithms for fair \(k\)-center problem with outliers and capacity constraints | 2024-04-16 | Paper |
| Gradient complexity and non-stationary views of differentially private empirical risk minimization | 2024-02-23 | Paper |
| PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data | 2024-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147303 | 2024-01-15 | Paper |
| A unified framework of FPT approximation algorithms for clustering problems | 2023-11-14 | Paper |
| Small candidate set for translational pattern search | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875629 | 2023-02-03 | Paper |
| Two-variable linear programming in parallel | 2022-12-09 | Paper |
| Small candidate set for translational pattern search | 2022-10-06 | Paper |
| Distributed and Robust Support Vector Machine | 2021-11-26 | Paper |
| Influence-based Voronoi diagrams of clusters | 2021-09-16 | Paper |
| Inferring ground truth from crowdsourced data under local attribute differential privacy | 2021-04-08 | Paper |
| Differentially private high dimensional sparse covariance matrix estimation | 2021-04-08 | Paper |
| On Sparse Linear Regression in the Local Differential Privacy Model | 2021-02-24 | Paper |
| Robust high dimensional expectation maximization algorithm via trimmed hard thresholding | 2020-12-29 | Paper |
| An efficient sum query algorithm for distance-based locally dominating functions | 2020-11-25 | Paper |
| Approximating global optimum for probabilistic truth discovery | 2020-10-12 | Paper |
| An efficient sum query algorithm for distance-based locally dominating functions | 2020-09-03 | Paper |
| Tight lower bound of sparse covariance matrix estimation in the local differential privacy model | 2020-04-06 | Paper |
| A unified framework for clustering constrained data without locality property | 2020-02-28 | Paper |
| Learning the truth vector in high dimensions | 2020-02-24 | Paper |
| Principal component analysis in the local differential privacy model | 2020-01-29 | Paper |
| A faster algorithm for truth discovery via range cover | 2019-09-10 | Paper |
| How to Block Blood Flow by Using Elastic Coil | 2019-04-26 | Paper |
| Medical image segmentation using fruit fly optimization and density peaks clustering | 2019-02-26 | Paper |
| Approximating global optimum for probabilistic truth discovery | 2018-10-04 | Paper |
| Novel geometric approach for virtual coiling | 2018-06-05 | Paper |
| Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems | 2018-04-23 | Paper |
| Distributed and Robust Support Vector Machine | 2018-04-19 | Paper |
| Finding global optimum for truth discovery: Entropy based geometric variance | 2018-01-30 | Paper |
| Incentive-punitive risk function with interval valued intuitionistic fuzzy information for outsourced software project risk assessment | 2017-12-14 | Paper |
| On Clustering Induced Voronoi Diagrams | 2017-11-22 | Paper |
| FPTAS for minimizing the earth mover's distance under rigid transformations and related problems | 2017-10-09 | Paper |
| A Unified Framework for Clustering Constrained Data without Locality Property | 2017-10-05 | Paper |
| Algorithms for congruent sphere packing and applications | 2017-09-29 | Paper |
| Faster algorithm for truth discovery via range cover | 2017-09-22 | Paper |
| A Novel Weighted Average Index Method of Interval Valued Intuitionistic Fuzzy Sets and Its Application to Outsourced Software Project Risk Assessment | 2017-08-17 | Paper |
| Some risk functions of IVIFS applied to outsourced software project | 2017-07-17 | Paper |
| Chromatic kernel and its applications | 2016-04-13 | Paper |
| Improved parameterized and exact algorithms for cut problems on trees | 2015-12-11 | Paper |
| The L∞ Hausdorff Voronoi Diagram Revisited | 2015-11-03 | Paper |
| Algorithms for Cut Problems on Trees | 2015-09-11 | Paper |
| Computing the map of geometric minimal cuts | 2014-12-02 | Paper |
| Shortest path queries in planar graphs | 2014-09-26 | Paper |
| On the approximability of the exemplar adjacency number problem for genomes with gene repetitions | 2014-08-26 | Paper |
| On the connectivity preserving minimum cut problem | 2014-02-13 | Paper |
| Approximating minimum bending energy path in a simple corridor | 2014-01-22 | Paper |
| On the central path problem | 2014-01-16 | Paper |
| Improved algorithms for the farthest colored Voronoi diagram of segments | 2014-01-10 | Paper |
| Map of Geometric Minimal Cuts for General Planar Embedding | 2013-12-10 | Paper |
| FPTAS for Minimizing Earth Mover’s Distance under Rigid Transformations | 2013-09-17 | Paper |
| On the Central Path Problem | 2012-11-02 | Paper |
| On the 2-Central Path Problem | 2012-09-25 | Paper |
| Improved Algorithms for Farthest Colored Voronoi Diagram of Segments | 2011-08-12 | Paper |
| Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere | 2011-07-06 | Paper |
| Traveling Salesman Problem of Segments | 2011-03-18 | Paper |
| Approximating Minimum Bending Energy Path in a Simple Corridor | 2010-12-09 | Paper |
| Ensemble clustering using semidefinite programming with applications | 2010-10-07 | Paper |
| Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems | 2010-03-23 | Paper |
| A GEOMETRIC SPANNER OF SEGMENTS | 2010-03-19 | Paper |
| A coarse-grained reconfigurable computing architecture with loop self-pipelining | 2010-02-26 | Paper |
| Robustness of \(k\)-gon Voronoi diagram construction | 2009-12-18 | Paper |
| Computing the Map of Geometric Minimal Cuts | 2009-12-17 | Paper |
| An LP rounding algorithm for approximating uncapacitated facility location problem with penalties | 2009-12-04 | Paper |
| On lazy bin covering and packing problems | 2009-12-01 | Paper |
| Efficient approximation algorithms for clustering point-sets | 2009-10-16 | Paper |
| Generalized median graphs and applications | 2009-08-06 | Paper |
| An improved approximation algorithm for uncapacitated facility location problem with penalties | 2009-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601517 | 2009-02-10 | Paper |
| Almost optimal solutions for bin coloring problems | 2008-09-02 | Paper |
| Geometric Spanner of Objects under L 1 Distance | 2008-07-10 | Paper |
| Non-breaking Similarity of Genomes with Gene Repetitions | 2008-06-17 | Paper |
| Geometric Spanner of Segments | 2008-05-27 | Paper |
| Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems | 2008-04-24 | Paper |
| Minimum Spanning Tree with Neighborhoods | 2008-01-04 | Paper |
| On Lazy Bin Covering and Packing Problems | 2007-09-10 | Paper |
| Linear time algorithms for approximating the facility terminal cover problem | 2007-07-20 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| Constant approximation algorithms for rectangle stabbing and related problems | 2007-02-14 | Paper |
| Graph bandwidth of weighted caterpillars | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Efficient algorithms for determining 3D biplane imaging geometry | 2006-02-08 | Paper |
| Efficient job scheduling algorithms with multi-type contentions | 2006-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications | 2005-05-17 | Paper |
| Geometric permutations of higher dimensional spheres | 2004-10-13 | Paper |
| Finding an optimal path without growing the tree | 2004-10-01 | Paper |
| TOPOLOGICAL PEELING AND APPLICATIONS | 2004-09-29 | Paper |
| TRAVELING SALESMAN PROBLEM OF SEGMENTS | 2004-09-29 | Paper |
| An Experimental Study and Comparison of Topological Peeling and Topological Walk | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472522 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474113 | 2004-08-04 | Paper |
| Computing optimal beams in two and three dimensions | 2003-08-28 | Paper |
| Two-variable linear programming in parallel | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768301 | 2002-03-24 | Paper |
| An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model | 2001-09-27 | Paper |
| Determining an optimal penetration among weighted regions in two and three dimensions | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952691 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252037 | 1999-10-06 | Paper |
