Остановите войну!
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 24 matches
- 2009
- William J. Cook, László Lovász, Jens Vygen:
Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany. Springer 2009, ISBN 978-3-540-76795-4 [contents] - 2008
- Mourad Baïou, Francisco Barahona:
On the Location and p-Median Polytopes. Bonn Workshop of Combinatorial Optimization 2008: 1-31 - Sylvia C. Boyd, William R. Pulleyblank:
Facet Generating Techniques. Bonn Workshop of Combinatorial Optimization 2008: 33-55 - Vasek Chvátal:
Antimatroids, Betweenness, Convexity. Bonn Workshop of Combinatorial Optimization 2008: 57-64 - Jack Edmonds:
Euler Complexes. Bonn Workshop of Combinatorial Optimization 2008: 65-68 - Jean Fonlupt, Alexandre Skoda:
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid. Bonn Workshop of Combinatorial Optimization 2008: 69-85 - András Frank, Tamás Király:
A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization 2008: 87-126 - Satoru Fujishige:
Theory of Principal Partitions Revisited. Bonn Workshop of Combinatorial Optimization 2008: 127-162 - Frank Göring, Jochen Harant:
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach. Bonn Workshop of Combinatorial Optimization 2008: 163-183 - Stefan Hougardy:
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems. Bonn Workshop of Combinatorial Optimization 2008: 185-200 - T. C. Hu, Leo Landa, Man-tak Shing:
The Unbounded Knapsack Problem. Bonn Workshop of Combinatorial Optimization 2008: 201-217 - Kazuo Murota:
Recent Developments in Discrete Convex Analysis. Bonn Workshop of Combinatorial Optimization 2008: 219-260 - Guyslain Naves, András Sebö:
Multiflow Feasibility: An Annotated Tableau. Bonn Workshop of Combinatorial Optimization 2008: 261-283 - Jaroslav Nesetril:
Many Facets of Dualities. Bonn Workshop of Combinatorial Optimization 2008: 285-302 - Michael D. Plummer:
On the Structure of Graphs Vertex Critical with Respect to Connected Domination. Bonn Workshop of Combinatorial Optimization 2008: 303-315 - Yves Pochet, Mathieu Van Vyve:
LS-LIB: A Library of Tools for Solving Production Planning Problems. Bonn Workshop of Combinatorial Optimization 2008: 317-346 - Lionel Pournin, Thomas M. Liebling:
From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis. Bonn Workshop of Combinatorial Optimization 2008: 347-363 - Myriam Preissmann, András Sebö:
Graphic Submodular Function Minimization: A Graphic Approach and Applications. Bonn Workshop of Combinatorial Optimization 2008: 365-385 - András Recski:
Matroids - the Engineers' Revenge. Bonn Workshop of Combinatorial Optimization 2008: 387-398 - Andreas S. Schulz:
On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming. Bonn Workshop of Combinatorial Optimization 2008: 399-428 - F. Bruce Shepherd:
Single-Sink Multicommodity Flow with Side Constraints. Bonn Workshop of Combinatorial Optimization 2008: 429-450 - Martin Skutella:
An Introduction to Network Flows over Time. Bonn Workshop of Combinatorial Optimization 2008: 451-482 - Zoltán Szigeti:
Edge-Connectivity Augmentations of Graphs and Hypergraphs. Bonn Workshop of Combinatorial Optimization 2008: 483-521 - Dominic Welsh:
Some Problems on Approximate Counting in Graphs and Matroids. Bonn Workshop of Combinatorial Optimization 2008: 523-544
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-06-01 06:15 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