Items where Author / Artist / Editor is "Paulusma, Daniël"

See full list of headings
Export as [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Jump to: Conference or Workshop Item
Number of items: 2.

Conference or Workshop Item

Golovach, Petr A., Lidický, Bernard, Martin, Barnaby and Paulusma, Daniël (2012) Finding vertex-surjective graph homomorphisms. Computer Science -- Theory and Applications. In: 7th International Computer Science Symposium (CSR 2012), 3-7 Jul 2012, Nizhny Novgorod, Russia. ISBN 9783642306419. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-30642-6_16)

Martin, Barnaby and Paulusma, Daniël (2011) The computational complexity of disconnected cut and 2K2-partition. Principles and Practice of Constraint Programming – CP 2011. In: The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), 12-16 Sep 2011, Perugia, Italy. ISBN 9783642237850. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-23786-7_43)

This list was generated on Sat Jun 3 05:35:42 2023 BST.