Dominique de Werra

Lucas Assunção

Discret. Appl. Math., 2026

2025

Minimizing breaks in incomplete round-robin tournaments.

[BibT_eX]

[DOI]

Lucas Assunção

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2023

A tutorial on graph models for scheduling round-robin sports tournaments.

[BibT_eX]

[DOI]

Celso C. Ribeiro

Int. Trans. Oper. Res., November, 2023

2021

Recoloring subgraphs of K2n for sports scheduling.

[BibT_eX]

[DOI]

Tiago Januario

Theor. Comput. Sci., 2021

2020

Minimal graphs for 2-factor extension.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

The Micro-world of Cographs.

[BibT_eX]

[DOI]

Bogdan Alecu

Vadim V. Lozin

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2018

Dominating induced matchings in graphs containing no long claw.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems?

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Minimal graphs for matching extensions.

[BibT_eX]

[DOI]

Konrad Kazimierz Dabrowski

Discret. Appl. Math., 2018

2017

Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016

Combinatorics and Algorithms for Augmenting Graphs.

[BibT_eX]

[DOI]

Vadim V. Lozin

Victor Zamaraev

Graphs Comb., 2016

Edge coloring: A natural model for sports scheduling.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Sports scheduling search space connectivity: A riffle shuffle driven approach.

[BibT_eX]

[DOI]

Tiago Januario

Discret. Appl. Math., 2016

Choosability with limited number of colors.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Optimal pathway reconstruction on 3D NMR maps.

[BibT_eX]

[DOI]

Marta Szachniuk

Maria Cristina De Cola

Giovanni Felici

Discret. Appl. Math., 2015

2014

Preface.

[BibT_eX]

[DOI]

Nelson Maculan

Ali Ridha Mahjoub

Discret. Appl. Math., 2014

Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660].

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

On some coloring problems in grids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

A note on chromatic properties of threshold graphs.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2012

Some Graph Problems Arising in Elementary Robotics.

[BibT_eX]

Proceedings of the ICORES 2012, 2012

2011

Minimum d-blockers and d-transversals in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

2010

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.

[BibT_eX]

[DOI]

Tamás Kis

Wieslaw Kubiak

Oper. Res. Lett., 2010

Split-critical and uniquely split-colorable graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2010

2009

On the inapproximability of independent domination in 2P3-free perfect graphs.

[BibT_eX]

[DOI]

Yury L. Orlovich

Valery S. Gordon

Theor. Comput. Sci., 2009

From L. Euler to D. König.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2009

Degree-constrained edge partitioning in graphs arising from discrete tomography.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

A Magnetic Procedure for the Stability Number.

[BibT_eX]

[DOI]

Graphs Comb., 2009

A tutorial on the use of graph coloring for some problems in robotics.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

Graph transformations preserving the stability number.

[BibT_eX]

[DOI]

Benjamin Lévêque

Electron. Notes Discret. Math., 2009

Blockers and transversals.

[BibT_eX]

[DOI]

Discret. Math., 2009

Graph coloring with cardinality constraints on the neighborhoods.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.

[BibT_eX]

[DOI]

Tamás Kis

Wieslaw Kubiak

J. Sched., 2008

Construction of balanced sports schedules using partitions into subleagues.

[BibT_eX]

[DOI]

A. Geinoz

Oper. Res. Lett., 2008

On a graph coloring problem arising from discrete tomography.

[BibT_eX]

[DOI]

Networks, 2008

Addendum to "Bicolored Matchings in Some Classes of Graphs".

[BibT_eX]

[DOI]

Graphs Comb., 2008

On two coloring problems in mixed graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Polarity of chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Finding Hamiltonian circuits in quasi-adjoint graphs.

[BibT_eX]

[DOI]

Marta Kasprzak

Benjamin Leroy-Beaulieu

Discret. Appl. Math., 2008

On the use of graphs in discrete tomography.

[BibT_eX]

[DOI]

4OR, 2008

2007

Time slot scheduling of compatible jobs.

[BibT_eX]

[DOI]

J. Sched., 2007

Bicolored Matchings in Some Classes of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Polar cographs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2006

Three is easy, two is hard: open shop sum-batch scheduling problem refined.

[BibT_eX]

[DOI]

Irina V. Gribkovskaia

Chung-Yee Lee

Vitaly A. Strusevich

Oper. Res. Lett., 2006

On the approximation of Min Split-coloring and Min Cocoloring.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

Erratum.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Good and nice colorings of balanced hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

Construction of sports schedules with multiple venues.

[BibT_eX]

[DOI]

C. Raess

Discret. Appl. Math., 2006

Using graphs for some discrete tomography problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Some simple optimization techniques for self-organized public key management in mobile ad hoc networks.

[BibT_eX]

[DOI]

T. Bornand-Jaccard

David Schindl

Discret. Appl. Math., 2006

Locally restricted colorings.

[BibT_eX]

[DOI]

Ivo Blöchliger

