| Publication | Date of Publication | Type |
|---|
High-order compact difference method for simulating the nonlinear extended Fisher-Kolmogorov model
Wave Motion | 2026-08-25 | Paper |
Numerical investigation of the nonlinear convection diffusion equation with a general capacity term
Advances in Applied Mathematics and Mechanics | 2026-07-07 | Paper |
Minimum maximal matchings in phenylene chains
MATCH - Communications in Mathematical and in Computer Chemistry | 2026-04-23 | Paper |
GES-TSP: Graph Edge Sparsification for TSP
(available as arXiv preprint) | 2026-01-01 | Paper |
Dual-GNN Multilevel Coarsening for Maximum Independent Set
(available as arXiv preprint) | 2026-01-01 | Paper |
On anti-Kekulé and s-restricted matching preclusion problems
Journal of Combinatorial Optimization | 2023-05-05 | Paper |
Partial inverse maximum spanning tree problem under the Chebyshev norm
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
| Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm | 2022-06-29 | Paper |
| Independent perfect domination sets in semi-Cayley graphs | 2021-07-05 | Paper |
The complexity of total edge domination and some related results on trees
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
Complexity and characterization aspects of edge-related domination for graphs
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
Independent perfect dominating sets in semi-Cayley graphs
Theoretical Computer Science | 2021-04-08 | Paper |
Approximation algorithm for minimum connected 3-path vertex cover
Discrete Applied Mathematics | 2020-10-14 | Paper |
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Journal of Global Optimization | 2020-05-04 | Paper |
Algorithm for online 3-path vertex cover
Theory of Computing Systems | 2020-02-27 | Paper |
Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
Journal of Combinatorial Optimization | 2019-12-13 | Paper |
Online hole healing for sensor coverage
Journal of Global Optimization | 2019-12-03 | Paper |
Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm
Journal of Global Optimization | 2018-03-13 | Paper |
Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Moplex orderings generated by the LexDFs algorithm
Discrete Applied Mathematics | 2014-04-22 | Paper |
Matching preclusion for balanced hypercubes
Theoretical Computer Science | 2013-01-07 | Paper |
An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas
Optimization Letters | 2012-12-28 | Paper |
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Theoretical Computer Science | 2011-01-28 | Paper |
Approximations for node-weighted Steiner tree in unit disk graphs
Optimization Letters | 2010-10-04 | Paper |
Embedding on alphabet overlap digraphs
Journal of Mathematical Chemistry | 2010-03-02 | Paper |
Node-weighted Steiner tree approximation in unit disk graphs
Journal of Combinatorial Optimization | 2010-02-24 | Paper |
A better constant-factor approximation for selected-internal Steiner minimum tree
Algorithmica | 2010-02-23 | Paper |
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
Discrete Mathematics, Algorithms and Applications | 2009-06-23 | Paper |
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Characterizations for some types of DNA graphs
Journal of Mathematical Chemistry | 2007-10-12 | Paper |
