Stefan Lendl

Discret. Appl. Math., January, 2024

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Assistance and interdiction problems on interval graphs.

[BibT_eX]

[DOI]

Hung P. Hoang

Discret. Appl. Math., December, 2023

Allocation of indivisible items with individual preference graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., July, 2023

Non-Preemptive Tree Packing.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Algorithmica, March, 2023

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph.

[BibT_eX]

[DOI]

CoRR, 2023

A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Matroid bases with cardinality constraints on the intersection.

[BibT_eX]

[DOI]

Britta Peis

Veerle Timmermans

Math. Program., 2022

Continuous facility location on graphs.

[BibT_eX]

[DOI]

Tim A. Hartmann

Gerhard J. Woeginger

Math. Program., 2022

The Steiner cycle and path cover problem on interval graphs.

[BibT_eX]

[DOI]

Ante Custic

J. Comb. Optim., 2022

Recoverable robust representatives selection problems with discrete budgeted uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Two-Stage robust optimization problems with two-stage uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy.

[BibT_eX]

[DOI]

CoRR, 2022

Dispersing Obnoxious Facilities on Graphs by Rounding Distances.

[BibT_eX]

[DOI]

Tim A. Hartmann

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Robust Combinatorial Optimization with Locally Budgeted Uncertainty.

[BibT_eX]

[DOI]

Open J. Math. Optim., 2021

A linear time algorithm for the robust recoverable selection problem.

[BibT_eX]

[DOI]

Thomas Lachmann

Gerhard J. Woeginger

Discret. Appl. Math., 2021

On the Recoverable Traveling Salesman Problem.

[BibT_eX]

[DOI]

CoRR, 2021

Dispersing Obnoxious Facilities on a Graph.

[BibT_eX]

[DOI]

Algorithmica, 2021

Linearizable Special Cases of the Quadratic Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

An Investigation of the Recoverable Robust Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2019

Combinatorial optimization with interaction costs: Complexity and solvable cases.

[BibT_eX]

[DOI]

Ante Custic

Abraham P. Punnen

Discret. Optim., 2019

2018

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games.

[BibT_eX]

[DOI]

Ante Custic