The following pages link to Discrete Applied Mathematics (Q96294):
Displaying 50 items.
- Graph spectra as a systematic tool in computational biology (Q1026212) (← links)
- A note on fundamental, non-fundamental, and robust cycle bases (Q1026213) (← links)
- A refinement of the common cause principle (Q1026214) (← links)
- Discovering cis-regulatory modules by optimizing barbecues (Q1026216) (← links)
- A mathematical program to refine gene regulatory networks (Q1026217) (← links)
- Modeling and simulation of metabolic networks for estimation of biomass accumulation parame\-ters (Q1026221) (← links)
- On optimization, dynamics and uncertainty: A tutorial for gene-environment networks (Q1026224) (← links)
- Corrigendum to ``Variable space search for graph coloring'' [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)] (Q1028098) (← links)
- The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)
- On the spanning fan-connectivity of graphs (Q1028100) (← links)
- Superconnectivity of regular graphs with small diameter (Q1028102) (← links)
- Short containers in Cayley graphs (Q1028103) (← links)
- Polynomial reduction of time-space scheduling to time scheduling (Q1028105) (← links)
- Conjugated trees with minimum general Randić index (Q1028106) (← links)
- The number of independent sets in unicyclic graphs with a given diameter (Q1028107) (← links)
- Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- On randomized algorithms for the majority problem (Q1028119) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- Simple games and weighted games: A theoretical and computational viewpoint (Q1028122) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Molecular graphs and the inverse Wiener index problem (Q1028127) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- The upper connected geodetic number and forcing connected geodetic number of a graph (Q1028129) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- On the 3-restricted edge connectivity of permutation graphs (Q1028132) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- The vertex PI index and Szeged index of bridge graphs (Q1028135) (← links)
- RNA secondary structure, permutations, and statistics (Q1028137) (← links)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139) (← links)
- On reciprocal complementary Wiener number (Q1028140) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- An improved randomized approximation algorithm for maximum triangle packing (Q1028142) (← links)
- On the diameter of a domination dot-critical graph (Q1028143) (← links)
- Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees (Q1028145) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- On the number of connected convex subgraphs of a connected acyclic digraph (Q1028149) (← links)
- A connection between circular colorings and periodic schedules (Q1028150) (← links)
- On intermediate factorial languages (Q1028151) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Unbordered partial words (Q1028413) (← links)
- Locating a minisum circle in the plane (Q1028414) (← links)
- On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures (Q1028416) (← links)
- A generalization of Lucas polynomial sequence (Q1028417) (← links)
