| Publication | Date of Publication | Type |
|---|
| A cops and robber game and the meeting time of synchronous directed walks | 2024-09-05 | Paper |
| A game theoretic framework for distributed computing with dynamic set of agents | 2024-07-16 | Paper |
| The no-meet matroid | 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 | 2024-03-13 | Paper |
| Affine routing for robust network design | 2023-12-11 | Paper |
| New bounds for subset selection from conic relaxations | 2022-02-22 | Paper |
| On the approximability of robust network design | 2021-03-09 | Paper |
| On fractional cut covers | 2019-07-17 | Paper |
| A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues | 2019-06-11 | Paper |
| Multipolar robust optimization | 2019-03-14 | Paper |
| A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines | 2019-02-25 | Paper |
| Convex and concave envelopes: revisited and new perspectives | 2019-02-22 | Paper |
| Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems | 2018-08-22 | Paper |
| Complete formulations of polytopes related to extensions of assignment matrices | 2018-08-20 | Paper |
| On the most imbalanced orientation of a graph | 2018-07-20 | Paper |
| Efficient algorithms for the maximum concurrent flow problem | 2018-05-23 | Paper |
| Fiber cable network design in tree networks | 2018-05-17 | Paper |
| Design of fiber cable tree FTTH networks | 2018-04-11 | Paper |
| Robust Distributed Consensus Using Total Variation | 2017-05-03 | Paper |
| A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix | 2016-11-30 | Paper |
| From Graph Orientation to the Unweighted Maximum Cut | 2016-09-02 | Paper |
| Extended cuts | 2016-04-13 | Paper |
| On the Most Imbalanced Orientation of a Graph | 2015-10-29 | Paper |
| Fractional routing using pairs of failure-disjoint paths | 2015-09-22 | Paper |
| The \(k\)-separator problem: polyhedra, complexity and approximation results | 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 | 2013-08-06 | Paper |
| The k-Separator Problem | 2013-06-11 | Paper |
| A gradient-based randomised heuristic for the maximum cut problem | 2012-11-16 | Paper |
| On the minimum cut separator problem | 2012-06-18 | Paper |
| Robust routing in communication networks | 2012-01-26 | Paper |
| A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems | 2011-10-27 | Paper |
| Robust routing and optimal partitioning of a traffic demand polytope | 2011-08-17 | Paper |
| Designing Steiner networks with unicyclic connected components: an easy problem | 2011-07-18 | Paper |
| On the minimum cost multiple-source unsplittable flow problem | 2011-06-01 | Paper |
| Virtual network provisioning across multiple substrate networks | 2011-04-27 | Paper |
| The maximum cut problem | 2010-12-08 | Paper |
| Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems | 2010-09-09 | Paper |
| Routing of uncertain traffic demands | 2009-08-12 | Paper |
| Spectral bounds for the maximum cut problem | 2009-06-16 | Paper |
| A geometric characterization of ``optimality-equivalent relaxations | 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 | 2007-05-29 | Paper |
| Acceleration of cutting-plane and column generation algorithms: Applications to network design | 2007-02-02 | Paper |
| Further contributions to network optimization | 2006-09-12 | Paper |
| A constraint generation algorithm for large scale linear programs using multiple-points separation | 2006-06-14 | Paper |
| Computing the initial temperature of simulated annealing | 2005-04-07 | Paper |
| Some recent contributions to network optimization | 2004-08-20 | Paper |
| Internet Routing and Related Topology Issues | 2004-01-08 | Paper |
| Multi-hour design of survivable classical IP networks | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4509380 | 2000-10-15 | Paper |
