Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach, Theoretical Computer Science, pp.312-328, 2001. ,
Optimal traversal of directed hypergraphs, Tech. rep, 1992. ,
Graph drawing and manipulation with LINK, GD 1997, pp.425-437, 1997. ,
Computing and Listing st-Paths in Public Transportation Networks, CSR 2016, vol.9691, pp.102-116, 2016. ,
Paths and cycles in colored graphs, Australasian journal of combinatorics, vol.31, pp.299-311, 2005. ,
On the red-blue set cover problem, SODA 2000, vol.9, pp.345-353, 2000. ,
Shared risk resource group complexity and approximability issues, Parallel Processing Letters, vol.17, issue.02, pp.169-184, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00070167
Combinatorial optimization in networks with Shared Risk Link Groups, Research report, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01053859
A compendium of NP optimization problems, 1997. ,
Analytical Approach to Parallel Repetition, STOC 2014, pp.624-633, 2014. ,
A note on the maximum flow through a network. Information Theory, IRE Transactions on, vol.2, issue.4, pp.117-119, 1956. ,
Intersecting Sperner families and their convex hulls, Combinatorica, vol.4, issue.1, pp.21-34, 1984. ,
The parameterized complexity of some minimum label problems, pp.88-99, 2009. ,
Directed hypergraphs and applications, Discrete applied mathematics, vol.42, issue.2, pp.177-201, 1993. ,
Computers and intractability: a guide to the theory of NP-completeness, 1979. ,
Shortest Paths with Bundles and Non-additive Weights Is Hard, CIAC 2013, vol.7878, pp.264-275, 2013. ,
Approximation algorithms and hardness results for labeled connectivity problems, Journal Combinatorial Optimization, vol.14, issue.4, pp.437-453, 2007. ,
Diverse routing in optical mesh networks, IEEE Transactions on, vol.51, issue.3, pp.489-494, 2003. ,
Vertex cover might be hard to approximate to within 2-epsilon, Journal of Computer and System Sciences, vol.74, issue.3, pp.335-349, 2008. ,
On the minimum label spanning tree problem. Information Processing Letters, vol.66, pp.81-85, 1998. ,
Learning from interpretations: a rooted kernel for ordered hypergraphs, Proceedings of the 24th international conference on Machine learning, pp.943-950, 2007. ,
Minimum-color path problems for reliability in mesh networks, INFOCOM 2005, vol.4, pp.2658-2669, 2005. ,
Approximation and hardness results for label cut and related problems, Journal Combinatorial Optimization, vol.21, issue.2, pp.192-208, 2011. ,