| Publication | Date of Publication | Type |
|---|
| Doubly constrained fair clustering for general p-norms | 2026-01-28 | Paper |
| A short proof and experimental study of the approximation algorithm for label s-t cut | 2025-10-29 | Paper |
New algorithms for a simple measure of network partitioning
Lecture Notes in Computer Science | 2023-08-04 | Paper |
New approximation algorithms for the rooted budgeted cycle cover problem
Theoretical Computer Science | 2023-04-20 | Paper |
New approximation algorithms for the rooted budgeted cycle cover problem
Combinatorial Optimization and Applications | 2022-06-29 | Paper |
Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
Journal of Industrial and Management Optimization | 2021-09-10 | Paper |
Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph
Algorithmic Aspects in Information and Management | 2021-07-05 | Paper |
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
Minimum label \(s\)-\(t\) cut has large integrality gaps
Information and Computation | 2020-12-15 | Paper |
Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph
Theoretical Computer Science | 2020-12-15 | Paper |
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
(available as arXiv preprint) | 2020-11-25 | Paper |
The seeding algorithm for k-means problem with penalties
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Approximation algorithms for vertex happiness
Journal of the Operations Research Society of China | 2019-10-04 | Paper |
Local search approximation algorithms for the sum of squares facility location problems
Journal of Global Optimization | 2019-10-01 | Paper |
An approximation algorithm for genome sorting by reversals to recover all adjacencies
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Approximation and hardness results for the max \(k\)-uncut problem
Theoretical Computer Science | 2018-12-05 | Paper |
Computing and estimating the volume of the solution space of SMT(LA) constraints
Theoretical Computer Science | 2018-08-23 | Paper |
A local search approximation algorithm for a squared metric \(k\)-facility location problem
Journal of Combinatorial Optimization | 2018-05-24 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Algorithmica | 2018-05-18 | Paper |
| Complexity and approximation results for the min-sum and min-max disjoint paths problems | 2018-04-05 | Paper |
Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
Algorithmica | 2018-02-28 | Paper |
A local search approximation algorithm for a squared metric \(k\)-facility location problem
Combinatorial Optimization and Applications | 2018-02-26 | Paper |
Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
Journal of Global Optimization | 2018-02-09 | Paper |
Approximation and hardness results for the max \(k\)-uncut problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
The label cut problem with respect to path length and label frequency
Theoretical Computer Science | 2016-09-12 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
A new approximation algorithm for the unbalanced min s-t cut problem
Theoretical Computer Science | 2015-12-11 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Algorithmic aspects of homophyly of networks
Theoretical Computer Science | 2015-10-08 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Unbalanced graph cuts with minimum capacity
Frontiers of Computer Science | 2015-08-05 | Paper |
A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Efficient Algorithms for the Label Cut Problems
Lecture Notes in Computer Science | 2014-04-16 | Paper |
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Unbalanced graph partitioning
Theory of Computing Systems | 2013-10-21 | Paper |
On the generalized multiway cut in trees problem
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
On Editing Graphs into 2-Club Clusters
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Approximating minimum label s-t cut via linear programming
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
An approximation algorithm for the generalized k-multicut problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization | 2011-03-17 | Paper |
Unbalanced graph partitioning
Algorithms and Computation | 2010-12-09 | Paper |
Approximation and Hardness Results for Label Cut and Related Problems
Lecture Notes in Computer Science | 2009-06-03 | Paper |
An approximation algorithm to the \(k\)-Steiner forest problem
Theoretical Computer Science | 2009-03-20 | Paper |
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Approximating Generalized Multicut on Trees
Lecture Notes in Computer Science | 2007-11-13 | Paper |
An Approximation Algorithm to the k-Steiner Forest Problem
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Approximation to the Minimum Rooted Star Cover Problem
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A new approximation algorithm for the k-facility location problem
Theoretical Computer Science | 2007-09-28 | Paper |
Computational complexity of counting problems on 3-regular planar graphs
Theoretical Computer Science | 2007-09-28 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
A network flow approach to the minimum common integer partition problem
Theoretical Computer Science | 2007-01-09 | Paper |
