| Publication | Date of Publication | Type |
|---|
| Parallel algorithms for global optimization problems | 2024-06-21 | Paper |
| O(n log n)-average-time algorithm for shortest network under a given topology | 2024-01-29 | Paper |
| Computing the shortest network under a fixed topology | 2018-07-09 | Paper |
| Relay Node Placement in Wireless Sensor Networks | 2018-06-12 | Paper |
| Multiconstrained QoS Routing: A Norm Approach | 2018-06-12 | Paper |
| Constrained shortest link-disjoint paths selection: a network programming based approach | 2017-11-20 | Paper |
| Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes | 2017-07-12 | Paper |
| The electric vehicle shortest-walk problem with battery exchanges | 2017-06-20 | Paper |
| DeyPoS: Deduplicatable Dynamic Proof of Storage for Multi-User Environments | 2017-05-16 | Paper |
| Steiner tree problem with minimum number of Steiner points and bounded edge-length | 2016-06-16 | Paper |
| Improved approximation algorithms for single-tiered relay placement | 2016-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4980917 | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4980863 | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5398908 | 2014-02-28 | Paper |
| Minimum diameter cost-constrained Steiner trees | 2014-02-25 | Paper |
| On the Minimum Diameter Cost-Constrained Steiner Tree Problem | 2012-11-02 | Paper |
| Diameter-constrained Steiner trees | 2012-08-27 | Paper |
| A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges | 2012-08-27 | Paper |
| A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges | 2011-08-12 | Paper |
| A linear time algorithm for computing a most reliable source on a tree network with faulty nodes | 2011-01-28 | Paper |
| Diameter-Constrained Steiner Tree | 2011-01-10 | Paper |
| A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree | 2011-01-10 | Paper |
| A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices | 2009-07-07 | Paper |
| Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks | 2008-08-15 | Paper |
| On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths | 2008-02-11 | Paper |
| Reliable ad hoc routing based on mobility prediction | 2007-01-05 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| A cost-minimization algorithm for fast location tracking in mobile wireless networks | 2006-10-10 | Paper |
| The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization | 2006-05-09 | Paper |
| Fast data transmission and maximal dynamic flow. | 2006-01-17 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology | 2005-02-21 | Paper |
| A PTAS for weight constrained Steiner trees in series--parallel graphs. | 2003-08-17 | Paper |
| On the terminal Steiner tree problem. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551390 | 2002-09-05 | Paper |
| \(k\)-pair delay constrained minimum cost routing in undirected networks | 2002-03-24 | Paper |
| Reducing the Steiner problem in four uniform orientations | 2001-12-12 | Paper |
| Optimal multicast trees in communication systems with channel capacities and channel reliabilities | 2001-09-04 | Paper |
| A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM | 2001-08-20 | Paper |
| Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure | 2001-07-12 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2001-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525764 | 2001-01-24 | Paper |
| Grade of service Steiner minimum trees in the Euclidean plane | 2001-01-01 | Paper |
| An efficient algorithm for delay buffer minimization | 2000-10-30 | Paper |
| Optimization of molecular similarity index with applications to biomolecules | 2000-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938658 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945799 | 2000-03-23 | Paper |
| An Efficient Algorithm for Minimizing a Sum of p-Norms | 2000-03-19 | Paper |
| Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources | 1999-11-24 | Paper |
| On Rearrangeability of Multirate Clos Networks | 1999-10-28 | Paper |
| An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology | 1999-08-08 | Paper |
| Interconnecting Highways | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251083 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218411 | 1999-05-18 | Paper |
| Algorithms for a class of isotonic regression problems | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400643 | 1999-02-10 | Paper |
| A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges | 1999-01-12 | Paper |
| K-center and K-median problems in graded distances | 1999-01-12 | Paper |
| An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355484 | 1998-05-25 | Paper |
| An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications | 1998-02-10 | Paper |
| Protein conformation of a lattice model using tabu search | 1997-12-04 | Paper |
| A polynomial time dual algorithm for the Euclidean multifacility location problem | 1997-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883376 | 1996-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863370 | 1996-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840113 | 1996-01-14 | Paper |
| On an open problem in spherical facility location | 1995-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323618 | 1995-02-23 | Paper |
| Improvement on the Northby algorithm for molecular conformation: Better solutions | 1994-09-04 | Paper |
| Optimization methods for computing global minima of nonconvex potential energy functions | 1994-04-12 | Paper |
| Molecular conformation on the CM-5 by parallel two-level simulated annealing | 1994-04-12 | Paper |
| On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem | 1994-03-13 | Paper |
| A globally convergent algorithm for the Euclidean multiplicity location problem | 1993-05-24 | Paper |
| Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem | 1993-01-13 | Paper |
| Algorithms for the quickest path problem and the enumeration of quickest paths | 1992-06-28 | Paper |
| On a new algorithm for stable assignment* | 1992-06-28 | Paper |
| On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4710379 | 1992-06-25 | Paper |
| On the convergence of one-dimensional simplex search | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3799824 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804459 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780771 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3799822 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3797321 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494488 | 1986-01-01 | Paper |
