vix.ing · top · new · best · stats · spec

Martin Milanič

  1. Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
    2022/06/30 by Clément Dallard, Dallard, Clément, Martin Milanič +3 · 9 citations
    Computer Science · Mathematics · #05C05 #05C40 #05C69 #05C75 (Primary) #05C83 #05C85 #68Q25 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory
  2. Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
    2021/01/01 by Clément Dallard, Martin Milanič, Kenny Štorgel · 4 citations
  3. Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
    2024/02/17 by Clément Dallard, Dallard, Clément, Matjaž Krnc +11 · 8 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Graph theory and applications
  4. Tree decompositions with bounded independence number: beyond independent sets
    2022/09/25 by Martin Milanič, Paweł Rzążewski, Milanič, Martin +1 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #semigroups and automata theory
  5. Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints
    2023/08/18 by Nina Chiarelli, Chiarelli, Nina, Matjaž Krnc +7 · 2 citations
    Decision Sciences · #Auction Theory and Applications