Publications ‒ Disopt ‐ EPFL

2022. 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Paris, France, July 4-8, 2022. p. 19:1–19:19. DOI : 10.4230/lipics.icalp.2022.19.

Detailed record

Full text – View at publisher

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

A. Lassota; A. Łukasiewicz; A. Polak

2022. 49th International Colloquium on Automata, Languages, and Programming, Paris, France, July 4-8, 2022. p. 87:1–87:15. DOI : 10.4230/lipics.icalp.2022.87.

Detailed record

View at publisher

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

G. Codenotti; F. Santos; M. Schymura

Discrete & Computational Geometry. 2022. Vol. 67, p. 65–111. DOI : 10.1007/s00454-021-00330-3.

Detailed record

Full text – View at publisher

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

J. Cslovjecsek; F. Eisenbrand; M. Pilipczuk; M. A. Venzin; R. Weismantel

2021-08-03. 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon, Portugal (Virtual Conference), September 6-8, 2021. p. 33:1–33:14. DOI : 10.4230/lipics.esa.2021.33.

Detailed record

Full text – View at publisher

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

A. Antoniadis; C. Coester; M. Elias; A. T. Polak

2021. 35th Conference on Neural Information Processing Systems, NeurIPS 2021, virtual, December 6-14, 2021. p. 16714–16726.

Detailed record

Nearly-Tight and Oblivious Algorithms for Explainable Clustering

B. Gamlath; X. Jia; A. T. Polak; O. N. A. Svensson

2021. 35th Conference on Neural Information Processing Systems, NeurIPS 2021, virtual, December 6-14, 2021. p. 28929–28939.

Detailed record

Robust Learning-Augmented Caching: An Experimental Study

J. Chłędowski; A. Polak; B. Szabucki; K. Żołna

2021. 38th International Conference on Machine Learning (ICML 2021), Virtual, July 18-24, 2021. p. 1920-1930.

Detailed record

Knapsack and Subset Sum with Small Items

A. Polak; L. Rohwedder; K. Węgrzycki

2021. 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Virtual Conference, July 12-16, 2021. p. 106:1-106:19. DOI : 10.4230/lipics.icalp.2021.106.

Detailed record

Full text – View at publisher

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

Y. Gu; A. Polak; V. Vassilevska Williams; Y. Xu

2021. 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Virtual Conference, July 12-16, 2021. p. 75:1-75:20. DOI : 10.4230/lipics.icalp.2021.75.

Detailed record

Full text – View at publisher

Complexity of linear relaxations in integer programming

G. Averkov; M. Schymura

2020-03-17.

Detailed record

On compact representations of Voronoi cells of lattices

C. Hunkenschroder; G. Reuland; M. Schymura

Mathematical Programming. 2020-01-02. Vol. 183, p. 337–358. DOI : 10.1007/s10107-019-01463-3.

Detailed record

View at publisher

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

F. Eisenbrand; R. Weismantel

Acm Transactions On Algorithms. 2020-01-01. Vol. 16, num. 1, p. 5. DOI : 10.1145/3340322.

Detailed record

View at publisher

New Results in Integer and Lattice Programming

C. Hunkenschröder / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2020.

Detailed record

Full text – View at publisher

Fully dynamic bin packing revisited

S. Berndt; K. Jansen; K-M. Klein

Mathematical Programming. 2020-01-01. Vol. 179, num. 1-2, p. 109-155. DOI : 10.1007/s10107-018-1325-x.

Detailed record

View at publisher

Matching fields and lattice points of simplices

G. P. Loho; B. Smith

Advances in Mathematics. 2020. Vol. 370, p. 107232. DOI : 10.1016/j.aim.2020.107232.

Detailed record

View at publisher

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

M. Schymura; L. Yuan

Beitrage Zur Algebra Und Geometrie-Contributions To Algebra And Geometry. 2019-12-01. Vol. 60, num. 4, p. 749-759. DOI : 10.1007/s13366-019-00446-x.

Detailed record

View at publisher

An Improved Analysis of Local Search for Max-Sum Diversification

A. Cevallos; F. Eisenbrand; R. Zenklusen

