| Publication | Date of Publication | Type |
|---|
A sufficient condition for complete multipartite graphs to be of type 1
Discrete Mathematics | 2026-01-15 | Paper |
Algorithms and complexity of strongly stable non-crossing matchings
Discrete Applied Mathematics | 2025-12-11 | Paper |
Corrigendum to: ``On the complexity of co-secure dominating set problem
Information Processing Letters | 2025-10-23 | Paper |
On total chromatic number of complete multipartite graphs
Discrete Applied Mathematics | 2025-09-17 | Paper |
Hardness and approximation results for some variants of stable marriage problem
Discrete Applied Mathematics | 2025-09-17 | Paper |
Injective coloring of subclasses of chordal graphs
Theoretical Computer Science | 2024-12-12 | Paper |
Minimum maximal acyclic matching in proper interval graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
Injective edge coloring of some standard graph products
Discrete Mathematics, Algorithms and Applications | 2024-11-13 | Paper |
Total colorings of complete multipartite graphs using amalgamations
Discrete Applied Mathematics | 2024-11-06 | Paper |
On the complexity of minimum maximal acyclic matchings
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
Hardness results of connected power domination for bipartite graphs and chordal graphs
International Journal of Foundations of Computer Science | 2024-09-24 | Paper |
| On total chromatic number of complete multipartite graphs | 2024-05-31 | Paper |
On the complexity of co-secure dominating set problem
Information Processing Letters | 2024-03-13 | Paper |
Hardness results of global Roman domination in graphs
Discrete Applied Mathematics | 2023-11-13 | Paper |
Algorithms and complexity of strongly stable non-crossing matchings
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Minimum maximal acyclic matching in proper interval graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
On the complexity of minimum maximal acyclic matchings
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Complexity and algorithms for injective edge coloring of graphs
Theoretical Computer Science | 2023-07-21 | Paper |
Exact square coloring of graphs resulting from some graph operations and products
AKCE International Journal of Graphs and Combinatorics | 2023-06-01 | Paper |
Hardness and approximation results for some variants of stable marriage problem
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
| Hardness and approximation results of Roman \{3\}-domination in graphs | 2023-03-30 | Paper |
On the complexity of minimum maximal uniquely restricted matching
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
Acyclic matching in some subclasses of graphs
Theoretical Computer Science | 2023-01-05 | Paper |
Acyclic Matching in Some Subclasses of Graphs
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Exact square coloring of certain classes of graphs: complexity and algorithms
Theoretical Computer Science | 2022-09-16 | Paper |
Adjacent vertex distinguishing total coloring in split graphs
Discrete Mathematics | 2022-08-24 | Paper |
Hardness results of global total \(k\)-domination problem in graphs
Discrete Applied Mathematics | 2022-08-04 | Paper |
| Hardness results of connected power domination for bipartite graphs and chordal graphs | 2022-06-29 | Paper |
| Hardness results of global Roman domination in graphs | 2022-03-24 | Paper |
Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
Theoretical Computer Science | 2022-02-21 | Paper |
Dominating induced matching in some subclasses of bipartite graphs
Theoretical Computer Science | 2021-09-06 | Paper |
On the total and AVD-total coloring of graphs
AKCE International Journal of Graphs and Combinatorics | 2021-09-01 | Paper |
On the complexity of minimum maximal uniquely restricted matching
Theoretical Computer Science | 2021-08-11 | Paper |
Maximum weight induced matching in some subclasses of bipartite graphs
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
Injective coloring of some subclasses of bipartite graphs and chordal graphs
Discrete Applied Mathematics | 2021-03-25 | Paper |
Global total \(k\)-domination: approximation and hardness results
Theoretical Computer Science | 2020-12-16 | Paper |
Grundy coloring in some subclasses of bipartite graphs and their complements
Information Processing Letters | 2020-10-07 | Paper |
Hardness results of global total \(k\)-domination problem in graphs
Algorithms and Discrete Applied Mathematics | 2020-07-21 | Paper |
On partial Grundy coloring of bipartite graphs and chordal graphs
Discrete Applied Mathematics | 2019-11-27 | Paper |
Dominating induced matching in some subclasses of bipartite graphs
Algorithms and Discrete Applied Mathematics | 2019-10-10 | Paper |
Domination in some subclasses of bipartite graphs
Discrete Applied Mathematics | 2018-12-10 | Paper |
| Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three | 2018-11-22 | Paper |
Algorithmic aspects of \(b\)-disjunctive domination in graphs
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
| Restrained domination in some subclasses of chordal graphs | 2018-04-10 | Paper |
| On the complexity of minimum cardinality maximal uniquely restricted matching in graphs | 2017-12-01 | Paper |
| Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs | 2017-12-01 | Paper |
Induced Matching in Some Subclasses of Bipartite Graphs
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Algorithmic aspects of open neighborhood location-domination in graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Strong minimum energy hierarchical topology in wireless sensor networks
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
\(L(2,1)\)-labeling of block graphs.
Ars Combinatoria | 2016-05-04 | Paper |
Total-colorings of complete multipartite graphs using amalgamations
Discrete Mathematics | 2016-04-07 | Paper |
B-disjunctive total domination in graphs: algorithm and hardness results
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
On the dominator coloring in proper interval graphs and block graphs
Discrete Mathematics, Algorithms and Applications | 2016-02-22 | Paper |
Complexity of total outer-connected domination problem in graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks
Journal of Combinatorial Optimization | 2015-11-03 | Paper |
Algorithmic aspects of disjunctive domination in graphs
Lecture Notes in Computer Science | 2015-10-29 | Paper |
| scientific article; zbMATH DE number 6470870 (Why is no real title available?) | 2015-08-05 | Paper |
Domination in some subclasses of bipartite graphs
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Separator theorems for interval graphs and proper interval graphs
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Hardness results and approximation algorithm for total liar's domination in graphs
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
A linear time algorithm for liar's domination problem in proper interval graphs
Information Processing Letters | 2014-04-14 | Paper |
Algorithm and hardness results for outer-connected dominating set in graphs
Algorithms and Computation | 2014-02-18 | Paper |
Connected liar's domination in graphs: complexity and algorithms
Discrete Mathematics, Algorithms and Applications | 2014-01-28 | Paper |
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks
IET Communications | 2013-10-18 | Paper |
Liar's domination in graphs: complexity and algorithm
Discrete Applied Mathematics | 2013-04-25 | Paper |
\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
Information Processing Letters | 2012-07-25 | Paper |
\(L(2,1)\)-labeling of perfect elimination bipartite graphs
Discrete Applied Mathematics | 2011-10-27 | Paper |
| \(L(2,1)\)-labeling of graphs: known results and open problems | 2011-10-05 | Paper |
Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
Discrete Applied Mathematics | 2010-11-25 | Paper |
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
Information Processing Letters | 2010-08-20 | Paper |
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Discrete Applied Mathematics | 2009-06-24 | Paper |
A linear time recognition algorithm for proper interval graphs
Information Processing Letters | 2009-04-28 | Paper |
On tree 3‐spanners in directed path graphs
Networks | 2008-01-07 | Paper |
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees
Journal of Parallel and Distributed Computing | 2005-08-01 | Paper |
| scientific article; zbMATH DE number 2080870 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1955841 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1953157 (Why is no real title available?) | 2003-07-25 | Paper |
The separator theorem for rooted directed vertex graphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
The forbidden subgraph characterization of directed vertex graphs
Discrete Mathematics | 2000-01-09 | Paper |
| scientific article; zbMATH DE number 1295365 (Why is no real title available?) | 1999-11-10 | Paper |
New linear time algorithms for generating perfect elimination orderings of chordal graphs
Information Processing Letters | 1997-02-27 | Paper |
Intersection graphs of vertex disjoint paths in a tree
Discrete Mathematics | 1996-04-23 | Paper |
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
Information Processing Letters | 1994-04-05 | Paper |
