Result 1 to 20 of 120 total
The total chromatic number of split-indifference graphs. (English)
Discrete Math. 312, No. 17, 2690-2693 (2012).
1
Clique-colouring and biclique-colouring unichord-free graphs. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 530-541 (2012).
2
Morphological image processing applied in biomedicine. (English)
Deserno, Thomas M. (ed.), Biomedical image processing. Berlin: Springer (ISBN 978-3-642-15815-5/hbk; 978-3-642-15816-2/ebook). Biological and Medical Physics, Biomedical Engineering, 107-129 (2011).
3
Supporting audits and assessments in multi-model environments. (English)
Caivano, Danilo (ed.) et al., Product-focused software process improvement. 12th international conference, PROFES 2011, Torre Canne, Italy, June 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21842-2/pbk). Lecture Notes in Computer Science 6759, 73-87 (2011).
4
Total chromatic number of unichord-free graphs. (English)
Discrete Appl. Math. 159, No. 16, 1851-1864 (2011).
5
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs. (English)
Networks 57, No. 3, 261-269 (2011).
6
Complexity dichotomy on partial grid recognition. (English)
Theor. Comput. Sci. 412, No. 22, 2370-2379 (2011).
7
Traceability of executable codes using neural networks. (English)
Burmester, Mike (ed.) et al., Information security. 13th international conference, ISC 2010, Boca Raton, FL, USA, October 25‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18177-1/pbk). Lecture Notes in Computer Science 6531, 241-253 (2011).
8
Towards test coverage criteria for visual contracts (English)
ECEASST 41 (2011).
9
Unbalanced tree search on a manycore system using the GPI programming model (English)
Computer Science - R&D 26, No. 3-4, 229-236 (2011).
10
Adessowiki - collaborative platform for writing executable papers (English)
Procedia CS 4, 759-767 (2011).
11
Complexity separating classes for edge-colouring and total-colouring (English)
J. Braz. Comp. Soc. 17, No. 4, 281-285 (2011).
12
Supporting audits and assessments in multi-model environments (English)
PROFES, 73-87 (2011).
13
Adessowiki: collaborative scientific programming environment (English)
SIBGRAPI Tutorials, 56-62 (2011).
14
An approach to software process design and implementation using transition rules (English)
EUROMICRO-SEAA, 330-333 (2011).
15
Tailoring RUP to small software development teams (English)
EUROMICRO-SEAA, 306-309 (2011).
16
Total chromatic number of \{square,unichord\}-free graphs. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 671-678 (2010).
17
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 391-398 (2010).
18
Diffusion-based approach to deploying wireless sensor networks. (English)
Int. J. Sens. Netw. 8, No. 3-4, 222-232 (2010).
19
The UML “extend” relationship as support for software variability. (English)
Bosch, Jan (ed.) et al., Software product lines: going beyond. 14th international conference, SPLC 2010, Jeju Island, South Korea, September 13‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15578-9/pbk). Lecture Notes in Computer Science 6287, 471-475 (2010).
20
Result 1 to 20 of 120 total
Start
Contact
Print
General Help
