EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Editor: Italiano, G.F.
Home Policy Brochure Browse Search User Area Contact Help

Number of items: 3.

2013

Berkholz, C. and Bonsma, P.S. and Grohe, M. (2013) Tight lower and upper bounds for the complexity of canonical colour refinement. In: Proceedings of the 21st Annual European Symposium on Algorithms (ESA 2013), 2-4 Sep 2013, Sophia Antipolis, France. pp. 145-156. Lecture Notes in Computer Science 8125. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-40449-8

2007

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2007) Improved upper bounds for λ-backbone colorings along matchings and stars. In: Proceedings of SOFSEM 2007: Theory and Practice of Computer Science, 20-26 Jan 2007, Harrachov, Czech Republic. pp. 188-199. Lecture Notes in Computer Science 4362. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-69506-6

2006

Broersma, H.J. and Capponi, A. and Paulusma, D. (2006) On-line coloring of H-free bipartite graphs. In: Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC 2006), 29-31 May 2006, Rome, Italy. pp. 284-295. Lecture Notes in Computer Science 3998. Springer Verlag. ISSN 0302-9743 ISBN 3-540-34375-X

This list was generated on Mon Mar 27 03:31:27 CEST 2017.