| Publication | Date of Publication | Type |
|---|
| A survey on conflict-free connection coloring of graphs | 2024-05-06 | Paper |
| Two-stage BP maximization under \(p\)-matroid constraint | 2024-03-28 | Paper |
| Two-stage BP maximization under \(p\)-matroid constraint | 2023-08-10 | Paper |
| Two-stage non-submodular maximization | 2023-08-04 | Paper |
| Two-stage non-submodular maximization | 2023-07-21 | Paper |
| Two-stage submodular maximization under curvature | 2023-04-14 | Paper |
| A construction of minimal coherent filling pairs | 2023-02-07 | Paper |
| Two-stage submodular maximization problem beyond non-negative and monotone | 2022-12-22 | Paper |
| Isosceles Constraints for Person Re-Identification | 2022-09-16 | Paper |
| Improved algorithms for non-submodular function maximization problem | 2022-09-01 | Paper |
| An upper bound of the numbers of minimally intersecting filling coherent pairs | 2022-08-01 | Paper |
| Efficient geodesics in the curve complex and their dot graphs | 2022-07-13 | Paper |
| Improved algorithms for non-submodular function maximization problem | 2022-07-01 | Paper |
| Two-stage submodular maximization under curvature | 2022-06-29 | Paper |
| Multi-party quantum key agreement protocol with authentication | 2022-01-03 | Paper |
| Conflict-free connection of trees | 2021-11-25 | Paper |
| Online BP functions maximization | 2021-07-05 | Paper |
| Origami edge-paths in the curve graph | 2021-06-14 | Paper |
| Online algorithms for BP functions maximization | 2021-02-03 | Paper |
| More on limited packings in graphs | 2020-07-29 | Paper |
| Degree sum conditions for graphs to have proper connection number 2 | 2019-12-18 | Paper |
| On conflict-free connection of graphs | 2019-02-20 | Paper |
| Some upper bounds for the 3-proper index of graphs | 2019-01-31 | Paper |
| Graphs with conflict-free connection number two | 2019-01-11 | Paper |
| The \((k,\ell )\)-proper index of graphs | 2018-07-20 | Paper |
| Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs | 2017-05-23 | Paper |
| More on the $k$-color connection number of a graph | 2017-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4927888 | 2013-06-20 | Paper |
| A Scalable Kernel-Based Semisupervised Metric Learning Algorithm with Out-of-Sample Generalization Ability | 2008-11-20 | Paper |
| Robust path-based spectral clustering | 2007-10-10 | Paper |
| Learning the kernel matrix by maximizing a KFD-based class separability criterion | 2007-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415327 | 2007-01-16 | Paper |
| Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval | 2006-08-16 | Paper |
| Robust locally linear embedding | 2006-08-14 | Paper |
| Locally linear metric adaptation with application to semi-supervised clustering and image retrieval | 2006-06-30 | Paper |
| Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints | 2006-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5697140 | 2005-10-17 | Paper |
| QUANTUM CHAOS IN NON-SYMMETRIC POTENTIAL WELL IN A TILTED MAGNETIC FIELD | 2005-01-06 | Paper |
| The design of a triplet with a shape-dependent third-order aberration optimization technique | 2005-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944248 | 2000-06-14 | Paper |
| Bayesian Approach for Nonlinear Random Effects Models | 1998-03-18 | Paper |
