Dominique de Werra
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.
Select an item on the menu on the right. If no menu appears, it means that no record is in the database for the moment.
More information may be available here
International journals
Published
Total: 13
- Januario, T., Urrutia, S., and de Werra, D. (2016). Sports scheduling search space connectivity: A riffle shuffle driven approach, Discrete Applied Mathematics 211:113-120. doi:10.1016/j.dam.2016.04.018
- Demange, M., and de Werra, D. (2013). On some coloring problems in grids, Theoretical Computer Science 472(11):9-27. doi:10.1016/j.tcs.2012.10.046
- 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, Journal of Discrete Algorithms 17:95-102.
- Lévêque, B., and de Werra, D. (2012). Graph Transformations preserving the stability number, Discrete Applied Mathematics 160:2752-2759.
- Ries, B., de Werra, D., and Zenklusen, R. (2012). A note on chromatic properties of threshold graphs, Discrete Mathematics 312:1838-1843.
- Lévêque, B., and de Werra, D. (2009). Graph transformations preserving the stability number, Electronic Notes in Discrete Mathematics 35(1):3-8. doi:10.1016/j.endm.2009.11.002
- Costa, M., de Werra, D., Picouleau, C., and Ries, B. (2009). Graph coloring with cardinality constraints on the neighborhoods, Discrete Optimization 6:362-369. doi:10.1016/j.disopt.2009.04.005
- de Werra, D. (2009). From L. Euler to D. König, RAIRO-Operations Research 43:247-251. doi:10.1051/ro/2009020
- Zenklusen, R., Ries, B., Picouleau, C., de Werra, D., Costa, M., and Bentz, C. (2009). Blockers and transversals, Discrete Mathematics 309(13):4306-4314. doi:10.1016/j.disc.2009.01.006
- Orlovich, Y. L., Gordon, V. S., and de Werra, D. (2009). On the inapproximability of independent domination in 2P3-free perfect graphs , Theoretical Computer Science 410(8-10):977-982. doi:10.1016/j.tcs.2008.11.023
- Bentz, C., Costa, M., Picouleau, C., Ries, B., and de Werra, D. (2009). Degree-constrained edge partitioning in graphs arising from discrete tomography, Journal of Graph Algorithms and Applications 13(2):99-118.
- de Werra, D., Demange, M., Escoffier, B., Monnot, J., and Paschos, V. (2009). Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, Discrete Applied Mathematics 157(4):819-832. doi:10.1016/j.dam.2008.06.013
- Demange, M., Ekim, T., and de Werra, D. (2009). A tutorial on the use of graph coloring for some problems in robotics, European Journal of Operational Research 1(1):41-55. doi:10.1016/j.ejor.2007.09.018