| Publication | Date of Publication | Type |
|---|
| Integrality gap of time-indexed linear programming relaxation for coflow scheduling | 2024-08-22 | Paper |
Approximation algorithm for the 2-stage stochastic matroid base problem
Operations Research Letters | 2022-03-11 | Paper |
Two-level hub Steiner trees
Information Processing Letters | 2021-12-14 | Paper |
| Approximation algorithms for a generalization of the maximum budget allocation | 2021-06-23 | Paper |
Submodular maximization with uncertain knapsack capacity
(available as arXiv preprint) | 2020-02-12 | Paper |
Computing a tree having a small vertex cover
Theoretical Computer Science | 2019-09-10 | Paper |
Submodular maximization with uncertain knapsack capacity
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
LP-based pivoting algorithm for higher-order correlation clustering
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
Algorithmica | 2019-01-11 | Paper |
Spider covers for prize-collecting network activation problem
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Computing minimum multiway cuts in hypergraphs
Discrete Optimization | 2018-10-18 | Paper |
Spider covering algorithms for network design problems
Combinatorial Optimization and Graph Algorithms | 2018-10-16 | Paper |
LP-based pivoting algorithm for higher-order correlation clustering
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Virtual machine placement for minimizing connection cost in data center networks
Discrete Optimization | 2018-05-24 | Paper |
Covering problems in edge- and node-weighted graphs
Discrete Optimization | 2018-05-24 | Paper |
Spider covers for prize-collecting network activation problem
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem | 2017-03-22 | Paper |
Computing a tree having a small vertex cover
Lecture Notes in Computer Science | 2017-02-01 | Paper |
| Approximating the generalized terminal backup problem via half-integral multiflow relaxation | 2017-01-24 | Paper |
Approximating the generalized terminal backup problem via half-integral multiflow relaxation
SIAM Journal on Discrete Mathematics | 2016-04-29 | Paper |
Approximating the generalized terminal backup problem via half-integral multiflow relaxation
SIAM Journal on Discrete Mathematics | 2016-04-29 | Paper |
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
SIAM Journal on Computing | 2015-10-08 | Paper |
Unranking of small combinations from large sets
Journal of Discrete Algorithms | 2014-11-24 | Paper |
Covering problems in edge- and node-weighted graphs
Lecture Notes in Computer Science | 2014-09-02 | Paper |
Approximating minimum cost source location problems with local vertex-connectivity demands
Journal of Discrete Algorithms | 2014-02-03 | Paper |
FPTASs for trimming weighted trees
Theoretical Computer Science | 2013-02-19 | Paper |
An approximation algorithm for locating maximal disks within convex polygons
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Graph orientations with set connectivity requirements
Discrete Mathematics | 2012-08-10 | Paper |
Network design with weighted degree constraints
Discrete Optimization | 2012-06-20 | Paper |
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
Algorithmica | 2012-04-26 | Paper |
All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
Graphs and Combinatorics | 2012-01-24 | Paper |
Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
Lecture Notes in Computer Science | 2011-07-01 | Paper |
| Survivable network design problems with weighted degree constraints | 2011-05-16 | Paper |
FPTAS’s for Some Cut Problems in Weighted Trees
Frontiers in Algorithmics | 2010-09-07 | Paper |
| scientific article; zbMATH DE number 5764868 (Why is no real title available?) | 2010-08-06 | Paper |
Computing minimum multiway cuts in hypergraphs from hypertree packings
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
Algorithms and Computation | 2009-12-17 | Paper |
Graph orientations with set connectivity requirements
Algorithms and Computation | 2009-12-17 | Paper |
Network design with edge-connectivity and degree constraints
Theory of Computing Systems | 2009-09-02 | Paper |
Eulerian detachments with local edge-connectivity
Discrete Applied Mathematics | 2009-06-30 | Paper |
Network Design with Weighted Degree Constraints
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
“Rent-or-Buy” Scheduling and Cost Coloring Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Network Design with Edge-Connectivity and Degree Constraints
Approximation and Online Algorithms | 2008-02-21 | Paper |
Generalizing the induced matching by edge capacity constraints
Discrete Optimization | 2008-01-18 | Paper |
The Set Connector Problem in Graphs
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Approximability of the capacitated \(b\)-edge dominating set problem
Theoretical Computer Science | 2007-10-18 | Paper |
Some Theorems on Detachments Preserving Local-Edge-Connectivity
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
