| Publication | Date of Publication | Type |
|---|
| \(G\)-good-neighbor diagnosability under the modified comparison model for multiprocessor systems | 2025-01-16 | Paper |
| Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs | 2024-08-22 | Paper |
| On the \(d\)-claw vertex deletion problem | 2024-01-25 | Paper |
| A study for conditional diagnosability of pancake graphs | 2023-03-30 | Paper |
| On the \(d\)-claw vertex deletion problem | 2023-03-30 | Paper |
| Improved IP lookup technology for trie-based data structures | 2023-01-06 | Paper |
| Pancake graphs: structural properties and conditional diagnosability | 2022-10-31 | Paper |
| Characterization of component diagnosability of regular networks | 2022-10-13 | Paper |
| A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks | 2022-07-01 | Paper |
| On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality | 2022-06-28 | Paper |
| Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs | 2022-06-13 | Paper |
| A Novel Measurement for Network Reliability | 2022-03-23 | Paper |
| An improved algorithm for the Steiner tree problem with bounded edge-length | 2021-10-28 | Paper |
| Constructing independent spanning trees in alternating group networks | 2021-04-21 | Paper |
| A survey for conditional diagnosability of alternating group networks | 2021-04-21 | Paper |
| Matching cut in graphs with large minimum degree | 2021-04-19 | Paper |
| An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem | 2020-11-25 | Paper |
| \( R_3\)-connectivity of folded hypercubes | 2020-08-31 | Paper |
| An Efficient Approximation Algorithm for the Steiner Tree Problem | 2020-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295505 | 2020-07-10 | Paper |
| Multilevel length-based classified index table for IP lookups and updates | 2020-06-09 | Paper |
| Matching cut in graphs with large minimum degree | 2020-02-24 | Paper |
| Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs | 2020-01-16 | Paper |
| On the \(g\)-good-neighbor connectivity of graphs | 2019-12-27 | Paper |
| Vulnerability of super extra edge-connected graphs | 2019-11-29 | Paper |
| Performance evaluation on hybrid fault diagnosability of regular networks | 2019-11-13 | Paper |
| Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks | 2019-10-29 | Paper |
| On the $g$-extra connectivity of graphs | 2019-04-13 | Paper |
| The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model | 2018-05-08 | Paper |
| Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality | 2017-11-14 | Paper |
| Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model | 2017-11-10 | Paper |
| Random and conditional \((t,k)\)-diagnosis of hypercubes | 2017-11-09 | Paper |
| The approximability of the \(p\)-hub center problem with parameterized triangle inequality | 2017-10-23 | Paper |
| Strongly Diagnosable Systems under the Comparison Diagnosis Model | 2017-08-08 | Paper |
| (t,k)-Diagnosis for Component-Composition Graphs under the MM* Model | 2017-07-27 | Paper |
| Multiprefix Trie: A New Data Structure for Designing Dynamic Router-Tables | 2017-07-27 | Paper |
| On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality | 2017-07-21 | Paper |
| The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model | 2017-07-12 | Paper |
| Component-Composition Graphs: (t,k)-Diagnosability and Its Application | 2017-07-12 | Paper |
| Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes | 2017-07-12 | Paper |
| A Classified Multisuffix Trie for IP Lookup and Update | 2017-07-12 | Paper |
| Pancyclicity of Matching Composition Networks under the Conditional Fault Model | 2017-07-12 | Paper |
| Construction independent spanning trees on locally twisted cubes in parallel | 2017-06-22 | Paper |
| On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes | 2017-06-20 | Paper |
| Multi-Inherited Search Tree for Dynamic IP Router-Tables | 2017-06-08 | Paper |
| Conditional (t,k)-Diagnosis in Graphs by Using the Comparison Diagnosis Model | 2017-05-16 | Paper |
| An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem | 2017-05-16 | Paper |
| The -Diagnosability for Regular Networks | 2017-05-16 | Paper |
| \(h\)-restricted connectivity of locally twisted cubes | 2017-03-15 | Paper |
| Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs | 2017-02-01 | Paper |
| Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks | 2016-11-18 | Paper |
| Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs | 2016-09-02 | Paper |
| Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges | 2016-04-18 | Paper |
| \(\{2,3\}\)-restricted connectivity of locally twisted cubes | 2016-01-21 | Paper |
| An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 | 2015-11-17 | Paper |
| Bounds for the Super Extra Edge Connectivity of Graphs | 2015-10-29 | Paper |
| Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths | 2014-11-28 | Paper |
| \(\{2,3\}\)-extraconnectivities of hypercube-like networks | 2013-07-24 | Paper |
| Fault-tolerant path embedding in folded hypercubes with both node and edge faults | 2013-03-04 | Paper |
| The internal Steiner tree problem: Hardness and approximations | 2013-01-14 | Paper |
| Extraconnectivity of \(k\)-ary \(n\)-cube networks | 2012-08-10 | Paper |
| Edge-bipancyclicity of star graphs with faulty elements | 2011-12-07 | Paper |
| On parallel recognition of cographs | 2011-02-21 | Paper |
| Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application | 2010-12-09 | Paper |
| Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model | 2010-12-03 | Paper |
| Panconnectivity and edge-pancyclicity ofk-aryn-cubes | 2010-11-24 | Paper |
| A further result on fault-free cycles in faulty folded hypercubes | 2010-09-02 | Paper |
| Pancyclicity and bipancyclicity of conditional faulty folded hypercubes | 2010-09-02 | Paper |
| Cycle embedding of augmented cubes | 2010-09-01 | Paper |
| An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation | 2010-09-01 | Paper |
| Conditional edge-fault Hamiltonicity of augmented cubes | 2010-07-20 | Paper |
| A note on cycle embedding in folded hypercubes with faulty elements | 2010-06-09 | Paper |
| 1-vertex-fault-tolerant cycles embedding on folded hypercubes | 2010-04-28 | Paper |
| Finding a maximum-density path in a tree under the weight and length constraints | 2010-03-24 | Paper |
| Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults | 2010-03-09 | Paper |
| Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults | 2009-10-19 | Paper |
| Constructing edge-disjoint spanning trees in locally twisted cubes | 2009-03-17 | Paper |
| A DNA-based graph encoding scheme with its applications to graph isomorphism problems | 2009-01-14 | Paper |
| Cycle and Path Embedding on 5-ary N-cubes | 2008-12-22 | Paper |
| Edge-bipancyclicity of a hypercube with faulty vertices and edges | 2008-09-10 | Paper |
| Diagnosability of Two-Matching Composition Networks | 2008-07-10 | Paper |
| Hamiltonicity of Matching Composition Networks with Conditional Edge Faults | 2008-05-27 | Paper |
| Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species | 2008-04-17 | Paper |
| A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers | 2008-03-26 | Paper |
| Some edge‐fault‐tolerant properties of the folded hypercube | 2008-03-12 | Paper |
| On the Internal Steiner Tree Problem | 2007-11-13 | Paper |
| Path Embedding on Folded Hypercubes | 2007-11-13 | Paper |
| Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes | 2007-11-02 | Paper |
| Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges | 2007-10-12 | Paper |
| MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees | 2007-09-10 | Paper |
| Approximating the selected-internal Steiner tree | 2007-09-03 | Paper |
| A faster parallel connectivity algorithm on cographs | 2007-06-29 | Paper |
| Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species | 2007-02-26 | Paper |
| The interval-merging problem | 2007-02-16 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The Hamiltonian problem on distance-hereditary graphs | 2006-04-28 | Paper |
| Thek-degree Cayley graph and its topological properties | 2006-03-24 | Paper |
| Computational Science - ICCS 2004 | 2005-12-23 | Paper |
| Embedding longest fault-free paths onto star graphs with more vertex faults | 2005-06-30 | Paper |
| Efficiently parallelizable problems on a class of decomposable graphs | 2005-02-23 | Paper |
| An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808624 | 2004-08-12 | Paper |
| Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs | 2003-01-05 | Paper |
| On vertex ranking of a starlike graph | 2002-07-14 | Paper |
| Hamiltonian-laceability of star graphs | 2001-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525740 | 2001-01-24 | 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/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 |
