Result 1 to 20 of 64 total
Degree sequences and the existence of $k$-factors. (English)
Graphs Comb. 28, No. 2, 149-166 (2012).
1
Cyclic orderings and cyclic arboricity of matroids. (English)
J. Comb. Theory, Ser. B 102, No. 3, 638-646 (2012).
2
Detecting 3D position and orientation of a Wii remote using webcams. (English)
Allbeck, Jan M. (ed.) et al., Motion in games. 4th international conference, MIG 2011, Edinburgh, UK, November 13‒15, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25089-7/pbk). Lecture Notes in Computer Science 7060, 448-458 (2011).
3
Special issue: Selected papers based on the presentations at the 22nd British combinatorial conference, St. Andrews, UK, July 6‒10, 2009. (English)
Discrete Math. 311, No. 13, 1073-1254 (2011).
4
Finding paths between 3-colorings. (English)
J. Graph Theory 67, No. 1, 69-82 (2011).
5
Finding paths between 3-colorings (English)
Journal of Graph Theory 67, No. 1, 69-82 (2011).
6
Detecting 3D position and orientation of a wii remote using webcams (English)
MIG, 448-458 (2011).
7
A general approach to distance-two colouring of graphs on surfaces. (English)
Acharya, B. D. (ed.) et al., Advances in discrete mathematics and applications: Mysore, 2008. Proceedings of the international conference on discrete mathematics (ICDM 2008), Mysore, India, June 6‒10, 2008. Mysore: Ramanujan Mathematical Society (ISBN 978-93-80416-03-8/hbk). Ramanujan Mathematical Society Lecture Notes Series 13, 59-67 (2010).
8
Optimizing throughput for limited receiver circuit power (English)
ISCAS, 1013-1016 (2010).
9
Optimal transmission rate for ultra low-power receivers (English)
PIMRC, 93-98 (2010).
10
Spatial filtering approach for dynamic range reduction in cognitive radios (English)
PIMRC, 2657-2662 (2010).
11
Finding paths between 3-colourings. (English)
Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12‒15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 182-196 (2009).
12
Mixing 3-colourings in bipartite graphs. (English)
Eur. J. Comb. 30, No. 7, 1593-1606 (2009).
13
Mixing 3-colourings in bipartite graphs (English)
Eur. J. Comb. 30, No. 7, 1593-1606 (2009).
14
A unified approach to distance-two colouring of planar graphs (English)
SODA, 273-282 (2009).
15
On the complexity of ordered colorings. (English)
SIAM J. Discrete Math. 22, No. 2, 832-847 (2008).
16
Transversals of subtree hypergraphs and the source location problem in digraphs. (English)
Networks 51, No. 2, 113-119 (2008).
17
Connectedness of the graph of vertex-colourings. (English)
Discrete Math. 308, No. 5-6, 913-919 (2008).
18
Finding paths between 3-colourings (English)
IWOCA, 182-196 (2008).
19
Frugal colouring of graphs. (English)
Comput. Res. Repos. 2007, Article No. 0705.0422 (2007).
20
Result 1 to 20 of 64 total
Start
Contact
Print
General Help
