Laura A. Sanchis

According to our database1, Laura A. Sanchis authored at least 20 papers between 1989 and 2004.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
Relating the size of a connected graph to its total and restricted domination numbers.
Discret. Math., 2004

2002
On the number of edges in graphs with a given weakly connected domination number.
Discret. Math., 2002

Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.
Algorithmica, 2002

2001
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique.
J. Heuristics, 2001

2000
On the number of edges in graphs with a given connected domination number.
Discret. Math., 2000

1997
Bounds related to domination in graphs with minimum degree two.
J. Graph Theory, 1997

1996
Parallel Algorithms for Counting and Randomly Generating Integer Partitions.
J. Parallel Distributed Comput., 1996

Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem.
INFORMS J. Comput., 1996

1995
Some results on characterizing the edges of connected graphs with a given domination number.
Discret. Math., 1995

Generating Hard and Diverse Test Sets for NP-hard Graph Problems.
Discret. Appl. Math., 1995

1994
Constructing Language Instances Based on Partial Information.
Int. J. Found. Comput. Sci., 1994

1993
Multiple-Way Network Partitioning with Different Cost Functions.
IEEE Trans. Computers, 1993

On the Effective Generation of Set Elements Within Specified Ranges.
Math. Syst. Theory, 1993

Approximately solving Maximum Clique using neural network and related heuristics.
Proceedings of the Cliques, 1993

1992
Counting and Generating Integer Partitions in Parallel.
Proceedings of the Computing and Information, 1992

Test Case Construction for the Vertex Cover Problem.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1991
Maximum number of edges in connected graphs with a given domination number.
Discret. Math., 1991

1990
On the Efficient Generation of Language Instances.
SIAM J. Comput., 1990

On the Complexity of Test Case Generation for NP-Hard Problems.
Inf. Process. Lett., 1990

1989
Multiple-Way Network Partitioning.
IEEE Trans. Computers, 1989


  Loading...