default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Santiago
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Martin Nägele
, Richard Santiago, Rico Zenklusen:
Congruency-Constrained TU Problems Beyond the Bimodular Case. Math. Oper. Res. 49(3): 1303-1348 (2024)- [c11]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. SODA 2024: 1278-1306 - 2023
- [j1]Danish Kashaev, Richard Santiago:
A simple optimal contention resolution scheme for uniform matroids. Theor. Comput. Sci. 940(Part): 81-96 (2023) - [c10]Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen:
Advances on Strictly $\varDelta $-Modular IPs. IPCO 2023: 393-407 - [c9]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. IPCO 2023: 423-437 - [c8]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. SOSA 2023: 84-95 - [i11]Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen:
Advances on Strictly Δ-Modular IPs. CoRR abs/2302.07029 (2023) - [i10]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. CoRR abs/2305.05353 (2023) - 2022
- [c7]Martin Nägele, Richard Santiago, Rico Zenklusen:
Congruency-Constrained TU Problems Beyond the Bimodular Case. SODA 2022: 2743-2790 - [i9]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. CoRR abs/2211.15146 (2022) - 2021
- [c6]Richard Santiago, Danish Kashaev:
A Simple Optimal Contention Resolution Scheme for Uniform Matroids. ICTCS 2021: 27-39 - [c5]Richard Santiago:
New Approximations and Hardness Results for Submodular Partitioning Problems. IWOCA 2021: 516-530 - [c4]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization via One-Sided Smoothness. SODA 2021: 1006-1025 - [i8]Danish Kashaev, Richard Santiago:
An Optimal Monotone Contention Resolution Scheme for Uniform and Partition Matroids. CoRR abs/2105.11992 (2021) - [i7]Martin Nägele, Richard Santiago, Rico Zenklusen:
Congruency-Constrained TU Problems Beyond the Bimodular Case. CoRR abs/2109.03148 (2021) - 2020
- [c3]Richard Santiago, Yuichi Yoshida:
Weakly Submodular Function Maximization Using Local Submodularity Ratio. ISAAC 2020: 64:1-64:17 - [i6]Richard Santiago, Yuichi Yoshida:
Weakly Submodular Function Maximization Using Local Submodularity Ratio. CoRR abs/2004.14650 (2020) - [i5]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. CoRR abs/2006.13754 (2020) - [i4]Richard Santiago:
New Approximations and Hardness Results for Submodular Partitioning Problems. CoRR abs/2006.14312 (2020)
2010 – 2019
- 2019
- [c2]Richard Santiago, F. Bruce Shepherd:
Multivariate Submodular Optimization. ICML 2019: 5599-5609 - [i3]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization. CoRR abs/1904.09216 (2019) - 2018
- [c1]Richard Santiago, F. Bruce Shepherd:
Multi-Agent Submodular Optimization. APPROX-RANDOM 2018: 23:1-23:20 - [i2]Richard Santiago, F. Bruce Shepherd:
Multi-Agent Submodular Optimization. CoRR abs/1803.03767 (2018) - 2016
- [i1]Richard Santiago, F. Bruce Shepherd:
Multi-Agent and Multivariate Submodular Optimization. CoRR abs/1612.05222 (2016)
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-09-21 23:38 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:
