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
- 2024
- Iskander Aliev, Marcel Celaya, Martin Henk:
Sparsity and Integrality Gap Transference Bounds for Integer Programs. IPCO 2024: 1-13 - Aditya Anand, Euiwoong Lee:
Separating k -sc Median from the Supplier Version. IPCO 2024: 14-27 - Théo Barré, Omar El Housni, Andrea Lodi:
Assortment Optimization with Visibility Constraints. IPCO 2024: 124-138 - Jannis Blauth, Nathan Klein, Martin Nägele:
A Better-Than-1.6-Approximation for Prize-Collecting TSP. IPCO 2024: 28-42 - Marcel Celaya, Stefan Kuhlmann, Robert Weismantel:
On Matrices over a Polynomial Ring with Restricted Subdeterminants. IPCO 2024: 43-56 - Diego Cifuentes, Santanu S. Dey, Jingye Xu:
Sensitivity Analysis for Mixed Binary Quadratic Programming. IPCO 2024: 446-459 - Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. IPCO 2024: 57-70 - Gérard Cornuéjols, Siyue Liu, R. Ravi:
Approximately Packing Dijoins via Nowhere-Zero Flows. IPCO 2024: 71-84 - Rajni Dabas, Naveen Garg, Neelima Gupta:
Capacitated Facility Location with Outliers and Uniform Facility Costs. IPCO 2024: 85-98 - Sally Dong, Thomas Rothvoss:
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. IPCO 2024: 113-123 - Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow:
Fast Combinatorial Algorithms for Efficient Sortation. IPCO 2024: 418-432 - Yuri Faenza, Ayoub Foussoul, Chengyue He:
Two-Stage Stochastic Stable Matching. IPCO 2024: 154-167 - Yuri Faenza, Cliff Stein, Jia Wan:
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. IPCO 2024: 168-181 - Ayoub Foussoul, Vineet Goyal, Amit Kumar:
Fully-Dynamic Load Balancing. IPCO 2024: 182-195 - Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin:
Pairwise-Independent Contention Resolution. IPCO 2024: 196-209 - Omar El Housni, Alfredo Torrico, Ulysse Hennebelle:
Adaptivity Gaps in Two-Sided Assortment Optimization. IPCO 2024: 139-153 - Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai:
An FPTAS for Connectivity Interdiction. IPCO 2024: 210-223 - Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. IPCO 2024: 224-237 - Billy Jin, Nathan Klein, David P. Williamson:
A Lower Bound for the Max Entropy Algorithm for TSP. IPCO 2024: 238-251 - Kirill Kukharenko, Laura Sanità:
On the Number of Degenerate Simplex Pivots. IPCO 2024: 252-264 - Yongchun Li, Weijun Xie:
On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms. IPCO 2024: 265-279 - Siyue Liu, Chao Xu:
On the Congruency-Constrained Matroid Base. IPCO 2024: 280-293 - Jesús A. De Loera, Brittney Marsters, Luze Xu, Shixuan Zhang:
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones. IPCO 2024: 99-112 - Javier Marinkovic, José A. Soto, Victor Verdugo:
Online Combinatorial Assignment in Independence Systems. IPCO 2024: 294-308 - Jannik Matuschke:
Decomposing Probability Marginals Beyond Affine Requirements. IPCO 2024: 309-322 - Ryuhei Mizutani, Yuki Yoshida:
Polynomial Algorithms to Minimize 2/3-Submodular Functions. IPCO 2024: 323-336 - Meike Neuwohner:
A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs. IPCO 2024: 337-350 - Zeev Nutov:
Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. IPCO 2024: 351-364 - Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu:
Network Flow Problems with Electric Vehicles. IPCO 2024: 365-378 - Bart van Rossum, Rui Chen, Andrea Lodi:
A New Branching Rule for Range Minimization Problems. IPCO 2024: 433-445
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-10-15 01:45 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