Остановите войну!
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 35 matches
- 2010
- Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain:
A 3-Approximation for Facility Location with Uniform Capacities. IPCO 2010: 149-162 - Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi:
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO 2010: 397-410 - Kent Andersen, Robert Weismantel:
Zero-Coefficient Cuts. IPCO 2010: 57-70 - Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 - Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
On k-Column Sparse Packing Programs. IPCO 2010: 369-382 - Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95 - Siavosh Benabbas, Avner Magen:
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain. IPCO 2010: 299-312 - Kristóf Bérczi, László A. Végh:
Restricted b-Matchings in Degree-Bounded Graphs. IPCO 2010: 43-56 - Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang:
The Price of Collusion in Series-Parallel Networks. IPCO 2010: 313-326 - Daniel Bienstock:
Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. IPCO 2010: 29-42 - Daniel Bienstock, Mark Zuckerberg:
Solving LP Relaxations of Large-Scale Precedence Constrained Problems. IPCO 2010: 1-14 - Andreas Bley, Jose Neto:
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. IPCO 2010: 205-218 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO 2010: 341-354 - Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary Problems via Linear Programming. IPCO 2010: 163-176 - Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298 - Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy:
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO 2010: 244-257 - Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann:
On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368 - Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396 - Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
Experiments with Two Row Tableau Cuts. IPCO 2010: 424-437 - Santanu S. Dey, Juan Pablo Vielma:
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. IPCO 2010: 327-340 - Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on a Single Machine. IPCO 2010: 230-243 - Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli:
Hitting Diamonds and Growing Cacti. IPCO 2010: 191-204 - Takuro Fukunaga:
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. IPCO 2010: 15-28 - MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84 - Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. IPCO 2010: 219-229 - Klaus Jansen, Roberto Solis-Oba:
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. IPCO 2010: 438-449 - Volker Kaibel, Andreas Loos:
Branched Polyhedral Systems. IPCO 2010: 177-190 - Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for the Sizes of Extended Formulations. IPCO 2010: 135-148 - Lap Chi Lau, Chun Kong Yung:
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. IPCO 2010: 96-109 - Adam N. Letchford:
Integer Quadratic Quasi-polyhedra. IPCO 2010: 258-270
skipping 5 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-27 12:04 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