| Publication | Date of Publication | Type |
|---|
| Constructing one-to-many disjoint paths in folded hypercubes | 2018-07-09 | Paper |
| (t, k) - Diagnosis for Matching Composition Networks under the MM* Model | 2018-06-12 | Paper |
| A Cognitive TCP Design for a Cognitive Radio Network with an Unstable-Bandwidth Link | 2017-05-16 | Paper |
| Optimal buy-and-hold strategies for financial markets with bounded daily returns | 2016-09-29 | Paper |
| The broadcast median problem in heterogeneous postal model | 2013-06-13 | Paper |
| A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs | 2013-05-13 | Paper |
| Broadcasting in Heterogeneous Tree Networks with Uncertainty | 2011-12-16 | Paper |
| The degree-preserving spanning tree problem in strongly chordal and directed path graphs | 2010-11-24 | Paper |
| Finding cycles in hierarchical hypercube networks | 2010-06-09 | Paper |
| Edge‐fault‐tolerant pancyclicity of alternating group graphs | 2009-07-28 | Paper |
| Embedding Hamiltonian cycles in alternating group graphs under conditional fault model | 2009-03-24 | Paper |
| Fault-free longest paths in star networks with conditional link faults | 2009-03-17 | Paper |
| Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model | 2009-01-08 | Paper |
| Efficient on-line repetition detection | 2008-11-18 | Paper |
| (t,k)-Diagnosability of Multiprocessor Systems with Applications to Grids and Tori | 2008-08-14 | Paper |
| w -Rabin numbers and strong w -Rabin numbers of folded hypercubes | 2008-06-20 | Paper |
| Fault-free Hamiltonian cycles in crossed cubes with conditional link faults | 2008-01-03 | Paper |
| Node-searching problem on block graphs | 2007-11-30 | Paper |
| Node-disjoint paths in hierarchical hypercube networks | 2007-10-10 | Paper |
| Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs | 2007-02-13 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Strong Rabin numbers of folded hypercubes | 2005-09-22 | Paper |
| Generalized diameters of the mesh of trees | 2004-10-01 | Paper |
| Fault-tolerant cycle embedding in hierarchical cubic networks | 2004-02-03 | Paper |
| Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures | 2003-05-14 | Paper |
| Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs | 2003-01-05 | Paper |
| Node‐disjoint paths and related problems on hierarchical cubic networks | 2002-12-17 | Paper |
| A note on cyclic-cubes | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540062 | 2002-07-21 | Paper |
| Hamiltonicity of the hierarchical cubic network | 2002-05-30 | Paper |
| Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns | 2002-04-23 | Paper |
| Minimum spanners of butterfly graphs | 2001-12-18 | Paper |
| A general broadcasting scheme for recursive networks with complete connection | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714908 | 2001-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761322 | 2001-02-11 | Paper |
| Node-disjoint paths in incomplete WK-recursive networks | 2000-10-26 | Paper |
| A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944742 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953326 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260016 | 1999-11-22 | Paper |
| The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules | 1999-10-25 | Paper |
| Broadcasting on incomplete WK-recursive networks | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249531 | 1999-06-17 | Paper |
| An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees | 1999-03-30 | Paper |
| On the complexity of the k-chain subgraph cover problem | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4363414 | 1997-11-06 | Paper |
| Efficient parallel algorithms for doubly convex-bipartite graphs | 1997-02-28 | Paper |
| Multiple search problem on reconfigurable meshes | 1997-02-27 | Paper |
| Combinatorial properties of generalized hypercube graphs | 1997-02-27 | Paper |
| Cost-optimal parallel algorithms for constructing B-trees | 1995-08-10 | Paper |
| Generate all maximal independent sets in permutation graphs | 1995-02-16 | Paper |
| Deriving algorithms on reconfigurable networks based on function decomposition | 1994-11-29 | Paper |
| Algorithms for the constrained quickest path problem and the enumeration of quickest paths | 1994-09-14 | Paper |
| An algorithm for coalescing operations with precedence constraints in real-time systems | 1994-09-11 | Paper |
| A theorem on permutation graphs with applications | 1994-07-26 | Paper |
| The Steiner problem in distributed computing systems | 1994-03-20 | Paper |
| Parallel algorithms for permutation graphs | 1994-03-07 | Paper |
| On the quickest path problem | 1994-01-19 | Paper |
| Sorting and computing convex hulls on processor arrays with reconfigurable bus systems | 1994-01-13 | Paper |
| On the Set LCS and Set-Set LCS Problems | 1993-06-29 | Paper |
| On the complexity of generating synchronizable test sequences | 1993-02-22 | Paper |
| The weighted maximum independent set problem in permutation graphs | 1993-01-26 | Paper |
| An improved parallel algorithm for 0/1 knapsack problem | 1992-11-08 | Paper |
| Distributed algorithms for the quickest path problem | 1992-11-08 | Paper |
| Conflict-free broadcasting algorithms for graph traversals and their applications | 1992-10-07 | Paper |
| Optimal multiway generalized split trees | 1992-06-28 | Paper |
| An 0(1) time algorithm for string matching | 1992-06-28 | Paper |
| An algorithm paradigm for incomplete hypercubes | 1992-06-26 | Paper |
| A simple approach to implementing multiplication with small tables | 1991-01-01 | Paper |
| A note on optimal multiway split trees | 1991-01-01 | Paper |
| Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model | 1990-01-01 | Paper |
| Data mapping of linear programming on fixed-size hypercubes | 1990-01-01 | Paper |
| Constant time sorting on a processor array with a reconfigurable bus system | 1990-01-01 | Paper |
| Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model | 1990-01-01 | Paper |
| Pipeline architectures for dynamic programming algorithms | 1990-01-01 | Paper |
| Selection of the first k largest processes in hypercubes | 1989-01-01 | Paper |
