| Publication | Date of Publication | Type |
|---|
The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space
Theoretical Computer Science | 2025-01-08 | Paper |
| Improved approximation algorithm for the distributed lower-bounded \(k\)-center problem | 2024-11-12 | Paper |
PTAS for minimum cost multicovering with disks
SIAM Journal on Computing | 2024-08-27 | Paper |
New algorithms for fair \(k\)-center problem with outliers and capacity constraints
Theoretical Computer Science | 2024-04-16 | Paper |
| The fair \(k\)-center with outliers problem: FPT and polynomial approximations | 2024-02-28 | Paper |
A 2.57-approximation algorithm for contig-based genomic scaffold filling
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Exponential time approximation scheme for TSP
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7788391 (Why is no real title available?) | 2024-01-15 | Paper |
| A unified framework of FPT approximation algorithms for clustering problems | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7650294 (Why is no real title available?) | 2023-02-03 | Paper |
| Small candidate set for translational pattern search | 2023-02-03 | Paper |
On parameterized approximation algorithms for balanced clustering
Journal of Combinatorial Optimization | 2023-01-17 | Paper |
Improved approximation algorithms for solving the squared metric \(k\)-facility location problem
Theoretical Computer Science | 2022-12-21 | Paper |
Small candidate set for translational pattern search
Algorithmica | 2022-10-06 | Paper |
| New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition | 2022-07-21 | Paper |
| An improved approximation algorithm for squared metric \(k\)-facility location | 2022-06-29 | Paper |
| Improved parameterized approximation for balanced \(k\)-median | 2022-06-29 | Paper |
An improved FPT algorithm for the flip distance problem
Information and Computation | 2021-11-25 | Paper |
A new approximation algorithm for contig-based genomic scaffold filling
Theoretical Computer Science | 2021-01-25 | Paper |
The complexity of tree partitioning
Algorithmica | 2020-09-03 | Paper |
| Parameterized algorithms for minimum tree cut/paste distance and minimum common integer partition | 2020-07-07 | Paper |
| Improved kernels for several problems on planar graphs | 2020-07-07 | Paper |
scientific article; zbMATH DE number 7204399 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
An improved kernel for max-bisection above tight lower bound
Theoretical Computer Science | 2020-04-07 | Paper |
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
Theoretical Computer Science | 2020-01-16 | Paper |
An approximation algorithm for the \(l\)-pseudoforest deletion problem
Theoretical Computer Science | 2020-01-16 | Paper |
New kernels for several problems on planar graphs
Theoretical Computer Science | 2020-01-16 | Paper |
| An improved approximation algorithm for the \(k\)-means problem with penalties | 2019-10-11 | Paper |
Improved PTAS for the constrained \(k\)-means problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Randomized parameterized algorithms for the kidney exchange problem
Algorithms | 2019-05-14 | Paper |
Parameterized Algorithms for Maximum Edge Biclique and Related Problems
Frontiers in Algorithmics | 2019-04-26 | Paper |
Improved Algorithms for Several Parameterized Problems Based on Random Methods
Frontiers in Algorithmics | 2019-04-26 | Paper |
| Constant factor approximation algorithm for \(l\)-pseudoforest deletion problem | 2018-10-04 | Paper |
A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Dealing with several parameterized problems by random methods
Theoretical Computer Science | 2018-06-05 | Paper |
Parameterized algorithms for edge biclique and related problems
Theoretical Computer Science | 2018-06-05 | Paper |
An improved FPT algorithm for almost forest deletion problem
Information Processing Letters | 2018-05-25 | Paper |
| Planar vertex-disjoint cycle packing: new structures and improved kernel | 2018-03-26 | Paper |
| A new kernel for parameterized Max-Bisection above tight lower bound | 2017-10-23 | Paper |
The complexity of tree partitioning
Lecture Notes in Computer Science | 2017-09-22 | Paper |
On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms
IEEE Transactions on Computers | 2017-06-20 | Paper |
Partition on trees with supply and demand: kernelization and algorithms
Theoretical Computer Science | 2017-02-06 | Paper |
Improved kernel results for some FPT problems based on simple observations
Theoretical Computer Science | 2017-02-06 | Paper |
Kernelization and randomized parameterized algorithms for co-path set problem
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
Theoretical Computer Science | 2015-12-08 | Paper |
Parameterized Minimum Cost Partition of a Tree with Supply and Demand
Frontiers in Algorithmics | 2015-11-12 | Paper |
Parameterized complexity of control and bribery for \(d\)-approval elections
Theoretical Computer Science | 2015-07-24 | Paper |
Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
Theoretical Computer Science | 2014-12-02 | Paper |
Algorithms for parameterized maximum agreement forest problem on multiple trees
Theoretical Computer Science | 2014-10-06 | Paper |
Approximation algorithms for maximum agreement forest on multiple trees
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Improved approximation algorithm for maximum agreement forest of two trees
Frontiers in Algorithmics | 2014-09-02 | Paper |
Randomized parameterized algorithms for co-path set problem
Frontiers in Algorithmics | 2014-09-02 | Paper |
On star-cover and path-cover of a tree
Frontiers in Algorithmics | 2014-09-02 | Paper |
Kernelization and Lower Bounds of the Signed Domination Problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Matching and weighted \(P_2\)-packing: algorithms and kernels
Theoretical Computer Science | 2014-01-24 | Paper |
Improved linear problem kernel for planar connected dominating set
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Theoretical Computer Science | 2013-12-19 | Paper |
Parameterized complexity of control and bribery for \(d\)-approval elections
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Random methods for parameterized problems
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Parameterized algorithms for maximum agreement forest on multiple trees
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Improved FPT Algorithms for Rectilinear k-Links Spanning Path
Lecture Notes in Computer Science | 2012-07-16 | Paper |
FPT results for signed domination
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Matching and \(P _{2}\)-packing: weighted versions
Lecture Notes in Computer Science | 2011-08-17 | Paper |
An improved kernel for planar connected dominating set
Lecture Notes in Computer Science | 2011-07-01 | Paper |
The min-power multicast problems in wireless ad hoc networks: a parameterized view
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science | 2011-05-18 | Paper |
An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science | 2011-04-05 | Paper |
An improved algorithm for weighted 3-set packing
Journal of Software | 2011-02-05 | Paper |
Kernelization techniques and its applications to parameterized computation
Journal of Software | 2010-11-05 | Paper |
An improved kernelization for \(P_{2}\)-packing
Information Processing Letters | 2010-09-07 | Paper |
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
Frontiers in Algorithmics | 2009-07-14 | Paper |
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Improved Parameterized Algorithms for Weighted 3-Set Packing
Lecture Notes in Computer Science | 2008-07-10 | Paper |
An Improved Parameterized Algorithm for a Generalized Matching Problem
Lecture Notes in Computer Science | 2008-05-27 | Paper |
An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
Lecture Notes in Computer Science | 2008-05-27 | Paper |
