


default search action
27th IPCO 2026: Padua, Italy
- Santanu S. Dey

, Marco Di Summa
, Domenico Salvagnin
:
Integer Programming and Combinatorial Optimization - 27th International Conference, IPCO 2026, Padua, Italy, June 17-19, 2026, Proceedings. Lecture Notes in Computer Science 16588, Springer 2026, ISBN 978-3-032-28690-1 - Martin Nägele

, Christian Nöbel
, Rico Zenklusen
:
On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope. 1-16 - Miguel Bosch-Calvo

, Fabrizio Grandoni
, Yusuke Kobayashi
, Takashi Noguchi:
A PTAS for Weighted Triangle-Free 2-Matching. 17-31 - Jannik Matuschke:

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction. 32-46 - Meike Neuwohner

, Vera Traub
, Rico Zenklusen
:
Approximation Schemes for Planar Graph Connectivity Problems. 47-63 - Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz:

Degree Realization with Minimum Dominating Set. 64-80 - Chenglin Fan, Dahoon Lee, Euiwoong Lee:

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. 81-96 - Tasuku Soma

, Mingquan Ye, Yuichi Yoshida
:
O(log n)-Approximation Algorithms for Bipartiteness Ratio. 97-111 - Zachary Friggstad

, Tobias Mömke
:
Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding. 112-127 - Tullio Villa, Eleonora Vercesi

, János Barta
, Monaldo Mastrolilli
:
The Integrality Gap of the Traveling Salesman Problem is $\frac{4}{3}$ if the LP Solution Has at Most n + 6 Non-Zero Components. 128-143 - Mahtab Alghasi, Bertrand Guenin, Levent Tunçel:

The Local Dyadic Conjecture. 144-157 - Marcin Brianski

, Alexandra Lassota
, Kristýna Pekárková
, Michal Pilipczuk
, Janina Reuter:
On Integer Programs That Look Like Paths. 158-172 - Alexandra Lassota

, Koen Ligthart:
Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides. 173-187 - Stefan Kuhlmann, Robert Weismantel:

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm. 188-203 - Siyue Liu

, Olha Silina:
Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations. 204-219 - Gennadiy Averkov

, Anouk E. Brose, Jesús A. De Loera
, Gyivan Lopez-Campos
, Antonio J. Torres
:
On Lattice Diameter Segments: Algorithms and Structure. 220-232 - Daniel Dadush, Stefan Kober, Zhuan Khye Koh:

On Circuit Diameter and Straight Line Complexity. 233-248 - Ryan Cory-Wright

, Jean Pauphilet
:
Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization. 249-264 - Alexander Lindermayr

, Zhenwei Liu, Nicole Megow
:
Polytope Scheduling with Groups: Unified Models and Optimal Guarantees. 265-281 - Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, Jens Vygen:

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing. 282-298 - David Alemán Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver, Chaitanya Swamy:

Stochastic Load Balancing with Machine Reservations. 299-314 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo:

s,t-Separating Principal Partition Sequence of Submodular Functions. 315-330 - Karthekeyan Chandrasekaran

, Chandra Chekuri
, Weihang Wang
, Weihao Zhu:
Hedgegraph Polymatroids. 331-345 - Stephen Arndt, Benjamin Moseley

, Kirk Pruhs
, Michael Zlatin
:
Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids. 346-361 - Chien-Chung Huang, Naonori Kakimura

, Yusuke Kobayashi
, Tatsuya Terao
:
Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. 362-377 - Aditi Dudeja, Mara Grilnberger:

A Weighted-to-Unweighted Reduction for Matroid Intersection. 378-393 - Christoph Hertrich, Stefan Kober, Georg Loho:

Arithmetic Circuits and Neural Networks for Regular Matroids. 394-409 - Anupam Gupta, Benjamin Moseley, Rudy Zhou:

Bayesian Probing on Graphs. 410-425 - Nagisa Sugishita

, Margarida Carvalho
:
Complexity of Bilevel Linear Programming with a Single Upper-Level Variable. 426-440 - Christopher Hojny

, Cédric Roy:
A Framework for Handling and Exploiting Symmetry in Benders Decomposition. 441-456 - Annika Jäger, Marc E. Pfetsch

:
Structure-Preserving Symmetry Presolving for Mixed-Binary Linear Problems. 457-473 - Boyang Han, Aleksandr M. Kazachkov

:
The Strength of Root Cuts in an Extended Abstract Branch-and-Cut Model. 474-490 - Yuri Faenza

, Victor Verdugo
, José Verschae
, Matías Villagra
:
Linear Programming Hierarchies Collapse Under Symmetry. 491-506 - Jiaqi Wang, Weijun Xie

:
Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters. 507-520

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














