2 citations · 2 across the 2 of their papers we have counts for
4 papers
Separable discrete functions: recognition and sufficient conditions
Endre Boros, Ondrej Cepek, Vladimir Gurvich
A discrete function of variables is a mapping , where , and are arbitrary finite sets. Function is cal…
On Equistable, Split, CIS, and Related Classes of Graphs
Endre Boros, Vladimir Gurvich, Martin Milanič
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic st…
Equistarable bipartite graphs
Endre Boros, Nina Chiarelli, Martin Milanič
Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges…
Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
Given a graph and a weight function on the edges $w:E\mapsto\RR$, we consider the polyhedron of negative-weight flows on , and get a complete characterization…