| Publication | Date of Publication | Type |
|---|
| The Outer-Paired Domination of Graphs | 2023-08-15 | Paper |
| A note on the geodetic number and the Steiner number of AT-free graphs | 2021-01-25 | Paper |
| The 2-rainbow bondage number in generalized Petersen graphs | 2019-09-10 | Paper |
| Geodetic Contraction Games on Trees | 2019-04-26 | Paper |
| A fast parallel algorithm for constructing independent spanning trees on parity cubes | 2019-03-18 | Paper |
| On retracts, absolute retracts, and foldings in cographs | 2018-05-28 | Paper |
| On complexities of minus domination | 2018-05-24 | Paper |
| Efficient absorbants in generalized de Bruijn digraphs | 2018-05-24 | Paper |
| On efficient absorbant conjecture in generalized De Bruijn digraphs | 2017-07-28 | Paper |
| Independent Spanning Trees on Multidimensional Torus Networks | 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 | 2017-07-12 | Paper |
| Construction independent spanning trees on locally twisted cubes in parallel | 2017-06-22 | Paper |
| A note on path embedding in crossed cubes with faulty vertices | 2017-02-21 | Paper |
| P_3-Games on Chordal Bipartite Graphs | 2016-10-22 | Paper |
| The connected \(p\)-median problem on block graphs | 2016-09-21 | Paper |
| A memory-efficient and fast Huffman decoding algorithm | 2016-06-16 | Paper |
| A linear time algorithm for finding depth-first spanning trees on trapezoid graphs | 2016-05-26 | Paper |
| The outer-connected domination number of Sierpiński-like graphs | 2016-03-09 | Paper |
| Edge-clique covers of the tensor product | 2015-12-08 | Paper |
| Corrigendum to: ``Incidence coloring of Cartesian product graphs | 2015-12-01 | Paper |
| Hamiltonian cycles in hypercubes with faulty edges | 2015-09-25 | Paper |
| Finding outer-connected dominating sets in interval graphs | 2015-09-15 | Paper |
| Resequencing a set of strings based on a target string | 2015-07-10 | Paper |
| Incidence coloring of Cartesian product graphs | 2015-06-15 | Paper |
| On maximum independent set of categorical product and ultimate categorical ratios of graphs | 2015-06-11 | Paper |
| Edge-Clique Covers of the Tensor Product | 2015-05-20 | Paper |
| On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs | 2015-02-13 | Paper |
| The hub number of co-comparability graphs | 2015-01-30 | Paper |
| Efficient twin domination in generalized de Bruijn digraphs | 2014-12-19 | Paper |
| Circuits of each length in tournaments | 2014-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5412227 | 2014-04-25 | Paper |
| A tight upper bound for 2-rainbow domination in generalized Petersen graphs | 2014-04-22 | Paper |
| On the complexity of the black-and-white coloring problem on some classes of perfect graphs | 2014-04-15 | Paper |
| On Perfect Absorbants in De Bruijn Digraphs | 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 | 2014-02-18 | Paper |
| Two spanning disjoint paths with required length in generalized hypercubes | 2014-01-16 | Paper |
| \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs | 2013-12-13 | Paper |
| On Complexities of Minus Domination | 2013-12-10 | Paper |
| On Retracts, Absolute Retracts, and Folds in Cographs | 2013-12-06 | Paper |
| Global strong defensive alliances of Sierpiński-like graphs | 2013-10-21 | Paper |
| Set Representations of Linegraphs | 2013-08-31 | Paper |
| On Independence Domination | 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 | 2013-04-25 | Paper |
| The minimum bandwidth required at each time slot of the fast broadcasting scheme | 2013-04-04 | Paper |
| Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs | 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 | 2012-07-16 | Paper |
| The hub number of Sierpiński-like graphs | 2011-11-30 | Paper |
| A quadratic algorithm for finding next-to-shortest paths in graphs | 2011-09-20 | Paper |
| Amortized efficiency of generating planar paths in convex position | 2011-09-12 | Paper |
| Unique intersectability of diamond-free graphs | 2011-05-17 | Paper |
| 3-list-coloring planar graphs of girth 4 | 2011-02-18 | Paper |
| Restricted power domination and fault-tolerant power domination on grids | 2010-10-11 | Paper |
| Upper bounds on the queue number of \(k\)-ary \(n\)-cubes | 2010-09-02 | Paper |
| Errata for ``Faster index for property matching | 2010-08-20 | Paper |
| A note on ``An improved upper bound on the queue number of the hypercube | 2010-06-09 | Paper |
| Erratum to ``A new upper bound on the queuenumber of hypercubes [Discrete Math. 310, No. 4, 935-939 (2010; Zbl 1231.05190)] | 2010-05-28 | Paper |
| A new upper bound on the queuenumber of hypercubes | 2010-04-27 | Paper |
| Edit distance for a run-length-encoded string and an uncompressed string | 2010-03-24 | Paper |
| CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2) | 2010-03-09 | Paper |
| The interchange graphs of tournaments with minimum score vectors are exactly hypercubes | 2009-12-09 | Paper |
| Feedback vertex sets in star graphs | 2009-07-09 | Paper |
| Global defensive alliances in star graphs | 2009-06-24 | Paper |
| On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) | 2009-05-28 | Paper |
| Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes | 2009-02-25 | Paper |
| Sequence Alignment Algorithms for Run-Length-Encoded Strings | 2008-07-10 | Paper |
| The existence and uniqueness of strong kings in tournaments | 2008-05-13 | Paper |
| Finding a longest common subsequence between a run-length-encoded string and an uncompressed string | 2008-04-28 | Paper |
| Geodesic-pancyclic graphs | 2007-09-19 | Paper |
| The lower and upper forcing geodetic numbers of block--cactus graphs | 2006-10-25 | Paper |
| A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations | 2006-04-28 | Paper |
| An efficient algorithm for estimating rotation distance between two binary trees | 2005-08-25 | Paper |
| The incidence coloring numbers of meshes | 2005-06-01 | Paper |
| Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs | 2005-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818472 | 2004-09-28 | Paper |
| The tree longest detour problem in a biconnected graph. | 2004-03-14 | Paper |
| Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. | 2003-08-07 | Paper |
| A linear-time algorithm for solving the center problem on weighted cactus graphs | 2002-07-25 | Paper |
| An efficient algorithm for solving the homogeneous set sandwich problem | 2002-07-25 | Paper |
| On the powers of graphs with bounded asteroidal number | 2001-10-03 | Paper |
| An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs | 2000-08-30 | Paper |
| On the bondage number of a graph | 1997-04-21 | Paper |
| A linear time algorithm for finding all hinge vertices of a permutation graph | 1997-02-27 | Paper |
| An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs | 1997-02-27 | Paper |
| A new way of counting \(n^ m\) | 1996-02-01 | Paper |
| A sweepline algorithm to solve the two-center problem | 1994-04-05 | Paper |
| A note on optimal multiway split trees | 1991-01-01 | Paper |
