| Publication | Date of Publication | Type |
|---|
Total \(\{k\}\)-domination in special graphs
Mathematical Foundations of Computing | 2022-03-07 | Paper |
Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs
IEEE Transactions on Signal Processing | 2019-02-12 | Paper |
Complexity of connectivity in cognitive radio networks through spectrum assignment
Lecture Notes in Computer Science | 2016-12-19 | Paper |
Signed and minus domination in complete multipartite graphs.
Ars Combinatoria | 2016-10-26 | Paper |
Matroid and knapsack center problems
Algorithmica | 2016-06-28 | Paper |
Computing Roman domatic number of graphs
Information Processing Letters | 2016-05-18 | Paper |
Average-case complexity of the min-sum matrix product problem
Theoretical Computer Science | 2015-12-08 | Paper |
Optimal algorithms for running max and min filters on random inputs
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Average-case complexity of the min-sum matrix product problem
Algorithms and Computation | 2015-09-11 | Paper |
On the complexity of connectivity in cognitive radio networks through spectrum assignment
Journal of Combinatorial Optimization | 2015-02-16 | Paper |
On the signed (total) \(k\)-domination number of a graph
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2014-08-12 | Paper |
Some sharp bounds on the negative decision number of graphs
Discussiones Mathematicae Graph Theory | 2014-07-30 | Paper |
On the \(k\)-edge-incident subgraph problem and its variants
Discrete Applied Mathematics | 2014-04-23 | Paper |
Optimal collapsing protocol for multiparty pointer jumping
Theory of Computing Systems | 2014-03-25 | Paper |
| scientific article; zbMATH DE number 6269006 (Why is no real title available?) | 2014-03-12 | Paper |
Satisfiability with index dependency
Journal of Computer Science and Technology | 2014-02-11 | Paper |
Extracting the Core Structure of Social Networks Using (α, β)-Communities
Internet Mathematics | 2013-06-28 | Paper |
The hardness and approximation of the star \(p\)-hub center problem
Operations Research Letters | 2013-05-14 | Paper |
Improved approximation for spanning star forest in dense graphs
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Matroid and knapsack center problems
Lecture Notes in Computer Science | 2013-03-19 | Paper |
The algorithmic complexity of \(k\)-domatic partition of graphs
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Computational complexity of the negative decision number of graphs
The Australasian Journal of Combinatorics | 2012-09-05 | Paper |
On rainbow-\(k\)-connectivity of random graphs
Information Processing Letters | 2012-07-20 | Paper |
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Reversing longest previous factor tables is hard
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Detecting the Structure of Social Networks Using (α,β)-Communities
Lecture Notes in Computer Science | 2011-06-08 | Paper |
Complexity of Total {k}-Domination and Related Problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
On variants of the spanning star forest problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
An improved approximation algorithm for spanning star forest in dense graphs
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Satisfiability with index dependency
Algorithms and Computation | 2010-12-09 | Paper |
Limiting negations in bounded treewidth and upward planar circuits
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
