| Publication | Date of Publication | Type |
|---|
A polynomial-time exact algorithm for the connected \(k\)-facility location problem on trees
Discrete Mathematics, Algorithms and Applications | 2025-11-12 | Paper |
Parameterized approximations for the minimum diameter vertex-weighted Steiner tree problem in graphs with parameterized weights
Asia-Pacific Journal of Operational Research | 2025-11-12 | Paper |
Disjoint and shortest paths routing in hypercubes
Congressus Numerantium | 2025-01-02 | Paper |
Constant-factor greedy algorithms for the asymmetric \(p\)-center problem in parameterized complete digraphs
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Updating matrix polynomials
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Minimum diameter \(k\)-Steiner forest
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
On the \(g\)-extra connectivity of augmented cubes
Theoretical Computer Science | 2023-08-08 | Paper |
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
A brief account on the development and future research directions of connectivity properties of interconnection networks
Parallel Processing Letters | 2022-07-08 | Paper |
On the \(g\)-extra diagnosability of enhanced hypercubes
Theoretical Computer Science | 2022-05-23 | Paper |
| A general approach to deriving diagnosability results of interconnection networks | 2022-04-06 | Paper |
| Minimum diameter vertex-weighted Steiner tree | 2021-07-05 | Paper |
A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
Theoretical Computer Science | 2020-09-17 | Paper |
Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
Journal of Combinatorial Optimization | 2020-06-05 | Paper |
| On coloring complete binary trees | 2019-07-24 | Paper |
| A proposed scheme of findings closed form solutions to surface areas of graphs | 2019-07-24 | Paper |
Approximating the restricted 1-center in graphs
Theoretical Computer Science | 2019-06-25 | Paper |
A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
Theoretical Computer Science | 2019-01-18 | Paper |
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Structural properties of generalized exchanged hypercubes
Emergent Computation | 2018-10-04 | Paper |
Length two path centered surface areas of the \((n, k)\)-star graph
Information Sciences | 2018-05-22 | Paper |
On the conditional diagnosability of hyper-buttery graphs and related networks
Parallel Processing Letters | 2017-12-15 | Paper |
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
Theoretical Computer Science | 2017-05-12 | Paper |
A strong connectivity property of the generalized exchanged hypercube
Discrete Applied Mathematics | 2017-03-15 | Paper |
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the conditional diagnosability of matching composition networks
Theoretical Computer Science | 2016-06-27 | Paper |
Edge centered surface area for the \((n, k)\)-star graph
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-03-16 | Paper |
Dynamic single-source shortest paths in Erdős-Rényi random graphs
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Approximating the Restricted 1-Center in Graphs
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
The number of shortest paths in the arrangement graph
Information Sciences | 2015-09-23 | Paper |
| On the surface areas of the alternating group graph and the split-star graph. | 2015-08-26 | Paper |
Algorithms for the minimum diameter terminal Steiner tree problem
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
The number of shortest paths in the \((n, k)\)-star graph
Discrete Mathematics, Algorithms and Applications | 2014-11-28 | Paper |
Length two path centered surface area for bipartite graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2014-11-04 | Paper |
Length two path-centred surface areas for the arrangement graph
International Journal of Computer Mathematics | 2014-10-14 | Paper |
The edge-centered surface area of the arrangement graph
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Edge centered surface areas of bipartite graphs
Congressus Numerantium | 2014-01-03 | Paper |
Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
Graphs and Combinatorics | 2013-07-19 | Paper |
On the surface areas and average distances of meshes and tori
Parallel Processing Letters | 2012-12-12 | Paper |
The edge-centered surface area of the arrangement graph
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
On deriving conditional diagnosability of interconnection networks
Information Processing Letters | 2012-10-23 | Paper |
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs
International Journal of Computer Mathematics | 2011-01-20 | Paper |
The Number of Shortest Paths in the (n, k)-Star Graphs
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
A short note on the surface area of star graphs
Parallel Processing Letters | 2010-09-29 | Paper |
On the spectrum of the middle-cube
(available as arXiv preprint) | 2010-09-02 | Paper |
Distance formula and shortest paths for the \((n,k)\)-star graphs
Information Sciences | 2010-06-11 | Paper |
On the surface area of the \((n,k)\)-star graph
Theoretical Computer Science | 2009-11-25 | Paper |
On Disjoint Shortest Paths Routing on the Hypercube
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
| scientific article; zbMATH DE number 5532156 (Why is no real title available?) | 2009-03-24 | Paper |
On the Surface Area of the (n, k)-Star Graph
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On the Whitney numbers of the second kind for the star poset
European Journal of Combinatorics | 2008-09-04 | Paper |
| On a combinatorial problem on the star graphs | 2008-02-20 | Paper |
Finding the maximum subsequence sum on interconnection networks
International Journal of Parallel, Emergent and Distributed Systems | 2007-10-24 | Paper |
| scientific article; zbMATH DE number 5139470 (Why is no real title available?) | 2007-04-02 | Paper |
| Notes on Whitney numbers of the second kind for the star poset | 2006-03-30 | Paper |
Interconnection Networks and Their Eigenvalues
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
LOAD BALANCING, SELECTION AND SORTING ON THE STAR AND PANCAKE INTERCONNECTION NETWORKS∗
Parallel Algorithms and Applications | 2004-10-06 | Paper |
| scientific article; zbMATH DE number 2077683 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1735791 (Why is no real title available?) | 2002-10-23 | Paper |
From Hall's matching theorem to optimal routing on hypercubes
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
| scientific article; zbMATH DE number 1161303 (Why is no real title available?) | 1998-11-08 | Paper |
| scientific article; zbMATH DE number 1185587 (Why is no real title available?) | 1998-08-09 | Paper |
| scientific article; zbMATH DE number 637342 (Why is no real title available?) | 1994-11-27 | Paper |
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
Networks | 1993-08-23 | Paper |
A novel routing scheme on the star and pancake networks and its applications
Parallel Computing | 1993-05-16 | Paper |
Decomposing a star graph into disjoint cycles
Information Processing Letters | 1992-06-27 | Paper |
A note on diameter of acyclic directed hypercubes
Information Processing Letters | 1990-01-01 | Paper |
