- Approximation Algorithms and Semidefinite Programming2012 | Faculty of Mathematics and Physics
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12018 | Faculty of Mathematics and Physics
- Approximation Algorithms and Lower Bounds for Graph Burning2023 | Faculty of Mathematics and Physics
- Adaptive approximation algorithm for relaxed optimization problems.2001 | Faculty of Mathematics and Physics
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View2020 | Faculty of Mathematics and Physics
- Fast approximation algorithm for the multislot just-in-time scheduling problem2003 | Faculty of Mathematics and Physics
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem2016 | Faculty of Mathematics and Physics
- Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios2022 | Faculty of Mathematics and Physics
- Two-bounded-space bin packing revisited2011 | Faculty of Mathematics and Physics
- Scheduling shared continuous resources on many-cores2018 | Faculty of Mathematics and Physics
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree2016 | Faculty of Mathematics and Physics
- Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing2013 | Faculty of Mathematics and Physics
- Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case2012 | Faculty of Mathematics and Physics
- Optimal analysis of Best Fit bin packing2014 | Faculty of Mathematics and Physics
- Online bin packing: Old algorithms and new results2014 | Faculty of Mathematics and Physics
- Constant factor approximations to edit distance on far input pairs in nearly linear time2020 | Faculty of Mathematics and Physics
- APPROXIMATING MINIMUM REPRESENTATIONS OF KEY HORN FUNCTIONS*2022 | Faculty of Mathematics and Physics
- Peeling Potatoes Near-Optimally in Near-Linear Time2014 | Faculty of Mathematics and Physics
- Polynomial time approximation schemes for clustering in low highway dimension graphs2021 | Faculty of Mathematics and Physics
- Approximation Guarantees for Shortest Superstrings: Simpler and Better2023 | Faculty of Mathematics and Physics
- A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms2020 | Faculty of Mathematics and Physics
- Three results on frequency assignment in linear cellular networks2010 | Faculty of Mathematics and Physics
- PEELING POTATOES NEAR-OPTIMALLY IN NEAR-LINEAR TIME2017 | Faculty of Mathematics and Physics
- On Algorithms Employing Treewidth for L-bounded Cut Problems2018 | Faculty of Mathematics and Physics
- Better approximation bounds for the joint replenishment problem2014 | Faculty of Mathematics and Physics
- Near-Optimal Separators in String Graphs2014 | Faculty of Mathematics and Physics
- Graph Burning and Non-uniform k-Centers for Small Treewidth2022 | Faculty of Mathematics and Physics
- Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses2011 | Faculty of Mathematics and Physics
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Faculty of Mathematics and Physics