Mathematics Of Operations Research. 2019-11-01. Vol. 44, num. 4, p. 1494-1509. DOI : 10.1287/moor.2018.0982.

Detailed record

View at publisher

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

C. Hunkenschroeder; S. Vempala; A. Vetta

Acm Transactions On Algorithms. 2019-10-01. Vol. 15, num. 4, p. 55. DOI : 10.1145/3341599.

Detailed record

View at publisher

Tropical Ehrhart Theory and Tropical Volume

G. P. Loho; M. Schymura

ArXiv. 2019-08-22.

Detailed record

Extended Formulations from Communication Protocols in Output-Efficient Time

M. Aprile; Y. Faenza

2019-01-01. 20th International Conference on Integer Programming and Combinatorial Optimization (IPCO), Ann Arbor, MI, May 22-24, 2019. p. 43-56. DOI : 10.1007/978-3-030-17953-3_4.

Detailed record

View at publisher

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

I. Malinovic / F. Eisenbrand; Y. Faenza (Dir.)

Lausanne, EPFL, 2019.

Detailed record

Full text – View at publisher

Graph fragmentation problem: analysis and synthesis

M. Aprile; N. Castro; G. Ferreira; J. Piccini; F. Robledo et al.

International Transactions In Operational Research. 2019-01-01. Vol. 26, num. 1, p. 41-53. DOI : 10.1111/itor.12562.

Detailed record

View at publisher

Lonely Runner Polyhedra

M. Beck; S. Hosten; M. Schymura

Integers. 2019. Vol. 19, p. A29.

Detailed record

Finding Perfect Matchings in Bipartite Hypergraphs

C. Annamalai

Combinatorica. 2018-12-01. Vol. 38, num. 6, p. 1285-1307. DOI : 10.1007/s00493-017-3567-2.

Detailed record

View at publisher

On compact representations of Voronoi cells of lattices

C. Hunkenschröder; G. Reuland; M. Schymura

2018-11-20. 20th International Conference on Integer Programming and Combinatorial Optimization (IPCO), Ann Arbor, MI, USA, May 22-24, 2019. p. 261-274. DOI : 10.1007/978-3-030-17953-3_20.

Detailed record

View at publisher

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

Y. Faenza; I. Malinovic

Lecture Notes in Computer Science. 2018-07-18. Vol. 10856, p. 157-169. DOI : 10.1007/978-3-319-96151-4_14.

Detailed record

View at publisher

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

Y. Faenza; I. Malinović; M. Mastrolilli; O. Svensson

Lecture Notes in Computer Science. 2018-07-18. Vol. 10856, p. 170-182. DOI : 10.1007/978-3-319-96151-4_15.

Detailed record

View at publisher

Der einsame Läufer

M. Schymura; J. M. Wills

Mitteilungen der Deutschen Mathematiker-Vereinigung. 2018-06-08. Vol. 26, num. 1, p. 14-17. DOI : 10.1515/dmvm-2018-0007.

Detailed record

View at publisher

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

B. González Merino; M. Schymura

ArXiv. 2018-04-16.

Detailed record

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

F. Eisenbrand; R. Weismantel

2018-01-01. 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, Jan 07-10, 2018. p. 808-816. DOI : 10.1137/1.9781611975031.52.

Detailed record

View at publisher

Using Structural Properties for Integer Programs

S. Berndt; K-M. Klein

2018-01-01. 14th Conference on Computability in Europe (CiE), Kiel, GERMANY, Jul 30-Aug 03, 2018. p. 89-96. DOI : 10.1007/978-3-319-94418-0_9.

Detailed record

View at publisher

The Support Of Integer Optimal Solutions

I. Aliev; J. A. De Loera; F. Eisenbrand; T. Oertel; R. Weismantel

Siam Journal On Optimization. 2018-01-01. Vol. 28, num. 3, p. 2152-2157. DOI : 10.1137/17M1162792.

Detailed record

View at publisher

On 2-Level Polytopes Arising In Combinatorial Settings

M. Aprile; A. Cevallos; Y. Faenza

