| Publication | Date of Publication | Type |
|---|
| Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs | 2023-10-13 | Paper |
| Upper bounds on the average number of colors in the non-equivalent colorings of a graph | 2023-05-26 | Paper |
| Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph | 2023-05-15 | Paper |
| Optimizing the Design of a Wind Farm Collection Network | 2023-05-09 | Paper |
| Graph colouring variations | 2022-12-21 | Paper |
| Decycling bipartite graphs | 2022-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5026930 | 2022-02-08 | Paper |
| A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering | 2022-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5156385 | 2021-10-15 | Paper |
| Resolving sets and integer programs for recommender systems | 2021-08-17 | Paper |
| An exact algorithm for a class of geometric set-cover problems | 2021-06-07 | Paper |
| Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices | 2021-05-05 | Paper |
| An exact dynamic programming algorithm for the precedence-constrained class sequencing problem | 2021-04-20 | Paper |
| On the edge capacitated Steiner tree problem | 2021-01-15 | Paper |
| An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes | 2020-04-27 | Paper |
| Maximum eccentric connectivity index for graphs with given diameter | 2019-09-19 | Paper |
| On graceful difference labelings of disjoint unions of circuits | 2019-08-29 | Paper |
| A comparison of integer programming models for the partial directed weighted improper coloring problem | 2019-05-17 | Paper |
| A polynomial time algorithm for unloading boxes off a gravity conveyor | 2018-10-18 | Paper |
| Dominating induced matchings in graphs containing no long claw | 2018-07-13 | Paper |
| Online algorithms for the maximum \(k\)-colorable subgraph problem | 2018-07-11 | Paper |
| Incomplete service and split deliveries in a routing problem with profits | 2018-05-11 | Paper |
| A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) | 2017-12-20 | Paper |
| Tabu search for the RNA partial degradation problem | 2017-07-27 | Paper |
| A new efficient RLF-like algorithm for the vertex coloring problem | 2017-07-19 | Paper |
| On the maximum orders of an induced forest, an induced tree, and a stable set | 2017-04-11 | Paper |
| A note on r-equitable k-colorings of trees | 2017-04-11 | Paper |
| Symmetry Breaking Constraints for the Minimum Deficiency Problem | 2017-04-05 | Paper |
| A comparison of integer and constraint programming models for the deficiency problem | 2016-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2822599 | 2016-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816102 | 2016-07-01 | Paper |
| The split delivery capacitated team orienteering problem | 2016-06-10 | Paper |
| Counting the number of non-equivalent vertex colorings of a graph | 2016-03-18 | Paper |
| Constructive algorithms for the partial directed weighted improper coloring problem | 2016-03-03 | Paper |
| Directed weighted improper coloring for cellular channel allocation | 2015-02-06 | Paper |
| Automated generation of conjectures on forbidden subgraph characterization | 2014-09-12 | Paper |
| A branch-and-price algorithm for the robust graph coloring problem | 2014-05-05 | Paper |
| Integer linear programming models for a cement delivery problem | 2012-12-29 | Paper |
| Total domination and the Caccetta-Häggkvist conjecture | 2012-12-28 | Paper |
| Improving constrained pattern mining with first-fail-based heuristics | 2012-04-11 | Paper |
| On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic | 2012-03-07 | Paper |
| Der Graf der Graphen | 2011-10-07 | Paper |
| Using local search to speed up filtering algorithms for some NP-hard constraints | 2011-06-22 | Paper |
| On a reduction of the interval coloring problem to a series of bandwidth coloring problems | 2011-04-01 | Paper |
| A magnetic procedure for the stability number | 2010-05-05 | Paper |
| About equivalent interval colorings of weighted graphs | 2010-04-28 | Paper |
| A flexible MILP model for multiple-shift workforce planning under annualized hours | 2009-12-10 | Paper |
| A solution method for a car fleet management problem with maintenance constraints | 2009-11-20 | Paper |
| Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems | 2009-11-16 | Paper |
| The capacitated team orienteering and profitable tour problems | 2009-10-15 | Paper |
| The metric cutpoint partition problem | 2009-10-13 | Paper |
| Lower bounds and a tabu search algorithm for the minimum deficiency problem | 2009-09-18 | Paper |
| A comparison of five heuristics for the multiple depot vehicle scheduling problem | 2009-08-28 | Paper |
| Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)] | 2009-06-30 | Paper |
| A patient assignment algorithm for home care services | 2009-06-29 | Paper |
| The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization | 2009-05-08 | Paper |
| Finding augmenting chains in extensions of claw-free graphs | 2009-03-23 | Paper |
| Average distance and maximum induced forest | 2009-02-20 | Paper |
| Variable space search for graph coloring | 2008-11-19 | Paper |
| On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem | 2008-09-10 | Paper |
| A sequential elimination algorithm for computing bounds on the clique number of a graph | 2008-08-15 | Paper |
| A note on tree realizations of matrices | 2008-07-29 | Paper |
| Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints | 2008-05-27 | Paper |
| Efficient algorithms for finding critical subgraphs | 2008-01-21 | Paper |
| An adaptive memory algorithm for the \(k\)-coloring problem | 2008-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431823 | 2008-01-02 | Paper |
| On edge orienting methods for graph coloring | 2007-10-12 | Paper |
| Solution techniques for the large set covering problem | 2007-03-02 | Paper |
| A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding | 2007-02-26 | Paper |
| Augmenting chains in graphs without a skew star. | 2006-05-18 | Paper |
| A survey of local search methods for graph coloring | 2006-05-16 | Paper |
| Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374251 | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717953 | 2006-01-13 | Paper |
| A taxonomy of evolutionary algorithms in combinatorial optimization | 2005-10-13 | Paper |
| Finding the chromatic number by means of critical graphs | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668751 | 2005-04-15 | Paper |
| \(P_{5}\)-free augmenting graphs and the maximum stable set problem | 2003-12-04 | Paper |
| Stable sets in two subclasses of banner-free graphs | 2003-12-04 | Paper |
| A variable neighborhood search for graph coloring. | 2003-10-14 | Paper |
| A lower bound for the job insertion problem. | 2003-06-10 | Paper |
| Extension of Turán's theorem to the 2-stability number | 2003-03-25 | Paper |
| Bounds and heuristics for the shortest capacitated paths problem | 2002-12-15 | Paper |
| A transformation which preserves the clique number | 2002-12-10 | Paper |
| A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows | 2002-07-01 | Paper |
| A Tabu Search Heuristic for the Capacitated arc Routing Problem | 2002-06-04 | Paper |
| Feasible edge colorings of trees with cardinality constraints | 2001-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762470 | 2001-05-01 | Paper |
| A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem | 2001-01-01 | Paper |
| A framework for the description of evolutionary algorithms | 2000-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505839 | 2000-09-28 | Paper |
| Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise | 2000-08-24 | Paper |
| On some properties of DNA graphs | 2000-06-29 | Paper |
| On perfectness of sums of graphs | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365130 | 2000-03-19 | Paper |
| On perfect switching classes | 1999-08-24 | Paper |
| Constructing a course schedule by solving a series of assignment type problems | 1999-08-03 | Paper |
| On perfect switching classes | 1999-06-28 | Paper |
| A partial view of OR in Switzerland | 1999-05-05 | Paper |
| A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems | 1999-01-01 | Paper |
| Improvement Procedures for the Undirected Rural Postman Problem | 1999-01-01 | Paper |
| An Approximation Algorithm for the Traveling Salesman Problem with Backhauls | 1998-05-25 | Paper |
| On the use of Boolean methods for the computation of the stability number | 1998-01-12 | Paper |
| The tabu search metaheuristic: How we used it | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4368561 | 1997-12-04 | Paper |
| Splitting trees | 1997-10-08 | Paper |
| An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques | 1996-10-28 | Paper |
| On a scheduling problem in a robotized analytical system | 1996-07-07 | Paper |
| An improved tabu search approach for solving the job shop scheduling problem with tooling constraints | 1996-07-07 | Paper |
| The traveling salesman problem with backhauls | 1996-07-01 | Paper |
| On the stability number of AH‐free graphs | 1996-01-10 | Paper |
| Polynomially solvable cases for the maximum stable set problem | 1995-09-06 | Paper |
| A Tabu Search Heuristic for the Vehicle Routing Problem | 1995-05-28 | Paper |
| Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs | 1995-01-01 | Paper |
| A generalized insertion algorithm for the seriation problem | 1994-08-08 | Paper |
| A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing | 1994-07-18 | Paper |
| Local optima topology for the \(k\)-coloring problem | 1994-07-18 | Paper |
| A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives | 1994-01-01 | Paper |
| Bounded vertex colorings of graphs | 1993-12-20 | Paper |
| Most unbreakable murky graphs are bull-free | 1993-08-11 | Paper |
| New Insertion and Postoptimization Procedures for the Traveling Salesman Problem | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995154 | 1992-09-17 | Paper |
| Finding a feasible course schedule using Tabu search | 1992-06-28 | Paper |
| TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph | 1990-01-01 | Paper |
| A fast algorithm for coloring Meyniel graphs | 1990-01-01 | Paper |
| Slender graphs | 1989-01-01 | Paper |
| A new heuristic method for the flow shop sequencing problem | 1989-01-01 | Paper |
| Tabu search techniques. A tutorial and an application to neural networks | 1989-01-01 | Paper |
| Connected sequential colourings | 1989-01-01 | Paper |
| STABULUS: A technique for finding stable sets in large graphs with tabu search | 1989-01-01 | Paper |
| Perfectly orderable graphs are quasi-parity graphs: a short proof | 1988-01-01 | Paper |
| Consecutive colorings of graphs | 1988-01-01 | Paper |
| Using tabu search techniques for graph coloring | 1987-01-01 | Paper |
| Some experiments with simulated annealing for coloring graphs | 1987-01-01 | Paper |