Discret. Appl. Math., 2006

2005

(p, k)-coloring problems in line graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On Split-Coloring Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

Path colorings in bipartite graphs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

(p, k)-coloring problems in line graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Partitioning cographs into cliques and stable sets.

[BibT_eX]

[DOI]

Discret. Optim., 2005

A hypocoloring model for batch scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

A solvable case of image reconstruction in discrete tomography.

[BibT_eX]

[DOI]

David Schindl

Discret. Appl. Math., 2005

Variations on the Roy-Gallai theorem.

[BibT_eX]

[DOI]

4OR, 2005

2004

On some properties of suboptimal colorings of graphs.

[BibT_eX]

[DOI]

Ivo Blöchliger

Networks, 2004

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Coloration de graphes : fondements et applications.

[BibT_eX]

[DOI]

Daniel Kobler

RAIRO Oper. Res., 2003

Using stable sets to bound the chromatic number.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Variations on the Theorem of Birkhoff - von Neumann and Extensions.

[BibT_eX]

[DOI]

Graphs Comb., 2003

Special issue on stability in graphs and related topics.

[BibT_eX]

[DOI]

Vadim V. Lozin

Discret. Appl. Math., 2003

Struction revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Colorings and Related Topics.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Circular-arc graph coloring: On chords and circuits in the meeting graph.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

A generalized class-teacher model for some timetabling problems.

[BibT_eX]

[DOI]

Armen S. Asratian

Eur. J. Oper. Res., 2002

Weighted Node Coloring: When Stable Sets Are Expensive.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Constraints of Availability in Timetabling and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2000

Feasible edge colorings of trees with cardinality constraints.

[BibT_eX]

[DOI]

Daniel Kobler

Discret. Math., 2000

1999

On perfectness of sums of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

On a Graph-theoretical Model for Cyclic Register Allocation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On a Multiconstrained Model for Chromatic Scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On some Properties of DNA Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1997

Mixed graph colorings.

[BibT_eX]

[DOI]

Julio Kuplinsky

Math. Methods Oper. Res., 1997

Restricted coloring models for timetabling.

[BibT_eX]

[DOI]

Discret. Math., 1997

Preassignment Requirements in Chromatic Scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

Open shop scheduling with some additional constraints.

[BibT_eX]

[DOI]

Jacques Erschler

Graphs Comb., 1996

Restrictions and Preassignments in Preemptive open Shop Scheduling.

[BibT_eX]

[DOI]

Alan J. Hoffman

Uri N. Peled

Discret. Appl. Math., 1996

Deadline Scheduling of Multiprocessor Tasks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Nesticity.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Hierarchies and Biology, 1996

1995

Some Combinatorial Models for Course Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995

1994

Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System.

[BibT_eX]

[DOI]

Parallel Comput., 1994

Nonpreemptive open shop with restricted processing times.

[BibT_eX]

[DOI]

Ondrej Cepek

Milan Vlach

Math. Methods Oper. Res., 1994

Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions.

[BibT_eX]

[DOI]

Fanica Gavril

V. Toledano Laredo

J. Algorithms, 1994

A sufficient condition for equitable edge-colourings of simple graphs.

[BibT_eX]

[DOI]

Anthony J. W. Hilton

Discret. Math., 1994

Chromatic Scheduling and Frequency Assignment.

[BibT_eX]

[DOI]

Y. Gay

Discret. Appl. Math., 1994

on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A Review of Combinatorial Problems Arising in Feedforward Neural Network Design.

[BibT_eX]

[DOI]

Edoardo Amaldi

Eddy Mayoraz

Discret. Appl. Math., 1994

1993

Edge-Chromatic Scheduling with Simultaneity Constraints.

[BibT_eX]

[DOI]

Uri N. Peled

SIAM J. Discret. Math., 1993

Some graph-theoretical models for scheduling in automated production systems.

[BibT_eX]

[DOI]

Ph. Solot

Networks, 1993

Graph endpoint coloring and distributed processing.

[BibT_eX]

[DOI]

Networks, 1993

On the stability number of AH-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

The cyclic compact open-shop scheduling problem.

[BibT_eX]

[DOI]

Ph. Solot

Discret. Math., 1993

Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219).

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Scheduling Multiprocessor Tasks on Uniform Processors.

[BibT_eX]

Proceedings of the Parallel Computing: Trends and Applications, 1993

1992

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Compact Cylindrical Chromatic Scheduling.

[BibT_eX]

[DOI]

Ph. Solot

SIAM J. Discret. Math., 1991

A preemptive open shop scheduling problem with one resource.

[BibT_eX]

[DOI]

Wieslaw Kubiak

Oper. Res. Lett., 1991

On the use of augmenting chains in chain packings.

[BibT_eX]

[DOI]

Fred S. Roberts

Discret. Appl. Math., 1991

Erratum.

[BibT_eX]

[DOI]

Bruno Simeone

Discret. Appl. Math., 1991

A convoy scheduling problem.

