scientific article; zbMATH DE number 3566474
From MaRDI portal
Publication:4138414
Applications of mathematical programming (90C90) Genetics and epigenetics (92D10) Applications of game theory (91A80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical sociology (including anthropology) (91D99) General biology and biomathematics (92B05) Trade models (91B60)
Cited in
(only showing first 100 items - show all)- Optimal resource allocation in the difference and differential Stackelberg games on marketing networks
- Algorithms on subgraph overlap graphs
- Reduction in problem size for ranking alternatives in group decision- making
- Preference structure on alternatives and judges in a group decision problem—a fuzzy approach
- Minimal obstructions for partial representations of interval graphs
- Dynamic resource allocation networks in marketing: comparing the effectiveness of control methods
- Reformulating Markovian processes for learning and memory from a hazard function framework
- Chronological Orderings of Interval Digraph
- Inheritance principle in dynamical systems
- Sources in posets and comparability graphs
- Periodic, irreducible, powerful ray pattern matrices
- Characterizations of fuzzy interval graphs
- On eventual boundedness of Lotka-Volterra ecological systems
- Satisfiability problems on intervals and unit intervals
- Probabilistic Inductive Classes of Graphs
- On the problem of how to represent a graph taking into account an additional structure
- Parallel algorithms on interval graphs
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
- Passage time, resilience, and structure of compartmental models
- Mutual exclusion scheduling with interval graphs or related classes. I
- A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks
- Fuzzy intersection graphs
- Minimum weight feedback vertex sets in circle graphs
- Chronological orderings of interval graphs
- On an extremal problem concerning the interval number of a graph
- A note on lower bounds for boxicity of graphs
- Rectangular Matrices and Signed Graphs
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Algorithms on Subtree Filament Graphs
- Boxicity of circular arc graphs
- Double Semiorders and Double Indifference Graphs
- Features of modeling and identification of cognitive maps under uncertainty
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Consensus functions and patterns in molecular sequences
- On optimal orientations of Cartesian products of graphs. I
- Matrix sandwich problems
- Finding Hamiltonian circuits in proper interval graphs
- Optimal patchings for consecutive ones matrices
- Intersection graphs of paths in a tree
- On optimal orientation of cycle vertex multiplications
- Boxicity of graphs with bounded degree
- Finding hidden independent sets in interval graphs
- Comparability graphs and intersection graphs
- Transitivity of fuzzy matrices under generalized connectedness
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Parallel algorithms on circular-arc graphs
- Large-scale clique cover of real-world networks
- Intersection graphs of concatenable subtrees of graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Homogeneously representable interval graphs
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
- Analysis of an ecological niche
- A necessary but insufficient condition for the stochastic binary choice problem
- Easy weighted majority games
- Gridline indifference graphs
- Automation of impulse processes control in cognitive maps with multirate sampling based on weights varying
- Niche space, multigraphs, and the Helly condition
- Optimal parallel algorithms on circular-arc graphs
- A model of the direct interaction of elements of a tightly coupled system
- Complexity of compartmental models
- Resource network with limited capacity of attractor vertices
- Meaningful and meaningless solutions for cooperative \(n\)-person games
- Constructing a stochastic critical path network given the slacks: Representation
- A fuzzy relation space for group decision theory
- Preference voting and project ranking using DEA and cross-evaluation
- Some parallel algorithms on interval graphs
- On fuzzification of some concepts of graphs
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Adaptive control of impulse processes in complex systems cognitive maps with multirate coordinates sampling
- Interval representations of planar graphs
- Partitioning Signed Two-Mode Networks
- The relationship between the threshold dimension of split graphs and various dimensional parameters
- On optimal orientations of Cartesian products with a bipartite graph
- Algorithm for determining the mutual impact of nodes in weighted directed graphs
- On the stabilization of iterative processes
- On periodical behaviour in societies with symmetric influences
- Isomorphism in 3-person games
- A recognition algorithm for the intersection graphs of paths in trees
- Chronological orderings of interval digraphs
- Dominating sets and domatic number of circular arc graphs
- From the discrete to the continuous: Relationships and results for single-species population models
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
- Modular intersection graphs
- A characterization of cycle-free unit probe interval graphs
- Some remarks on conflict analysis
- Combined stress and human performance: A weighted digraph model
- A study of Euler resource networks
- Some results about the interval number of a graph
- \((i,j)\) competition graphs
- Representation theorems for graphs whose vertex set is partially ordered
- Issues of dynamic graph theory
- Impediments to universal preference-based default theories
- Mutual exclusion scheduling with interval graphs or related classes. II
- Interval graphs with side (and size) constraints
- Applications of the theory of meaningfulness to psychology
- Intersection graphs of Helly families of subtrees
- A mathematical approach on representation of competitions: competition cluster hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138414)