37 results on '"Bonnet, Édouard"'
Search Results
2. Maximum Matchings in Geometric Intersection Graphs
3. Twin-Width IV: Ordered Graphs and Matrices.
4. Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
5. Twin-width II: small classes
6. Neighbourhood complexity of graphs of bounded twin-width
7. Grundy Coloring and Friends, Half-Graphs, Bicliques
8. Twin-width and Polynomial Kernels
9. Twin-width can be exponential in treewidth
10. The complexity of mixed-connectivity
11. Metric Dimension Parameterized By Treewidth
12. The Inverse Voronoi Problem in Graphs II: Trees
13. TWIN-WIDTH AND PERMUTATIONS.
14. The Inverse Voronoi Problem in Graphs I: Hardness
15. Parameterized Complexity of Independent Set in H-Free Graphs
16. Complexity of Grundy coloring and its variants
17. Purely combinatorial approximation algorithms for maximum [formula omitted]-vertex cover in bipartite graphs
18. Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
19. Optimality Program in Segment and String Graphs
20. The Graph Motif problem parameterized by the structure of the input graph
21. Twin-width I: Tractable FO Model Checking.
22. Complexity of Token Swapping and Its Variants
23. Parameterized Intractability of Even Set and Shortest Vector Problem.
24. EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.
25. Sparsification and subexponential approximation
26. Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
27. 4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n4/3.
28. Parameterized Hardness of Art Gallery Problems.
29. Designing RNA Secondary Structures Is Hard.
30. Parameterized (in)approximability of subset problems
31. Time-approximation trade-offs for inapproximable problems.
32. Sparsification and subexponential approximation.
33. On the complexity of various parameterizations of common induced subgraph isomorphism.
34. On the complexity of connection games.
35. A Note on Edge Isoperimetric Numbers and Regular Graphs.
36. PARAMETERIZED EXACT AND APPROXIMATION ALGORITHMS FOR MAXIMUM κ-SET COVER AND RELATED SATISFIABILITY PROBLEMS.
37. 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.