default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictoria G. Crawford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Wenjing Chen, Victoria G. Crawford:
Linear Submodular Maximization with Bandit Feedback. CoRR abs/2407.02601 (2024)- [i9]Wenjing Chen, Shuo Xing, Samson Zhou, Victoria G. Crawford:
Fair Submodular Cover. CoRR abs/2407.04804 (2024) - 2023
- [c10]Victoria G. Crawford:
Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover. AISTATS 2023: 9517-9537 - [c9]Wenjing Chen, Victoria G. Crawford:
Bicriteria Approximation Algorithms for the Submodular Cover Problem. NeurIPS 2023 - [i8]Wenjing Chen, Victoria G. Crawford:
Bicriteria Approximation Algorithms for the Submodular Cover Problem. CoRR abs/2309.14558 (2023) - [i7]Wenjing Chen, Shuo Xing, Victoria G. Crawford:
A Threshold Greedy Algorithm for Noisy Submodular Maximization. CoRR abs/2312.00155 (2023) - 2021
- [c8]Victoria G. Crawford:
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions. IJCAI 2021: 1661-1667 - [i6]Victoria G. Crawford:
Streaming Based Bicriteria Approximation Algorithms for Submodular Optimization. CoRR abs/2112.09985 (2021)
2010 – 2019
- 2019
- [j3]Alan Kuhnle
, Victoria G. Crawford, My T. Thai:
Scalable approximations to k-cycle transversal problems on dynamic networks. Knowl. Inf. Syst. 61(1): 65-84 (2019) - [c7]Victoria G. Crawford, Alan Kuhnle, My T. Thai:
Submodular Cost Submodular Cover with an Approximate Oracle. ICML 2019: 1426-1435 - [c6]Victoria G. Crawford:
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover. IJCAI 2019: 1227-1233 - [i5]Victoria G. Crawford, Alan Kuhnle, My T. Thai:
Submodular Cost Submodular Cover with an Approximate Oracle. CoRR abs/1908.00653 (2019) - [i4]Victoria G. Crawford:
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover. CoRR abs/1908.01029 (2019) - [i3]Victoria G. Crawford, Alan Kuhnle:
Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions. CoRR abs/1908.01230 (2019) - 2018
- [j2]Victoria G. Crawford, Alan Kuhnle, Christina Boucher, Rayan Chikhi, Travis Gagie:
Practical dynamic de Bruijn graphs. Bioinform. 34(24): 4189-4195 (2018) - [j1]Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 4:1-4:26 (2018) - [c5]Alan Kuhnle, J. David Smith, Victoria G. Crawford, My T. Thai:
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice. ICML 2018: 2791-2800 - [c4]Victoria G. Crawford, Alan Kuhnle, Md Abdul Alim, My T. Thai:
Space-Efficient and Dynamic Caching for D2D Networks of Heterogeneous Users. MASS 2018: 317-325 - [c3]Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. SIGMETRICS (Abstracts) 2018: 81-83 - [i2]Alan Kuhnle, J. David Smith, Victoria G. Crawford, My T. Thai:
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice. CoRR abs/1805.06990 (2018) - 2017
- [c2]Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks. ICDM 2017: 237-246 - [c1]Alan Kuhnle, Tianyi Pan, Victoria G. Crawford, Md Abdul Alim, My T. Thai:
Pseudo-Separation for Assessment of Structural Vulnerability of a Network. SIGMETRICS (Abstracts) 2017: 13-14 - [i1]Alan Kuhnle, Tianyi Pan, Victoria G. Crawford, Md Abdul Alim, My T. Thai:
Pseudo-Separation for Assessment of Structural Vulnerability of a Network. CoRR abs/1704.04555 (2017)
Coauthor Index
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-08-13 20: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:
