i11www.iti.uni-karlsruhe.de
KIT - ITI Algorithmik I - Startseite
http://i11www.iti.uni-karlsruhe.de/index
Institut für Theoretische Informatik, Algorithmik I. Wed, 19 Apr 2017, 13:00. A Practical Scalable Shared-Memory Parallel Algorithm for Computing Minimum Spanning Trees. Tue, 9 May 2017, 13:00. Heursitiken zum Organisieren von Sitzungen. Algorithmen für planare Graphen. Practical Course: Graph Visualisation in Practice. Seminar: Algorithmic Methods in the Humanities. Proseminar: Klassiker der Theoretischen Informatik. Praktikum Algorithmentechnik (Algorithm Engineering - Routenplanung). 24 August 2016: D...
fpt.wikidot.com
Welcome - Parameterized Complexity
http://fpt.wikidot.com/welcome
Did you say NP-hard? 2015 Summary of PC/MVA. Psychology and Cognitive Science. Social Choice and Voting. Books and Survey Articles. Conferences, Dagstuhl Seminars, and Workshops. Courses in Parameterized Complexity. FPT News: The Parameterized Complexity Newsletter. JOBS: Positions Available and People Looking. Overview of the Field 2008. FPT papers in conferences. Table of FPT races. Complexity Status of Edge Modification Problems. Table of COMSOC FPT Races. How to edit pages? How to join this site?
fpt.wikidot.com
FPT News: The Parameterized Complexity Newsletter - Parameterized Complexity
http://fpt.wikidot.com/fpt-news:the-parameterized-complexity-newsletter
Did you say NP-hard? 2015 Summary of PC/MVA. Psychology and Cognitive Science. Social Choice and Voting. Books and Survey Articles. Conferences, Dagstuhl Seminars, and Workshops. Courses in Parameterized Complexity. FPT News: The Parameterized Complexity Newsletter. JOBS: Positions Available and People Looking. Overview of the Field 2008. FPT papers in conferences. Table of FPT races. Complexity Status of Edge Modification Problems. Table of COMSOC FPT Races. How to edit pages? How to join this site?