| Publication | Date of Publication | Type |
|---|
| Relative survivable network design | 2024-08-22 | Paper |
| Improved approximations for relative survivable network design | 2024-07-19 | Paper |
| On approximating degree-bounded network design problems | 2023-10-31 | Paper |
Generating sparse 2—spanners
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Bounded Degree Group Steiner Tree Problems
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Approximating activation edge-cover and facility location problems
Theoretical Computer Science | 2022-08-25 | Paper |
| scientific article; zbMATH DE number 7561664 (Why is no real title available?) | 2022-07-21 | Paper |
On approximating degree-bounded network design problems
Algorithmica | 2022-05-03 | Paper |
Tight bounds on subexponential time approximation of set cover and related problems
(available as arXiv preprint) | 2022-03-22 | Paper |
The minimum degree group Steiner problem
Discrete Applied Mathematics | 2022-01-13 | Paper |
Network design under general wireless interference
Algorithmica | 2021-11-19 | Paper |
Spanning trees with edge conflicts and wireless connectivity
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximating spanners and directed Steiner forest. Upper and lower bounds
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Radio aggregation scheduling
Theoretical Computer Science | 2020-09-17 | Paper |
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
SIAM Journal on Computing | 2020-08-18 | Paper |
Approximation algorithms for connected maximum cut and related problems
Theoretical Computer Science | 2020-03-12 | Paper |
Improved approximation algorithms for minimum power covering problems
Theoretical Computer Science | 2019-10-18 | Paper |
Matroid secretary for regular and decomposable matroids
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Improved approximating algorithms for directed Steiner forest | 2019-05-06 | Paper |
Improved approximation algorithms for minimum power covering problems
Approximation and Online Algorithms | 2019-01-15 | Paper |
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Approximation algorithms for movement repairmen
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
ACM Transactions on Algorithms | 2018-10-30 | Paper |
A simplified \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms | 2018-10-30 | Paper |
The densest \(k\)-subhypergraph problem
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Approximating spanners and directed Steiner forest: upper and lower bounds
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The minimum color sum of bipartite graphs
Automata, Languages and Programming | 2018-07-04 | Paper |
A bounded-risk mechanism for the kidney exchange game
Discrete Applied Mathematics | 2018-05-24 | Paper |
| LP-relaxations for tree augmentation | 2018-04-19 | Paper |
The densest \(k\)-subhypergraph problem
(available as arXiv preprint) | 2018-04-19 | Paper |
LP-relaxations for tree augmentation
Discrete Applied Mathematics | 2018-03-21 | Paper |
| Bicovering: covering edges with two small subsets of vertices | 2017-12-19 | Paper |
Bi-covering: covering edges with two small subsets of vertices
SIAM Journal on Discrete Mathematics | 2017-12-11 | Paper |
On maximum leaf trees and connections to connected maximum cut problems
Information Processing Letters | 2017-10-18 | Paper |
Approximating source location and star survivable network problems
Theoretical Computer Science | 2017-05-12 | Paper |
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
Algorithmica | 2017-05-02 | Paper |
| Improved approximation algorithm for Steiner \(k\)-Forest with nearly uniform weights | 2017-03-22 | Paper |
Approximating source location and star survivable network problems
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
A Bounded-Risk Mechanism for the Kidney Exchange Game
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
On fixed cost \(k\)-flow problems
Theory of Computing Systems | 2016-03-21 | Paper |
Approximation algorithms for connected maximum cut and related problems
Lecture Notes in Computer Science | 2015-11-19 | Paper |
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
Parameterized and Exact Computation | 2015-09-15 | Paper |
On Set Expansion Problems and the Small Set Expansion Conjecture
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
An improved algorithm for radio broadcast
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On set expansion problems and the small set expansion conjecture
Discrete Applied Mathematics | 2015-09-01 | Paper |
| scientific article; zbMATH DE number 6472583 (Why is no real title available?) | 2015-08-14 | Paper |
Matroid secretary for regular and decomposable matroids
SIAM Journal on Computing | 2015-02-09 | Paper |
On a local protocol for concurrent file transfers
Theory of Computing Systems | 2015-01-19 | Paper |
| Approximation algorithms for node-weighted buy-at-bulk network design | 2014-12-18 | Paper |
Corrigendum: ``Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Prize-collecting steiner network problems
ACM Transactions on Algorithms | 2014-12-05 | Paper |
On the advantage of overlapping clusters for minimizing conductance
Algorithmica | 2014-11-19 | Paper |
| Improved schedule for radio broadcast | 2014-10-13 | Paper |
| Complete partitions of graphs | 2014-10-13 | Paper |
Approximating the domatic number
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On fixed cost \(k\)-flow problems
Approximation and Online Algorithms | 2014-09-02 | Paper |
Steiner forest orientation problems
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Fixed-Parameter and Approximation Algorithms: A New Look
Parameterized and Exact Computation | 2013-12-10 | Paper |
Approximation algorithms for movement repairmen
Lecture Notes in Computer Science | 2013-10-04 | Paper |
Label cover instances with large girth and the hardness of approximating basic \(k\)-spanner
Automata, Languages, and Programming | 2013-08-12 | Paper |
On some network design problems with degree constraints
Journal of Computer and System Sciences | 2013-07-24 | Paper |
A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
Information Processing Letters | 2013-04-04 | Paper |
Two-stage robust network design with exponential scenarios
Algorithmica | 2013-03-05 | Paper |
Local search algorithms for the red-blue median problem
Algorithmica | 2012-12-06 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-10-24 | Paper |
The checkpoint problem
Theoretical Computer Science | 2012-10-11 | Paper |
Steiner forest orientation problems
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Advantage of Overlapping Clusters for Minimizing Conductance
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Improved approximation algorithms for directed Steiner forest
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science | 2012-03-13 | Paper |
Approximating some network design problems with node costs
Theoretical Computer Science | 2011-09-12 | Paper |
Network-design with degree constraints
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Approximating minimum-power degree and connectivity problems
Algorithmica | 2011-07-01 | Paper |
Approximating maximum subgraphs without short cycles
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Approximation algorithms for nonuniform buy-at-bulk network design
SIAM Journal on Computing | 2010-11-04 | Paper |
The checkpoint problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Budgeted red-blue median and its generalizations
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Approximation algorithm for \(k\)-node connected subgraphs via critical graphs
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Prize-collecting Steiner network problems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
The minimum shift design problem: theory and practice
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Approximating the achromatic number problem on bipartite graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Approximating Some Network Design Problems with Node Costs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Approximating minimum-power edge-covers and 2,3-connectivity
Discrete Applied Mathematics | 2009-06-24 | Paper |
A note on two source location problems
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
Algorithmica | 2009-05-13 | Paper |
Tight Approximation Algorithm for Connectivity Augmentation Problems
Automata, Languages and Programming | 2009-03-12 | Paper |
Asymmetric k -center is log * n -hard to approximate
Journal of the ACM | 2008-12-21 | Paper |
Approximating Maximum Subgraphs without Short Cycles
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Two-Stage Robust Network Design with Exponential Scenarios
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Complete partitions of graphs
Combinatorica | 2008-10-21 | Paper |
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Min Sum Edge Coloring in Multigraphs Via Configuration LP
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
| A lower bound for approximating the Grundy number | 2008-05-27 | Paper |
An Improved Approximation of the Achromatic Number on Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
Approximating Minimum-Power Degree and Connectivity Problems
Lecture Notes in Computer Science | 2008-04-15 | Paper |
The minimum shift design problem
Annals of Operations Research | 2008-01-25 | Paper |
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
SIAM Journal on Computing | 2007-10-22 | Paper |
Power Optimization for Connectivity Problems
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Power optimization for connectivity problems
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Approximating the minimal sensor selection for supervisory control
Discrete Event Dynamic Systems | 2006-11-17 | Paper |
An approximation algorithm for the directed telephone multicast problem
Algorithmica | 2006-09-26 | Paper |
Sublogarithmic approximation for telephone multicast
Journal of Computer and System Sciences | 2006-06-30 | Paper |
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
SIAM Journal on Computing | 2006-06-01 | Paper |
Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics | 2006-01-10 | Paper |
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximating k-node Connected Subgraphs via Critical Graphs
SIAM Journal on Computing | 2005-10-28 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Greedy approximation algorithms for directed multicuts
Networks | 2005-08-05 | Paper |
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119643 (Why is no real title available?) | 2004-11-29 | Paper |
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms | 2004-11-23 | Paper |
Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
Algorithmica | 2004-09-22 | Paper |
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2079350 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079323 (Why is no real title available?) | 2004-07-28 | Paper |
Approximating node connectivity problems via set covers
Algorithmica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2038712 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2038708 (Why is no real title available?) | 2004-02-08 | Paper |
Multicoloring trees.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1947057 (Why is no real title available?) | 2003-07-07 | Paper |
Approximating theDomatic Number
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1833404 (Why is no real title available?) | 2002-11-21 | Paper |
| scientific article; zbMATH DE number 1833406 (Why is no real title available?) | 2002-11-21 | Paper |
A matched approximation bound for the sum of a greedy coloring
Information Processing Letters | 2002-07-25 | Paper |
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
Journal of Algorithms | 2002-07-11 | Paper |
| scientific article; zbMATH DE number 1696535 (Why is no real title available?) | 2002-07-09 | Paper |
| On approximating the achromatic number (preliminary version) | 2002-03-14 | Paper |
On the hardness of approximating spanners
Algorithmica | 2002-02-19 | Paper |
| scientific article; zbMATH DE number 1670542 (Why is no real title available?) | 2001-11-11 | Paper |
On approximating the achromatic number
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
The dense \(k\)-subgraph problem
Algorithmica | 2001-04-17 | Paper |
Sum Multicoloring of Graphs
Journal of Algorithms | 2000-12-19 | Paper |
Generalized submodular cover problems and applications
Theoretical Computer Science | 2000-12-12 | Paper |
Minimum Color Sum of Bipartite Graphs
Journal of Algorithms | 2000-05-18 | Paper |
| scientific article; zbMATH DE number 1418267 (Why is no real title available?) | 2000-03-19 | Paper |
Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics | 2000-02-07 | Paper |
| scientific article; zbMATH DE number 1182768 (Why is no real title available?) | 1998-10-25 | Paper |
Generating Low-Degree 2-Spanners
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1003288 (Why is no real title available?) | 1997-08-03 | Paper |
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics | 1996-01-10 | Paper |
Generating Sparse 2-Spanners
Journal of Algorithms | 1995-11-22 | Paper |
Traffic-light scheduling on the grid
Discrete Applied Mathematics | 1994-12-11 | Paper |
How to Allocate Network Centers
Journal of Algorithms | 1994-03-22 | Paper |
