The following pages link to Jean-François Culus (Q319197):
Displayed 9 items.
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- 2 CSPs all are approximable within a constant differential factor (Q1661912) (← links)
- How far from a worst solution a random solution of a \(k\,\)CSP instance can be? (Q1671024) (← links)
- About some robustness and complexity properties of \(G\)-graphs networks (Q2255041) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- Tournaments without acyclic interval. (Q2573972) (← links)
- (Q2861543) (← links)
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs (Q5452164) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897986) (← links)