3 citations · 3 across the 9 of their papers we have counts for
10 papers
Odd and Even Harder Problems on Cycle-Factors
Florian Hörsch, Csaba Király, Mirabel Mendoza-Cadena +3
For a graph (undirected or directed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise nat…
A Note on Mixed Cages of Girth 5
Gabriela Araujo-Pardo, Lydia Mirabel Mendoza-Cadena
A mixed regular graph is a graph where every vertex has incoming arcs, outgoing arcs, and edges; furthermore, if it has girth , we say that the graph is a \emph{$[z,…
The Strong Core of Housing Markets with Partial Order Preferences
Ildikó Schlotter, Lydia Mirabel Mendoza-Cadena
We study the strong core of housing markets when agents' preferences over houses are expressed as partial orders. We provide a structural characterization of the strong core, and p…
On the Complexity of Inverse Bivariate Multi-unit Assignment Valuation Problems
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena
Inverse and bilevel optimization problems play a central role in both theory and applications. These two classes are known to be closely related due to the pioneering work of Dempe…
Diameter reduction via arc reversal
Panna Gehér, Max Kölbl, Lydia Mirabel Mendoza-Cadena +1
The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph an…
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena +3
We consider the Shortest Odd Path problem, where given an undirected graph , a weight function on its edges, and two vertices and in , the aim is to find an -p…
Newton-type algorithms for inverse optimization II: weighted span objective
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
In inverse optimization problems, the goal is to modify the costs in an underlying optimization problem in such a way that a given solution becomes optimal, while the difference be…
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and -norm objectives
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
In minimum-cost inverse optimization problems, we are given a feasible solution to an underlying optimization problem together with a linear cost function, and the goal is to modif…
Resolving Infeasibility of Linear Systems: A Parameterized Approach
Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza-Cadena +1
Deciding feasibility of large systems of linear equations and inequalities is one of the most fundamental algorithmic tasks. However, due to data inaccuracies or modeling errors, i…
Inverse optimization problems with multiple weight functions
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
We introduce a new class of inverse optimization problems in which an input solution is given together with linear weight functions, and the goal is to modify the weights by th…