• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Daneshyari Discrete Mathematics and Combinatorics Journas Latest Articles

Discrete Mathematics and Combinatorics Research Articles

Comparing bacterial genomes from linear orders of patterns
Fulltext Access 12 Pages 2008
An improved ant colony optimisation heuristic for graph colouring
Fulltext Access 12 Pages 2008
Computing finest mincut partitions of a graph and application to routing problems
Fulltext Access 12 Pages 2008
Constructive generation of very hard 3-colorability instances
Fulltext Access 12 Pages 2008
Parameterized algorithmics for linear arrangement problems
Fulltext Access 12 Pages 2008
Feedback vertex set on AT-free graphs
Fulltext Access 12 Pages 2008
The general σσ all-ones problem for trees
Fulltext Access 12 Pages 2008
A covering problem that is easy for trees but NP-complete for trivalent graphs
Fulltext Access 12 Pages 2008
A general model for cyclic machine scheduling problems
Fulltext Access 12 Pages 2008
On edge-weighted recursive trees and inversions in random permutations
Fulltext Access 12 Pages 2008
The colourful feasibility problem
Fulltext Access 12 Pages 2008
The bondage numbers and efficient dominations of vertex-transitive graphs
Fulltext Access 12 Pages 2008
Covering point sets with two disjoint disks or squares
Fulltext Access 12 Pages 2008
On corners of objects built from parallelepiped bricks
Fulltext Access 12 Pages 2008
On the stable bb-matching problem in multigraphs
Fulltext Access 12 Pages 2008
Algorithms for bivariate zonoid depth
Fulltext Access 12 Pages 2008
Optimal clustering of multipartite graphs
Fulltext Access 12 Pages 2008
On bags and bugs
Fulltext Access 12 Pages 2008
Tight blocking sets in some maximum packings of λKnλKn
Fulltext Access 12 Pages 2008
Decomposition of Smith graphs in maximal reflexive cacti
Fulltext Access 12 Pages 2008
Ideals and graphs, Gröbner bases and decision procedures in graphs
Fulltext Access 12 Pages 2008
An equivalence relation in finite planar spaces
Fulltext Access 12 Pages 2008
Beta-expansion and continued fraction expansion over formal Laurent series
Fulltext Access 13 Pages 2008
Lattice basis reduction algorithms and multi-dimensional continued fractions
Fulltext Access 13 Pages 2008
Cyclic codes over GR(p2,m) of length pk
Fulltext Access 13 Pages 2008
Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes
Fulltext Access 13 Pages 2008
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
Fulltext Access 13 Pages 2008
Isometric full embeddings of DW(2n−1,q) into DH(2n−1,q2)
Fulltext Access 13 Pages 2008
Geometric constructions of optimal linear perfect hash families
Fulltext Access 13 Pages 2008
A unified interpretation of several combinatorial dualities
Fulltext Access 13 Pages 2008
A dual ascent procedure for the set partitioning problem
Fulltext Access 13 Pages 2008
Global solution of optimization problems with signomial parts
Fulltext Access 13 Pages 2008
Nonlinear bipartite matching
Fulltext Access 13 Pages 2008
On the approximation of the single source k-splittable flow problem
Fulltext Access 13 Pages 2008
New algorithms for text fingerprinting
Fulltext Access 13 Pages 2008
Intersection representations of matrices by subtrees and unicycles on graphs
Fulltext Access 13 Pages 2008
Brace-Daykin type inequalities for intersecting families
Fulltext Access 13 Pages 2008
On finite edge transitive graphs and rotary maps
Fulltext Access 13 Pages 2008
Erdős–Ko–Rado theorems for permutations and set partitions
Fulltext Access 13 Pages 2008
Whiskers and sequentially Cohen–Macaulay graphs
Fulltext Access 13 Pages 2008
Counting permutations by their alternating runs
Fulltext Access 13 Pages 2008
Adaptive identification in graphs
Fulltext Access 13 Pages 2008
The 2-adic valuation of a sequence arising from a rational integral
Fulltext Access 13 Pages 2008
The endomorphism monoid of Pn¯
Fulltext Access 13 Pages 2008
Block transitivity and degree matrices
Fulltext Access 13 Pages 2008
Combinatorial probability interpretation of certain modified orthogonal polynomials
Fulltext Access 13 Pages 2008
Spanning cycles in regular matroids without M∗(K5)M∗(K5) minors
Fulltext Access 13 Pages 2008
The 3D Dimer and Ising problems revisited
Fulltext Access 13 Pages 2008
Knot invariants and the Bollobás–Riordan polynomial of embedded graphs
Fulltext Access 13 Pages 2008
CPR graphs and regular polytopes
Fulltext Access 13 Pages 2008
Tabloids and weighted sums of characters of certain modules of the symmetric groups
Fulltext Access 13 Pages 2008
Embeddability of arrangements of pseudocircles into the sphere
Fulltext Access 13 Pages 2008
Constructions of partitioned difference families
Fulltext Access 13 Pages 2008
Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with odd characteristic
Fulltext Access 13 Pages 2008
Euler–Mahonian triple set-valued statistics on permutations
Fulltext Access 13 Pages 2008
Tetravalent half-arc-transitive graphs of order p4p4
Fulltext Access 13 Pages 2008
Substitution tilings with statistical circular symmetry
Fulltext Access 13 Pages 2008
Cluster structures and collections of Galois closed entity subsets
Fulltext Access 13 Pages 2008
On finding augmenting graphs
Fulltext Access 13 Pages 2008
Routing to reduce the cost of wavelength conversion
Fulltext Access 13 Pages 2008
Non-deterministic ideal operators: An adequate tool for formalization in Data Bases
Fulltext Access 13 Pages 2008
Comprehensive vs. comprehensible classifiers in logical analysis of data
Fulltext Access 13 Pages 2008
Extended resolution simulates binary decision diagrams
Fulltext Access 13 Pages 2008
Ratewise-optimal non-sequential search strategies under constraints on the tests
Fulltext Access 13 Pages 2008
An efficient algorithm for the three-guard problem
Fulltext Access 13 Pages 2008
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Fulltext Access 13 Pages 2008
Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
Fulltext Access 13 Pages 2008
Ordering graphs with index in the interval (2,2+5)
Fulltext Access 13 Pages 2008
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
Fulltext Access 13 Pages 2008
Convex drawings of graphs with non-convex boundary constraints
Fulltext Access 13 Pages 2008
Identical part production in cyclic robotic cells: Concepts, overview and open questions
Fulltext Access 13 Pages 2008
Sparse geometric graphs with small dilation
Fulltext Access 13 Pages 2008
Edge-unfolding nested polyhedral bands
Fulltext Access 13 Pages 2008
Lower bounds for expected-case planar point location
Fulltext Access 13 Pages 2008
Query point visibility computation in polygons with holes
Fulltext Access 13 Pages 2008
On local transformations in plane geometric graphs embedded on small grids
Fulltext Access 13 Pages 2008
Improving the topology computation of an arrangement of cubics
Fulltext Access 13 Pages 2008
The flow complex: A data structure for geometric modeling
Fulltext Access 13 Pages 2008
Unfolding Manhattan Towers
Fulltext Access 13 Pages 2008
Time offset optimization in digital broadcasting
Fulltext Access 13 Pages 2008
Petri net modelling of biological regulatory networks
Fulltext Access 13 Pages 2008
A parallel extended GCD algorithm
Fulltext Access 13 Pages 2008
Lossless filter for multiple repetitions with Hamming distance
Fulltext Access 13 Pages 2008
Approximate colored range and point enclosure queries
Fulltext Access 13 Pages 2008
On k-connectivity problems with sharpened triangle inequality
Fulltext Access 13 Pages 2008
Algorithms for media
Fulltext Access 13 Pages 2008
Steiner hull algorithm for the uniform orientation metrics
Fulltext Access 13 Pages 2008
Constant memory routing in quasi-planar and quasi-polyhedral graphs
Fulltext Access 13 Pages 2008
On polyhedra induced by point sets in space
Fulltext Access 13 Pages 2008
An adaptive memory algorithm for the k-coloring problem
Fulltext Access 13 Pages 2008
Shuffling biological sequences with motif constraints
Fulltext Access 13 Pages 2008
Solving some NP-complete problems using split decomposition
Fulltext Access 13 Pages 2008
A distance approximating trees
Fulltext Access 13 Pages 2008
Constructions of optimal GDRP(n,λ;v)(n,λ;v)’s of type λ1μm−1λ1μm−1
Fulltext Access 13 Pages 2008
The six classes of trees with the largest algebraic connectivity
Fulltext Access 13 Pages 2008
An upper bound on the independence number of benzenoid systems
Fulltext Access 13 Pages 2008
Batch processing with interval graph compatibilities between tasks
Fulltext Access 13 Pages 2008
Fractionally total colouring Gn,pGn,p
Fulltext Access 13 Pages 2008
On classes of minimal circular-imperfect graphs
Fulltext Access 13 Pages 2008
Hosoya polynomials under gated amalgamations
Fulltext Access 13 Pages 2008
<< < 180 181 182 183 184 > >>
Related Topics
Simulated annealing Articles
1787 Papers
Linear programming Articles
1748 Papers
Algorithm Articles
1719 Papers
Graph theory Articles
1382 Papers
Combinatorial optimization Articles
1214 Papers
Fourier transform Articles
1050 Papers
Markov chain Articles
957 Papers
Laplace transform Articles
639 Papers
Algebra and Number Theory Articles
Analysis Articles
Applied Mathematics Articles
Computational Mathematics Articles
Control and Optimization Articles
Discrete Mathematics and Combinatorics Articles
Geometry and Topology Articles
Logic Articles
Mathematical Physics Articles
Mathematics (General) Articles
Modelling and Simulation Articles
Numerical Analysis Articles
Statistics and Probability Articles
Theoretical Computer Science Articles
All Topics
Related Journals
Algebra and Number Theory Journals
Analysis Journals
Applied Mathematics Journals
Computational Mathematics Journals
Control and Optimization Journals
Discrete Mathematics and Combinatorics Journals
Geometry and Topology Journals
Logic Journals
Mathematical Physics Journals
Mathematics (General) Journals
Modelling and Simulation Journals
Numerical Analysis Journals
Statistics and Probability Journals
Theoretical Computer Science Journals
Computational Geometry Journal
Discrete Applied Mathematics Journal
Electronic Notes in Theoretical Computer Science Journal
Journal of Discrete Algorithms Journal
Surveys in Operations Research and Management Science Journal
Discrete Optimization Journal
Operations Research Letters Journal
Finite Fields and Their Applications Journal
Advances in Applied Mathematics Journal
AKCE International Journal of Graphs and Combinatorics Journal
Discrete Mathematics Journal
Electronic Notes in Discrete Mathematics Journal
European Journal of Combinatorics Journal
Journal of Combinatorial Theory, Series A Journal
Journal of Combinatorial Theory, Series B Journal

Daneshyari.com

دسترسی سریع

  • صفحه اصلی دانشیاری
  • دسته بندی موضوعی مقالات
  • مقالات ترجمه شده
  • سفارش ترجمه مقاله
  • سفارش تولید محتوا
  • تولید محتوا

ارتباط

  • ورود
  • عضویت
  • تماس و پشتیبانی
  • تبلیغات

English Website

  • Home
  • Physical Sciences and Engineering
  • Life Sciences
  • Health Sciences
  • Social Sciences and Humanities