Nevena Pivac

21 papers B 2C 2Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Sandwich Monotonicity and the Recognition of Weighted Graph Classes.
CoRR
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2024 J jnl
A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor.
CoRR
Martin Milanic, Nevena Pivac
2024 J jnl
Bisimplicial separators.
J. Graph Theory
Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic
2023 J jnl
Allocation of indivisible items with individual preference graphs.
Discret. Appl. Math.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2023 J jnl
Bisimplicial separators.
CoRR
Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic
2023 J jnl
Computing well-covered vector spaces of graphs using modular decomposition.
Comput. Appl. Math.
Martin Milanic, Nevena Pivac
2023 J jnl
Fair Allocation of Indivisible Items with Conflict Graphs.
Algorithmica
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2022 J jnl
Allocation of Indivisible Items with Individual Preference Graphs.
CoRR
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2022 J jnl
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition.
CoRR
Martin Milanic, Nevena Pivac
2021 — conf
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.
ADT
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
2021 J jnl
Graphs where Search Methods are Indistinguishable.
CoRR
Matjaz Krnc, Nevena Pivac
2021 J jnl
Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem.
Electron. J. Comb.
Martin Milanic, Nevena Pivac
2021 J jnl
The Recognition Problem of Graph Search Trees.
SIAM J. Discret. Math.
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
2020 B conf
Edge Elimination and Weighted Graph Classes.
WG
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2020 C conf
Fair Packing of Independent Sets.
IWOCA
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020 J jnl
Fair packing of independent sets.
CoRR
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2019 B conf
Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs.
WG
Martin Milanic, Nevena Pivac
2019 J jnl
On the End-Vertex Problem of Graph Searches.
Discret. Math. Theor. Comput. Sci.
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
2019 C conf
Recognizing Graph Search Trees.
LAGOS
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
2018 J jnl
On the End-Vertex Problem of Graph Searches.
CoRR
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
2018 J jnl
Recognizing Graph Search Trees.
CoRR
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler