| Publication | Date of Publication | Type |
|---|
| On the approximability of some maximum spanning tree problems | 2022-08-16 | Paper |
| On minimum reload cost cycle cover | 2015-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5397271 | 2014-02-19 | Paper |
| Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases | 2013-06-10 | Paper |
| A branch‐and‐price approach to k‐clustering minimum biclique completion problem | 2013-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4899827 | 2013-01-10 | Paper |
| On Minimum Reload Cost Cycle Cover | 2012-05-13 | Paper |
| On minimum reload cost paths, tours, and flows | 2011-06-22 | Paper |
| On Minimum Changeover Cost Arborescences | 2011-06-10 | Paper |
| Computational experience with a SDP-based algorithm for maximum cut with limited unbalance | 2010-11-24 | Paper |
| Minimum cut bases in undirected networks | 2010-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3550228 | 2010-03-31 | Paper |
| Edge-swapping algorithms for the minimum fundamental cycle basis problem | 2009-04-27 | Paper |
| A branch-and-cut method for the obnoxious \(p\)-median problem | 2008-05-20 | Paper |
| Approximating Maximum Cut with Limited Unbalance | 2008-02-21 | Paper |
| Approximation algorithms for maximum cut with limited unbalance | 2007-10-18 | Paper |
| Least and most colored bases | 2007-09-19 | Paper |
| Algorithms for finding minimum fundamental cycle bases in graphs | 2007-05-29 | Paper |
| Approximating Max Cut with Limited Unbalance | 2007-05-29 | Paper |
| Solving minimum K-cardinality cut problems in planar graphs | 2007-02-02 | Paper |
| An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints | 2006-06-09 | Paper |
| On some properties of base-matroids | 2006-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708541 | 2005-11-18 | Paper |
| Cardinality constrained minimum cut problems: complexity and algorithms. | 2004-03-14 | Paper |
| On the complexity of graph tree partition problems. | 2004-01-26 | Paper |
| Discrete facility location and routing of obnoxious activities. | 2004-01-05 | Paper |
| New bounds for optimum traffic assignment in satellite communication. | 2003-09-07 | Paper |
| The base-matroid and inverse combinatorial optimization problems. | 2003-06-10 | Paper |
| Solving the Two-Connected Network with Bounded Meshes Problem | 2002-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771641 | 2002-03-03 | Paper |
| Approximability of hard combinatorial optimization problems: an introduction | 2001-01-17 | Paper |
| Combining linear and nonlinear objectives in spanning tree problems | 2000-10-30 | Paper |
| Randomized algorithms over finite fields for the exact parity base problem. | 2000-09-03 | Paper |
| Solving the feedback vertex set problem on undirected graphs | 2000-04-09 | Paper |
| Exact solution of the SONET ring loading problem | 2000-01-31 | Paper |
| Solution of the cumulative assignment problem with a well-structured tabu search method | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4229635 | 1999-02-22 | Paper |
| A bound for the symmetric travelling salesman problem through matroid formulation | 1999-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217594 | 1998-11-11 | Paper |
| A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem | 1998-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4208337 | 1998-09-01 | Paper |
| On the approximability of some Maximum Spanning Tree Problems | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398358 | 1998-07-19 | Paper |
| A mixed-integer model for solving ordering problems with side constraints | 1998-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350061 | 1997-10-27 | Paper |
| Heuristics from Nature for Hard Combinatorial Optimization Problems | 1997-01-15 | Paper |
| On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem | 1997-01-06 | Paper |
| Complexity of spanning tree problems with leaf-dependent objectives | 1996-08-05 | Paper |
| On some multicriteria arborescence problems: Complexity and algorithms | 1996-07-07 | Paper |
| A short note on the approximability of the maximum leaves spanning tree problem | 1996-02-26 | Paper |
| On the computation of pfaffians | 1994-07-31 | Paper |
| Weighted k‐cardinality trees: Complexity and polyhedral structure | 1994-05-09 | Paper |
| In memoriam Paolo M. Camerini | 1993-06-29 | Paper |
| Note on combinatorial optimization with max-linear objective functions | 1993-06-29 | Paper |
| Random pseudo-polynomial algorithms for some combinatorial programming problems | 1992-10-06 | Paper |
| Random pseudo-polynomial algorithms for exact matroid problems | 1992-06-28 | Paper |
| The image of weighted combinatorial problems | 1992-06-27 | Paper |
| Multi-constrained matroidal knapsack problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4203821 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205241 | 1987-01-01 | Paper |
| Randomized algorithms in combinatorial optimization: A survey | 1986-01-01 | Paper |
| Most and least uniform spanning trees | 1986-01-01 | Paper |
| Some experience in applying a stochastic method to location problems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745296 | 1986-01-01 | Paper |
| Linking-Centers and Reliable-Trees of a Network | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678964 | 1985-01-01 | Paper |
| Unlabelled Partition Systems: Optimization and Complexity | 1984-01-01 | Paper |
| On the complexity of finding multi-constrained spanning trees | 1983-01-01 | Paper |
| On the worst-case performance of some algorithms for the asymmetric traveling salesman problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3717069 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929566 | 1981-01-01 | Paper |
| Ranking arborescences in O(Km log n) time | 1980-01-01 | Paper |
| Complexity of spanning tree problems: Part I | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3869085 | 1980-01-01 | Paper |
| Thek best spanning arborescences of a network | 1980-01-01 | Paper |
| Polynomial bounding for NP-hard problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919448 | 1980-01-01 | Paper |
| A note on finding optimum branchings | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194733 | 1979-01-01 | Paper |
| Heuristically guided algorithm for k-parity matroid problems | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198530 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4119001 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121712 | 1976-01-01 | Paper |
| Bounds for 3-matroid intersection problems | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109511 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132014 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133397 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181230 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770778 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5598958 | 1969-01-01 | Paper |
