RSK correspondence and classically irreducible Kirillov–Reshetikhin crystals Fulltext Access 20 Pages 2013
Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey Fulltext Access 20 Pages 2013
Efficient model-checking of dense-time systems with time-convexity analysis Fulltext Access 20 Pages 2013
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II Fulltext Access 20 Pages 2013
Panconnectivity of nn-dimensional torus networks with faulty vertices and edges Fulltext Access 20 Pages 2013
Locating a semi-obnoxious covering facility with repelling polygonal regions Fulltext Access 20 Pages 2013
Backward Solution of Markov Chains and Markov Regenerative Processes: Formalization and Applications Fulltext Access 20 Pages 2013
Fast algorithms for finding a minimum repetition representation of strings and trees Fulltext Access 20 Pages 2013
A superpolynomial lower bound for strategy iteration based on snare memorization Fulltext Access 21 Pages 2013
The computational power of simple protocols for self-awareness on graphs Fulltext Access 21 Pages 2013
Simple agents learn to find their way: An introduction on mapping polygons Fulltext Access 21 Pages 2013
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound) Fulltext Access 21 Pages 2013
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source Fulltext Access 21 Pages 2013
A regularization approach for estimating the type of a plane curve singularity Fulltext Access 21 Pages 2013
Towards a characterization of subfields of the Deligne–Lusztig function fields Fulltext Access 21 Pages 2013
Algebraic and combinatorial aspects of sandpile monoids on directed graphs Fulltext Access 21 Pages 2013
Lattices generated by Chip Firing Game models: Criteria and recognition algorithms Fulltext Access 21 Pages 2013
Linear programming in the semi-streaming model with application to the maximum matching problem Fulltext Access 21 Pages 2013
Verification of Model Transformations: A Survey of the State-of-the-Art Fulltext Access 21 Pages 2013
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs Fulltext Access 21 Pages 2013
Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+13x+1 graph Fulltext Access 22 Pages 2013
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Fulltext Access 22 Pages 2013
Pfaffian decomposition and a Pfaffian analogue of q-Catalan Hankel determinants Fulltext Access 22 Pages 2013
Four one-shot learners for regular tree languages and their polynomial characterizability Fulltext Access 22 Pages 2013
Optimal random matchings, tours, and spanning trees in hierarchically separated trees Fulltext Access 22 Pages 2013
Ordinal theory for expressiveness of well-structured transition systems Fulltext Access 22 Pages 2013
Sets of generators blocking all generators in finite classical polar spaces Fulltext Access 22 Pages 2013
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees Fulltext Access 23 Pages 2013
Continuity of Gödelʼs System T Definable Functionals via Effectful Forcing Fulltext Access 23 Pages 2013
Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey Fulltext Access 23 Pages 2013
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems Fulltext Access 23 Pages 2013
Automatic synthesis of switching controllers for linear hybrid systems: Safety control Fulltext Access 23 Pages 2013
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials Fulltext Access 23 Pages 2013
Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line Fulltext Access 23 Pages 2013
Discrete Time Stochastic Petri Box Calculus with Immediate Multiactions dtsiPBC Fulltext Access 24 Pages 2013
A doubly-refined enumeration of alternating sign matrices and descending plane partitions Fulltext Access 24 Pages 2013
Fishburn diagrams, Fishburn numbers and their refined generating functions Fulltext Access 24 Pages 2013