default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 150 matches
- 2024
- Shengminjie Chen, Donglei Du, Wenguo Yang, Suixiang Gao:
Maximizing stochastic set function under a matroid constraint from decomposition. J. Comb. Optim. 48(1): 3 (2024) - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Solving the Maximum Popular Matching Problem with Matroid Constraints. SIAM J. Discret. Math. 38(3): 2226-2242 (2024) - Hong Chang, Jing Jin, Zhicheng Liu, Donglei Du, Xiaoyan Zhang:
Two-stage BP maximization under p-matroid constraint. Theor. Comput. Sci. 994: 114469 (2024) - Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong:
Fairness in Submodular Maximization over a Matroid Constraint. AISTATS 2024: 1027-1035 - Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - Yusuke Kobayashi, Tatsuya Terao:
Subquadratic Submodular Maximization with a General Matroid Constraint. ICALP 2024: 100:1-100:19 - Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP 2024: 56:1-56:20 - Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. SWAT 2024: 22:1-22:16 - Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024) - Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. CoRR abs/2404.03979 (2024) - Naoyuki Kamiyama:
The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints. CoRR abs/2405.00342 (2024) - Yusuke Kobayashi, Tatsuya Terao:
Subquadratic Submodular Maximization with a General Matroid Constraint. CoRR abs/2405.00359 (2024) - Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024) - Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi:
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR abs/2407.09798 (2024) - Niv Buchbinder, Moran Feldman:
Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint. CoRR abs/2408.03583 (2024) - 2023
- Qingqin Nong, Zhijia Guo, Suning Gong:
Regularized Submodular Maximization With a k-Matroid Intersection Constraint. IEEE Access 11: 103830-103838 (2023) - Jinshan Zhang, Bo Tang, Jianwei Yin:
Exchange of indivisible goods under matroid constraints. Inf. Comput. 295(Part B): 105110 (2023) - Amitay Dror, Michal Feldman, Erel Segal-Halevi:
On Fair Division under Heterogeneous Matroid Constraints. J. Artif. Intell. Res. 76: 567-611 (2023) - Kemin Yu, Min Li, Yang Zhou, Qian Liu:
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. J. Comb. Optim. 45(3): 93 (2023) - Yu-Ran Gu, Chao Bian, Chao Qian:
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. AAAI 2023: 3959-3967 - Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. ICML 2023: 9150-9171 - Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. IJCAI 2023: 5558-5566 - Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. CoRR abs/2305.15118 (2023) - Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. CoRR abs/2307.07567 (2023) - Yu-Ran Gu, Chao Bian, Chao Qian:
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. CoRR abs/2307.09487 (2023) - Shuxian Niu, Qian Liu, Yang Zhou, Min Li:
Fast algorithms for k-submodular maximization subject to a matroid constraint. CoRR abs/2307.13996 (2023) - Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong:
Fairness in Submodular Maximization over a Matroid Constraint. CoRR abs/2312.14299 (2023) - 2022
- Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model. Oper. Res. 70(5): 2967-2981 (2022) - Yuni Iwamasa, Kenjiro Takazawa:
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. 194(1): 229-256 (2022)
skipping 120 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-26 03:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint