| Publication | Date of Publication | Type |
|---|
Optimal Boolean lattice-based algorithms for the U-curve optimization problem
Information Sciences | 2020-09-22 | Paper |
Prices of anarchy of selfish 2D bin packing games
International Journal of Foundations of Computer Science | 2019-06-21 | Paper |
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
Theoretical Computer Science | 2019-05-17 | Paper |
A \(\min\)-\(\max\) relation in flowgraphs and some applications
Discrete Applied Mathematics | 2018-05-24 | Paper |
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
Discrete Optimization | 2018-05-24 | Paper |
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
Discrete Applied Mathematics | 2017-06-19 | Paper |
| A min-max relation in flowgraphs | 2016-10-17 | Paper |
The envy-free pricing problem and unit-demand markets
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
Discrete Applied Mathematics | 2015-09-22 | Paper |
Algorithms for junctions in acyclic digraphs
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
PTAS's for some metric \(p\)-source communication spanning tree problems
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Selfish square packing
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A dynamic programming algorithm for the tree mapping problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Mathematical models and polyhedral studies for integral sheet metal design
SIAM Journal on Optimization | 2013-04-09 | Paper |
Minimum ratio cover of matrix columns by extreme rays of its induced cone
Lecture Notes in Computer Science | 2012-11-02 | Paper |
A branch-and-cut approach to the repetition-free longest common subsequence problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Repetition-free longest common subsequence
Discrete Applied Mathematics | 2010-08-13 | Paper |
Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
Information Processing Letters | 2010-03-24 | Paper |
Repetition-free longest common subsequence
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Estimates for the spreading velocity of an epidemic model.
Mathematics and Computers in Simulation | 2004-03-29 | Paper |
Rearrangement of DNA fragments: a branch-and-cut algorithm.
Discrete Applied Mathematics | 2002-01-01 | Paper |
| DNA fragments assembly programs: A comparative study | 2001-10-24 | Paper |
A combinatorial optimization technique for the sequential decomposition of erosions and dilations
Journal of Mathematical Imaging and Vision | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1254471 (Why is no real title available?) | 1999-06-29 | Paper |
The node capacitated graph partitioning problem: A computational study
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Decomposing Matrices into Blocks
SIAM Journal on Optimization | 1999-02-22 | Paper |
Solving Multiple Knapsack Problems by Cutting Planes
SIAM Journal on Optimization | 1997-02-03 | Paper |
Formulations and valid inequalities of the node capacitated graph partitioning problem
Mathematical Programming. Series A. Series B | 1996-10-31 | Paper |
| scientific article; zbMATH DE number 833409 (Why is no real title available?) | 1996-01-14 | Paper |
Some integer programs arising in the design of main frame computers
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1993-09-21 | Paper |
