1. On relationships between treewidth, clique number, tree-independence number, and induced minors : master’s thesisÐorđe Vasić, 2025, master's thesis Keywords: treewidth, clique number, tree-independence number, induced minor, hered itary graph class, bipartite chain graph
Published in RUP: 11.09.2025; Views: 723; Downloads: 9
 Full text (839,36 KB) |
2. Edge elimination and weighted graph classesJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, published scientific conference contribution Keywords: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm
Published in RUP: 10.11.2020; Views: 3098; Downloads: 38
 Link to full text |
3. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, original scientific article Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published in RUP: 26.07.2019; Views: 3678; Downloads: 103
Link to full text |
4. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, published scientific conference contribution abstract (invited lecture) Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published in RUP: 17.09.2018; Views: 3459; Downloads: 22
Link to full text |
5. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, published scientific conference contribution Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published in RUP: 17.09.2018; Views: 4363; Downloads: 72
Link to full text |
