Publications ‒ Disopt ‐ EPFL

These publications are managed in Infoscience. To add a new publication, go to https://infoscience.epfl.ch/youraccount/login?ln=en&referer=https://infoscience.epfl.ch/submit?ln=en.

Warning

Please note that the publication lists from Infoscience integrated into the EPFL website, lab or people pages are frozen following the launch of the new version of platform. The owners of these pages are invited to recreate their publication list from Infoscience. For any assistance, please consult the Infoscience help or contact support.

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

R. Pinchasi

Electronic Journal Of Combinatorics. 2024-06-14. Vol. 31, num. 2, p. 1-11. DOI : 10.37236/12054.

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

From approximate to exact integer programming

Reducibility bounds of objective functions over the integers

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

Geometric Considerations in Lattice Programming

Results on Sparse Integer Programming and Geometric Independent Sets

Approximate CVPp in time 2(0.802n)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

The double exponential runtime is tight for 2-stage stochastic ILPs

Covering Convex Bodies and the Closest Vector Problem

The covering radius and a discrete surface area for non-hollow simplices

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Nearly-Tight and Oblivious Algorithms for Explainable Clustering

Robust Learning-Augmented Caching: An Experimental Study

Knapsack and Subset Sum with Small Items

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

New Results in Integer and Lattice Programming

Fully dynamic bin packing revisited

Complexity of linear relaxations in integer programming

On compact representations of Voronoi cells of lattices

Matching fields and lattice points of simplices

An Improved Analysis of Local Search for Max-Sum Diversification

A note on discrete lattice-periodic sets with an application to Archimedean tilings

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem

Extended Formulations from Communication Protocols in Output-Efficient Time

Tropical Ehrhart Theory and Tropical Volume

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Graph fragmentation problem: analysis and synthesis

Lonely Runner Polyhedra

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Using Structural Properties for Integer Programs

Finding Perfect Matchings in Bipartite Hypergraphs

The Support Of Integer Optimal Solutions

On 2-Level Polytopes Arising In Combinatorial Settings

Faster Algorithms for Integer Programs with Block Structure

On compact representations of Voronoi cells of lattices

On some problems related to 2-level polytopes

A PTAS for the Time-Invariant Incremental Knapsack Problem, Combinatorial Optimization

On Bounded Pitch Inequalities for the Min-Knapsack Polytope, Combinatorial Optimization

Der einsame Läufer

On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds

Analysis of Node-Resilience Strategies under Natural Disasters

Extension complexity of stable set polytopes of bipartite graphs

The weighted stable matching problem

Approximation algorithms for geometric dispersion

On vertices and facets of combinatorial 2-level polytopes

Clustered planarity testing revisited

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

On largest volume simplices and sub-determinants

Node-weighted network design and maximum sub-determinants

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Solving the stable set problem in terms of the odd cycle packing number

On Sub-determinants and the Diameter of Polyhedra

Approximation algorithms for regret minimization in vehicle routing problems

Finding small stabilizers for unstable graphs

On The Convergence Of The Affine Hull Of The Chvatal-Gomory Closures

Testing additive integrality gaps

Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

Bin Packing via Discrepancy of Permutations

On the approximability of two capacitated vehicle routing problems

The School Bus Problem on Trees

Stable Routing And Unique-Max Coloring On Trees

Steiner Tree Approximation via Iterative Randomized Rounding

New Results in the Theory of Linear and Integer Programming

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

On coloring problems with local constraints

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Scheduling with an Orthogonal Resource Constraint

On sub-determinants and the diameter of polyhedra

Coloring fuzzy circular interval graphs

Real-time Avionics OptimizationMathematische Optimierung von Echtzeitsystemen im Flugzeugdesign

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Complexity of the critical node problem over trees