| Publication | Date of Publication | Type |
|---|
| A local search algorithm for radius-constrained \(k\)-median | 2024-11-12 | Paper |
Convergence and correctness of belief propagation for weighted min-max flow
Discrete Applied Mathematics | 2024-06-20 | Paper |
Disjunctive belief rule-based reasoning for decision making with incomplete information
Information Sciences | 2024-04-30 | Paper |
Submodular maximization over data streams with differential privacy noise
Theoretical Computer Science | 2023-01-30 | Paper |
Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
Theoretical Computer Science | 2023-01-04 | Paper |
| LP-based algorithms for computing maximum vertex-disjoint paths with different colors | 2022-12-22 | Paper |
| Parametric streaming two-stage submodular maximization | 2022-12-22 | Paper |
Improved local search algorithms for Bregman \(k\)-means and its variants
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Exact algorithms for finding constrained minimum spanning trees
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
The seeding algorithm for spherical \(k\)-means clustering with penalties
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement | 2022-07-01 | Paper |
| Efficient algorithms for scheduling parallel jobs with interval constraints in clouds | 2022-06-29 | Paper |
| Target coverage with minimum number of camera sensors | 2022-06-29 | Paper |
| Streaming submodular maximization under differential privacy noise | 2022-06-29 | Paper |
Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
Asia-Pacific Journal of Operational Research | 2022-02-01 | Paper |
Maximization problems of balancing submodular relevance and supermodular diversity
Journal of Global Optimization | 2022-01-24 | Paper |
On the complexity of algorithms for detecting \(k\)-length negative cost cycles
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms
Theoretical Computer Science | 2021-10-06 | Paper |
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
Algorithmic Aspects in Information and Management | 2021-07-05 | Paper |
Sequence submodular maximization meets streaming
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
| An improved Bregman \(k\)-means++ algorithm via local search | 2021-04-21 | Paper |
Parallelized maximization of nonsubmodular function subject to a cardinality constraint
Lecture Notes in Computer Science | 2021-04-21 | Paper |
Parallelized maximization of nonsubmodular function subject to a cardinality constraint
Theoretical Computer Science | 2021-04-08 | Paper |
Sequence submodular maximization meets streaming
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
| On the complexity of and algorithms for min-max target coverage on a line boundary | 2019-10-15 | Paper |
Efficient approximation algorithms for maximum coverage with group budget constraints
Theoretical Computer Science | 2019-08-09 | Paper |
| Exact algorithms for finding partial edge-disjoint paths | 2018-10-04 | Paper |
| Performance of multipath routing algorithms based on software defined networking paradigm | 2018-05-25 | Paper |
| Approximation algorithms for maximum coverage with group budget constraints | 2018-03-26 | Paper |
| On the complexity of detecting \(k\)-length negative cost cycles | 2018-02-26 | Paper |
| Fast approximation algorithms for computing constrained minimum spanning trees | 2018-02-26 | Paper |
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks
IEEE Transactions on Computers | 2017-07-12 | Paper |
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks
IEEE Transactions on Computers | 2017-07-12 | Paper |
Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Improved approximation algorithms for constrained fault-tolerant resource allocation
Theoretical Computer Science | 2015-06-10 | Paper |
Improved LP-rounding approximations for the \(k\)-disjoint restricted shortest paths problem
Frontiers in Algorithmics | 2014-09-02 | Paper |
Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)
Fundamentals of Computation Theory | 2013-08-16 | Paper |
On finding Min-Min disjoint paths
Algorithmica | 2013-06-25 | Paper |
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On the complexity of the edge-disjoint min-min problem in planar digraphs
Theoretical Computer Science | 2012-06-25 | Paper |
Hardness of finding two edge-disjoint Min-Min paths in digraphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
