| Publication | Date of Publication | Type |
|---|
On the approximability of some maximum spanning tree problems
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
On minimum reload cost cycle cover
Discrete Applied Mathematics | 2015-09-22 | Paper |
On minimum reload cost cycle cover
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Approximating minimum cut with bounded size
Lecture Notes in Computer Science | 2011-09-09 | Paper |
On minimum reload cost paths, tours, and flows
Networks | 2011-06-22 | Paper |
On minimum changeover cost arborescences
Experimental Algorithms | 2011-06-10 | Paper |
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics | 2011-03-09 | Paper |
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
Networks | 2010-11-24 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
Information Processing Letters | 2009-07-09 | Paper |
The complexity of a minimum reload cost diameter problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
Approximating Maximum Cut with Limited Unbalance
Approximation and Online Algorithms | 2008-02-21 | Paper |
Approximation algorithms for maximum cut with limited unbalance
Theoretical Computer Science | 2007-10-18 | Paper |
On Optimum Cycle Bases
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Approximating Max Cut with Limited Unbalance
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 2080984 (Why is no real title available?) | 2004-08-04 | Paper |
On the approximation of the minimum disturbance \(p\)-facility location problem
Discrete Applied Mathematics | 2002-05-15 | Paper |
Approximability of hard combinatorial optimization problems: an introduction
Annals of Operations Research | 2001-01-17 | Paper |
Randomized algorithms over finite fields for the exact parity base problem.
Journal of Complexity | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1222099 (Why is no real title available?) | 1998-11-11 | Paper |
On the approximability of some Maximum Spanning Tree Problems
Theoretical Computer Science | 1998-07-22 | Paper |
A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters | 1996-02-26 | Paper |
On the computation of pfaffians
Discrete Applied Mathematics | 1994-07-31 | Paper |
Random pseudo-polynomial algorithms for some combinatorial programming problems
European Journal of Operational Research | 1992-10-06 | Paper |
Random pseudo-polynomial algorithms for exact matroid problems
Journal of Algorithms | 1992-06-28 | Paper |
The image of weighted combinatorial problems
Annals of Operations Research | 1992-06-27 | Paper |
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
Journal of Complexity | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 3980505 (Why is no real title available?) | 1986-01-01 | Paper |
Linking-Centers and Reliable-Trees of a Network
IEEE Transactions on Reliability | 1986-01-01 | Paper |
On the complexity of finding multi-constrained spanning trees
Discrete Applied Mathematics | 1983-01-01 | Paper |
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
Networks | 1982-01-01 | Paper |
The Bounded Path Tree Problem
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
An exact upper bound to the maximum number of perfect matchings in cubic pseudographs
Calcolo | 1981-01-01 | Paper |
Complexity of spanning tree problems: Part I
European Journal of Operational Research | 1980-01-01 | Paper |
On Permutation-Embedding Sequences
SIAM Journal on Applied Mathematics | 1976-01-01 | Paper |
