| Publication | Date of Publication | Type |
|---|
| A graph theoretical approach to the firebreak locating problem | 2022-04-19 | Paper |
| Generalised online colouring problems in overlap graphs | 2021-06-23 | Paper |
| Orienteering problem with time-windows and updating delay | 2021-03-18 | Paper |
| A robust \(p\)-center problem under pressure to locate shelters in wildfire context | 2020-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207847 | 2020-01-13 | Paper |
| Firefighting on trees | 2019-10-16 | Paper |
| Online Firefighting on Grids | 2019-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5741893 | 2019-05-16 | Paper |
| Online firefighting on trees | 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 | 2017-10-11 | Paper |
| Inverse chromatic number problems in interval and permutation graphs | 2016-10-06 | Paper |
| On some applications of the selective graph coloring problem | 2016-07-06 | Paper |
| On the minimum and maximum selective graph coloring problems in some graph classes | 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 | 2015-06-25 | Paper |
| About some robustness and complexity properties of \(G\)-graphs networks | 2015-02-06 | Paper |
| Hardness and approximation of minimum maximal matchings | 2014-12-29 | Paper |
| On the complexity of the selective graph coloring problem in some special classes of graphs | 2014-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747400 | 2014-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861543 | 2013-11-08 | Paper |
| On-line computation and maximum-weighted hereditary subgraph problems | 2013-10-18 | Paper |
| New results on maximum induced matchings in bipartite graphs and beyond | 2013-06-06 | Paper |
| On some coloring problems in grids | 2013-03-04 | Paper |
| On inverse traveling salesman problems | 2013-02-06 | Paper |
| Selective Graph Coloring in Some Special Classes of Graphs | 2012-11-02 | Paper |
| On the online track assignment problem | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070856 | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070857 | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3061962 | 2011-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059318 | 2010-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059325 | 2010-12-08 | Paper |
| Algorithms for the on-line quota traveling salesman problem | 2009-08-27 | Paper |
| Weighted coloring on planar, bipartite and split graphs: Complexity and approximation | 2009-06-30 | Paper |
| On the approximation of Min Split-coloring and Min Cocoloring | 2009-01-19 | Paper |
| The 0-1 inverse maximum stable set problem | 2008-11-19 | Paper |
| A tutorial on the use of graph coloring for some problems in robotics | 2008-10-17 | Paper |
| Some Inverse Traveling Salesman Problems | 2008-06-05 | Paper |
| Online Bounded Coloring of Permutation and Overlap Graphs | 2008-06-05 | Paper |
| Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs | 2008-05-27 | Paper |
| Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs | 2008-03-25 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| (p, k)-coloring problems in line graphs | 2007-05-29 | Paper |
| Time slot scheduling of compatible jobs | 2007-05-15 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| \((p,k)\)-coloring problems in line graphs | 2006-03-20 | Paper |
| Improved approximations for weighted and unweighted graph problems | 2006-01-10 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES | 2005-12-15 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Partitioning cographs into cliques and stable sets | 2005-10-10 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| On-line maximum-order induced hereditary subgraph problems | 2005-04-22 | Paper |
| Polynomial approximation algorithms with performance guarantees: an introduction-by-example | 2005-04-21 | Paper |
| On-line vertex-covering | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4655422 | 2005-03-11 | Paper |
| A hypocoloring model for batch scheduling | 2005-02-23 | Paper |
| Reducing off-line to on-line: An example and its applications | 2004-11-18 | Paper |
| Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation | 2004-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471994 | 2004-08-03 | Paper |
| Differential approximation results for the Steiner tree problem | 2004-06-11 | Paper |
| Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances | 2004-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414489 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414490 | 2003-07-25 | Paper |
| A note on the approximation of a minimum-weight maximal independent set | 2001-04-09 | Paper |
| Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems | 2000-08-24 | Paper |
| Bridging gap between standard and differential polynomial approximation: The case of bin-packing | 2000-01-30 | Paper |
| A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios | 1999-02-22 | Paper |
| Differential approximation algorithms for some combinatorial optimization problems | 1999-01-12 | Paper |
| Improved approximations for maximum independent set via approximation chains | 1998-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359293 | 1997-10-08 | Paper |
| The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems | 1997-06-04 | Paper |
| On an approximation measure founded on the links between optimization and polynomial approximation theory | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864343 | 1996-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4843442 | 1995-08-13 | Paper |
| Approximation results for the minimum graph coloring problem | 1995-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4291269 | 1994-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142706 | 1994-01-09 | Paper |
