| Publication | Date of Publication | Type |
|---|
The Outer-Paired Domination of Graphs
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
A note on the geodetic number and the Steiner number of AT-free graphs
Theoretical Computer Science | 2021-01-25 | Paper |
The 2-rainbow bondage number in generalized Petersen graphs
Cogent Mathematics | 2019-09-10 | Paper |
Geodetic contraction games on trees
Frontiers in Algorithmics | 2019-04-26 | Paper |
A fast parallel algorithm for constructing independent spanning trees on parity cubes
Applied Mathematics and Computation | 2019-03-18 | Paper |
On retracts, absolute retracts, and foldings in cographs
Optimization Letters | 2018-05-28 | Paper |
On complexities of minus domination
Discrete Optimization | 2018-05-24 | Paper |
Efficient absorbants in generalized de Bruijn digraphs
Discrete Optimization | 2018-05-24 | Paper |
On efficient absorbant conjecture in generalized de Bruijn digraphs
International Journal of Computer Mathematics | 2017-07-28 | Paper |
Independent Spanning Trees on Multidimensional Torus Networks
IEEE Transactions on Computers | 2017-07-27 | Paper |
| On the Orbits of Crossed Cubes | 2017-07-21 | Paper |
A New Subclass of Integer Linear Programming Problems and Its Applications
IEEE Transactions on Computers | 2017-07-12 | Paper |
Construction independent spanning trees on locally twisted cubes in parallel
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
A note on path embedding in crossed cubes with faulty vertices
Information Processing Letters | 2017-02-21 | Paper |
| P₃-Games on Chordal Bipartite Graphs | 2016-10-22 | Paper |
The connected p-median problem on block graphs
Optimization Letters | 2016-09-21 | Paper |
A memory-efficient and fast Huffman decoding algorithm
Information Processing Letters | 2016-06-16 | Paper |
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
Information Processing Letters | 2016-05-26 | Paper |
The outer-connected domination number of Sierpiński-like graphs
Theory of Computing Systems | 2016-03-09 | Paper |
Edge-clique covers of the tensor product
Theoretical Computer Science | 2015-12-08 | Paper |
Corrigendum to: ``Incidence coloring of Cartesian product graphs''
Information Processing Letters | 2015-12-01 | Paper |
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences | 2015-09-25 | Paper |
Finding outer-connected dominating sets in interval graphs
Information Processing Letters | 2015-09-15 | Paper |
Resequencing a set of strings based on a target string
Algorithmica | 2015-07-10 | Paper |
Incidence coloring of Cartesian product graphs
Information Processing Letters | 2015-06-15 | Paper |
On maximum independent set of categorical product and ultimate categorical ratios of graphs
Theoretical Computer Science | 2015-06-11 | Paper |
Edge-clique covers of the tensor product
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
Journal of Discrete Algorithms | 2015-02-13 | Paper |
The hub number of co-comparability graphs
Theoretical Computer Science | 2015-01-30 | Paper |
Efficient twin domination in generalized de Bruijn digraphs
Discrete Mathematics | 2014-12-19 | Paper |
Circuits of each length in tournaments
Graphs and Combinatorics | 2014-09-19 | Paper |
| scientific article; zbMATH DE number 6288786 (Why is no real title available?) | 2014-04-25 | Paper |
A tight upper bound for 2-rainbow domination in generalized Petersen graphs
Discrete Applied Mathematics | 2014-04-22 | Paper |
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Theoretical Computer Science | 2014-04-15 | Paper |
On perfect absorbants in de Bruijn digraphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Algorithms and Computation | 2014-02-18 | Paper |
Two spanning disjoint paths with required length in generalized hypercubes
Theoretical Computer Science | 2014-01-16 | Paper |
\((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
Theoretical Computer Science | 2013-12-13 | Paper |
On complexities of minus domination
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
On retracts, absolute retracts, and folds in cographs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Global strong defensive alliances of Sierpiński-like graphs
Theory of Computing Systems | 2013-10-21 | Paper |
| Set Representations of Linegraphs | 2013-08-31 | Paper |
On independence domination
Fundamentals of Computation Theory | 2013-08-16 | Paper |
| Independent set in categorical products of cographs and splitgraphs | 2013-05-18 | Paper |
| The Domination Number of Generalized Petersen Graphs with a Faulty Vertex | 2013-05-06 | Paper |
Finding the edge ranking number through vertex partitions
Discrete Applied Mathematics | 2013-04-25 | Paper |
The minimum bandwidth required at each time slot of the fast broadcasting scheme
Information Processing Letters | 2013-04-04 | Paper |
Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| A note on "Folding wheels and fans." | 2012-08-29 | Paper |
The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
The hub number of Sierpiński-like graphs
Theory of Computing Systems | 2011-11-30 | Paper |
A quadratic algorithm for finding next-to-shortest paths in graphs
Algorithmica | 2011-09-20 | Paper |
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science | 2011-09-12 | Paper |
Unique intersectability of diamond-free graphs
Discrete Applied Mathematics | 2011-05-17 | Paper |
3-list-coloring planar graphs of girth 4
Discrete Mathematics | 2011-02-18 | Paper |
Restricted power domination and fault-tolerant power domination on grids
Discrete Applied Mathematics | 2010-10-11 | Paper |
Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
Information Processing Letters | 2010-09-02 | Paper |
Errata for ``Faster index for property matching''
Information Processing Letters | 2010-08-20 | Paper |
A note on ``An improved upper bound on the queue number of the hypercube''
Information Processing Letters | 2010-06-09 | Paper |
Erratum to: ``A new upper bound on the queuenumber of hypercubes''
Discrete Mathematics | 2010-05-28 | Paper |
A new upper bound on the queuenumber of hypercubes
Discrete Mathematics | 2010-04-27 | Paper |
Edit distance for a run-length-encoded string and an uncompressed string
Information Processing Letters | 2010-03-24 | Paper |
CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2)
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
Graphs and Combinatorics | 2009-12-09 | Paper |
Feedback vertex sets in star graphs
Information Processing Letters | 2009-07-09 | Paper |
Global defensive alliances in star graphs
Discrete Applied Mathematics | 2009-06-24 | Paper |
On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
Theoretical Computer Science | 2009-05-28 | Paper |
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
Applied Mathematics and Computation | 2009-02-25 | Paper |
Sequence Alignment Algorithms for Run-Length-Encoded Strings
Lecture Notes in Computer Science | 2008-07-10 | Paper |
The existence and uniqueness of strong kings in tournaments
Discrete Mathematics | 2008-05-13 | Paper |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
Journal of Complexity | 2008-04-28 | Paper |
Geodesic-pancyclic graphs
Discrete Applied Mathematics | 2007-09-19 | Paper |
The lower and upper forcing geodetic numbers of block--cactus graphs
European Journal of Operational Research | 2006-10-25 | Paper |
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
Theoretical Computer Science | 2006-04-28 | Paper |
An efficient algorithm for estimating rotation distance between two binary trees
International Journal of Computer Mathematics | 2005-08-25 | Paper |
The incidence coloring numbers of meshes
Computers & Mathematics with Applications | 2005-06-01 | Paper |
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Networks | 2005-01-12 | Paper |
| scientific article; zbMATH DE number 2104107 (Why is no real title available?) | 2004-09-28 | Paper |
The tree longest detour problem in a biconnected graph.
European Journal of Operational Research | 2004-03-14 | Paper |
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
An efficient algorithm for solving the homogeneous set sandwich problem
Information Processing Letters | 2002-07-25 | Paper |
A linear-time algorithm for solving the center problem on weighted cactus graphs
Information Processing Letters | 2002-07-25 | Paper |
On the powers of graphs with bounded asteroidal number
Discrete Mathematics | 2001-10-03 | Paper |
An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
European Journal of Operational Research | 2000-08-30 | Paper |
On the bondage number of a graph
Discrete Mathematics | 1997-04-21 | Paper |
A linear time algorithm for finding all hinge vertices of a permutation graph
Information Processing Letters | 1997-02-27 | Paper |
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
Information Processing Letters | 1997-02-27 | Paper |
A new way of counting \(n^ m\)
Computers & Mathematics with Applications | 1996-02-01 | Paper |
A sweepline algorithm to solve the two-center problem
Information Processing Letters | 1994-04-05 | Paper |
A note on optimal multiway split trees
BIT | 1991-01-01 | Paper |