Siam Journal On Discrete Mathematics. 2018-01-01. Vol. 32, num. 3, p. 1857-1886. DOI : 10.1137/17M1116684.

Detailed record

View at publisher

Faster Algorithms for Integer Programs with Block Structure

F. Eisenbrand; C. Hunkenschröder; K-M. Klein

2018. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Rupublic, p. 49:1–49:13. DOI : 10.4230/LIPICS.ICALP.2018.49.

Detailed record

View at publisher

On some problems related to 2-level polytopes

M. F. Aprile / F. Eisenbrand; Y. Faenza (Dir.)

Lausanne, EPFL, 2018.

Detailed record

Full text – View at publisher

Extension complexity of stable set polytopes of bipartite graphs

M. F. Aprile; Y. Faenza; S. Fiorini; T. Huynh; M. Macchia

2017-11-02. WG 2017: Graph-Theoretic Concepts in Computer Science, Eindhoven, The Netherlands, June 21-23 2017. p. 75-87. DOI : 10.1007/978-3-319-68705-6_6.

Detailed record

View at publisher

Analysis of Node-Resilience Strategies under Natural Disasters

M. F. Aprile; N. Castro; F. Robledo; P. Romero

2017. nternational Conference on Design of Reliable Communication Networks, Munich, Germany, March 8-10, 2017 .

Detailed record

The weighted stable matching problem

L. Farczadi; N. Guričanová

2017. MATCH-UP 2017, Cambridge, Massachusetts, USA, April 20, 2017 – April 21, 2017.

Detailed record

Full text

Approximation algorithms for geometric dispersion

A. B. Cevallos Manzano / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2016.

Detailed record

Full text – View at publisher

On vertices and facets of combinatorial 2-level polytopes

M. F. Aprile; A. B. Cevallos Manzano; Y. Faenza

2016. ISCO 2016, Vietri sul mare, Italy, May 16-18, 2016. p. 177-188. DOI : 10.1007/978-3-319-45587-7_16.

Detailed record

Full text – View at publisher

Clustered planarity testing revisited

R. Fulek; J. Kynčl; I. Malinović; D. Pálvölgyi

The Electronic Journal of Combinatorics. 2015. Vol. 22, num. 4, p. P4.24. DOI : 10.37236/5002.

Detailed record

Full text – View at publisher

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

C. Annamalai; C. Kalaitzis; O. N. A. Svensson

2015. Symposium on Discrete Algorithms 2015, San Diego, California, USA, January 4-6, 2015. p. 1357-1372. DOI : 10.1137/1.9781611973730.90.

Detailed record

Full text – View at publisher

On largest volume simplices and sub-determinants

M. Di Summa; F. Eisenbrand; Y. Faenza; C. Moldenhauer

2015. ACM-SIAM Symposium on Discrete Algorithms, San Diego, California, USA, January 4-6, 2015. p. 315-323. DOI : 10.1137/1.9781611973730.23.

Detailed record

View at publisher

Node-weighted network design and maximum sub-determinants

C. Moldenhauer / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2014.

Detailed record

Full text – View at publisher

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

Y. Faenza; G. Oriolo; G. Stauffer

Journal Of The Acm. 2014. Vol. 61, num. 4, p. 20. DOI : 10.1145/2629600.

Detailed record

View at publisher

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

A. A. Bock; Y. Faenza; C. Moldenhauer; A. J. Ruiz Vargas

2014. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, India International Centre, New Delhi, December 15–17, 2014.

Detailed record

On Sub-determinants and the Diameter of Polyhedra

N. Bonifas; M. Di Summa; F. Eisenbrand; N. Haehnle; M. Niemeier

Discrete & Computational Geometry. 2014. Vol. 52, num. 1, p. 102-115. DOI : 10.1007/s00454-014-9601-x.

Detailed record

Full text – View at publisher

Approximation algorithms for regret minimization in vehicle routing problems

A. A. Bock / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2014.

Detailed record

Full text – View at publisher

Finding small stabilizers for unstable graphs

A. A. Bock; K. Chandrasekaran; J. Könemann; B. Peis; L. Sanità

