Laura A. Sanchis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Relating the size of a connected graph to its total and restricted domination numbers Discrete Mathematics	2004-08-06	Paper
On the number of edges in graphs with a given weakly connected domination number Discrete Mathematics	2002-12-02	Paper
On the frequency of occurrence of \(\alpha^i\) in the \(\alpha\)-expansions of the positive integers The Fibonacci Quarterly	2002-08-17	Paper
Experimental analysis of Heuristic algorithms for the dominating set problem Algorithmica	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 Journal of Heuristics	2001-01-01	Paper
On the number of edges in graphs with a given connected domination number Discrete Mathematics	2000-09-27	Paper
scientific article; zbMATH DE number 1391717 (Why is no real title available?)	2000-01-20	Paper
Bounds related to domination in graphs with minimum degree two	1997-07-15	Paper
scientific article; zbMATH DE number 956848 (Why is no real title available?)	1997-06-16	Paper
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem INFORMS Journal on Computing	1997-01-22	Paper
scientific article; zbMATH DE number 861339 (Why is no real title available?)	1996-08-13	Paper
Some results on characterizing the edges of connected graphs with a given domination number Discrete Mathematics	1995-10-23	Paper
CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION International Journal of Foundations of Computer Science	1995-07-19	Paper
Generating hard and diverse test sets for NP-hard graph problems Discrete Applied Mathematics	1995-05-17	Paper
scientific article; zbMATH DE number 742902 (Why is no real title available?)	1995-04-11	Paper
On the effective generation of set elements within specified ranges Mathematical Systems Theory	1993-12-06	Paper
Maximum number of edges in connected graphs with a given domination number Discrete Mathematics	1992-06-25	Paper
On the Efficient Generation of Language Instances SIAM Journal on Computing	1990-01-01	Paper
On the complexity of test case generation for NP-hard problems Information Processing Letters	1990-01-01	Paper
Multiple-way network partitioning IEEE Transactions on Computers	1989-01-01	Paper

Research outcomes over time

This page was built for person: Laura A. Sanchis