| Publication | Date of Publication | Type |
|---|
The next‐to‐shortest path problem on directed graphs with positive edge weights
Networks | 2018-05-23 | Paper |
Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized algorithms for min-max 2-cluster editing
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
Lecture Notes in Computer Science | 2017-07-21 | Paper |
On the minimum routing cost clustered tree problem
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Approximation algorithms for the star \(k\)-hub center problem in metric graphs
Lecture Notes in Computer Science | 2016-09-02 | Paper |
An efficient algorithm for the length-constrained heaviest path problem on a tree
Information Processing Letters | 2016-06-16 | Paper |
Polynomial time algorithms for some minimum latency problems
Information Processing Letters | 2016-06-16 | Paper |
A measure and conquer approach for the parameterized bounded degree-one vertex deletion
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
Algorithmica | 2015-09-02 | Paper |
On the clustered Steiner tree problem
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
On approximating metric 1-median in sublinear time
Information Processing Letters | 2014-04-15 | Paper |
On the clustered Steiner tree problem
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
Journal of Combinatorial Optimization | 2013-12-02 | Paper |
A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Discrete Applied Mathematics | 2013-04-25 | Paper |
A simpler and more efficient algorithm for the next-to-shortest path problem
Algorithmica | 2013-03-05 | Paper |
Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
On the maximum disjoint paths problem on edge-colored graphs
Discrete Optimization | 2012-07-12 | Paper |
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
Journal of Computer and System Sciences | 2012-01-11 | Paper |
A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
Lecture Notes in Computer Science | 2011-11-11 | Paper |
On the maximum locally clustered subgraph and some related problems
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
A tight bound on the min-ratio edge-partitioning problem of a tree
Discrete Applied Mathematics | 2010-11-25 | Paper |
An optimal algorithm for the maximum-density path in a tree
Information Processing Letters | 2010-08-20 | Paper |
Exact algorithms for the minimum latency problem
Information Processing Letters | 2009-08-27 | Paper |
The backup 2‐center and backup 2‐median problems on trees
Networks | 2009-07-28 | Paper |
Minimum \(L_k\) path partitioning-an illustration of the Monge property
Operations Research Letters | 2008-05-29 | Paper |
The swap edges of a multiple-sources routing tree
Algorithmica | 2008-04-03 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
On the uniform edge-partition of a tree
Discrete Applied Mathematics | 2007-06-26 | Paper |
Tree edge decomposition with an application to minimum ultrametric tree approximation
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
On the intercluster distance of a tree metric
Theoretical Computer Science | 2007-01-09 | Paper |
Approximation algorithms for somek-source shortest paths spanning tree problems
Networks | 2006-06-06 | Paper |
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
Theoretical Computer Science | 2006-03-20 | Paper |
Constructing the maximum consensus tree from rooted Triples
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
Approximation algorithms for the optimal \(p\)-source communication spanning tree
Discrete Applied Mathematics | 2004-11-23 | Paper |
An improved algorithm for the \(k\)-source maximum eccentricity spanning trees
Discrete Applied Mathematics | 2004-11-23 | Paper |
Spanning Trees and Optimization Problems
| 2004-01-18 | Paper |
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
Journal of Algorithms | 2003-05-14 | Paper |
Light graphs with small routing cost
Networks | 2002-07-01 | Paper |
Approximation algorithms for the shortest total path length spanning tree problem
Discrete Applied Mathematics | 2001-02-27 | Paper |
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics | 2000-11-27 | Paper |
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Journal of Algorithms | 2000-08-27 | 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 1303537 (Why is no real title available?)
| 2000-02-09 | Paper |
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
Journal of Combinatorial Optimization | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1222844 (Why is no real title available?)
| 1999-03-30 | Paper |
