Остановите войну!
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 37 matches
- 2017
- Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. IPCO 2017: 186-198 - Ahmad Abdi, Bertrand Guenin:
The Two-Point Fano and Ideal Binary Clutters. IPCO 2017: 1-12 - Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows - (Extended Abstract). IPCO 2017: 13-24 - Iskander Aliev, Martin Henk, Timm Oertel:
Integrality Gaps of Integer Knapsack Problems. IPCO 2017: 25-38 - Haris Angelidakis, Yury Makarychev, Pasin Manurangsi:
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. IPCO 2017: 39-50 - Gennadiy Averkov, Amitabh Basu, Joseph Paat:
Approximation of Corner Polyhedra with Families of Intersection Cuts. IPCO 2017: 51-62 - Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. IPCO 2017: 63-74 - Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang:
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. IPCO 2017: 75-85 - Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. IPCO 2017: 86-98 - Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
Cutting Planes from Wide Split Disjunctions. IPCO 2017: 99-110 - Sylvia C. Boyd, András Sebö:
The Saleman's Improved Tours for Fundamental Classes. IPCO 2017: 111-122 - Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar:
The Heterogeneous Capacitated k-Center Problem. IPCO 2017: 123-135 - Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. IPCO 2017: 136-147 - Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. IPCO 2017: 148-160 - Roberto Cominetti, José Correa, Neil Olver:
Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. IPCO 2017: 161-172 - Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. IPCO 2017: 173-185 - Zachary Friggstad, Chaitanya Swamy:
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. IPCO 2017: 199-211 - Michel X. Goemans, Swati Gupta, Patrick Jaillet:
Discrete Newton's Algorithm for Parametric Submodular Function Minimization. IPCO 2017: 212-227 - Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. IPCO 2017: 228-240 - Guru Prashanth Guruganesh, Sahil Singla:
Online Matroid Intersection: Beating Half for Random Arrival. IPCO 2017: 241-253 - Tobias Harks, Veerle Timmermans:
Equilibrium Computation in Atomic Splittable Singleton Congestion Games. IPCO 2017: 442-454 - Rebecca Hoberg, Thomas Rothvoss:
An Improved Deterministic Rescaling for Linear Programming Algorithms. IPCO 2017: 267-278 - Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang:
Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. IPCO 2017: 254-266 - Sharat Ibrahimpur, Chaitanya Swamy:
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. IPCO 2017: 279-291 - Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO 2017: 292-304 - Klaus Jansen, Lars Rohwedder:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. IPCO 2017: 305-316 - Prabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi:
Adaptive Submodular Ranking. IPCO 2017: 317-329 - Matthias Köppe, Yuan Zhou:
On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem. IPCO 2017: 330-342 - Janardhan Kulkarni, Euiwoong Lee, Mohit Singh:
Minimum Birkhoff-von Neumann Decomposition. IPCO 2017: 343-354 - Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-Arrival Model. IPCO 2017: 355-367
skipping 7 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-06-21 21:18 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