www-cc.cs.uni-saarland.de
Computational Complexity - Radu Curticapean
http://www-cc.cs.uni-saarland.de/curticapean
Department of Computer Science. I was a PhD student in the computational complexity group at Saarland University and defended my thesis. In June 2015. Currently, I am a post-doc at the Institute for Computer Science and Control of the Hungarian Academy of Sciences. Fortunately, this rather unwieldy name abbreviates to MTA SZTAKI. At said place, I'm part of the PARAMTIGHT. Group For two semesters, I also was a fellow at the Simons Institute. My main research area is counting complexity. Campus Geb E1 3.
computationalcombinatorics.wordpress.com
Resources | Computational Combinatorics
https://computationalcombinatorics.wordpress.com/resources
This page contains a list of resources to help with computational combinatorics. Please email me. If you would like to add something to this list. ISGCI: Information System on Graph Classes and their Inclusions. 8220;ISGCI is an encyclopaedia of graphclasses with an accompanying java application that helps you to research what’s known about particular graph classes.” Useful for learning more about the types of graphs you are working with, including code examples. FXT: A library of algorithms. COIN-OR: CO...