Statistics of RUP

Bibliography of the person, including all types of documents, not only theses.

PhD theses (2)

1. Nina Chiarelli: Novi koncepti in rezultati v teoriji dominacije in prirejanj v grafih
2. Tatiana Romina Hartinger: Nove karakterizacije v strukturni teoriji grafov

MSc theses (8)

1. Mirza Krbezlija: A complexitystudy of distance variants of covering and domination problems in H-free graphs
2. Nevena Pivač: The university timetabling problem - complexity and an integer linear programming formulation
3. Angelina Ćirković: Kromatično število in kromatični indeks grafa
4. Edin Husić: The maximum independent set problem and equistable graphs
5. Peter Muršič: Particija grafa, odkrivanje skupnosti in maksimalen prerez
6. Kenny Štorgel: Metoda prepoznavanja matematičnih vzorcev in zgledi uporabe v teoriji grafov
7. Narmina Baghirova: Reconstructing perfect phylogenies via branchings in acyclic digraphs
8. Mirza Redžić: Classes of graphs with tree-independence number at most two

BSc theses (14)

1. Maja Frangež: Liho dominantne množice v grafih
2. Urša Kačar: Problemi popolne filogenije
3. Edin Husić: Submodularne funkcije
4. Vladan Jovičić: Odčitljivost digrafov in dvodelnih grafov
5. Kenny Štorgel: Domneva Erdősa, Faberja in Lovásza
6. Tilen Sabadin: Izrek Kuratowskega
7. Olga Kaliada: Trije klasični grški problemi
8. Mirza Krbezlija: Aproksimacijski vidiki vektorske dominacije in vektorske povezanosti v grah
9. Mojca Šentjurc: 1-popolno usmerljivi produktni grafi
10. Špela Čučko: Rekonstrukcija evolucij mešanih tumorskih vzorcev z uporabo celoštevilskega linearnega programiranja
11. Anja Hofbauer: Pragovni grafi
12. Matej Čeč: Povezanost grafov
13. Marko Tuta: Izrek o dualnosti v jeziku hipergrafov
14. Urška Pangerc: Karakterizacije popolnih grafov

Other documents (86)

