| Publication | Date of Publication | Type |
|---|
The telephone \(k\)-multicast problem
Algorithmica | 2026-03-20 | Paper |
The Steiner path aggregation problem
Information Processing Letters | 2026-01-13 | Paper |
| The telephone \(k\)-multicast problem | 2025-10-06 | Paper |
| Timeliness through telephones: approximating information freshness in vector clock models | 2024-05-14 | Paper |
| Approximation algorithms for Steiner tree augmentation problems | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7759273 (Why is no real title available?) | 2023-11-02 | Paper |
Vertex downgrading to minimize connectivity
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
scientific article; zbMATH DE number 7650071 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
Lecture Notes in Computer Science | 2022-12-16 | Paper |
On small-depth tree augmentations
Operations Research Letters | 2022-12-12 | Paper |
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
Operations Research Letters | 2022-12-12 | Paper |
Service-constrained network design problems
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
Algorithmica | 2022-08-18 | Paper |
Combinatorial heuristics for inventory routing problems
INFORMS Journal on Computing | 2022-06-28 | Paper |
| Multicommodity Multicast, Wireless and Fast | 2022-05-11 | Paper |
A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs
Operations Research Letters | 2022-03-11 | Paper |
Approximation algorithm for the 2-stage stochastic matroid base problem
Operations Research Letters | 2022-03-11 | Paper |
A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms
SIAM Journal on Mathematics of Data Science | 2022-02-03 | Paper |
Two-level hub Steiner trees
Information Processing Letters | 2021-12-14 | Paper |
On the integrality gap of the prize-collecting Steiner forest LP
(available as arXiv preprint) | 2021-07-28 | Paper |
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
(available as arXiv preprint) | 2021-04-13 | Paper |
Local improvement algorithms for a path packing problem: a performance analysis based on linear programming
Operations Research Letters | 2021-04-07 | Paper |
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
Information Processing Letters | 2021-03-11 | Paper |
Shorter tours and longer detours: uniform covers and a bit beyond
Mathematical Programming. Series A. Series B | 2021-01-25 | Paper |
The approximability of multiple facility location on directed networks with random arc failures
Algorithmica | 2020-09-03 | Paper |
Single-sink fractionally subadditive network design
(available as arXiv preprint) | 2020-05-27 | Paper |
| Randomized contractions for multiobjective minimum cuts | 2020-05-27 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Plane gossip: approximating rumor spread in planar graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
Inventory Routing problem with facility location
(available as arXiv preprint) | 2020-01-16 | Paper |
Algorithms for automatic ranking of participants and tasks in an anonymized contest
Theoretical Computer Science | 2019-09-10 | Paper |
| scientific article; zbMATH DE number 7053373 (Why is no real title available?) | 2019-05-10 | Paper |
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SIAM Journal on Discrete Mathematics | 2019-03-12 | Paper |
Bicriteria network design problems
Lecture Notes in Computer Science | 2019-01-10 | Paper |
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Minimum makespan multi-vehicle dial-a-ride
ACM Transactions on Algorithms | 2018-10-30 | Paper |
LAST but not least: online spanners for buy-at-bulk
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Optimal circuits for parallel multipliers
IEEE Transactions on Computers | 2018-07-09 | Paper |
Improving spanning trees by upgrading nodes
Automata, Languages and Programming | 2018-07-04 | Paper |
Multiple facility location on a network with linear reliability order of edges
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
Approximation algorithms for optimal decision trees and adaptive TSP problems
Mathematics of Operations Research | 2017-09-22 | Paper |
| Designing Overlapping Networks for Publish-Subscribe Systems | 2017-08-31 | Paper |
| Rumors across radio, wireless, telephone | 2017-07-13 | Paper |
Algorithms for automatic ranking of participants and tasks in an anonymized contest
Lecture Notes in Computer Science | 2017-05-05 | Paper |
| Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem | 2017-03-22 | Paper |
| A \(\frac {9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs | 2017-03-22 | Paper |
Balls and funnels: energy efficient group-to-group anycasts
Lecture Notes in Computer Science | 2016-09-02 | Paper |
A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs
Discrete Applied Mathematics | 2016-06-21 | Paper |
The \(p\)-neighbor \(k\)-center problem
Information Processing Letters | 2016-06-09 | Paper |
Capacitated vehicle routing with nonuniform speeds
Mathematics of Operations Research | 2016-04-15 | Paper |
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
SIAM Journal on Computing | 2015-10-08 | Paper |
Graph-TSP from Steiner cycles
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Efficient cost-sharing mechanisms for prize-collecting problems
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
| Multicommodity facility location | 2015-08-03 | Paper |
Many birds with one stone
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
Mathematics of Operations Research | 2015-04-01 | Paper |
Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem | 2014-12-18 | Paper |
| Line-of-sight networks | 2014-12-18 | Paper |
Dial a ride from \(k\)-forest
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 2014-10-13 | Paper |
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Thresholded covering algorithms for robust and max-min optimization
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
New approaches to multi-objective optimization
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
The geometry of online packing linear programs
Mathematics of Operations Research | 2014-07-11 | Paper |
Sending secrets swiftly: approximation algorithms for generalized multicast problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Short Tours through Large Linear Forests
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| scientific article; zbMATH DE number 6297807 (Why is no real title available?) | 2014-05-22 | Paper |
Approximating max-min weighted \(T\)-joins
Operations Research Letters | 2014-05-14 | Paper |
Approximation algorithms for online weighted rank function maximization under matroid constraints
Automata, Languages, and Programming | 2013-08-12 | Paper |
Geometry of online packing linear programs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
Operations Research Letters | 2013-05-14 | Paper |
Online and Stochastic Survivable Network Design
SIAM Journal on Computing | 2013-03-19 | Paper |
| Iterative methods in combinatorial optimization | 2012-10-24 | Paper |
Solving the capacitated local access network design problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Approximation algorithms for distance constrained vehicle routing problems
Networks | 2012-06-18 | Paper |
Approximation algorithms for VRP with stochastic demands
Operations Research | 2012-06-18 | Paper |
A near Pareto optimal auction with budget constraints
Games and Economic Behavior | 2012-03-19 | Paper |
Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
Management Science | 2012-02-19 | Paper |
Sampling and cost-sharing: approximation algorithms for stochastic optimization problems
SIAM Journal on Computing | 2012-02-11 | Paper |
| Iterative methods in combinatorial optimization. | 2011-08-02 | Paper |
The directed orienteering problem
Algorithmica | 2011-07-01 | Paper |
Capacitated vehicle routing with non-uniform speeds
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Approximation algorithms for multicommodity facility location problems
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
An FPTAS for minimizing the product of two non-negative linear cost functions
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Game-Theoretic Models of Information Overload in Social Networks
Algorithms and Models for the Web-Graph | 2011-01-21 | Paper |
An improved approximation algorithm for requirement cut
Operations Research Letters | 2010-09-07 | Paper |
Thresholded Covering Algorithms for Robust and Max-min Optimization
Automata, Languages and Programming | 2010-09-07 | Paper |
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Automata, Languages and Programming | 2010-09-07 | Paper |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Boosted sampling
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
A PTAS for the chance-constrained knapsack problem with random item sizes
Operations Research Letters | 2010-06-08 | Paper |
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operations Research Letters | 2010-06-08 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Line-of-Sight Networks
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Approximation algorithms for requirement cut on graphs
Algorithmica | 2010-02-23 | Paper |
Iterative Rounding for Multi-Objective Optimization Problems
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Minimum makespan multi-vehicle dial-a-ride
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Approximation Algorithms for Problems Combining Facility Location and Network Design
Operations Research | 2009-08-13 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
A linear-time algorithm to compute a MAD tree of an interval graph
Information Processing Letters | 2009-07-09 | Paper |
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
Automata, Languages and Programming | 2009-03-12 | Paper |
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
Automata, Languages and Programming | 2009-03-12 | Paper |
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
The Directed Minimum Latency Problem
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Dial a Ride from k-Forest
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Pricing Tree Access Networks with Connected Backbones
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Matching Based Augmentations for Approximating Connectivity Problems
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
LP Rounding Approximation Algorithms for Stochastic Network Design
Mathematics of Operations Research | 2008-05-27 | Paper |
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
STACS 2006 | 2008-03-19 | Paper |
Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
European Journal of Operational Research | 2007-11-23 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
On Two-Stage Stochastic Minimum Spanning Trees
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Minimum Vehicle Routing with a Common Deadline
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Approximation algorithms for minimizing average distortion
Theory of Computing Systems | 2006-10-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
Hedging uncertainty: approximation algorithms for stochastic optimization problems
Mathematical Programming. Series A. Series B | 2006-06-28 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
SIAM Journal on Computing | 2005-09-16 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2185635 (Why is no real title available?) | 2005-07-04 | Paper |
Approximation algorithms for finding low-degree subgraphs
Networks | 2005-02-23 | Paper |
Min-max tree covers of graphs.
Operations Research Letters | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2119718 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119765 (Why is no real title available?) | 2004-11-29 | Paper |
Approximation algorithms for a capacitated network design problem
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086924 (Why is no real title available?) | 2004-08-11 | Paper |
Approximation algorithms for the test cover problem
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 | 2004-01-29 | Paper |
| scientific article; zbMATH DE number 1947429 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1875415 (Why is no real title available?) | 2003-03-02 | Paper |
Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
Algorithmica | 2002-12-01 | Paper |
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing | 2002-09-29 | Paper |
On approximating planar metrics by tree metrics.
Information Processing Letters | 2002-07-14 | Paper |
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1757956 (Why is no real title available?) | 2002-06-20 | Paper |
Exponential and input-output stability are equivalent for linear time-varying systems.
Sādhanā | 2002-02-18 | Paper |
| scientific article; zbMATH DE number 1670539 (Why is no real title available?) | 2002-01-13 | Paper |
Approximating the single-sink link-installation problem in network design
SIAM Journal on Optimization | 2001-03-19 | Paper |
Approximation algorithms for the multiple knapsack problem with assignment restrictions
Journal of Combinatorial Optimization | 2001-02-06 | Paper |
Approximation algorithms for degree-constrained minimum-cost network-design problems
Algorithmica | 2001-01-01 | Paper |
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
Journal of Algorithms | 2000-11-05 | Paper |
| scientific article; zbMATH DE number 1405806 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1487883 (Why is no real title available?) | 2000-08-10 | Paper |
| scientific article; zbMATH DE number 1263259 (Why is no real title available?) | 2000-08-03 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Theoretical Computer Science | 2000-06-04 | Paper |
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1405785 (Why is no real title available?) | 2000-02-23 | Paper |
A constant-factor approximation algorithm for the \(k\)-MST problem
Journal of Computer and System Sciences | 2000-02-17 | Paper |
| scientific article; zbMATH DE number 1303537 (Why is no real title available?) | 2000-02-09 | Paper |
Improving Minimum Cost Spanning Trees by Upgrading Nodes
Journal of Algorithms | 2000-02-06 | Paper |
Improving spanning trees by upgrading nodes
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1445321 (Why is no real title available?) | 2000-01-01 | Paper |
Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
Discrete Applied Mathematics | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1263279 (Why is no real title available?) | 1999-11-03 | Paper |
| scientific article; zbMATH DE number 1303564 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256763 (Why is no real title available?) | 1999-05-18 | Paper |
Approximation algorithms for certain network improvement problems
Journal of Combinatorial Optimization | 1999-03-28 | Paper |
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Journal of Algorithms | 1998-11-11 | Paper |
| scientific article; zbMATH DE number 1163718 (Why is no real title available?) | 1998-08-04 | Paper |
| scientific article; zbMATH DE number 1163719 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1002205 (Why is no real title available?) | 1997-11-12 | Paper |
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics | 1997-11-09 | Paper |
An approximation algorithm for minimum-cost vertex-connectivity problems
Algorithmica | 1997-10-09 | Paper |
| scientific article; zbMATH DE number 1003287 (Why is no real title available?) | 1997-08-04 | Paper |
| scientific article; zbMATH DE number 910919 (Why is no real title available?) | 1996-08-22 | Paper |
| scientific article; zbMATH DE number 910889 (Why is no real title available?) | 1996-08-22 | Paper |
Spanning Trees—Short or Small
SIAM Journal on Discrete Mathematics | 1996-07-24 | Paper |
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
Combinatorica | 1996-04-16 | Paper |
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
Journal of Algorithms | 1996-04-11 | Paper |
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
SIAM Journal on Computing | 1995-07-26 | Paper |
A primal-dual approximation algorithm for the Steiner forest problem
Information Processing Letters | 1994-06-15 | Paper |
| scientific article; zbMATH DE number 554763 (Why is no real title available?) | 1994-04-19 | Paper |
| scientific article; zbMATH DE number 176780 (Why is no real title available?) | 1993-05-18 | Paper |
Generalized vertex covering in interval graphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
An optimal algorithm to solve the all-pair shortest path problem on interval graphs
Networks | 1992-06-28 | Paper |
Bicriteria network design problems
Journal of Algorithms | 0001-01-03 | Paper |