2014. Integer Programming and Combinatorial Optimization (IPCO), Bonn, Germany, June 2014.

Detailed record

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

G. Averkov; M. Conforti; A. Del Pia; M. Di Summa; Y. Faenza

Siam Journal On Discrete Mathematics. 2013. Vol. 27, num. 3, p. 1492-1502. DOI : 10.1137/120898371.

Detailed record

View at publisher

Testing additive integrality gaps

F. Eisenbrand; N. Haehnle; D. Palvolgyi; G. Shmonin

Mathematical Programming. 2013. Vol. 141, num. 1-2, p. 257-271. DOI : 10.1007/s10107-012-0518-y.

Detailed record

Full text – View at publisher

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

F. Eisenbrand

Top. 2013. Vol. 21, num. 3, p. 468-471. DOI : 10.1007/s11750-013-0292-x.

Detailed record

View at publisher

Bin Packing via Discrepancy of Permutations

F. Eisenbrand; D. Palvoelgyi; T. Rothvoss

Acm Transactions On Algorithms. 2013. Vol. 9, num. 3, p. 24. DOI : 10.1145/2483699.2483704.

Detailed record

View at publisher

On the approximability of two capacitated vehicle routing problems

A. A. Bock; L. Sanità

2013. International Network Optimization Conference (INOC), Tenerife, Spain, May 20-22, 2013. p. 519-526. DOI : 10.1016/j.endm.2013.05.133.

Detailed record

View at publisher

The School Bus Problem on Trees

A. A. Bock; E. Grant; J. Könemann; L. Sanità

Algorithmica. 2013. Vol. 67, num. 1, p. 49-64. DOI : 10.1007/s00453-012-9711-x.

Detailed record

Full text – View at publisher

Stable Routing And Unique-Max Coloring On Trees

N. Haehnle; L. Sanita; R. Zenklusen

Siam Journal On Discrete Mathematics. 2013. Vol. 27, num. 1, p. 109-125. DOI : 10.1137/100817565.

Detailed record

View at publisher

Steiner Tree Approximation via Iterative Randomized Rounding

J. Byrka; F. Grandoni; T. Rothvoss; L. Sanità

Journal of the ACM. 2013. Vol. 60, num. 1, p. 6. DOI : 10.1145/2432622.2432628.

Detailed record

Full text – View at publisher

New Results in the Theory of Linear and Integer Programming

N. Hähnle / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2012.

Detailed record

Full text – View at publisher

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

M. Niemeier / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2012.

Detailed record

Full text – View at publisher

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

Y. Faenza; S. Fiorini; R. Grappe; H. R. Tiwary

2012. 2nd International Symposium on Combinatorial Optimization (ISCO 2012). p. 129-140. DOI : 10.1007/978-3-642-32147-4_13.

Detailed record

Full text – View at publisher

On coloring problems with local constraints

F. Bonomo; Y. Faenza; G. Oriolo

Discrete Mathematics. 2012. Vol. 312, num. 12-13, p. 2027-2039. DOI : 10.1016/j.disc.2012.03.019.

Detailed record

Full text – View at publisher

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

Y. Faenza; G. Oriolo; G. Stauffer

2012. 2012 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012). p. 1298-1308. DOI : 10.1137/1.9781611973099.102.

Detailed record

View at publisher

Scheduling with an Orthogonal Resource Constraint

M. Niemeier; A. Wiese

2012. 10th Workshop on Approximation and Online Algorithms (WAOA2012), Ljubljana, Slovenia, September 13-14, 2012.

Detailed record

Full text

On sub-determinants and the diameter of polyhedra

N. Bonifas; M. Di Summa; F. Eisenbrand; N. Hähnle; M. Niemeier

2012. 28th Symposium on Computational Geometry (SoCG 2012), Chapel Hill, North Carolina, USA, June 17-20, 2012.

Detailed record

Coloring fuzzy circular interval graphs

F. Eisenbrand; M. Niemeier

European Journal of Combinatorics. 2012. Vol. 33, num. 5, p. 893-904. DOI : 10.1016/j.ejc.2011.09.016.

Detailed record

Full text – View at publisher

