- English only
Dominique de Werra papers in international journals
This page reports only the academic work registered in the databases of the Transport and Mobility Laboratory, and is not necessarily a comprehensive list of the work by Dominique de Werra.
More information may be available here
Published
Total: 13
\item[Januario et al., 2016]
Januario, T., Urrutia, S., and de Werra, D. (2016). Sports scheduling search space connectivity: A riffle shuffle driven approach, \emph{Discrete Applied Mathematics} \textbf{211}:113-120.
doi:10.1016/j.dam.2016.04.018
\item[Demange and de Werra, 2013]
Demange, M., and de Werra, D. (2013). On some coloring problems in grids, \emph{Theoretical Computer Science} \textbf{472}(11):9-27.
doi:10.1016/j.tcs.2012.10.046
\item[Bentz et al., 2012]
Bentz, C., Costa, M., Picouleau, C., Ries, B., and de Werra, D. (2012). d-Transversals of stable sets and vertex covers in weighted bipartite graphs, \emph{Journal of Discrete Algorithms} \textbf{17}:95-102.
\item[L\'ev\^eque et de Werra, 2012]
L\év\êque, B., and de Werra, D. (2012). Graph Transformations preserving the stability number, \emph{Discrete Applied Mathematics} \textbf{160}:2752-2759.
\item[Ries et al., 2012]
Ries, B., de Werra, D., and Zenklusen, R. (2012). A note on chromatic properties of threshold graphs, \emph{Discrete Mathematics} \textbf{312}:1838-1843.
\item[L\'ev\^eque and de Werra 2009]
L\év\êque, B., and de Werra, D. (2009). Graph transformations preserving the stability number, \emph{Electronic Notes in Discrete Mathematics} \textbf{35}(1):3-8.
doi:10.1016/j.endm.2009.11.002
\item[Costa et al., 2009]
Costa, M., de Werra, D., Picouleau, C., and Ries, B. (2009). Graph coloring with cardinality constraints on the neighborhoods, \emph{Discrete Optimization} \textbf{6}:362-369.
doi:10.1016/j.disopt.2009.04.005
\item[de Werra, 2009]
de Werra, D. (2009). From L. Euler to D. K\"onig, \emph{RAIRO-Operations Research} \textbf{43}:247-251.
doi:10.1051/ro/2009020
\item[Zenklusen et al., 2009]
Zenklusen, R., Ries, B., Picouleau, C., de Werra, D., Costa, M., and Bentz, C. (2009). Blockers and transversals, \emph{Discrete Mathematics} \textbf{309}(13):4306-4314.
doi:10.1016/j.disc.2009.01.006
\item[Orlovich et al., 2009]
Orlovich, Y. L., Gordon, V. S., and de Werra, D. (2009). On the inapproximability of independent domination in 2P3-free perfect graphs , \emph{Theoretical Computer Science} \textbf{410}(8-10):977-982.
doi:10.1016/j.tcs.2008.11.023
\item[Bentz and al., 2009]
Bentz, C., Costa, M., Picouleau, C., Ries, B., and de Werra, D. (2009). Degree-constrained edge partitioning in graphs arising from discrete tomography, \emph{Journal of Graph Algorithms and Applications} \textbf{13}(2):99-118.
\item[de Werra et al., 2009]
de Werra, D., Demange, M., Escoffier, B., Monnot, J., and Paschos, V. (2009). Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, \emph{Discrete Applied Mathematics} \textbf{157}(4):819-832.
doi:10.1016/j.dam.2008.06.013
\item[Demange et al., 2009]
Demange, M., Ekim, T., and de Werra, D. (2009). A tutorial on the use of graph coloring for some problems in robotics, \emph{European Journal of Operational Research} \textbf{1}(1):41-55.
doi:10.1016/j.ejor.2007.09.018
