8 results on '"Bonnet, Édouard"'
Search Results
2. Complexity of Grundy coloring and its variants
3. Purely combinatorial approximation algorithms for maximum [formula omitted]-vertex cover in bipartite graphs
4. The Graph Motif problem parameterized by the structure of the input graph
5. Parameterized (in)approximability of subset problems
6. On the complexity of various parameterizations of common induced subgraph isomorphism.
7. On the complexity of connection games.
8. Species-specific isoconversion effective activation energies derived by thermogravimetry–mass spectrometry
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.