| Publication | Date of Publication | Type |
|---|
A cops and robber game and the meeting time of synchronous directed walks
Networks | 2024-09-05 | Paper |
A game theoretic framework for distributed computing with dynamic set of agents
Annals of Operations Research | 2024-07-16 | Paper |
The no-meet matroid
Discrete Applied Mathematics | 2024-06-20 | Paper |
| Approximability of robust network design: the directed case | 2024-04-23 | Paper |
Subset Selection and the Cone of Factor-Width-k Matrices
SIAM Journal on Optimization | 2024-03-13 | Paper |
Affine routing for robust network design
Networks | 2023-12-11 | Paper |
New bounds for subset selection from conic relaxations
European Journal of Operational Research | 2022-02-22 | Paper |
On the approximability of robust network design
Theoretical Computer Science | 2021-03-09 | Paper |
On fractional cut covers
Discrete Applied Mathematics | 2019-07-17 | Paper |
A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues
Operations Research Letters | 2019-06-11 | Paper |
Multipolar robust optimization
EURO Journal on Computational Optimization | 2019-03-14 | Paper |
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
European Journal of Operational Research | 2019-02-25 | Paper |
Convex and concave envelopes: revisited and new perspectives
Operations Research Letters | 2019-02-22 | Paper |
Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Complete formulations of polytopes related to extensions of assignment matrices
Discrete Optimization | 2018-08-20 | Paper |
On the most imbalanced orientation of a graph
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Efficient algorithms for the maximum concurrent flow problem
Networks | 2018-05-23 | Paper |
Fiber cable network design in tree networks
European Journal of Operational Research | 2018-05-17 | Paper |
| Design of fiber cable tree FTTH networks | 2018-04-11 | Paper |
Robust Distributed Consensus Using Total Variation
IEEE Transactions on Automatic Control | 2017-05-03 | Paper |
A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix
Lecture Notes in Computer Science | 2016-11-30 | Paper |
From Graph Orientation to the Unweighted Maximum Cut
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Extended cuts
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
On the most imbalanced orientation of a graph
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Fractional routing using pairs of failure-disjoint paths
Discrete Applied Mathematics | 2015-09-22 | Paper |
The \(k\)-separator problem: polyhedra, complexity and approximation results
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
| Failure disjoint paths | 2013-11-08 | Paper |
| Polynomial traffic demand polytope partitioning | 2013-11-08 | Paper |
| Steiner networks with unicyclic connected components | 2013-11-08 | Paper |
| Networks with unicyclic connected components and without short cycles | 2013-11-08 | Paper |
| Algorithms and formulations for the minimum cut separator problem | 2013-11-08 | Paper |
| Robust Consensus in Distributed Networks using Total Variation | 2013-09-27 | Paper |
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
Networks | 2013-08-06 | Paper |
The \(k\)-separator problem
Lecture Notes in Computer Science | 2013-06-11 | Paper |
A gradient-based randomised heuristic for the maximum cut problem
International Journal of Mathematics in Operational Research | 2012-11-16 | Paper |
On the minimum cut separator problem
Networks | 2012-06-18 | Paper |
| Robust routing in communication networks | 2012-01-26 | Paper |
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
Discrete Applied Mathematics | 2011-10-27 | Paper |
Robust routing and optimal partitioning of a traffic demand polytope
International Transactions in Operational Research | 2011-08-17 | Paper |
Designing Steiner networks with unicyclic connected components: an easy problem
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
On the minimum cost multiple-source unsplittable flow problem
RAIRO - Operations Research | 2011-06-01 | Paper |
On the minimum cost multiple-source unsplittable flow problem
RAIRO - Operations Research | 2011-06-01 | Paper |
Virtual network provisioning across multiple substrate networks
Computer Networks | 2011-04-27 | Paper |
| The maximum cut problem | 2010-12-08 | Paper |
Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
European Journal of Operational Research | 2010-09-09 | Paper |
Routing of uncertain traffic demands
Optimization and Engineering | 2009-08-12 | Paper |
Spectral bounds for the maximum cut problem
Networks | 2009-06-16 | Paper |
A geometric characterization of ``optimality-equivalent relaxations
Journal of Global Optimization | 2009-05-04 | Paper |
| More mathematics to gain more money in the ``Weakest Link game | 2008-02-08 | Paper |
| Mathematical models of the delay constrained routing problem | 2007-08-13 | Paper |
New bounds for the maximum cut problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Acceleration of cutting-plane and column generation algorithms: Applications to network design
Networks | 2007-02-02 | Paper |
Further contributions to network optimization
Networks | 2006-09-12 | Paper |
A constraint generation algorithm for large scale linear programs using multiple-points separation
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Computing the initial temperature of simulated annealing
Computational Optimization and Applications | 2005-04-07 | Paper |
Some recent contributions to network optimization
Networks | 2004-08-20 | Paper |
Internet Routing and Related Topology Issues
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Multi-hour design of survivable classical IP networks
International Journal of Communication Systems | 2003-02-04 | Paper |
| scientific article; zbMATH DE number 1517141 (Why is no real title available?) | 2000-10-15 | Paper |
