Остановите войну!
for scientists:
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 4,631 matches
- 2024
- Hassene Aissi, Ali Ridha Mahjoub:
On the minimum s-t cut problem with budget constraints. Math. Program. 203(1): 421-442 (2024) - Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer:
How many matchings cover the nodes of a graph? Math. Program. 203(1): 271-284 (2024) - Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez:
Weak notions of nondegeneracy in nonlinear semidefinite programming. Math. Program. 205(1): 1-32 (2024) - Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. Math. Program. 205(1): 745-771 (2024) - Galit Ashkenazi-Golan, Ilia Krasikov, Catherine Rainer, Eilon Solan:
Absorption paths and equilibria in quitting games. Math. Program. 203(1): 735-762 (2024) - Azam Asl, Haihao Lu, Jinwen Yang:
A J-symmetric quasi-newton method for minimax problems. Math. Program. 204(1): 207-254 (2024) - Jean-François Aujol, Charles Dossal, Aude Rondepierre:
FISTA is an automatic geometrically optimized algorithm for strongly convex functions. Math. Program. 204(1): 449-491 (2024) - Haris Aziz, Anton Baychkov, Péter Biró:
Cutoff stability under distributional constraints with an application to summer internship matching. Math. Program. 203(1): 247-269 (2024) - Haris Aziz, Bo Li, Xiaowei Wu:
Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Math. Program. 203(1): 319-345 (2024) - Mourad Baïou, José Correa, Rida Laraki:
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski. Math. Program. 203(1): 1-7 (2024) - Elizabeth Baldwin, Martin Bichler, Maximilian Fichtl, Paul Klemperer:
Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices. Math. Program. 203(1): 611-643 (2024) - Michel Balinski, Victoriano Ramirez:
Why webster? Math. Program. 203(1): 239-246 (2024) - Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem, Luiz-Rafael Santos:
On the centralization of the circumcentered-reflection method. Math. Program. 205(1): 337-371 (2024) - Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. Math. Program. 203(1): 369-420 (2024) - Dimitris Bertsimas, Stefan C. M. ten Eikelder, Dick den Hertog, Nikolaos Trichakis:
Pareto Adaptive Robust Optimality via a Fourier-Motzkin Elimination lens. Math. Program. 205(1): 485-538 (2024) - Jérôme Bolte, Laurent Miclo, Stéphane Villeneuve:
Swarm gradient dynamics for global optimization: the mean-field limit case. Math. Program. 205(1): 661-701 (2024) - Digvijay Boob, Cristóbal Guzmán:
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems. Math. Program. 204(1): 255-297 (2024) - Etienne Boursier, Vianney Perchet:
Utility/privacy trade-off as regularized optimal transport. Math. Program. 203(1): 703-726 (2024) - Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation algorithms for flexible graph connectivity. Math. Program. 204(1): 493-516 (2024) - Kristian Bredies, Marcello Carioni, Silvio Fanzon, Daniel Walter:
Asymptotic linear convergence of fully-corrective generalized conditional gradient methods. Math. Program. 205(1): 135-202 (2024) - Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's voting methods and justified representation. Math. Program. 203(1): 47-76 (2024) - Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-based apportionment. Math. Program. 203(1): 77-105 (2024) - Ivonne Callejas, Srihari Govindan, Lucas Pahl:
A finite characterization of perfect equilibria. Math. Program. 203(1): 727-734 (2024) - Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. Math. Program. 203(1): 901-930 (2024) - Ioannis Caragiannis, Aris Filos-Ratsikas, Swaprava Nath, Alexandros A. Voudouris:
Truthful ownership transfer with expert advice. Math. Program. 203(1): 871-900 (2024) - Andrei Comaneci, Michael Joswig:
Tropical medians by transportation. Math. Program. 205(1): 813-839 (2024) - Roberto Cominetti, Valerio Dose, Marco Scarsini:
The price of anarchy in routing games as a function of the demand. Math. Program. 203(1): 531-558 (2024) - Frank E. Curtis, Michael O'Neill, Daniel P. Robinson:
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. Math. Program. 205(1): 431-483 (2024) - Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh:
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. 204(1): 135-206 (2024) - Gabrielle Demange:
On the resolution of cross-liabilities. Math. Program. 203(1): 827-856 (2024)
skipping 4,601 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-05-08 18:55 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