| Publication | Date of Publication | Type |
|---|
| A tutorial on graph models for scheduling round‐robin sports tournaments | 2023-10-04 | Paper |
| The Micro-world of Cographs | 2022-10-13 | Paper |
| The micro-world of cographs | 2022-03-24 | Paper |
| Recoloring subgraphs of \(K_{2n}\) for sports scheduling | 2021-06-23 | Paper |
| Letter graphs and geometric grid classes of permutations: characterization and recognition | 2020-06-29 | Paper |
| Minimal graphs for 2-factor extension | 2020-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5741893 | 2019-05-16 | Paper |
| Dominating induced matchings in graphs containing no long claw | 2018-07-13 | Paper |
| What are the worst cases in constrained last-in-first-out pick-up and delivery problems? | 2018-07-12 | Paper |
| Letter graphs and geometric grid classes of permutations: characterization and recognition | 2018-06-15 | Paper |
| Minimal graphs for matching extensions | 2017-12-20 | Paper |
| Sports scheduling search space connectivity: a riffle shuffle driven approach | 2016-11-02 | Paper |
| Edge coloring: a natural model for sports scheduling | 2016-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2822599 | 2016-09-30 | Paper |
| Combinatorics and algorithms for augmenting graphs | 2016-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816078 | 2016-07-01 | Paper |
| Complexity of choosability with a small palette of colors | 2016-01-07 | Paper |
| Optimal pathway reconstruction on 3D NMR maps | 2015-02-06 | Paper |
| Corrigendum to ``Polar cographs | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396744 | 2014-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857332 | 2013-11-01 | Paper |
| Graph transformations preserving the stability number | 2013-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2837369 | 2013-07-10 | Paper |
| \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs | 2013-06-24 | Paper |
| On some coloring problems in grids | 2013-03-04 | Paper |
| Graph transformations preserving the stability number | 2012-11-22 | Paper |
| A note on chromatic properties of threshold graphs | 2012-05-30 | Paper |
| Minimum \(d\)-blockers and \(d\)-transversals in graphs | 2012-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109939 | 2012-01-26 | Paper |
| Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization | 2011-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081600 | 2011-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059317 | 2010-12-08 | Paper |
| On the use of graphs in discrete tomography | 2010-05-10 | Paper |
| A projective algorithm for preemptive open shop scheduling with two multiprocessor groups | 2010-05-07 | Paper |
| A magnetic procedure for the stability number | 2010-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3402439 | 2010-02-04 | Paper |
| Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid | 2009-12-15 | Paper |
| Blockers and transversals | 2009-12-10 | Paper |
| Graph coloring with cardinality constraints on the neighborhoods | 2009-11-23 | Paper |
| From L. Euler to D. König | 2009-09-29 | Paper |
| Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications | 2009-08-28 | Paper |
| Weighted coloring on planar, bipartite and split graphs: Complexity and approximation | 2009-06-30 | Paper |
| Degree-constrained edge partitioning in graphs arising from discrete tomography | 2009-05-19 | Paper |
| Using stable sets to bound the chromatic number | 2009-04-28 | Paper |
| On the inapproximability of independent domination in \(2P_3\)-free perfect graphs | 2009-03-17 | Paper |
| On the approximation of Min Split-coloring and Min Cocoloring | 2009-01-19 | Paper |
| Polarity of chordal graphs | 2008-11-19 | Paper |
| Finding Hamiltonian circuits in quasi-adjoint graphs | 2008-11-19 | Paper |
| A tutorial on the use of graph coloring for some problems in robotics | 2008-10-17 | Paper |
| Construction of balanced sports schedules using partitions into subleagues | 2008-09-10 | Paper |
| Polar cographs | 2008-09-10 | Paper |
| On the use of graphs in discrete tomography | 2008-09-04 | Paper |
| Addendum to ``Bicolored matchings in some classes of graphs | 2008-08-20 | Paper |
| On a graph coloring problem arising from discrete tomography | 2008-07-29 | Paper |
| On two coloring problems in mixed graphs | 2008-04-22 | Paper |
| Three is easy, two is hard: Open shop sum-batch scheduling problem refined | 2008-01-15 | Paper |
| On split-coloring problems | 2007-09-10 | Paper |
| Bicolored matchings in some classes of graphs | 2007-05-29 | Paper |
| Polar cographs | 2007-05-29 | Paper |
| (p, k)-coloring problems in line graphs | 2007-05-29 | Paper |
| Time slot scheduling of compatible jobs | 2007-05-15 | Paper |
| Bicolored matchings in some classes of graphs | 2007-04-26 | Paper |
| Good and nice colorings of balanced hypergraphs | 2006-10-30 | Paper |
| Some simple optimization techniques for self-organized public key management in mobile ad hoc networks | 2006-06-30 | Paper |
| \((p,k)\)-coloring problems in line graphs | 2006-03-20 | Paper |
| Variations on the Roy-Gallai theorem | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717958 | 2006-01-13 | Paper |
| Using graphs for some discrete tomography problems | 2006-01-10 | Paper |
| Construction of sports schedules with multiple venues | 2006-01-10 | Paper |
| Locally restricted colorings | 2006-01-10 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Partitioning cographs into cliques and stable sets | 2005-10-10 | Paper |
| A solvable case of image reconstruction in discrete tomography | 2005-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4669229 | 2005-04-15 | Paper |
| Path colorings in bipartite graphs | 2005-03-08 | Paper |
| A hypocoloring model for batch scheduling | 2005-02-23 | Paper |
| Coloration de graphes : fondements et applications | 2004-08-30 | Paper |
| On some properties of suboptimal colorings of graphs | 2004-03-15 | Paper |
| Foreword: Special issue on stability in graphs and related topics | 2003-12-04 | Paper |
| Struction revisited | 2003-12-04 | Paper |
| Variations on the theorem of Birkhoff-von Neumann and extensions | 2003-08-18 | Paper |
| Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414490 | 2003-07-25 | Paper |
| A generalized class-teacher model for some timetabling problems | 2002-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779223 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779224 | 2002-04-15 | Paper |
| Circular-arc graph coloring: On chords and circuits in the meeting graph | 2002-01-23 | Paper |
| Feasible edge colorings of trees with cardinality constraints | 2001-06-28 | 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/Q4934406 | 2000-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365130 | 2000-03-19 | Paper |
| On a graph-theoretical model for cyclic register allocation | 1999-11-16 | Paper |
| On a multiconstrained model for chromatic scheduling | 1999-06-28 | Paper |
| A partial view of OR in Switzerland | 1999-05-05 | Paper |
| The combinatorics of timetabling | 1999-02-22 | Paper |
| What is my objective function? | 1999-02-22 | Paper |
| Extensions of coloring models for scheduling purposes | 1998-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375744 | 1998-03-02 | Paper |
| Preassignment requirements in chromatic scheduling | 1998-02-24 | Paper |
| The tabu search metaheuristic: How we used it | 1997-12-14 | Paper |
| Restricted coloring models for timetabling | 1997-12-01 | Paper |
| Mixed graph colorings | 1997-08-26 | Paper |
| Deadline scheduling of multiprocessor tasks | 1997-01-13 | Paper |
| Open shop scheduling with some additional constraints | 1996-10-07 | Paper |
| Restrictions and preassignments in preemptive open shop scheduling | 1996-07-07 | Paper |
| On the stability number of AH‐free graphs | 1996-01-10 | Paper |
| On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation | 1995-07-13 | Paper |
| Nonpreemptive open shop with restricted processing times | 1995-03-01 | Paper |
| Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions | 1994-11-30 | Paper |
| EPCOT: An efficient procedure for coloring optimally with Tabu Search | 1994-10-31 | Paper |
| The cyclic compact open-shop scheduling problem | 1994-10-27 | Paper |
| Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops | 1994-08-31 | Paper |
| A review of combinatorial problems arising in feedforward neural network design | 1994-08-29 | Paper |
| Edge-Chromatic Scheduling with Simultaneity Constraints | 1994-08-14 | Paper |
| Chromatic scheduling and frequency assignment | 1994-07-18 | Paper |
| A sufficient condition for equitable edge-colourings of simple graphs | 1994-06-09 | Paper |
| Some graph‐theoretical models for scheduling in automated production systems | 1994-05-09 | Paper |
| Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system | 1994-03-24 | Paper |
| Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource | 1993-08-31 | Paper |
| A user's guide to tabu search | 1993-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992988 | 1992-09-17 | Paper |
| Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource | 1992-06-28 | Paper |
| Compact Cylindrical Chromatic Scheduling | 1992-06-27 | Paper |
| On the use of augmenting chains in chain packings | 1992-06-25 | Paper |
| A preemptive open shop scheduling problem with one resource | 1991-01-01 | Paper |
| TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph | 1990-01-01 | Paper |
| Scheduling independent two processor tasks on a uniform duo-processor system | 1990-01-01 | Paper |
| A note on SS/TDMA satellite communication | 1990-01-01 | Paper |
| Almost nonpreemptive schedules | 1990-01-01 | Paper |
| Recognition of a class of unimodular functions | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5752591 | 1990-01-01 | Paper |
| Odd path packings | 1989-01-01 | Paper |
| An interactive system for constructing timetables on a PC | 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 |
| Generalized edge packings | 1989-01-01 | Paper |
| Paths, chains, and antipaths | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490013 | 1989-01-01 | Paper |
| Preemptive scheduling with staircase and piecewise linear resource availability | 1989-01-01 | Paper |
| On randomized stopping points and perfect graphs | 1988-01-01 | Paper |
| Perfectly orderable graphs are quasi-parity graphs: a short proof | 1988-01-01 | Paper |
| On the two-phase method for preemptive scheduling | 1988-01-01 | Paper |
| Some models of graphs for scheduling sports competitions | 1988-01-01 | Paper |
| Consecutive colorings of graphs | 1988-01-01 | Paper |
| From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions | 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 |
| Partitions into odd chains | 1987-01-01 | Paper |
| A note on superbrittle graphs | 1986-01-01 | Paper |
| Generalized neighbourhoods and a class of perfectly orderable graphs | 1986-01-01 | Paper |
| Variations on the integral decomposition property | 1986-01-01 | Paper |
| Time-Tabling Problems: Should They Be Canonical? | 1986-01-01 | Paper |
| Node coverings with odd chains | 1986-01-01 | Paper |
| An introduction to timetabling | 1985-01-01 | Paper |
| Stability in CAN-free graphs | 1985-01-01 | Paper |
| Split graphs of Dilworth number 2 | 1985-01-01 | Paper |
| The struction of a graph: Application to CN-free graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686417 | 1985-01-01 | Paper |
| On the multiplication of divisions: The use of graphs for sports scheduling | 1985-01-01 | Paper |
| Threshold characterization of graphs with dilworth number two | 1985-01-01 | Paper |
| A note on strong perfectness of graphs | 1985-01-01 | Paper |
| Balanced optimization problems | 1984-01-01 | Paper |
| Variation on a theorem of König | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3309471 | 1984-01-01 | Paper |
| Preemptive Scheduling, Linear Programming and Network Flows | 1984-01-01 | Paper |
| On Some Properties of the Struction of a Graph | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682509 | 1984-01-01 | Paper |
| A decomposition property of polyhedra | 1984-01-01 | Paper |
| On the use of Bichromatic Interchanges | 1983-01-01 | Paper |
| Obstructions for regular colorings | 1982-01-01 | Paper |
| Chromatic optimisation: Limitations, objectives, uses, references | 1982-01-01 | Paper |
| Minimizing irregularities in sports schedules using graph theory | 1982-01-01 | Paper |
| Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs | 1981-01-01 | Paper |
| On the existence of generalized good and equitable edge colorings | 1981-01-01 | Paper |
| On some characterisations of totally unimodular matrices | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912623 | 1981-01-01 | Paper |
| Scheduling in Sports | 1981-01-01 | Paper |
| Geography, games and graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863418 | 1980-01-01 | Paper |
| Regular and canonical colorings | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859806 | 1979-01-01 | Paper |
| On the use of alternating chains and hypergraphs in edge coloring | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186063 | 1979-01-01 | Paper |
| On line perfect graphs | 1978-01-01 | Paper |
| Some Comments On A Note About Timetabling* | 1978-01-01 | Paper |
| Color-feasible sequences of a multigraph | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200069 | 1978-01-01 | Paper |
| Uniqueness of colorings | 1977-01-01 | Paper |
| Multigraphs with quasiweak odd cycles | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4126362 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140719 | 1977-01-01 | Paper |
| Compactness and balancing in scheduling | 1977-01-01 | Paper |
| A note on a paper by D. Seinsche | 1976-01-01 | Paper |
| Some remarks on good colorations | 1976-01-01 | Paper |
| An extension of bipartite multigraphs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083202 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4097313 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4073396 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083457 | 1975-01-01 | Paper |
| On A Particular Conference Scheduling Problem | 1975-01-01 | Paper |
| Partitions of graphs into coverings and hypergraphs into transversals | 1974-01-01 | Paper |
| Some results in chromatic scheduling | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4404922 | 1974-01-01 | Paper |
| Decomposition of bipartite multigraphs into matchings | 1972-01-01 | Paper |
| Investigations on an edge coloring problem | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5627898 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5627909 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5636674 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5650698 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5611549 | 1970-01-01 | Paper |
