| Publication | Date of Publication | Type |
|---|
Approximating the probabilistic \(p\)-center problem under pressure
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
| Constructive -- non-constructive approximation and maximum independent set problem | 2024-07-05 | Paper |
A graph theoretical approach to the firebreak locating problem
Theoretical Computer Science | 2022-04-19 | Paper |
Generalised online colouring problems in overlap graphs
Theoretical Computer Science | 2021-06-23 | Paper |
Orienteering problem with time-windows and updating delay
Theoretical Computer Science | 2021-03-18 | Paper |
A robust \(p\)-center problem under pressure to locate shelters in wildfire context
EURO Journal on Computational Optimization | 2020-08-26 | Paper |
Structure of conflict graphs in constraint alignment problems and algorithms
(available as arXiv preprint) | 2020-01-13 | Paper |
| Structure of conflict graphs in constraint alignment problems and algorithms | 2020-01-13 | Paper |
Firefighting on trees
Theoretical Computer Science | 2019-10-16 | Paper |
| Online Firefighting on Grids | 2019-07-17 | Paper |
| scientific article; zbMATH DE number 7055496 (Why is no real title available?) | 2019-05-16 | Paper |
Online firefighting on trees
(available as arXiv preprint) | 2018-08-17 | Paper |
| A note on online colouring problems in overlap graphs and their complements | 2018-06-15 | Paper |
Complexity of the improper twin edge coloring of graphs
Graphs and Combinatorics | 2017-10-11 | Paper |
Inverse chromatic number problems in interval and permutation graphs
European Journal of Operational Research | 2016-10-06 | Paper |
On some applications of the selective graph coloring problem
European Journal of Operational Research | 2016-07-06 | Paper |
On the minimum and maximum selective graph coloring problems in some graph classes
Discrete Applied Mathematics | 2016-04-07 | Paper |
| Improper Twin Edge Coloring of Graphs | 2016-01-10 | Paper |
| Complexity of choosability with a small palette of colors | 2016-01-07 | Paper |
Efficient recognition of equimatchable graphs
Information Processing Letters | 2015-06-25 | Paper |
About some robustness and complexity properties of \(G\)-graphs networks
Discrete Applied Mathematics | 2015-02-06 | Paper |
Hardness and approximation of minimum maximal matchings
International Journal of Computer Mathematics | 2014-12-29 | Paper |
On the complexity of the selective graph coloring problem in some special classes of graphs
Theoretical Computer Science | 2014-06-06 | Paper |
| A note on the NP-hardness of two matching problems in induced subgrids | 2014-02-14 | Paper |
| On inverse chromatic number problems (extended abstract) | 2013-11-08 | Paper |
On-line computation and maximum-weighted hereditary subgraph problems
YUJOR. Yugoslav Journal of Operations Research | 2013-10-18 | Paper |
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science | 2013-06-06 | Paper |
On some coloring problems in grids
Theoretical Computer Science | 2013-03-04 | Paper |
On inverse traveling salesman problems
4OR | 2013-02-06 | Paper |
Selective graph coloring in some special classes of graphs
Lecture Notes in Computer Science | 2012-11-02 | Paper |
On the online track assignment problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
| Maximizing the number of unused bins | 2011-01-28 | Paper |
| Approximating values and solutions of NP-optimization problems: concepts and examples | 2011-01-28 | Paper |
| A model for the design of a minimum-cost telecommunications network | 2011-01-03 | Paper |
| scientific article; zbMATH DE number 5823945 (Why is no real title available?) | 2010-12-08 | Paper |
| Polynomial approximation | 2010-12-08 | Paper |
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters | 2009-08-27 | Paper |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics | 2009-06-30 | Paper |
On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
The 0-1 inverse maximum stable set problem
Discrete Applied Mathematics | 2008-11-19 | Paper |
A tutorial on the use of graph coloring for some problems in robotics
European Journal of Operational Research | 2008-10-17 | Paper |
Online Bounded Coloring of Permutation and Overlap Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Some Inverse Traveling Salesman Problems
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
(p, k)-coloring problems in line graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Time slot scheduling of compatible jobs
Journal of Scheduling | 2007-05-15 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
\((p,k)\)-coloring problems in line graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Improved approximations for weighted and unweighted graph problems
Theory of Computing Systems | 2006-01-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Partitioning cographs into cliques and stable sets
Discrete Optimization | 2005-10-10 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
On-line maximum-order induced hereditary subgraph problems
International Transactions in Operational Research | 2005-04-22 | Paper |
Polynomial approximation algorithms with performance guarantees: an introduction-by-example
European Journal of Operational Research | 2005-04-21 | Paper |
On-line vertex-covering
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2143861 (Why is no real title available?) | 2005-03-11 | Paper |
A hypocoloring model for batch scheduling
Discrete Applied Mathematics | 2005-02-23 | Paper |
Reducing off-line to on-line: An example and its applications
Yugoslav Journal of Operations Research | 2004-11-18 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
RAIRO - Operations Research | 2004-08-30 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
RAIRO - Operations Research | 2004-08-30 | Paper |
| scientific article; zbMATH DE number 2079869 (Why is no real title available?) | 2004-08-03 | Paper |
Differential approximation results for the Steiner tree problem
Applied Mathematics Letters | 2004-06-11 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
RAIRO - Operations Research | 2004-03-17 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
RAIRO - Operations Research | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 1953087 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1953086 (Why is no real title available?) | 2003-07-25 | Paper |
A note on the approximation of a minimum-weight maximal independent set
Computational Optimization and Applications | 2001-04-09 | Paper |
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
RAIRO - Operations Research | 2000-08-24 | Paper |
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
RAIRO - Operations Research | 2000-08-24 | Paper |
Bridging gap between standard and differential polynomial approximation: The case of bin-packing
Applied Mathematics Letters | 2000-01-30 | Paper |
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
European Journal of Operational Research | 1999-02-22 | Paper |
Differential approximation algorithms for some combinatorial optimization problems
Theoretical Computer Science | 1999-01-12 | Paper |
Improved approximations for maximum independent set via approximation chains
Applied Mathematics Letters | 1998-03-16 | Paper |
| scientific article; zbMATH DE number 1072400 (Why is no real title available?) | 1997-10-08 | Paper |
| scientific article; zbMATH DE number 1072400 (Why is no real title available?) | 1997-10-08 | Paper |
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
Computational Optimization and Applications | 1997-06-04 | Paper |
On an approximation measure founded on the links between optimization and polynomial approximation theory
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 845765 (Why is no real title available?) | 1996-08-19 | Paper |
| scientific article; zbMATH DE number 784428 (Why is no real title available?) | 1995-08-13 | Paper |
Approximation results for the minimum graph coloring problem
Information Processing Letters | 1995-02-13 | Paper |
| scientific article; zbMATH DE number 563689 (Why is no real title available?) | 1994-06-16 | Paper |
| scientific article; zbMATH DE number 447044 (Why is no real title available?) | 1994-01-09 | Paper |
