default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura A. Sanchis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j17]Laura A. Sanchis:
Relating the size of a connected graph to its total and restricted domination numbers. Discret. Math. 283(1-3): 205-216 (2004)- 2002
- [j16]Laura A. Sanchis:
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem. Algorithmica 33(1): 3-18 (2002) - [j15]Laura A. Sanchis:
On the number of edges in graphs with a given weakly connected domination number. Discret. Math. 257(1): 111-124 (2002) - 2001
- [j14]Arun Jagota, Laura A. Sanchis:
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. J. Heuristics 7(6): 565-585 (2001) - 2000
- [j13]Laura A. Sanchis:
On the number of edges in graphs with a given connected domination number. Discret. Math. 214(1-3): 193-210 (2000)
1990 – 1999
- 1997
- [j12]Laura A. Sanchis:
Bounds related to domination in graphs with minimum degree two. J. Graph Theory 25(2): 139-152 (1997) - 1996
- [j11]Laura A. Sanchis, Arun Jagota:
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem. INFORMS J. Comput. 8(2): 87-102 (1996) - [j10]Laura A. Sanchis, Matthew B. Squire:
Parallel Algorithms for Counting and Randomly Generating Integer Partitions. J. Parallel Distributed Comput. 34(1): 29-35 (1996) - 1995
- [j9]Laura A. Sanchis:
Generating Hard and Diverse Test Sets for NP-hard Graph Problems. Discret. Appl. Math. 58(1): 35-66 (1995) - [j8]Laura A. Sanchis:
Some results on characterizing the edges of connected graphs with a given domination number. Discret. Math. 140(1-3): 149-166 (1995) - 1994
- [j7]Laura A. Sanchis:
Constructing Language Instances Based on Partial Information. Int. J. Found. Comput. Sci. 5(2): 209-229 (1994) - 1993
- [j6]Laura A. Sanchis:
On the Effective Generation of Set Elements Within Specified Ranges. Math. Syst. Theory 26(4): 327-341 (1993) - [j5]Laura A. Sanchis:
Multiple-Way Network Partitioning with Different Cost Functions. IEEE Trans. Computers 42(12): 1500-1504 (1993) - [c3]Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan:
Approximately solving Maximum Clique using neural network and related heuristics. Cliques, Coloring, and Satisfiability 1993: 169-204 - 1992
- [c2]Laura A. Sanchis:
Test Case Construction for the Vertex Cover Problem. Computational Support for Discrete Mathematics 1992: 315-326 - [c1]Laura A. Sanchis:
Counting and Generating Integer Partitions in Parallel. ICCI 1992: 54-57 - 1991
- [j4]Laura A. Sanchis:
Maximum number of edges in connected graphs with a given domination number. Discret. Math. 87(1): 65-72 (1991) - 1990
- [j3]Laura A. Sanchis:
On the Complexity of Test Case Generation for NP-Hard Problems. Inf. Process. Lett. 36(3): 135-140 (1990) - [j2]Laura A. Sanchis, Mark A. Fulk:
On the Efficient Generation of Language Instances. SIAM J. Comput. 19(2): 281-296 (1990)
1980 – 1989
- 1989
- [j1]Laura A. Sanchis:
Multiple-Way Network Partitioning. IEEE Trans. Computers 38(1): 62-81 (1989)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
