| Publication | Date of Publication | Type |
|---|
Superfluous arcs and confluent reductions in the minimum feedback vertex set problem
RAIRO. Theoretical Informatics and Applications | 2025-10-31 | Paper |
Optimizing the Design of a Wind Farm Collection Network
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
On the maximum orders of an induced forest, an induced tree, and a stable set
Yugoslav Journal of Operations Research | 2017-04-11 | Paper |
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization | 2009-08-19 | Paper |
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
Operations Research | 2009-08-13 | Paper |
Average distance and maximum induced forest
Journal of Graph Theory | 2009-02-20 | Paper |
A column generation and branch-and-cut algorithm for the channel assignment problem
Computers & Operations Research | 2008-09-01 | Paper |
Comparison of column generation models for channel assignment in cellular networks
Discrete Applied Mathematics | 2002-07-04 | Paper |
Erratum to ``Comparison of column generation models for channel assignment in cellular networks
Discrete Applied Mathematics | 2002-06-24 | Paper |
Topological Design of Two-Level Telecommunication Networks with Modular Switches
Operations Research | 2002-06-04 | Paper |
Optimal edge-colourings for a class of planar multigraphs
Combinatorica | 2002-02-13 | Paper |
| scientific article; zbMATH DE number 1390132 (Why is no real title available?) | 2000-07-05 | Paper |
Fast Matching Algorithms for Points on a Polygon
SIAM Journal on Computing | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4195987 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4195986 (Why is no real title available?) | 1990-01-01 | Paper |
On a Network Design Problem That Is Intractable on Trees
Mathematics of Operations Research | 1990-01-01 | Paper |
Erratum to: On the chromatic index of multigraphs and a conjecture of Seymour. I
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
An instance of the cutting stock problem for which the rounding property does not hold
Operations Research Letters | 1986-01-01 | Paper |
An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
Management Science | 1986-01-01 | Paper |
On the chromatic index of multigraphs and a conjecture of Seymour (I)
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
The cutting stock problem and integer rounding
Mathematical Programming | 1985-01-01 | Paper |
