2023
A tutorial on graph models for scheduling round-robin sports tournaments.
Int. Trans. Oper. Res., November, 2023
2022
The micro-world of cographs.
Discret. Appl. Math., 2022
2021
Recoloring subgraphs of <i>K</i><sub>2<i>n</i></sub> for sports scheduling.
Theor. Comput. Sci., 2021
2020
Minimal graphs for 2-factor extension.
Discret. Appl. Math., 2020
Letter graphs and geometric grid classes of permutations: Characterization and recognition.
Discret. Appl. Math., 2020
2018
Dominating induced matchings in graphs containing no long claw.
J. Graph Theory, 2018
What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems?
Eur. J. Oper. Res., 2018
Minimal graphs for matching extensions.
Discret. Appl. Math., 2018
2016
Combinatorics and Algorithms for Augmenting Graphs.
Graphs Comb., 2016
Edge coloring: A natural model for sports scheduling.
Eur. J. Oper. Res., 2016
Sports scheduling search space connectivity: A riffle shuffle driven approach.
Discret. Appl. Math., 2016
Choosability with limited number of colors.
CoRR, 2016
2015
Optimal pathway reconstruction on 3D NMR maps.
Discret. Appl. Math., 2015
2014
Discret. Appl. Math., 2014
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660].
Discret. Appl. Math., 2014
2013
On some coloring problems in grids.
Theor. Comput. Sci., 2013
2012
d-Transversals of stable sets and vertex covers in weighted bipartite graphs.
J. Discrete Algorithms, 2012
A note on chromatic properties of threshold graphs.
Discret. Math., 2012
Some Graph Problems Arising in Elementary Robotics.
Proceedings of the ICORES 2012, 2012
2011
Minimum d-blockers and d-transversals in graphs.
J. Comb. Optim., 2011
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.
Electron. Notes Discret. Math., 2011
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011
2010
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.
Oper. Res. Lett., 2010
Split-critical and uniquely split-colorable graphs.
Discret. Math. Theor. Comput. Sci., 2010
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.
Discret. Math., 2010
On the use of graphs in discrete tomography.
Ann. Oper. Res., 2010
2009
On the inapproximability of independent domination in 2P<sub>3</sub>-free perfect graphs.
Theor. Comput. Sci., 2009
From L. Euler to D. König.
RAIRO Oper. Res., 2009
Degree-constrained edge partitioning in graphs arising from discrete tomography.
J. Graph Algorithms Appl., 2009
A Magnetic Procedure for the Stability Number.
Graphs Comb., 2009
A tutorial on the use of graph coloring for some problems in robotics.
Eur. J. Oper. Res., 2009
Graph transformations preserving the stability number.
Electron. Notes Discret. Math., 2009
Blockers and transversals.
Discret. Math., 2009
Graph coloring with cardinality constraints on the neighborhoods.
Discret. Optim., 2009
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.
Discret. Appl. Math., 2009
2008
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Sched., 2008
Construction of balanced sports schedules using partitions into subleagues.
Oper. Res. Lett., 2008
On a graph coloring problem arising from discrete tomography.
Networks, 2008
Addendum to "Bicolored Matchings in Some Classes of Graphs".
Graphs Comb., 2008
On two coloring problems in mixed graphs.
Eur. J. Comb., 2008
Discret. Appl. Math., 2008
Polarity of chordal graphs.
Discret. Appl. Math., 2008
Finding Hamiltonian circuits in quasi-adjoint graphs.
Discret. Appl. Math., 2008
2007
Time slot scheduling of compatible jobs.
J. Sched., 2007
Electron. Notes Discret. Math., 2007
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization.
Ann. Oper. Res., 2007
2006
Three is easy, two is hard: open shop sum-batch scheduling problem refined.
Oper. Res. Lett., 2006
On the approximation of Min Split-coloring and Min Cocoloring.
J. Graph Algorithms Appl., 2006
Good and nice colorings of balanced hypergraphs.
Discret. Math., 2006
Construction of sports schedules with multiple venues.
Discret. Appl. Math., 2006
Using graphs for some discrete tomography problems.
Discret. Appl. Math., 2006
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks.
Discret. Appl. Math., 2006
Locally restricted colorings.
Discret. Appl. Math., 2006
2005
(<i>p</i>, <i>k</i>)-coloring problems in line graphs.
Theor. Comput. Sci., 2005
On Split-Coloring Problems.
J. Comb. Optim., 2005
Path colorings in bipartite graphs.
Eur. J. Oper. Res., 2005
(p, k)-coloring problems in line graphs.
Electron. Notes Discret. Math., 2005
Bicolored matchings in some classes of graphs.
Electron. Notes Discret. Math., 2005
Partitioning cographs into cliques and stable sets.
Discret. Optim., 2005
A hypocoloring model for batch scheduling.
Discret. Appl. Math., 2005
A solvable case of image reconstruction in discrete tomography.
Discret. Appl. Math., 2005
Variations on the Roy-Gallai theorem.
4OR, 2005
2004
On some properties of suboptimal colorings of graphs.
Networks, 2004
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Coloration de graphes : fondements et applications.
RAIRO Oper. Res., 2003
Using stable sets to bound the chromatic number.
Inf. Process. Lett., 2003
Special issue on stability in graphs and related topics.
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
Colorings and Related Topics.
Proceedings of the Handbook of Graph Theory., 2003
2002
Circular-arc graph coloring: On chords and circuits in the meeting graph.
Eur. J. Oper. Res., 2002
A generalized class-teacher model for some timetabling problems.
Eur. J. Oper. Res., 2002
Weighted Node Coloring: When Stable Sets Are Expensive.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Constraints of Availability in Timetabling and Scheduling.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002
2000
Variations on the theorem of Birkhoff-von Neumann and extensions.
Electron. Notes Discret. Math., 2000
Feasible edge colorings of trees with cardinality constraints.
Discret. Math., 2000
1999
On perfectness of sums of graphs.
Discret. Math., 1999
On a Graph-theoretical Model for Cyclic Register Allocation.
Discret. Appl. Math., 1999
On a Multiconstrained Model for Chromatic Scheduling.
Discret. Appl. Math., 1999
On some Properties of DNA Graphs.
Discret. Appl. Math., 1999
1997
Math. Methods Oper. Res., 1997
Restricted coloring models for timetabling.
Discret. Math., 1997
Preassignment Requirements in Chromatic Scheduling.
Discret. Appl. Math., 1997
1996
Open shop scheduling with some additional constraints.
Graphs Comb., 1996
Restrictions and Preassignments in Preemptive open Shop Scheduling.
Discret. Appl. Math., 1996
Deadline Scheduling of Multiprocessor Tasks.
Discret. Appl. Math., 1996
Proceedings of the Mathematical Hierarchies and Biology, 1996
1995
Some Combinatorial Models for Course Scheduling.
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.
Parallel Comput., 1994
Nonpreemptive open shop with restricted processing times.
Math. Methods Oper. Res., 1994
Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions.
J. Algorithms, 1994
A sufficient condition for equitable edge-colourings of simple graphs.
Discret. Math., 1994
Chromatic Scheduling and Frequency Assignment.
Discret. Appl. Math., 1994
on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation.
Discret. Appl. Math., 1994
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits.
Discret. Appl. Math., 1994
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design.
Discret. Appl. Math., 1994
1993
Edge-Chromatic Scheduling with Simultaneity Constraints.
SIAM J. Discret. Math., 1993
Some graph-theoretical models for scheduling in automated production systems.
Networks, 1993
Graph endpoint coloring and distributed processing.
Networks, 1993
On the stability number of AH-free graphs.
J. Graph Theory, 1993
The cyclic compact open-shop scheduling problem.
Discret. Math., 1993
Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219).
Discret. Appl. Math., 1993
Scheduling Multiprocessor Tasks on Uniform Processors.
Proceedings of the Parallel Computing: Trends and Applications, 1993
1992
Discret. Appl. Math., 1992
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource.
Discret. Appl. Math., 1992
1991
Compact Cylindrical Chromatic Scheduling.
SIAM J. Discret. Math., 1991
A preemptive open shop scheduling problem with one resource.
Oper. Res. Lett., 1991
On the use of augmenting chains in chain packings.
Discret. Appl. Math., 1991
Discret. Appl. Math., 1991
A convoy scheduling problem.
Discret. Appl. Math., 1991
1990
A constrained sports scheduling problem.
Discret. Appl. Math., 1990
Recognition of a class of unimodular functions.
Discret. Appl. Math., 1990
Discret. Appl. Math., 1990
Scheduling independent two processor tasks on a uniform duo-processor system.
Discret. Appl. Math., 1990
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph.
Comput. Oper. Res., 1990
The Tabu Search Metaheuristic: How we used it.
Ann. Math. Artif. Intell., 1990
1989
Paths, chains, and antipaths.
Networks, 1989
Generalized edge packings.
Math. Program., 1989
Preemptive scheduling with staircase and piecewise linear resource availability.
ZOR Methods Model. Oper. Res., 1989
Connected sequential colorings.
Discret. Math., 1989
STABULUS: A technique for finding stable sets in large graphs with tabu search.
Computing, 1989
1988
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
SIAM J. Discret. Math., 1988
Consecutive colorings of graphs.
ZOR Methods Model. Oper. Res., 1988
On randomized stopping points and perfect graphs.
J. Comb. Theory, Ser. B, 1988
Perfectly orderable graphs are quasi-parity graphs: a short proof.
Discret. Math., 1988
Some models of graphs for scheduling sports competitions.
Discret. Appl. Math., 1988
1987
Partitions into odd chains.
Math. Program., 1987
Four classes of perfectly orderable graphs.
J. Graph Theory, 1987
Using tabu search techniques for graph coloring.
Computing, 1987
1986
Node coverings with odd chains.
J. Graph Theory, 1986
A note on superbrittle graphs.
Discret. Math., 1986
Generalized neighbourhoods and a class of perfectly orderable graphs.
Discret. Appl. Math., 1986
1985
On the multiplication of divisions: The use of graphs for sports scheduling.
Networks, 1985
A note on strong perfectness of graphs.
Math. Program., 1985
Threshold characterization of graphs with dilworth number two.
J. Graph Theory, 1985
Stability in CAN-free graphs.
J. Comb. Theory, Ser. B, 1985
Split graphs of Dilworth number 2.
Discret. Math., 1985
The struction of a graph: Application to CN-free graphs.
Comb., 1985
1984
A decomposition property of polyhedra.
Math. Program., 1984
Variation on a theorem of König.
Discret. Math., 1984
1982
Obstructions for regular colorings.
J. Comb. Theory, Ser. B, 1982
Minimizing irregularities in sports schedules using graph theory.
Discret. Appl. Math., 1982
1981
On some characterisations of totally unimodular matrices.
Math. Program., 1981
On the existence of generalized good and equitable edge colorings.
J. Graph Theory, 1981
1980
Geography, games and graphs.
Discret. Appl. Math., 1980
1979
On the use of alternating chains and hypergraphs in edge coloring.
J. Graph Theory, 1979
Regular and canonical colorings.
Discret. Math., 1979
1978
Color-feasible sequences of a multigraph.
Networks, 1978
1977
Compactness and balancing in scheduling.
Math. Methods Oper. Res., 1977
Multigraphs with quasiweak odd cycles.
J. Comb. Theory, Ser. B, 1977
1976
Some remarks on good colorations.
J. Comb. Theory, Ser. B, 1976
A note on a paper by D. Seinsche.
J. Comb. Theory, Ser. B, 1976
An extension of bipartite multigraphs.
Discret. Math., 1976
1974
Some results in chromatic scheduling.
Z. Oper. Research, 1974
A note on graph coloring.
RAIRO Theor. Informatics Appl., 1974
1972
Decomposition of bipartite multigraphs into matchings.
Z. Oper. Research, 1972
1971
Investigations on an edge coloring problem.
Discret. Math., 1971
