The following pages link to Martin Milanič (Q266922):
Displaying 50 items.
- The average order of dominating sets of a graph (Q2231709) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Equistable graphs, general partition graphs, triangle graphs, and graph products (Q2275915) (← links)
- Bounds on the locating-total domination number in trees (Q2282462) (← links)
- Avoidable vertices and edges in graphs (Q2285088) (← links)
- A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs (Q2301550) (← links)
- Minimal separators in graph classes defined by small forbidden induced subgraphs (Q2301558) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Group irregularity strength of connected graphs (Q2352344) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- On the complexity of the identifiable subgraph problem, revisited (Q2357777) (← links)
- Cliques in the union of \(C_4\)-free graphs (Q2413627) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
- Graphs whose complement and square are isomorphic (Q2449164) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Recognizing k-equistable Graphs in FPT Time (Q2827831) (← links)
- The exact weighted independent set problem in perfect graphs and related classes (Q2840556) (← links)
- New Polynomial Cases of the Weighted Efficient Domination Problem (Q2849909) (← links)
- On the plane-width of graphs (Q2851531) (← links)
- Improved inequality between Zagreb indices of trees (Q2856714) (← links)
- Linear Separation of Total Dominating Sets in Graphs (Q2864299) (← links)
- Simple and fast reoptimizations for the Steiner tree problem (Q2867366) (← links)
- Induced Subtrees in Interval Graphs (Q2870030) (← links)
- A note on domination and independence-domination numbers of graphs (Q2925428) (← links)
- (Q2934676) (← links)
- On the Readability of Overlap Digraphs (Q2942251) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs (Q2978190) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- On the Maximum Independent Set Problem in Subclasses of Planar Graphs (Q3075609) (← links)
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
- The plane-width of graphs (Q3096959) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Computing with Priced Information: When the Value Makes the Price (Q3596734) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem (Q4554347) (← links)
- Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs (Q4558969) (← links)
- On Almost Well-Covered Graphs of Girth at Least 6 (Q4560269) (← links)
- Vector connectivity in graphs (Q4642479) (← links)
