Recherche

Afficher tous les résultats pour

Accueil

Personne

Dominique de Werra

Cette personne a quitté l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (54)

Page 2 sur 3

On a graph coloring problem arising from discrete tomography

Dominique de Werra, Bernard Ries

An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph

G=(V,E)

and a family

\mathcal{P}

of chains

P_i

together with vectors

h(P_i)=(h_{i}^{1},...,h_{i}^{k})

, one wants to find a partition $V^{1},. ...

2008

Finding Hamiltonian circuits in quasi-adjoint graphs

Dominique de Werra, Benjamin Leroy-Beaulieu

This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothernnic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718-7291. This paper pr ...

2008

The micro-world of cographs

Dominique de Werra

Cographs constitute a small point in the atlas of graph classes. However, by zooming in on this point, we discover a complex world, where many parameters jump from finiteness to infinity. In the present paper, we identify several milestones in the world of ...

ELSEVIER2022

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

Dominique de Werra, Bernard Ries

Given an undirected graph G = (V, E) with matching number nu(G), a d-blocker is a subset of edges B such that nu((V, E \ B))

Elsevier2010

Degree-constrained edge partitioning in graphs arising from discrete tomography

Dominique de Werra, Bernard Ries

Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k=3 colors is open. Variations and special ...

2009

Split-critical and uniquely split-colorable graphs

Dominique de Werra, Tinaz Ekim, Bernard Ries

The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring p ...

2010

A tutorial on the use of graphs in discrete tomography

Dominique de Werra, Bernard Ries

Starting from the basic image reconstruction problem in discrete tomography some graph theoretical models are proposed. This suggests the study of some variations and extensions of the basic problem. Applications in scheduling and timetabling are described ...

Springer-Verlag2008

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

Dominique de Werra

This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously ...

2008

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

Dominique de Werra

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. We also present the first constructive polynomial-time algorithm for the recognition of 3-letter graphs. ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

On the use of graphs in discrete tomography

Dominique de Werra, Bernard Ries

In this tutorial paper, we consider the basic image reconstruction problem which stems from discrete tomography. We derive a graph theoretical model and we explore some variations and extensions of this model. This allows us to establish connections with s ...

2010

Sports scheduling search space connectivity: A riffle shuffle driven approach

Dominique de Werra

The canonical method is widely used to build single round robin schedules for sports competitions. Certain properties of the canonical method may entrap local search procedures. In this paper, we study the connectivity of one of the most used neighborhood ...

Elsevier Science Bv2016

Letter graphs and geometric grid classes of permutations: Characterization and recognition

Dominique de Werra

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive ...

ELSEVIER2020

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

Dominique de Werra

Kluwer Academic Publishers, Springer2007

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

Dominique de Werra

2006

Using graphs for some discrete tomography problems

Dominique de Werra

2006

Polar cographs (vol 156, pg 1652, 2008)

Dominique de Werra, Tinaz Ekim

Elsevier Science Bv2014

(p,k)-coloring problems in line graphs

Dominique de Werra, Tinaz Ekim

2005

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

Dominique de Werra

We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even ...

2010

From L. Euler to D. König

Dominique de Werra

Starting from the famous Konigsberg bridge problem which Euler described in 1736, we intend to show that some results obtained 180 years later by Konig are very close to Euler's discoveries. ...

EDP Sciences2009

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

Dominique de Werra, David Schindl

2006