The following pages link to Laura A. Sanchis (Q241138):
Displaying 22 items.
- On the complexity of test case generation for NP-hard problems (Q917311) (← links)
- Maximum number of edges in connected graphs with a given domination number (Q1174141) (← links)
- (Q1600993) (redirect page) (← links)
- Experimental analysis of Heuristic algorithms for the dominating set problem (Q1600994) (← links)
- Generating hard and diverse test sets for NP-hard graph problems (Q1805463) (← links)
- Relating the size of a connected graph to its total and restricted domination numbers (Q1827789) (← links)
- On the number of edges in graphs with a given weakly connected domination number (Q1849997) (← links)
- Some results on characterizing the edges of connected graphs with a given domination number (Q1893172) (← links)
- On the number of edges in graphs with a given connected domination number (Q1972141) (← links)
- (Q2719873) (← links)
- (Q2743977) (← links)
- On the Efficient Generation of Language Instances (Q3034825) (← links)
- On the effective generation of set elements within specified ranges (Q3141999) (← links)
- Multiple-way network partitioning (Q3495206) (← links)
- CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION (Q4327840) (← links)
- Bounds related to domination in graphs with minimum degree two (Q4344216) (← links)
- (Q4763341) (← links)
- (Q4871064) (← links)
- (Q4936058) (← links)
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem (Q5284217) (← links)
- (Q5687255) (← links)
- Adaptive, restart, randomized greedy heuristics for maximum clique (Q5960736) (← links)
