| Publication | Date of Publication | Type |
|---|
Designing multi-commodity flow trees
Lecture Notes in Computer Science | 2023-01-18 | Paper |
A network-flow technique for finding low-weight bounded-degree spanning trees
Lecture Notes in Computer Science | 2019-01-11 | Paper |
Low degree spanning trees of small weight
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Survivable network design: the capacitated minimum spanning network problem
Information Processing Letters | 2009-07-21 | Paper |
Degree-bounded minimum spanning trees
Discrete Applied Mathematics | 2009-06-30 | Paper |
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Journal of Discrete Algorithms | 2009-06-24 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Approximating the \(k\)-traveling repairman problem with repair times
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Approximation algorithms for finding low-degree subgraphs
Networks | 2005-02-23 | Paper |
scientific article; zbMATH DE number 2081108 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079404 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 1775420 (Why is no real title available?)
| 2002-08-01 | Paper |
Algorithms for capacitated vehicle routing
SIAM Journal on Computing | 2002-04-23 | Paper |
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
Algorithmica | 2000-11-14 | Paper |
scientific article; zbMATH DE number 1263175 (Why is no real title available?)
| 2000-08-03 | Paper |
scientific article; zbMATH DE number 1302021 (Why is no real title available?)
| 2000-01-18 | Paper |
A 3/2-Approximation Algorithm for the Mixed Postman Problem
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
scientific article; zbMATH DE number 1305527 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1305467 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1300955 (Why is no real title available?)
| 1999-06-16 | Paper |
scientific article; zbMATH DE number 1187150 (Why is no real title available?)
| 1998-08-10 | Paper |
The e-mail gossip number and the connected domination number
Applied Mathematics Letters | 1998-03-16 | Paper |
scientific article; zbMATH DE number 1003248 (Why is no real title available?)
| 1997-08-03 | Paper |
Landmarks in graphs
Discrete Applied Mathematics | 1997-07-07 | Paper |
On strongly connected digraphs with bounded cycle length
Discrete Applied Mathematics | 1997-04-07 | Paper |
Low-Degree Spanning Trees of Small Weight
SIAM Journal on Computing | 1996-11-03 | Paper |
Improved Approximation Algorithms for Uniform Connectivity Problems
Journal of Algorithms | 1996-10-16 | Paper |
Balancing minimum spanning trees and shortest-path trees
Algorithmica | 1996-03-11 | Paper |
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
Journal of Algorithms | 1995-11-22 | Paper |
Approximating the Minimum Equivalent Digraph
SIAM Journal on Computing | 1995-11-01 | Paper |
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
Journal of Algorithms | 1995-08-20 | Paper |
scientific article; zbMATH DE number 742978 (Why is no real title available?)
| 1995-04-11 | Paper |
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
Designing multi-commodity flow trees
Information Processing Letters | 1994-05-03 | Paper |
scientific article; zbMATH DE number 437549 (Why is no real title available?)
| 1994-01-02 | Paper |
scientific article; zbMATH DE number 176753 (Why is no real title available?)
| 1993-05-18 | Paper |
A network-flow technique for finding low-weight bounded-degree spanning trees
Journal of Algorithms | 0001-01-03 | Paper |
