Result 1 to 20 from 2247 total
Generating functions for inscribed polyominoes. (English)
Discrete Appl. Math. 161, No. 1-2, 151-166 (2013).
1
Avoidance of boxed mesh patterns on permutations. (English)
Discrete Appl. Math. 161, No. 1-2, 43-51 (2013).
2
ALLQBF solving by computational learning. (English)
Chakraborty, Supratik (ed.) et al., Automated technology for verification and analysis. 10th international symposium, ATVA 2012, Thiruvananthapuram, India, October 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33385-9/pbk). Lecture Notes in Computer Science 7561, 370-384 (2012).
3
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. (English)
Comput. Oper. Res. 39, No. 1, 27-31 (2012).
4
Cellular automata on irregular tessellations. (English)
Dyn. Syst. 27, No. 4, 411-430 (2012).
5
Enumeration and leader election in partially anonymous and multi-hop broadcast networks. (English)
Fundam. Inform. 120, No. 1, 1-27 (2012).
6
The vertical profile of embedded trees. (English)
Electron. J. Comb. 19, No. 3, Research Paper P46, 61 p., electronic only (2012).
7
Independent sets in graphs with given minimum degree. (English)
Electron. J. Comb. 19, No. 3, Research Paper P37, 11 p., electronic only (2012).
8
The enumeration of three pattern classes using monotone grid classes. (English)
Electron. J. Comb. 19, No. 3, Research Paper P20, 34 p., electronic only (2012).
9
Combinatorial logarithm and point-determining cographs. (English)
Electron. J. Comb. 19, No. 3, Research Paper P8, 11 p., electronic only (2012).
10
The number of nilpotent semigroups of degree 3. (English)
Electron. J. Comb. 19, No. 2, Research Paper P51, 19 p., electronic only (2012).
11
Enumeration formulæ for pattern restricted Stirling permutations. (English)
Discrete Math. 312, No. 21, 3179-3194 (2012).
12
Complementary vertices and adjacency testing in polytopes. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 507-518 (2012).
13
Embedding countable partial orderings in the enumeration degrees and the $ω$-enumeration degrees. (English)
J. Log. Comput. 22, No. 4, 927-952 (2012).
14
Non-cuppable enumeration degrees via finite injury. (English)
J. Log. Comput. 22, No. 4, 807-829 (2012).
15
Embedding distributive lattices in the $Σ^{0}_{2}$ enumeration degrees. (English)
J. Log. Comput. 22, No. 4, 779-792 (2012).
16
Turing and enumeration jumps in the Ershov hierarchy. (English)
J. Log. Comput. 22, No. 4, 737-743 (2012).
17
Least enumerations of partial structures. (English)
J. Log. Comput. 22, No. 4, 717-735 (2012).
18
Constant-memory iterative generation of special strings representing binary trees. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 375-387 (2012).
19
Asymptotic enumeration of minimal automata. (English)
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th ‒ March 3rd, 2012. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS ‒ Leibniz International Proceedings in Informatics 14, 88-99, electronic only (2012).
20
Result 1 to 20 from 2247 total
Start
Contact
Print
General Help