1. Martin Milanič: Graphs of small separability
2. Martin Milanič: On hereditary efficiently dominatable graphs
3. Bruno Escoffier, Martin Milanič, Vangelis Th. Paschos: Simple and fast reoptimizations for the steiner tree problem
4. Martin Milanič: Competitive evaluation of threshold functions and game trees in the priced information model
5. Martin Milanič: Maximum (weight) stable sets are sometimes easy to find
6. Vadim E. Levit, Martin Milanič, D. Tankus: On the recognition of k-equistable graphs
7. Martin Milanič: From DNA sequencing to exact weighted independent sets
8. Martin Milanič: Evaluating monotone Boolean functions and game trees in the priced information model
9. Martin Milanič: Evaluating monotone Boolean functions with priced variables
10. Martin Milanič, Vadim E. Levit, Štefko Miklavič, James B. Orlin, Gábor Rudolf, D. Tankus: Equistable graphs: conjectures, results, and connections with Boolean functions
11. Martin Milanič: Combinatorial methods for the independent set problem
12. Martin Milanič: Algorithmic graph theory
13. Martin Milanič, Jérôme Monnot: The exact weighted independent set problem in perfect graphs and related classes
14. Martin Milanič: Competitive evaluation of threshold functions and game trees in the priced information model (continuation of competitive evaluation of threshold functions)
15. Martin Milanič: Matching, augmenting and decomposing: an overview of combinatorial methods for the independent set problem
16. Martin Milanič: Algorithms for haplotyping problems
17. Martin Milanič: Graph classes: interrelations, structure, and algorithmic issues
18. Martin Milanič: On the boolean function evaluation problem
19. Luis Martínez, Martin Milanič, Leire Legarreta Solaguren, Paul Medvedev, Iker Malaina, Ildefonso M. de la Fuente: A combinatorial approach to the design of vaccines
20. Martin Milanič: Counterexamples to Orlin's conjecture on equistable graphs
21. Martin Milanič: On hereditary efficiently dominatable graphs
22. Martin Milanič: Vector connectivity in graphs
23. Martin Milanič, Endre Boros, Ferdinando Cicalese, Pinar Heggernes, Pim Van 't Hof, Romeo Rizzi: Vector connectivity in graphs
24. Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu: Set graphs. II. Complexity of set graph recognition and similar problems
25. Ferdinando Cicalese, Martin Milanič, Romeo Rizzi: On the complexity of the vector connectivity problem
26. Martin Milanič: Graph classes
27. Ademir Hujdurović, Urša Kačar, Martin Milanič, Bernard Ries, Alexandru I. Tomescu: Finding a perfect phylogeny from mixed tumor samples
28. Martin Milanič, Nicolas Trotignon: Counterexamples to three conjectures on equistable graphs
29. Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu: The minimum conflict-free row split problem revisited
30. Endre Boros, Vladimir Gurvich, Martin Milanič, Vladimir Oudalov, Jernej Vičič: A three-person deterministic graphical game without Nash equilibria
31. Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu: Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
32. Martin Milanič: Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
33. Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu: Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
34. Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu: Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
35. Martin Milanič: Decomposing 1-Sperner hypergraphs, with applications to graphs, Séminaires du Pôle 2 : Optimisation combinatoire, algorithmique", LAMSADE, Université Paris-Dauphine, 17. 9. 2018
36. Martin Milanič: Decomposing 1-Sperner hypergraphs, with applications to graphs, Journée-séminaire de combinatoire (équipe CALIN du LIPN, Université Paris-Nord, Villetaneuse), 11. 9. 2018
37. Tinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič: On Almost Well-Covered Graphs of Girth at Least 6
38. Andreas Brandstädt, Martin Milanič: A dichotomy for weighted efficient dominating sets with bounded degree vertices
39. Nina Chiarelli, Martin Milanič: Linear separation of connected dominating sets in graphs
40. Ademir Hujdurović, Martin Milanič, Bernard Ries: Detecting strong cliques
41. Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma: Bipartite graphs of small readability
42. Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič: Avoidable vertices and edges in graphs
43. Martin Milanič: Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19
44. Edin Husić, Martin Milanič: A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
45. Tinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič: Mind the independence gap
46. Vladimir Gurvich, Endre Boros, Martin Milanič, Jernej Vičič: Non realizable degree sequences of dual graphs on surfaces
47. Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler: Edge elimination and weighted graph classes
48. Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič: Strong cliques in diamond-free graphs
49. Clément Jean Dallard, Martin Milanič, Kenny Štorgel: Treewidth versus clique number in graph classes with a forbidden structure
50. Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič: Strong cliques in diamond-free graphs
51. Martin Milanič: Recent results and open problems on CIS Graphs
52. Martin Milanič: A note on domination and independence-domination numbers of graphs
53. Martin Milanič: Strong cliques and stable sets
54. Marcin Kamiński, Paul Medvedev, Martin Milanič: The plane-width of graphs
55. Ferdinando Cicalese, Martin Milanič: Competitive evaluation of threshold functions in the priced information model
56. Marcin Anholcer, Sylwia Cichacz, Martin Milanič: Group irregularity strength of connected graphs
57. Clément Jean Dallard, Mirza Krbezlija, Martin Milanič: Vertex cover at distance on H-free graphs
58. Ferdinando Cicalese, Martin Milanič: Graphs of separability at most 2
59. Nina Chiarelli, Martin Milanič: Linear separation of connected dominating sets in graphs
60. Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Joseph Peters, Ugo Vaccaro: Spread of influence in weighted networks under time and budget constraints
61. Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova: On the readability of overlap digraphs
62. Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Ugo Vaccaro: Latency-bounded target set selection in social networks
63. Flavia Bonomo, Luciano Grippo, Martin Milanič, Martin Dario Safe: Graph classes with and without powers of bounded clique-width
64. Endre Boros, Nina Chiarelli, Martin Milanič: Equistarable bipartite graphs
65. Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova: On the readability of overlap digraphs
66. Tatiana Romina Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma: The price of connectivity for cycle transversals
67. Tatiana Romina Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma: The price of connectivity for cycle transversals
68. Endre Boros, Vladimir Gurvich, Martin Milanič: 1-Sperner hypergraphs and new characterizations of threshold graphs
69. Didem Gozüpek, Ademir Hujdurović, Martin Milanič: Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
70. Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos, Martin Milanič: 1-perfectly orientable K4-minor-free and outerplanar graphs
71. Zakir Deniz, Tinaz Ekim, Tatiana Romina Hartinger, Martin Milanič, Mordechai Shalom: On two extensions of equimatchable graphs
72. Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu: MIPUP
73. Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava: Bipartite graphs of small readability
74. Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič: Improved algorithms for k-domination and total k-domination in proper interval graphs
75. Ademir Hujdurović, Edin Husić, Xinyue Li, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu: Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing
76. Luis Martínez, Martin Milanič, Iker Malaina, Carmen Álvarez, Martín-Blas Pérez, Ildefonso M. de la Fuente: Weighted lambda superstrings applied to vaccine design
77. Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič: New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
78. Endre Boros, Vladimir Gurvich, Martin Milanič: Decomposing 1-Sperner hypergraphs
79. Liliana Alcón, Marisa Gutierreza, Martin Milanič: A characterization of Claw-free CIS graphs and new results on the order of CIS graphs
80. Martin Milanič, Nevena Pivač: Minimal separators in graph classes defined by small forbidden induced subgraphs
81. Martin Milanič, Nevena Pivač, Jernej Vičič: An ILP formulation for a variant of the university timetabling problem
82. Martin Milanič, Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler: Edge elimination schemes of weighted graph classes, Workshop on Graph Modification algorithms, experiments and new problems, 23rd - 24th January 2020, Bergen, Norway
83. Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač, Joachim Schauer: Fair packing of independent sets
84. Eun Jung Kim, Martin Milanič, Jérôme Monnot, Christophe Picouleau: Complexity and algorithms for constant diameter augmentation problems
85. Nina Chiarelli, Clément Jean Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Nevena Pivač, Ulrich Pferschy: Allocating indivisible items with minimum dissatisfaction on preference graphs
86. Clément Jean Dallard, Martin Milanič, Kenny Štorgel: Treewidth versus clique number. I. graph classes with a forbidden structure