Laura A. Sanchis

From MaRDI portal
Person:241138

Available identifiers

zbMath Open sanchis.laura-aMaRDI QIDQ241138

List of research outcomes





PublicationDate of PublicationType
Relating the size of a connected graph to its total and restricted domination numbers2004-08-06Paper
On the number of edges in graphs with a given weakly connected domination number2002-12-02Paper
On the frequency of occurrence of \(\alpha^i\) in the \(\alpha\)-expansions of the positive integers2002-08-17Paper
Experimental analysis of Heuristic algorithms for the dominating set problem2002-06-17Paper
Some complexity issues involved in the construction of test cases for NP-hard problems2001-09-18Paper
Adaptive, restart, randomized greedy heuristics for maximum clique2001-01-01Paper
On the number of edges in graphs with a given connected domination number2000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49360582000-01-20Paper
Bounds related to domination in graphs with minimum degree two1997-07-15Paper
https://portal.mardi4nfdi.de/entity/Q56872551997-06-16Paper
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem1997-01-22Paper
https://portal.mardi4nfdi.de/entity/Q48710641996-08-13Paper
Some results on characterizing the edges of connected graphs with a given domination number1995-10-23Paper
CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION1995-07-19Paper
Generating hard and diverse test sets for NP-hard graph problems1995-05-17Paper
https://portal.mardi4nfdi.de/entity/Q47633411995-04-11Paper
On the effective generation of set elements within specified ranges1993-12-06Paper
Maximum number of edges in connected graphs with a given domination number1992-06-25Paper
On the Efficient Generation of Language Instances1990-01-01Paper
On the complexity of test case generation for NP-hard problems1990-01-01Paper
Multiple-way network partitioning1989-01-01Paper

Research outcomes over time

This page was built for person: Laura A. Sanchis