Result 1 to 20 from 65 total
Hamilton cycles in restricted and incomplete rotator graphs. (English)
J. Graph Algorithms Appl. 16, No. 4, 785-810 (2012).
1
The coolest order of binary strings. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 322-333 (2012).
2
Spanning trees with specified differences in Cayley graphs. (English)
Discrete Math. 312, No. 17, 2561-2565 (2012).
3
Divisibility of polynomials over finite fields and combinatorial applications. (English)
Des. Codes Cryptography 63, No. 3, 425-445 (2012).
4
Sets of orthogonal hypercubes of class r (English)
J. Comb. Theory, Ser. A 119, No. 2, 430-439 (2012).
5
Hamilton cycles in restricted rotator graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 324-336 (2011).
6
Uncoverings on graphs and network reliability. (English)
Australas. J. Comb. 50, 219-231 (2011).
7
De Bruijn sequences for the binary strings with maximum density. (English)
Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 182-190 (2011).
8
Digraphs are 2-weight choosable. (English)
Electron. J. Comb. 18, No. 1, Research Paper P21, 4 p., electronic only (2011).
9
Two new measures for permutations: ambiguity and deficiency (English)
IEEE Transactions on Information Theory 57, No. 11, 7648-7657 (2011).
10
De Bruijn sequences for the binary strings with maximum density (English)
WALCOM, 182-190 (2011).
11
Hamilton cycles in restricted rotator graphs (English)
IWOCA, 324-336 (2011).
12
Hamiltonian decompositions of complete $k$-uniform hypergraphs. (English)
Discrete Math. 310, No. 22, 3088-3095 (2010).
13
Bad pairs in software testing. (English)
Bottaci, Leonardo (ed.) et al., Testing ‒ practice and research techniques. 5th international academic and industrial conference, TAIC PART 2010, Windsor, UK, September 3‒5, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15584-0/pbk). Lecture Notes in Computer Science 6303, 39-55 (2010).
14
Ambiguity and deficiency in Costas arrays and APN permutations. (English)
López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 397-406 (2010).
15
io-port 70155552 Mwikirize, Cosmas;
Asiimwe, Arthur Tumusiime;
Musasizi, Lea;
Namuswa, Victoria;
Nakasozi, Mary Dawn;
Mugga, Charles;
Katumba, Andrew;
Tickodri-Togboa, Sandy Stevens;
Butime, Julius;
Musasizi, Paul Isaac
Development of online laboratories for modulation and combinational logic circuit analysis using NI ELVIS II (English)
ITNG, 1069-1073 (2010).
16
Ambiguity and deficiency in costas arrays and APN permutations (English)
LATIN, 397-406 (2010).
17
Bad pairs in software testing (English)
TAIC PART, 39-55 (2010).
18
Locating errors using ELAs, covering arrays, and adaptive testing algorithms. (English)
SIAM J. Discrete Math. 23, No. 4, 1776-1799 (2009).
19
The Hamilton-Waterloo problem for cycle sizes 3 and 4. (English)
J. Comb. Des. 17, No. 4, 342-352 (2009).
20
Result 1 to 20 from 65 total
Start
Contact
Print
General Help
