Остановите войну!
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 36 matches
- 1993
- Florin Avram, Dimitris Bertsimas:
On a characterization of the minimum assignment and matching in the independent random model. IPCO 1993: 161-169 - Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. IPCO 1993: 23-38 - Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices. IPCO 1993: 1-9 - Dimitris Bertsimas, José Niño-Mora:
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. IPCO 1993: 355-384 - E. Andrew Boyd:
Solving integer programs with Fenchel cutting planes and preprocessing. IPCO 1993: 209-220 - Jean-Maurice Clochard, Denis Naddef:
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. IPCO 1993: 291-311 - Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter:
Dynamic algorithms for optimization problems in bounded tree-width graphs. IPCO 1993: 99-112 - Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. IPCO 1993: 57-74 - Anna Galluccio, Martin Loebl:
Cycles of prescribed modularity in planar digraphs. IPCO 1993: 113-127 - Naveen Garg, Vijay V. Vazirani:
A polyhedron with all s-t cuts as vertices, and adjacency of cuts. IPCO 1993: 281-289 - Michel X. Goemans, David P. Williamson:
A new \frac34-approximation algorithm for MAX SAT. IPCO 1993: 313-321 - Andrew V. Goldberg:
An efficient implementation of a scaling minimum-cost flow algorithm. IPCO 1993: 251-266 - Frieda Granot, Michal Penn:
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO 1993: 235-249 - Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes. IPCO 1993: 447-461 - Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 - J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. IPCO 1993: 195-208 - Mark Jerrum:
An analysis of a Monte Carlo algorithm for estimating the permanent. IPCO 1993: 171-182 - Tibor Jordán:
Optimal and almost optimal algorithms for connectivity augmentation problems. IPCO 1993: 75-88 - Michael Jünger, Petra Mutzel:
Solving the maximum weight planar subgraph. IPCO 1993: 479-492 - Ravi Kannan:
Optimal solution and value of parametric integer programs. IPCO 1993: 11-21 - Hans Kellerer, Franz Rendl, Gerhard J. Woeginger:
Computing the optimum stock size. IPCO 1993: 147-159 - Samir Khuller, Uzi Vishkin, Neal E. Young:
A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993: 333-341 - Philip N. Klein, R. Ravi:
When cycles collapse: A general approximation technique for constrained two-connectivity problems. IPCO 1993: 39-55 - Philip N. Klein, R. Ravi:
A nearly best-possible approximation algorithm for node-weighted Steiner trees. IPCO 1993: 323-332 - Michael Lomonosov, András Sebö:
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. IPCO 1993: 221-234 - S. Thomas McCormick, Thomas R. Ervolina:
Canceling most helpful total submodular cuts for submodular flow. IPCO 1993: 343-353 - Rudolf Müller:
On the transitive acyclic subdigraph polytope. IPCO 1993: 463-477 - Masataka Nakamura:
Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme. IPCO 1993: 401-412 - Shin-Ichi Nakano, Takao Nishizeki:
Nearly uniform scheduling of file transfers. IPCO 1993: 425-431 - William R. Pulleyblank, F. Bruce Shepherd:
Formulations for the stable set polytope of a claw-free graph. IPCO 1993: 267-279
skipping 6 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-23 11:44 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