• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Daneshyari Theoretical Computer Science Journas Latest Articles

Theoretical Computer Science Research Articles

Ohba’s conjecture for graphs with independence number five
Fulltext Access 10 Pages 2011
An iterative construction of isospectral digraphs
Fulltext Access 10 Pages 2011
A linear time and space algorithm for detecting path intersection in Zd
Fulltext Access 10 Pages 2011
Computing efficiently the lattice width in any dimension
Fulltext Access 10 Pages 2011
A reconstruction algorithm for a subclass of instances of the 2-color problem
Fulltext Access 10 Pages 2011
Optimal algorithms for online scheduling with bounded rearrangement at the end
Fulltext Access 10 Pages 2011
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Fulltext Access 10 Pages 2011
Research problems from the BCC22
Fulltext Access 10 Pages 2011
Rainbow graph splitting
Fulltext Access 10 Pages 2011
Spreads, arcs, and multiple wavelength codes
Fulltext Access 10 Pages 2011
Cycles in kk-traceable oriented graphs
Fulltext Access 10 Pages 2011
Bounding χχ in terms of ωω and ΔΔ for some classes of graphs
Fulltext Access 10 Pages 2011
An edge deletion model for complex networks
Fulltext Access 10 Pages 2011
On the complexity of the independent set problem in triangle graphs
Fulltext Access 11 Pages 2011
Coquet-type formulas for the rarefied weighted Thue–Morse sequence
Fulltext Access 11 Pages 2011
How to eat 4/94/9 of a pizza
Fulltext Access 11 Pages 2011
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
Fulltext Access 11 Pages 2011
The base of a primitive, nonpowerful sign pattern with exactly dd nonzero diagonal entries
Fulltext Access 11 Pages 2011
Infinite matroids in graphs
Fulltext Access 11 Pages 2011
Small cycle covers of 3-connected cubic graphs
Fulltext Access 11 Pages 2011
One-regular graphs of square-free order of prime valency
Fulltext Access 11 Pages 2011
Nonexistence of CW(154,36) and CW(170,64)
Fulltext Access 11 Pages 2011
Notes on lattice points of zonotopes and lattice-face polytopes
Fulltext Access 11 Pages 2011
List precoloring extension in planar graphs
Fulltext Access 11 Pages 2011
The problem of singularity for planar grids
Fulltext Access 11 Pages 2011
Pósa-condition and nowhere-zero 3-flows
Fulltext Access 11 Pages 2011
The Randić index and the diameter of graphs
Fulltext Access 11 Pages 2011
Congruences for generalized Frobenius partitions with 4 colors
Fulltext Access 11 Pages 2011
A proof of the linearity conjecture for k-blocking sets in PG(n,p3), p prime
Fulltext Access 11 Pages 2011
On a group testing problem: Characterization of graphs with 2-complexity c2c2 and maximum number of edges
Fulltext Access 11 Pages 2011
Dynamic monopolies with randomized starting configuration
Fulltext Access 11 Pages 2011
Parameterizing cut sets in a graph by the number of their components
Fulltext Access 11 Pages 2011
A volume first maxima-finding algorithm
Fulltext Access 11 Pages 2011
Conditional matching preclusion for the arrangement graphs
Fulltext Access 11 Pages 2011
Larger lower bounds on the OBDD complexity of integer multiplication
Fulltext Access 11 Pages 2011
Asymptotics of the convex hull of spherically symmetric samples
Fulltext Access 11 Pages 2011
On the structure of cube tilings and unextendible systems of cubes in low dimensions
Fulltext Access 11 Pages 2011
Forbidden configurations and repeated induction
Fulltext Access 11 Pages 2011
Large non-planar graphs and an application to crossing-critical graphs
Fulltext Access 11 Pages 2011
A Gilbert–Varshamov-type bound for lattice packings
Fulltext Access 11 Pages 2011
Classification of the family AT4(qs,q,q)AT4(qs,q,q) of antipodal tight graphs
Fulltext Access 11 Pages 2011
Perfect matchings as IID factors on non-amenable groups
Fulltext Access 11 Pages 2011
Four-class skew-symmetric association schemes
Fulltext Access 11 Pages 2011
On the structure of 3-nets embedded in a projective plane
Fulltext Access 11 Pages 2011
Transversals to the convex hulls of all k-sets of discrete subsets of Rn
Fulltext Access 11 Pages 2011
Partitions and indivisibility properties of countable dimensional vector spaces
Fulltext Access 11 Pages 2011
Completing partial packings of bipartite graphs
Fulltext Access 11 Pages 2011
Unavoidable subhypergraphs: a-clusters
Fulltext Access 11 Pages 2011
Characterizing geometric designs, II
Fulltext Access 11 Pages 2011
Regularity of edge ideals of C4-free graphs via the topology of the lcm-lattice
Fulltext Access 11 Pages 2011
On the unimodality of independence polynomials of some graphs
Fulltext Access 11 Pages 2011
Extremal graphs for the identifying code problem
Fulltext Access 11 Pages 2011
Strong matching preclusion
Fulltext Access 11 Pages 2011
Laced Boolean functions and subset sum problems in finite fields
Fulltext Access 11 Pages 2011
Lagrangean Relaxation Parallel Method for Optimizing of a Hydroelectric Generation System
Fulltext Access 11 Pages 2011
Constructive Description Logics Hybrid-Style
Fulltext Access 11 Pages 2011
Modular Modelling in Synthetic Biology: Light-Based Communication in E. coli
Fulltext Access 11 Pages 2011
Mathematical Approach to Predict the Drug Effects on Cancer Stem Cell Models
Fulltext Access 11 Pages 2011
Event B Development of a Synchronous AADL Scheduler
Fulltext Access 11 Pages 2011
Generic Executable Semantics for D-Clean
Fulltext Access 11 Pages 2011
Confluence Results for a Quantum Lambda Calculus with Measurements
Fulltext Access 11 Pages 2011
Scalar System F for Linear-Algebraic λ-Calculus: Towards a Quantum Physical Logic
Fulltext Access 11 Pages 2011
Untangling planar graphs from a specified vertex position—Hard cases
Fulltext Access 11 Pages 2011
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Fulltext Access 11 Pages 2011
An ss–tt connection problem with adaptability
Fulltext Access 11 Pages 2011
Exponential time improvement for min-wise based algorithms
Fulltext Access 11 Pages 2011
Hamiltonian cycles passing through linear forests in kk-ary nn-cubes
Fulltext Access 11 Pages 2011
Supereulerian graphs in the graph family C2(6,k)C2(6,k)
Fulltext Access 11 Pages 2011
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Fulltext Access 11 Pages 2011
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Fulltext Access 11 Pages 2011
Approximation schemes for parallel machine scheduling with availability constraints
Fulltext Access 11 Pages 2011
L(2,1)L(2,1)-labeling of perfect elimination bipartite graphs
Fulltext Access 11 Pages 2011
Flow hypergraph reducibility
Fulltext Access 11 Pages 2011
On exact blockers and anti-blockers, ΔΔ-conjecture, and related problems
Fulltext Access 11 Pages 2011
The L(2,1)L(2,1)-labeling of unigraphs
Fulltext Access 11 Pages 2011
Some special minimum kk-geodetically connected graphs
Fulltext Access 11 Pages 2011
Enumerating (2+2)-free posets by the number of minimal elements and other statistics
Fulltext Access 11 Pages 2011
Improved online algorithms for parallel job scheduling and strip packing
Fulltext Access 11 Pages 2011
Parameter estimation for Boolean models of biological networks
Fulltext Access 11 Pages 2011
The convergence classes of Collatz function
Fulltext Access 11 Pages 2011
Approximating the longest paths in grid graphs
Fulltext Access 11 Pages 2011
Succinct data structures for Searchable Partial Sums with optimal worst-case performance
Fulltext Access 11 Pages 2011
Drawing graphs with right angle crossings
Fulltext Access 11 Pages 2011
Randomized competitive algorithms for online buffer management in the adaptive adversary model
Fulltext Access 11 Pages 2011
Oracle-based flocking of mobile robots in crash-recovery model
Fulltext Access 11 Pages 2011
Nash equilibria in stabilizing systems
Fulltext Access 11 Pages 2011
Computing by observing: Simple systems and simple observers
Fulltext Access 11 Pages 2011
Abstract geometrical computation 4: Small Turing universal signal machines
Fulltext Access 11 Pages 2011
Four states are enough!
Fulltext Access 11 Pages 2011
Locating–dominating codes in paths
Fulltext Access 11 Pages 2011
Graph grammars with string-regulated rewriting
Fulltext Access 11 Pages 2011
Succinct representation of dynamic trees
Fulltext Access 11 Pages 2011
Improved algorithms for latency minimization in wireless networks
Fulltext Access 11 Pages 2011
Maximum bipartite flow in networks with adaptive channel width
Fulltext Access 11 Pages 2011
Faster parameterized algorithms for minor containment
Fulltext Access 11 Pages 2011
Rectangle packing with additional restrictions
Fulltext Access 11 Pages 2011
A linear translation from CTL* to the first-order modal μ -calculus
Fulltext Access 11 Pages 2011
Unguardedness mostly means many solutions
Fulltext Access 11 Pages 2011
Canonical forms of uptimals
Fulltext Access 11 Pages 2011
On the complexity of some colorful problems parameterized by treewidth
Fulltext Access 11 Pages 2011
<< < 117 118 119 120 121 > >>
Related Topics
Fuzzy logic Articles
2743 Papers
Earthquakes Articles
770 Papers
Information theory Articles
762 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
Discrete Applied Mathematics Journal
Electronic Notes in Theoretical Computer Science Journal
Information and Computation Journal
Theoretical Computer Science Journal
Journal of the Nigerian Mathematical Society Journal
AKCE International Journal of Graphs and Combinatorics Journal
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