| Publication | Date of Publication | Type |
|---|
A semi brute-force search approach for (balanced) clustering
Algorithmica | 2024-01-09 | Paper |
Fault-tolerant total domination via submodular function approximation
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Calibrations scheduling with arbitrary lengths and activation length
Journal of Scheduling | 2022-01-14 | Paper |
Maximum rooted connected expansion
(available as arXiv preprint) | 2021-08-04 | Paper |
Maximum rooted connected expansion
Theoretical Computer Science | 2021-06-22 | Paper |
Improved budgeted connected domination and budgeted edge-vertex domination
Theoretical Computer Science | 2021-02-03 | Paper |
On the Complexity of Minimizing the Total Calibration Cost
Frontiers in Algorithmics | 2019-04-26 | Paper |
On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
IEEE Transactions on Computers | 2018-09-14 | Paper |
Bin packing with colocations
Approximation and Online Algorithms | 2017-04-04 | Paper |
Clustering on \(k\)-edge-colored graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Optimal data placement on networks with a constant number of clients
Theoretical Computer Science | 2014-06-06 | Paper |
Clustering on k-Edge-Colored Graphs
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| scientific article; zbMATH DE number 5842466 (Why is no real title available?) | 2011-01-28 | Paper |
| Local search: complexity and approximation | 2010-12-08 | Paper |
Probabilistic models for the Steiner tree problem
Networks | 2010-11-24 | Paper |
A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
Information Processing Letters | 2010-04-19 | Paper |
Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
Information Processing Letters | 2010-04-19 | Paper |
Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis
Information Processing Letters | 2009-12-04 | Paper |
Joint object placement and node dimensioning for internet content distribution
Information Processing Letters | 2009-07-09 | Paper |
SOFSEM 2004: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Steiner Forests on Stochastic Metric Graphs
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
The densest \(k\)-subgraph problem on clique graphs
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Methods and Applications of Artificial Intelligence
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Updating Directed Minimum Cost Spanning Trees
Experimental Algorithms | 2007-09-14 | Paper |
The antennas preassignment problem
Chaos, Solitons and Fractals | 2005-03-08 | Paper |
An efficient approach for large-scale two-dimensional guillotine cutting stock problems
The Journal of the Operational Research Society | 2005-01-19 | Paper |
A simulated annealing approach for the circular cutting problem
European Journal of Operational Research | 2004-08-16 | Paper |
Evaluation of reliability bounds by set covering models.
Statistics & Probability Letters | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1984140 (Why is no real title available?) | 2003-09-22 | Paper |
On the classification of NP-complete problems in terms of their correlation coefficient
Discrete Applied Mathematics | 2002-07-03 | Paper |
On the landscape ruggedness of the quadratic assignment problem
Theoretical Computer Science | 2001-08-20 | Paper |
A neural network for the minimum set covering problem
Chaos, Solitons and Fractals | 2000-12-18 | Paper |
A recursive exact algorithm for weighted two-dimensional cutting
European Journal of Operational Research | 1999-02-22 | Paper |
An approximation algorithm for solving unconstrained two-dimensional knapsack problems
European Journal of Operational Research | 1998-08-13 | Paper |
Autocorrelation coefficient for the graph bipartitioning problem
Theoretical Computer Science | 1998-08-13 | Paper |
An approximation scheme for strip packing of rectangles with bounded dimensions
Discrete Applied Mathematics | 1998-08-12 | Paper |
An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
Theoretical Computer Science | 1998-07-22 | Paper |
On the quality of local search for the quadratic assignment problem
Discrete Applied Mathematics | 1998-06-02 | Paper |
Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
The Journal of the Operational Research Society | 1997-11-25 | Paper |
Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
RAIRO - Operations Research | 1997-04-10 | Paper |
On the performance guarantee of neural networks for NP-hard optimization problems
Information Processing Letters | 1997-02-28 | Paper |
A New Efficient Heuristic for the Minimum Set Covering Problem
The Journal of the Operational Research Society | 1996-09-16 | Paper |
| scientific article; zbMATH DE number 558545 (Why is no real title available?) | 1994-05-19 | Paper |
Performance of a neural network method with set partitioning
Chaos, Solitons and Fractals | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 3954634 (Why is no real title available?) | 1985-01-01 | Paper |
