| Publication | Date of Publication | Type |
|---|
| A centroid labelling technique and its application to path selection in trees | 2022-08-19 | Paper |
| Minimizing the operation cost of distributed green data centers with energy storage under carbon capping | 2021-03-10 | Paper |
| Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus | 2018-07-09 | Paper |
| Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1) | 2017-09-08 | Paper |
| Coordinated En-Route Web Caching in Multiserver Networks | 2017-08-08 | Paper |
| Embedding Meshes and Tori on Double-Loop Networks of the Same Size | 2017-07-27 | Paper |
| Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks | 2017-07-12 | Paper |
| Effective Reconstruction of Data Perturbed by Random Projections | 2017-07-12 | Paper |
| An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks | 2017-07-12 | Paper |
| Edge-independent spanning trees in augmented cubes | 2017-03-16 | Paper |
| 2-space bounded online cube and hypercube packing | 2016-01-15 | Paper |
| Learning a hybrid similarity measure for image retrieval | 2015-12-08 | Paper |
| Updating attribute reduction in incomplete decision systems with the variation of attribute set | 2015-07-10 | Paper |
| Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints | 2015-07-10 | Paper |
| Improved approximation algorithms for constrained fault-tolerant resource allocation | 2015-06-10 | Paper |
| On the Advice Complexity of One-Dimensional Online Bin Packing | 2014-09-02 | Paper |
| Approximation algorithms for fault tolerant facility allocation | 2014-01-21 | Paper |
| Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation | 2013-08-16 | Paper |
| On finding Min-Min disjoint paths | 2013-06-25 | Paper |
| Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints | 2013-06-11 | Paper |
| On the complexity of the edge-disjoint min-min problem in planar digraphs | 2012-06-25 | Paper |
| Routing and wavelength assignment for hypercube in array-based WDM optical networks | 2012-03-07 | Paper |
| A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION | 2011-10-10 | Paper |
| Unconstrained and Constrained Fault-Tolerant Resource Allocation | 2011-08-17 | Paper |
| Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs | 2011-06-03 | Paper |
| The generalization of some trellis properties of linear codes to group codes | 2010-02-26 | Paper |
| The fault-tolerant facility allocation problem | 2009-12-17 | Paper |
| A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates | 2008-12-21 | Paper |
| A Relation Between the Characteristic Generators of a Linear Code and its Dual | 2008-12-21 | Paper |
| Janus: A Two-Sided Analytical Model for Multi-Stage Coordinated Attacks | 2008-05-06 | Paper |
| Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees | 2008-03-19 | Paper |
| Nearest lattice point algorithms on semi \(k\)-reduced basis | 2007-02-20 | Paper |
| Random walk routing in WSNS with regular topologies | 2006-10-12 | 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 |
| Sorting on Single-Channel Wireless Sensor Networks | 2005-10-19 | Paper |
| ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO | 2005-08-01 | Paper |
| Mining informative rule set for prediction | 2005-03-15 | Paper |
| A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL | 2004-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451939 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451897 | 2004-02-11 | Paper |
| More efficient topological sort using reconfigurable optical buses | 2003-08-20 | Paper |
| Analysis on extended ant routing algorithms for network routing and management | 2003-08-20 | Paper |
| Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers | 2003-05-08 | Paper |
| Transversal of disjoint convex polygons. | 2003-01-21 | Paper |
| Fast association discovery in derivative transaction collections | 2003-01-08 | Paper |
| Fast sequential and parallel algorithms for finding extremal sets | 2002-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532754 | 2002-11-06 | Paper |
| An efficient algorithm for constructing Hamiltonian paths in meshes | 2002-09-09 | Paper |
| A study of average-case speedup and scalability of parallel computations on static networks | 2002-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768585 | 2002-02-03 | Paper |
| An architecture-independent graphical tool for automatic contention-free process-to-processor mapping | 2001-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501593 | 2001-03-12 | Paper |
| Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree∗ | 2000-10-30 | Paper |
| Fully dynamic algorithms for maintaining extremal sets in a family of sets∗ | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494100 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953334 | 2000-05-09 | Paper |
| Finding the \(k\) most vital edges with respect to minimum spanning tree | 1999-12-20 | Paper |
| An efficient clustering algorithm for partitioning parallel programs | 1999-01-12 | Paper |
| Lower bounds for dynamic tree embedding in bipartite networks | 1999-01-06 | Paper |
| Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk | 1998-11-01 | Paper |
| Optimal parallel multiselection on EREW PRAM | 1998-08-13 | Paper |
| Efficient enumeration of all minimal separators in a graph | 1998-07-22 | Paper |
| Optimal algorithms for generalized searching in sorted matrices | 1998-06-30 | Paper |
| NC algorithms for the Single Most Vital Edge problem with respect to shortest paths | 1997-02-28 | Paper |
| Optimal parallel selection in sorted matrices | 1997-02-27 | Paper |
| NC algorithms for dynamically solving the all pairs shortest paths problem and related problems | 1997-02-27 | Paper |
| An efficient permutation-based parallel range-join algorithm on \(N\)-dimensional torus computers | 1996-02-26 | Paper |
| An efficient permutation-based parallel algorithm for range-join in hypercubes | 1996-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289057 | 1994-10-31 | Paper |
| A high performance interconnection network for multiprocessor systems | 1993-11-28 | Paper |
| Construction of large‐size interconnection networks with high performance | 1993-08-23 | Paper |
| Improved universal \(k\)-selection in hypercubes | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3987181 | 1992-06-28 | Paper |
| Improved nonconservative sequential and parallel integer sorting | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813303 | 1988-01-01 | Paper |
