Holger Spakowski
According to our database1,
Holger Spakowski
authored at least 24 papers
between 1999 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
1
2
1
3
1
2
2
2
1
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
Comput. Complex., 2020
2018
2016
Proceedings of the Language and Automata Theory and Applications, 2016
2012
2009
2008
CoRR, 2008
2007
Inf. Process. Lett., 2007
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
2006
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP.
RAIRO Theor. Informatics Appl., 2006
2005
Quantum and classical complexity classes: Separations, collapses, and closure properties.
Inf. Comput., 2005
Proceedings of the Ausgezeichnete Informatikdissertationen 2005, 2005
PhD thesis, 2005
2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004
2003
Theory Comput. Syst., 2003
2002
Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002
2000
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000
1999
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999