The following pages link to Clément Dallard (Q1635705):
Displaying 24 items.
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Treewidth versus clique number in graph classes with a forbidden structure (Q2110610) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Complexity of scheduling for DARP with soft ride times (Q2294048) (← links)
- Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs (Q2301740) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- (Q6087216) (← links)
- Functionality of box intersection graphs (Q6140059) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure (Q6403600) (← links)
- Detecting $K_{2,3}$ as an induced minor (Q6521576) (← links)
- Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star (Q6522235) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- On constrained intersection representations of graphs and digraphs (Q6602458) (← links)
- Finding \(k\)-community structures in special graph classes (Q6633530) (← links)
- Sufficient conditions for polynomial-time detection of induced minors (Q6760505) (← links)