[BibT_eX]

[DOI]

Jean Bovet

C. Constantin

Discret. Appl. Math., 1991

1990

A constrained sports scheduling problem.

[BibT_eX]

[DOI]

Loïc Jacot-Descombes

P. Masson

Discret. Appl. Math., 1990

Recognition of a class of unimodular functions.

[BibT_eX]

[DOI]

Bruno Simeone

Discret. Appl. Math., 1990

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Scheduling independent two processor tasks on a uniform duo-processor system.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph.

[BibT_eX]

[DOI]

Charles Friden

Comput. Oper. Res., 1990

The Tabu Search Metaheuristic: How we used it.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1990

1989

Paths, chains, and antipaths.

[BibT_eX]

[DOI]

C. Pasche

Networks, 1989

Generalized edge packings.

[BibT_eX]

[DOI]

Math. Program., 1989

Preemptive scheduling with staircase and piecewise linear resource availability.

[BibT_eX]

[DOI]

Roman Slowinski

ZOR Methods Model. Oper. Res., 1989

Odd Path Packings.

[BibT_eX]

[DOI]

William R. Pulleyblank

Eur. J. Comb., 1989

Connected sequential colorings.

[BibT_eX]

[DOI]

Discret. Math., 1989

STABULUS: A technique for finding stable sets in large graphs with tabu search.

[BibT_eX]

[DOI]

Charles Friden

Computing, 1989

1988

From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Consecutive colorings of graphs.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1988

On randomized stopping points and perfect graphs.

[BibT_eX]

[DOI]

Robert C. Dalang

Leslie E. Trotter Jr.

J. Comb. Theory B, 1988

Perfectly orderable graphs are quasi-parity graphs: a short proof.

[BibT_eX]

[DOI]

Discret. Math., 1988

Some models of graphs for scheduling sports competitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1988

1987

Partitions into odd chains.

[BibT_eX]

[DOI]

Math. Program., 1987

Four classes of perfectly orderable graphs.

[BibT_eX]

[DOI]

Vasek Chvátal

Chính T. Hoàng

J. Graph Theory, 1987

Using tabu search techniques for graph coloring.

[BibT_eX]

[DOI]

Computing, 1987

1986

Node coverings with odd chains.

[BibT_eX]

[DOI]

J. Graph Theory, 1986

A note on superbrittle graphs.

[BibT_eX]

[DOI]

Myriam Preissmann

Discret. Math., 1986

Generalized neighbourhoods and a class of perfectly orderable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

On the multiplication of divisions: The use of graphs for sports scheduling.

[BibT_eX]

[DOI]

Networks, 1985

A note on strong perfectness of graphs.

[BibT_eX]

[DOI]

Myriam Preissmann

Math. Program., 1985

Book review.

[BibT_eX]

[DOI]

Z. Oper. Research, 1985

Threshold characterization of graphs with dilworth number two.

[BibT_eX]

[DOI]

Claude Benzaken

J. Graph Theory, 1985

Stability in CAN-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

Split graphs of Dilworth number 2.

[BibT_eX]

[DOI]

Claude Benzaken

Discret. Math., 1985

The struction of a graph: Application to CN-free graphs.

[BibT_eX]

[DOI]

Comb., 1985

1984

A decomposition property of polyhedra.

[BibT_eX]

[DOI]

Math. Program., 1984

Variation on a theorem of König.

[BibT_eX]

[DOI]

Discret. Math., 1984

1982

Obstructions for regular colorings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1982

Minimizing irregularities in sports schedules using graph theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1982

1981

On some characterisations of totally unimodular matrices.

[BibT_eX]

[DOI]

Math. Program., 1981

On the existence of generalized good and equitable edge colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

1980

Geography, games and graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1980

1979

On the use of alternating chains and hypergraphs in edge coloring.

[BibT_eX]

[DOI]

J. Graph Theory, 1979

Regular and canonical colorings.

[BibT_eX]

[DOI]

Discret. Math., 1979

1978

Color-feasible sequences of a multigraph.

[BibT_eX]

[DOI]

Networks, 1978

On line perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 1978

1977

Compactness and balancing in scheduling.

[BibT_eX]

[DOI]

Daniel Brélaz

Y. Nicolier

Math. Methods Oper. Res., 1977

Multigraphs with quasiweak odd cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1977

1976

Some remarks on good colorations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1976

A note on a paper by D. Seinsche.

[BibT_eX]

[DOI]

J. C. Arditti

J. Comb. Theory B, 1976

An extension of bipartite multigraphs.

[BibT_eX]

[DOI]

Discret. Math., 1976

1974

Some results in chromatic scheduling.

[BibT_eX]

[DOI]

Z. Oper. Research, 1974

A note on graph coloring.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1974

1972

Decomposition of bipartite multigraphs into matchings.

[BibT_eX]

[DOI]

Z. Oper. Research, 1972

1971

Investigations on an edge coloring problem.

[BibT_eX]

[DOI]