default search action
Nevena Pivac
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Martin Milanic, Nevena Pivac:
A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor. CoRR abs/2405.15543 (2024) - 2023
- [j6]Nina Chiarelli
, Matjaz Krnc
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85(5): 1459-1489 (2023) - [j5]Martin Milanic
Computing well-covered vector spaces of graphs using modular decomposition. Comput. Appl. Math. 42(8): 360 (2023) - [j4]Nina Chiarelli, Clément Dallard
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334: 45-62 (2023) - [i7]Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic:
Bisimplicial separators. CoRR abs/2312.10830 (2023) - 2022
- [i6]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
Allocation of Indivisible Items with Individual Preference Graphs. CoRR abs/2202.04465 (2022) - [i5]Martin Milanic, Nevena Pivac:
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition. CoRR abs/2212.08599 (2022) - 2021
- [j3]Martin Milanic, Nevena Pivac:
Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem. Electron. J. Comb. 28(1): 1 (2021) - [j2]Jesse Beisegel
The Recognition Problem of Graph Search Trees. SIAM J. Discret. Math. 35(2): 1418-1446 (2021) - [c5]Nina Chiarelli, Clément Dallard
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT 2021: 243-257 - [i4]Matjaz Krnc, Nevena Pivac:
Graphs where Search Methods are Indistinguishable. CoRR abs/2109.00035 (2021) - 2020
- [c4]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Packing of Independent Sets. IWOCA 2020: 154-165 - [c3]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler
Edge Elimination and Weighted Graph Classes. WG 2020: 134-147 - [i3]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair packing of independent sets. CoRR abs/2003.11313 (2020)
2010 – 2019
- 2019
- [j1]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler
On the End-Vertex Problem of Graph Searches. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [c2]Martin Milanic, Nevena Pivac:
Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. WG 2019: 379-391 - [c1]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler
Recognizing Graph Search Trees. LAGOS 2019: 99-110 - 2018
- [i2]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. CoRR abs/1810.12253 (2018) - [i1]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. CoRR abs/1811.09249 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: