Остановите войну!
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 34 matches
- 2023
- Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro:
Information Complexity of Mixed-Integer Convex Optimization. IPCO 2023: 1-13 - Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg:
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. IPCO 2023: 14-28 - Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev:
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. IPCO 2023: 29-43 - Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel:
Sparse Approximation over the Cube. IPCO 2023: 44-57 - Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. IPCO 2023: 58-71 - Jean Cardinal, Raphael Steiner:
Inapproximability of Shortest Paths on Perfect Matching Polytopes. IPCO 2023: 72-86 - Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO 2023: 466-479 - Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano:
Monoidal Strengthening and Unique Lifting in MIQCPs. IPCO 2023: 87-99 - Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From Approximate to Exact Integer Programming. IPCO 2023: 100-114 - Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. IPCO 2023: 115-126 - Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. IPCO 2023: 127-141 - Satoru Fujishige, Tomonari Kitahara, László A. Végh:
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO 2023: 142-156 - Matthew Gerstbrein, Laura Sanità, Lucy Verberk:
Stabilization of Capacitated Matching Games. IPCO 2023: 157-171 - Oussama Hanguir, Will Ma, Christopher Thomas Ryan:
Designing Optimization Problems with Diverse Solutions. IPCO 2023: 172-186 - Christoph Hertrich, Leon Sering:
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation. IPCO 2023: 187-202 - Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh:
On the Correlation Gap of Matroids. IPCO 2023: 203-216 - Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling. IPCO 2023: 246-260 - Billy Jin, Nathan Klein, David P. Williamson:
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. IPCO 2023: 217-230 - Michael Joswig, Max Klimm, Sylvain Spitz:
The Polyhedral Geometry of Truthful Auctions. IPCO 2023: 231-245 - Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP. IPCO 2023: 261-274 - Aleksandr M. Kazachkov, Egon Balas:
Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts. IPCO 2023: 275-290 - Yusuke Kobayashi:
Optimal General Factor Problem and Jump System Intersection. IPCO 2023: 291-305 - Jannik Matuschke:
Decomposition of Probability Marginals for Security Games in Abstract Networks. IPCO 2023: 306-318 - Nicole Megow, Jens Schlöter:
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. IPCO 2023: 319-333 - Gonzalo Muñoz, Joseph Paat, Felipe Serrano:
Towards a Characterization of Maximal Quadratic-Free Sets. IPCO 2023: 334-347 - Gonzalo Muñoz, Joseph Paat, Álinson S. Xavier:
Compressing Branch-and-Bound Trees. IPCO 2023: 348-362 - Gonzalo Muñoz, David Salas, Anton Svensson:
Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming. IPCO 2023: 363-377 - Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen:
Advances on Strictly $\varDelta $-Modular IPs. IPCO 2023: 393-407 - Pranav Nuti, Jan Vondrák:
Towards an Optimal Contention Resolution Scheme for Matchings. IPCO 2023: 378-392 - Joseph Poremba, F. Bruce Shepherd:
Cut-Sufficient Directed 2-Commodity Multiflow Topologies. IPCO 2023: 408-422
skipping 4 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-21 17:51 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