![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 22 matches
- 2015
- Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154(1-2): 3-28 (2015) - Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of trees for capacitated k-center. Math. Program. 154(1-2): 29-53 (2015) - Alejandro Angulo Cardenas
, Daniel Espinoza, Rodrigo Palma
:
Sequence independent lifting for mixed knapsack problems with GUB constraints. Math. Program. 154(1-2): 55-80 (2015) - Gennadiy Averkov, Amitabh Basu
:
Lifting properties of maximal lattice-free polyhedra. Math. Program. 154(1-2): 81-111 (2015) - Manish Bansal
, Kiavash Kianfar:
n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem. Math. Program. 154(1-2): 113-144 (2015) - Nikhil Bansal, Viswanath Nagarajan:
On the adaptivity gap of stochastic orienteering. Math. Program. 154(1-2): 145-172 (2015) - Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding small stabilizers for unstable graphs. Math. Program. 154(1-2): 173-196 (2015) - Pierre Bonami, François Margot:
Cut generation through binarization. Math. Program. 154(1-2): 197-223 (2015) - Amit Chakrabarti
, Sagar Kale
:
Submodular maximization meets streaming: matchings, matroids, and more. Math. Program. 154(1-2): 225-247 (2015) - Chandra Chekuri, Alina Ene:
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. 154(1-2): 249-272 (2015) - Michele Conforti, Alberto Del Pia
, Marco Di Summa, Yuri Faenza:
Reverse split rank. Math. Program. 154(1-2): 273-303 (2015) - José Correa, Alberto Marchetti-Spaccamela
, Jannik Matuschke
, Leen Stougie, Ola Svensson, Víctor Verdugo
, José Verschae:
Strong LP formulations for scheduling splittable jobs on unrelated machines. Math. Program. 154(1-2): 305-328 (2015) - Santanu S. Dey
, Marco Molinaro, Qianyi Wang:
Approximating polyhedra with sparse inequalities. Math. Program. 154(1-2): 329-352 (2015) - Chien-Chung Huang, Telikepalli Kavitha:
Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. 154(1-2): 353-380 (2015) - Volker Kaibel, Matthias Walter
:
Simple extensions of polytopes. Math. Program. 154(1-2): 381-406 (2015) - Volker Kaibel, Stefan Weltge
:
Lower bounds on the sizes of integer programs without additional variables. Math. Program. 154(1-2): 407-425 (2015) - Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson:
On the configuration LP for maximum budgeted allocation. Math. Program. 154(1-2): 427-462 (2015) - Fatma Kilinç-Karzan, Sercan Yildiz
:
Two-term disjunctions on the second-order cone. Math. Program. 154(1-2): 463-491 (2015) - Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-sided placements: generalizing generalized assignment. Math. Program. 154(1-2): 493-514 (2015) - Lap Chi Lau, Hong Zhou:
A unified algorithm for degree bounded survivable network design. Math. Program. 154(1-2): 515-532 (2015) - Jon Lee, Jens Vygen:
Preface. Math. Program. 154(1-2): 1-2 (2015) - Matthias Mnich
, Andreas Wiese
:
Scheduling and fixed-parameter tractability. Math. Program. 154(1-2): 533-562 (2015)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-19 01:40 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