Laura A. Sanchis

21 papers C 1Journal 18Unranked 2
YearRankTypeTitle / Venue / Authors
2004 J jnl
Relating the size of a connected graph to its total and restricted domination numbers.
Discret. Math.
Laura A. Sanchis
2002 J jnl
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.
Algorithmica
Laura A. Sanchis
2002 J jnl
On the number of edges in graphs with a given weakly connected domination number.
Discret. Math.
Laura A. Sanchis
2001 J jnl
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique.
J. Heuristics
Arun Jagota, Laura A. Sanchis
2001 J jnl
Computer laboratories for the theory of computing course.
J. Comput. Sci. Coll.
Laura A. Sanchis
2000 J jnl
On the number of edges in graphs with a given connected domination number.
Discret. Math.
Laura A. Sanchis
1997 J jnl
Bounds related to domination in graphs with minimum degree two.
J. Graph Theory
Laura A. Sanchis
1996 J jnl
Parallel Algorithms for Counting and Randomly Generating Integer Partitions.
J. Parallel Distributed Comput.
Laura A. Sanchis, Matthew B. Squire
1996 J jnl
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem.
INFORMS J. Comput.
Laura A. Sanchis, Arun Jagota
1995 J jnl
Generating Hard and Diverse Test Sets for NP-hard Graph Problems.
Discret. Appl. Math.
Laura A. Sanchis
1995 J jnl
Some results on characterizing the edges of connected graphs with a given domination number.
Discret. Math.
Laura A. Sanchis
1994 J jnl
Constructing Language Instances Based on Partial Information.
Int. J. Found. Comput. Sci.
Laura A. Sanchis
1993 — conf
Approximately solving Maximum Clique using neural network and related heuristics.
Cliques, Coloring, and Satisfiability
Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan
1993 J jnl
Multiple-Way Network Partitioning with Different Cost Functions.
IEEE Trans. Computers
Laura A. Sanchis
1993 J jnl
On the Effective Generation of Set Elements Within Specified Ranges.
Math. Syst. Theory
Laura A. Sanchis
1992 C conf
Counting and Generating Integer Partitions in Parallel.
ICCI
Laura A. Sanchis
1992 — conf
Test Case Construction for the Vertex Cover Problem.
Computational Support for Discrete Mathematics
Laura A. Sanchis
1991 J jnl
Maximum number of edges in connected graphs with a given domination number.
Discret. Math.
Laura A. Sanchis
1990 J jnl
On the Complexity of Test Case Generation for NP-Hard Problems.
Inf. Process. Lett.
Laura A. Sanchis
1990 J jnl
On the Efficient Generation of Language Instances.
SIAM J. Comput.
Laura A. Sanchis, Mark A. Fulk
1989 J jnl
Multiple-Way Network Partitioning.
IEEE Trans. Computers
Laura A. Sanchis