Real-time Avionics OptimizationMathematische Optimierung von Echtzeitsystemen im Flugzeugdesign

F. Eisenbrand; M. Niemeier; M. Skutella; J. Verschae; A. Wiese

it – Information Technology. 2011. Vol. 53, num. 6, p. 274-279. DOI : 10.1524/itit.2011.0653.

Detailed record

Full text – View at publisher

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

C. Moldenhauer

2011. 38th International Colloquium on Automata, Languages and Programming (ICALP) / Annual Meeting of the European-Association-for-Theoretical-Computer-Science (EATCS)’, u’38th International Colloquium on Automata, Languages and Programming (ICALP), Zürich, July 2011. p. 293-306. DOI : 10.1016/j.ic.2012.10.017.

Detailed record

View at publisher

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

Y. Faenza; G. Oriolo; G. Stauffer

2011. Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011). p. 630-646. DOI : 10.1137/1.9781611973082.49.

Detailed record

Full text – View at publisher

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

Y. Faenza; G. Oriolo; C. Snels

Operations Research Letters. 2011. Vol. 39, num. 3, p. 213-217. DOI : 10.1016/j.orl.2011.04.002.

Detailed record

Full text – View at publisher

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

F. Grandoni; T. Rothvoss; L. Sanita

Mathematics Of Operations Research. 2011. Vol. 36, p. 185-204. DOI : 10.1287/moor.1110.0490.

Detailed record

View at publisher

Complexity of the critical node problem over trees

M. Di Summa; A. Grosso; M. Locatelli

Computers & Operations Research. 2011. Vol. 38, p. 1766-1774. DOI : 10.1016/j.cor.2011.02.016.

Detailed record

View at publisher

Approximation Algorithms for the Interval Constrained Coloring Problem

E. Althaus; S. Canzar; K. Elbassioni; A. Karrenbauer; J. Mestre

Algorithmica. 2011. Vol. 61, p. 342-361. DOI : 10.1007/s00453-010-9406-0.

Detailed record

View at publisher

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

C. Moldenhauer

2011. Automata, Languages and Programming – 38th International Colloquium, Zürich, Switzerland, July 4-8, 2011. p. 748-759. DOI : 10.1007/978-3-642-22006-7_63.

Detailed record

View at publisher

Balanced Interval Coloring

A. Antoniadis; F. Hüffner; P. Lenzner; C. Moldenhauer; A. Souza

2011. 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, March 10-12, 2011. p. 531-542. DOI : 10.4230/LIPIcs.STACS.2011.531.

Detailed record

View at publisher

The School Bus Problem on Trees

A. A. Bock; E. Grant; J. Könemann; L. Sanità

2011. 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Yokohama, Japan, December 5-8, 2011. p. 10-19. DOI : 10.1007/978-3-642-25591-5_3.

Detailed record

Full text – View at publisher

Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

S. Baruah; M. Niemeier; A. Wiese

2011. 23rd Euromicro Conference on Real-Time Systems (ECRTS2011), Porto, Portugal, July 6th – 8th, 2011. p. 115-124. DOI : 10.1109/ECRTS.2011.19.

Detailed record

Full text – View at publisher

Covering Cubes and the Closest Vector Problem

F. Eisenbrand; N. Hähnle; M. Niemeier

2011. 27th Annual Symposium on Computational Geometry (SoCG 2011), Paris, France, June 13-15, 2011. p. 417-423. DOI : 10.1145/1998196.1998264.

Detailed record

Full text – View at publisher

Diameter Bounds for Planar Graphs

R. Fulek; F. Moric; D. Pritchard

Discrete Mathematics. 2011. Vol. 311, num. 5, p. 327-335. DOI : 10.1016/j.disc.2010.11.006.

Detailed record

Full text – View at publisher

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

A. Karrenbauer; T. Rothvoss

2011. Approximation and Online Algorithms, 8th International Workshop (WAOA 2010), Liverpool, UK, September 9-10, 2010. p. 166-177. DOI : 10.1007/978-3-642-18318-8_15.

Detailed record

Full text – View at publisher

Pricing on Paths: A PTAS for the Highway Problem

