| Publication | Date of Publication | Type |
|---|
| Distributed graph pattern matching via bounded dual simulation | 2024-03-27 | Paper |
| Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items | 2023-07-03 | Paper |
| Complexity of edge monitoring on some graph classes | 2022-09-15 | Paper |
| On the double total dominator chromatic number of graphs | 2022-09-02 | Paper |
| Labeled packing of cycles and circuits | 2022-03-22 | Paper |
| Packing three copies of a tree into its sixth power | 2021-11-10 | Paper |
| Eternal dominating sets on digraphs and orientations of graphs | 2021-03-25 | Paper |
| [1,2-Domination in generalized Petersen graphs] | 2019-11-07 | Paper |
| A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs | 2019-10-18 | Paper |
| The critical node detection problem in networks: a survey | 2018-05-18 | Paper |
| Graph grammars according to the type of input and manipulated data: a survey | 2018-05-18 | Paper |
| Labeled Packing of Cycles and Circuits | 2018-05-16 | Paper |
| A O(m) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs | 2017-12-15 | Paper |
| \((N, p)\)-equitable \(b\)-coloring of graphs | 2017-12-06 | Paper |
| A Vizing-like theorem for union vertex-distinguishing edge coloring | 2017-10-17 | Paper |
| Labeled embedding of \((n, n-2)\)-graphs in their complements | 2017-10-13 | Paper |
| On some domination colorings of graphs | 2017-08-22 | Paper |
| A self-stabilizing algorithm for edge monitoring in wireless sensor networks | 2017-05-12 | Paper |
| ON CIRCULAR DISARRANGED STRINGS OF SEQUENCES | 2017-03-10 | Paper |
| On the parameterized complexity of the edge monitoring problem | 2017-02-21 | Paper |
| Edge monitoring problem on interval graphs | 2017-02-13 | Paper |
| A distance measure for large graphs based on prime graphs | 2016-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816112 | 2016-07-01 | Paper |
| Component-cardinality-constrained critical node problem in graphs | 2016-06-22 | Paper |
| Subdivision into i-packings and S-packing chromatic number of some lattices | 2016-01-22 | Paper |
| Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs | 2015-12-11 | Paper |
| Decomposition of complete multigraphs into stars and cycles | 2015-11-17 | Paper |
| A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs | 2015-07-15 | Paper |
| Dominated colorings of graphs | 2015-05-22 | Paper |
| Saturated boundary \(k\)-alliances in graphs | 2015-04-28 | Paper |
| Labeled 2-packings of trees | 2015-01-30 | Paper |
| The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs | 2014-12-03 | Paper |
| Labeled embedding of (n,n-2)-graphs in their complements | 2014-10-31 | Paper |
| \([r,s,t\)-colorings of graph products] | 2014-09-19 | Paper |
| Self-stabilizing algorithms for minimal global powerful alliance sets in graphs | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419845 | 2014-06-11 | Paper |
| On the family of \(r\)-regular graphs with Grundy number \(r+1\) | 2014-05-06 | Paper |
| Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs | 2014-04-17 | Paper |
| Edge coloring total \(k\)-labeling of generalized Petersen graphs | 2014-04-11 | Paper |
| A survey on tree matching and XML retrieval | 2014-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2866609 | 2013-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2864442 | 2013-12-06 | Paper |
| Distance edge coloring and collision‐free communication in wireless sensor networks | 2013-08-06 | Paper |
| Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power | 2013-02-18 | Paper |
| Gap vertex-distinguishing edge colorings of graphs | 2012-10-16 | Paper |
| A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs | 2012-03-07 | Paper |
| New results about set colorings of graphs | 2010-12-16 | Paper |
| A strict strong coloring of trees | 2010-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565943 | 2010-06-07 | Paper |
| \([r,s,t\)-coloring of trees and bipartite graphs] | 2010-03-29 | Paper |
| A graph b-coloring framework for data clustering | 2009-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503334 | 2009-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387730 | 2008-05-27 | Paper |
| A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph | 2008-03-06 | Paper |
| Grundy number of graphs | 2008-02-22 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| On the packing of trees into their power | 2007-05-29 | Paper |
| Grundy coloring for power graphs | 2007-05-29 | Paper |
| Sum coloring of distance and circulant graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480704 | 2006-08-03 | Paper |
| The irregularity strength of circulant graphs | 2005-12-29 | Paper |
| Exact values for theb-chromatic number of a power completek-ary tree | 2005-05-23 | Paper |
| A note on the ``packing of two copies of some trees into their third power | 2004-06-11 | Paper |
| On the packing of two copies of a caterpillar in its third power | 2004-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4483922 | 2003-05-27 | Paper |
| A dual of 4-regular graph forG × C2n | 2003-01-01 | Paper |
| Remarks on Partially Square Graphs, Hamiltonicity and Circumference | 2002-10-09 | Paper |
| On the packing of three graphs | 2002-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487447 | 2001-08-27 | Paper |
| Packing two copies of a tree into its fourth power | 2001-03-07 | Paper |
