The following pages link to Goran Konjevod (Q222489):
Displaying 40 items.
- Budget constrained minimum cost connected medians (Q876728) (← links)
- (Q1603385) (redirect page) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Improved approximations for tour and tree covers (Q1879245) (← links)
- On the establishment of distinct identities in overlay networks (Q1954205) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Coloring number and on-line Ramsey theory for graphs and hypergraphs (Q2149488) (← links)
- Robust optimization of contaminant sensor placement for community water systems (Q2492697) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- (Q2753739) (← links)
- (Q2753930) (← links)
- (Q2766688) (← links)
- Compacting cuts (Q2930250) (← links)
- (Q2934581) (← links)
- (Q2934685) (← links)
- (Q3044346) (← links)
- Engineering Label-Constrained Shortest-Path Algorithms (Q3511412) (← links)
- On Sampling in Higher-Dimensional Peer-to-Peer Systems (Q3525797) (← links)
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension (Q3540244) (← links)
- (Q3574272) (← links)
- A Tight Lower Bound for the Steiner Point Removal Problem on Trees (Q3595405) (← links)
- Randomized Postoptimization of Covering Arrays (Q3651567) (← links)
- Folding a Better Checkerboard (Q3652293) (← links)
- (Q4250189) (← links)
- (Q4411352) (← links)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (Q4512573) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- (Q4537744) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q4542526) (← links)
- (Q4952636) (← links)
- (Q4952637) (← links)
- (Q4952645) (← links)
- Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension (Q4962603) (← links)
- On pleat rearrangements in pureland tessellations (Q5078765) (← links)
- On the establishment of distinct identities in overlay networks (Q5177254) (← links)
- Optimal-stretch name-independent compact routing in doubling metrics (Q5177281) (← links)
- Compact routing with slack in low doubling dimension (Q5401395) (← links)
- Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty (Q5464207) (← links)
- A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem (Q5952320) (← links)