F. Grandoni; T. Rothvoss

2011. Symposium on Discrete Algorithms (SODA 2011), San Francisco, USA, January 22-25, 2011. p. 675–684.

Detailed record

Full text

Bin Packing via Discrepancy of Permutations

F. Eisenbrand; D. Palvoelgyi; T. Rothvoss

2011. Symposium on Discrete Algorithms (SODA 2011), San Francisco, USA, January 22-25, 2011.

Detailed record

Full text

Fast Computation of Small Cuts via Cycle Space Sampling

D. Pritchard; R. Thurimella

Acm Transactions On Algorithms. 2011. Vol. 7, num. 54, p. 46. DOI : 10.1145/2000807.2000814.

Detailed record

View at publisher

k-Edge-Connectivity: Approximation and LP Relaxation

D. Pritchard

2011. ALGO 2010: 8th Workshop on Approximation and Online Algorithms (WAOA), University of Liverpool, UK, September 9-10, 2010. p. 225-236. DOI : 10.1007/978-3-642-18318-8_20.

Detailed record

Full text – View at publisher

Approximability of Sparse Integer Programs

D. Pritchard; D. Chakrabarty

Algorithmica. 2011. Vol. 61, num. 1, p. 75-93. DOI : 10.1007/s00453-010-9431-z.

Detailed record

Full text – View at publisher

Optimal Selection of Customers for a Last-Minute Offer

R. Cominetti; J. R. Correa; T. Rothvoss; J. San Martin

Operations Research. 2010. Vol. 58, p. 878-888. DOI : 10.1287/opre.1090.0787.

Detailed record

View at publisher

Connected facility location via random facility sampling and core detouring

F. Eisenbrand; F. Grandoni; T. Rothvoss; G. Schafer

Journal Of Computer And System Sciences. 2010. Vol. 76, p. 709-726. DOI : 10.1016/j.jcss.2010.02.001.

Detailed record

View at publisher

Sorted Sector Covering Combined with Image Condensation – An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs

M. Albrecht; A. Karrenbauer; T. Jung; C. Xu

2010. 16th International Display Workshop (IDW 09), Miyazaki, JAPAN, Dec 09-11, 2009. p. 1556-1563. DOI : 10.1587/transele.E93.C.1556.

Detailed record

View at publisher

Single-Frontier Bidirectional Search

A. Felner; C. Moldenhauer; N. Sturtevant; J. Schaeffer

2010. Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA, July 11-15, 2010. p. 59-64. DOI : 10.1609/aaai.v24i1.7555.

Detailed record

View at publisher

Diameter of Polyhedra: Limits of Abstraction

F. Eisenbrand; N. Hähnle; A. Razborov; T. Rothvoss

Mathematics of Operations Research. 2010. Vol. 35, num. 4, p. 786-794. DOI : 10.1287/moor.1100.0470.

Detailed record

Full text – View at publisher

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound

D. Chakrabarty; J. Könemann; D. Pritchard

Operations Research Letters. 2010. Vol. 38, num. 6, p. 567-570. DOI : 10.1016/j.orl.2010.09.004.

Detailed record

View at publisher

Stable routing under the Spanning Tree Protocol

F. Grandoni; G. Nicosia; G. Oriolo; L. Sanità

Operations Research Letters. 2010. Vol. 38, num. 5, p. 399-404. DOI : 10.1016/j.orl.2010.05.001.

Detailed record

View at publisher

Hypergraphic LP Relaxations for Steiner Trees

D. Chakrabarty; J. Könemann; D. Pritchard

2010. 14th Conference on Integer Programming and Combinatorial Optimization (IPCO), Lausanne, Switzerland, June 9-11, 2010. p. 383-396. DOI : 10.1007/978-3-642-13036-6_29.

Detailed record

View at publisher

Network Design via Core Detouring for Problems Without a Core

F. Grandoni; T. Rothvoss

2010. 37th International Colloquium on Automata, Languages and Programming (ICALP’10), Bordeaux, France, July 5-10, 2010. p. 490-502. DOI : 10.1007/978-3-642-14165-2_42.

Detailed record

Full text – View at publisher