Nevena Pivač
- Faculty of Mathematics, Informatics and Natural Sciences at University of Primorska
- Address: Glagoljaška 8, 6000 Koper, SI
- Office: Kettejeva II/4
- E-mail: nevena.pivac@iam.upr.si
- Phone: +386 5 611 76 58
| 2017 - ongoing | Mathematics Phd Student, UP FAMNIT |
| 2015 - 2020 | Master in Computer Science, UP FAMNIT |
| Master's Thesis: Graph search algorithms and structure of graph search trees | |
| 2015 - 2018 | Master in Mathematics, UP FAMNIT |
| Master's Thesis: The university timetabling problem - complexity and an integer linear programming formulation: a case study of UP FAMNIT | |
| 2012 - 2015 | Bachelor in Mathematics, UP FAMNIT |
| Thesis: Characterization of planar and spatial Pythagorean-hodograph curves |
- Computing well-covered vector spaces of graphs using modular decomposition.
Martin Milanič and Nevena Pivač
Computational and Applied Mathematics 42 (2023). - Fair allocation of indivisible items with conflict graphs.
Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač, Joachim Schauer
Discrete Applied Mathematics. - Allocation of indivisible items with individual preference graphs.
Nina Chiarelli, Clement Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy, Nevena Pivač
Discrete Applied Mathematics. - Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem.
Martin Milanič and Nevena Pivač
The Electronic Journal of Combinatorics 28 (2021), no. 1, Paper No. 1.41, 27 pp. - Recognizing Graph Search Trees.
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler
SIAM Journal on Discrete Mathematics 35.2 (2021): 1418-1446. - On the end-vertex problem of graph searches.
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler
Discrete mathematics & theoretical computer science. 2019, vol. 21, no. 1, p. 1-20.
- Graphs Where Search Methods Are Indistinguishable.
Matjaž Krnc and Nevena Pivač
Extended Abstracts EuroComb 2021, Trends in Mathematics, vol 14. Birkhäuser, Cham, pp 351-358. - Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.
Nina Chiarelli, Clement Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy, Nevena Pivač
Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT 2021), Lecture Notes in Computer Science, 2021. - Edge elimination and weighted graph classes.
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler
Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), Lecture Notes in Computer Science 12301 (2020) 134-147. - Fair packing of independent sets.
Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač, Joachim Schauer
Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020), Lecture Notes in Computer Science 12126 (2020) 154-165. - An ILP Formulation for a Variant of the University Timetabling Problem.
Martin Milanič, Nevena Pivač and Jernej Vičič
Middle-European Conference on Applied Theoretical Computer Science: proceedings of the 22nd International Multiconference Information Society - IS 2019, Ljubljana, Slovenia: volume I. Ljubljana: Institut "Jožef Stefan", 2019. p. 55-58. - Minimal separators in graph classes defined by small forbidden induced subgraphs.
Martin Milanič and Nevena Pivač
Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019), Lecture Notes in Computer Science 11789 (2019) 379-391 - Recognizing Graph Search Trees.
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler
The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Electronic notes in theoretical computer science, Vol. 346. p.99-110-
- Graphs Where Search Methods Are Indistinguishable.
StuCoSRec 2021, September 2021, Maribor, Slovenia (online)
- Graphs Where Search Methods Are Indistinguishable.
EUROCOMB 2021, September 2021, Barcelona, Spain (online)
- A dichotomy for tame graph classes defined by small forbidden induced subgraphs.
Brandenburg University of Technology, Cottbus-Senftenberg, November 2019
- An ILP Formulation for a Variant of the University Timetabling Problem
MATCOS-19, October 2019, Koper, Slovenia
- Minimal separators in graph classes defined by small forbidden induced subgraphs
WG 2019, June 2019, Vall de Nuria, Spain
- Minimal separators in graph classes defined by small forbidden induced subgraphs
Bled-19, July 2019, Bled, Slovenia
- Recognizing Graph Search Trees
LAGOS 2019, June 2019, Belo Horizonte, Brasil
- Graph Search Algorithms and Recognition of Graph Search Trees
PhD Seminar, May 2019, Charles University, Prague, Czech Republic
- On the End-Vertex Problem of Graph Searches
PhD Seminar, May 2019, Charles University, Prague, Czech Republic
- The University Timetabling Problem - Complexity and an Integer Linear Programming Formulation: a Case Study of UP FAMNIT
Research Seminar, December 2018, University of Grac, Grac, Austria
- On the End-Vertex Problem of Graph Searches
ICGT 2019, July 2019, Lyon, France
2019/2020 Analysis 1 (Foundations of Analysis: Numbers, limits, and continuity), Tutorials Session, in English
2018/2019 Mathematical Topics in English I/II, Tutorials Session, in English
2018/2019 Analysis 1 (Foundations of Analysis: Numbers, limits, and continuity), Tutorials Session, in English
2017/2018 Analysis 1 (Foundations of Analysis: Numbers, limits, and continuity), Tutorials Session, in English