Laura A. Sanchis

Available identifiers

zbMath Open sanchis.laura-aMaRDI QIDQ241138

List of research outcomes

Publication	Date of Publication	Type
Relating the size of a connected graph to its total and restricted domination numbers	2004-08-06	Paper
On the number of edges in graphs with a given weakly connected domination number	2002-12-02	Paper
On the frequency of occurrence of \(\alpha^i\) in the \(\alpha\)-expansions of the positive integers	2002-08-17	Paper
Experimental analysis of Heuristic algorithms for the dominating set problem	2002-06-17	Paper
Some complexity issues involved in the construction of test cases for NP-hard problems	2001-09-18	Paper
Adaptive, restart, randomized greedy heuristics for maximum clique	2001-01-01	Paper
On the number of edges in graphs with a given connected domination number	2000-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4936058	2000-01-20	Paper
Bounds related to domination in graphs with minimum degree two	1997-07-15	Paper
https://portal.mardi4nfdi.de/entity/Q5687255	1997-06-16	Paper
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem	1997-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q4871064	1996-08-13	Paper
Some results on characterizing the edges of connected graphs with a given domination number	1995-10-23	Paper
CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION	1995-07-19	Paper
Generating hard and diverse test sets for NP-hard graph problems	1995-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q4763341	1995-04-11	Paper
On the effective generation of set elements within specified ranges	1993-12-06	Paper
Maximum number of edges in connected graphs with a given domination number	1992-06-25	Paper
On the Efficient Generation of Language Instances	1990-01-01	Paper
On the complexity of test case generation for NP-hard problems	1990-01-01	Paper
Multiple-way network partitioning	1989-01-01	Paper

Research outcomes over time

This page was built for person: Laura A. Sanchis