| Publication | Date of Publication | Type |
|---|
| Valid path-based graph vertex numbering | 2023-06-03 | Paper |
| Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs | 2022-11-02 | Paper |
| Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs | 2022-06-08 | Paper |
| Open-independent, open-locating-dominating sets in complementary prism graphs | 2022-04-27 | Paper |
| A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing | 2015-09-30 | Paper |
| A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data | 2015-07-29 | Paper |
| A compact transformation of arc routing problems into node routing problems | 2015-04-23 | Paper |
| Turning restriction design in traffic networks with a budget constraint | 2015-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581659 | 2010-09-02 | Paper |
| Modelling either-or relations in integer programming | 2009-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442494 | 2008-02-22 | Paper |
| A probabilistic dynamic programming model of rape seed harvesting | 2006-10-04 | Paper |
| Dynamic network flow models of sustainable grain silo location | 2006-10-04 | Paper |
| Scheduling contractors' farm‐to‐farm crop harvesting operations | 2006-09-14 | Paper |
| BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT | 2006-08-14 | Paper |
| SCHEDULING THE HARVESTING OPERATIONS OF A FOREST BLOCK: A CASE STUDY | 2005-11-21 | Paper |
| The sustainable cell formation problem: manufacturing cell creation with machine modification costs | 2005-11-01 | Paper |
| A positive linear discrete-time model of capacity planning and its controllability properties | 2005-02-22 | Paper |
| A network flow model of group technology | 2004-08-06 | Paper |
| Modelling and solving central cycle problems with integer programming. | 2004-03-14 | Paper |
| On center cycles in grid graphs | 2003-11-17 | Paper |
| Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems | 2000-05-18 | Paper |
| Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs | 1999-07-20 | Paper |
| An exact algorithm for a milk tanker scheduling and sequencing problem | 1999-06-10 | Paper |
| Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case | 1999-05-11 | Paper |
| Integrating the analytic hierarchy process and graph theory to model facilities layout | 1998-11-03 | Paper |
| Integer programming approaches to facilities layout models with forbidden areas | 1998-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4208335 | 1998-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364792 | 1997-12-15 | Paper |
| A variation of the generalized assignment problem arising in the New Zealand dairy industry | 1997-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4860675 | 1996-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858152 | 1995-12-12 | Paper |
| A bilinear approach to the pooling problem† | 1995-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4306054 | 1994-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294590 | 1994-07-17 | Paper |
| Optimal bin location and sequencing in printed circuit board assembly | 1993-08-23 | Paper |
| A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017163 | 1993-01-16 | Paper |
| Graph theory applications | 1992-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972052 | 1992-06-25 | Paper |
| A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352823 | 1989-01-01 | Paper |
| Algorithms for flows with parametric capacities | 1989-01-01 | Paper |
| Enumerating phylogenetic trees with multiple labels | 1988-01-01 | Paper |
| Facilities layout generalized model solved by n-boundary shortest path heuristics | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794221 | 1987-01-01 | Paper |
| Testing the theory of evolution: A novel application of combinatorial optimization | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3737164 | 1986-01-01 | Paper |
| Analysis of heuristics for finding a maximum weight planar subgraph | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347592 | 1985-01-01 | Paper |
| Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693222 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758860 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3328567 | 1984-01-01 | Paper |
| An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338271 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347902 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3706825 | 1984-01-01 | Paper |
| Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659495 | 1983-01-01 | Paper |
| The Steiner problem in phylogeny is NP-complete | 1982-01-01 | Paper |
| Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750667 | 1982-01-01 | Paper |
| An algorithm for the steiner problem in graphs | 1982-01-01 | Paper |
| Comparison of phylogenetic trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669467 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922707 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929387 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949080 | 1981-01-01 | Paper |
| Proving phylogenetic trees minimal with l-clustering and set partitioning | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3887489 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3905330 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942977 | 1980-01-01 | Paper |
| Construction properties of combinatorial deltahedra | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859782 | 1979-01-01 | Paper |
| A Strategy for Solving the Plant Layout Problem | 1976-01-01 | Paper |
