Stefan Richter

According to our database, Stefan Richter authored at least 16 papers between 2004 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

World libraries: towards efficiently sharing large data volumes in open untrusted environments while preserving privacy.

Stefan Richter

PhD thesis, 2009

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

SIAM J. Discret. Math., 2009

Breaking Anonymity by Learning a Unique Minimum Hitting Set.

Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Computer Science, 2009

NISAN: network information service for anonymization networks.

Andriy Panchenko, Stefan Richter, Arne Rache

Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.

Daniel Mölle, Stefan Richter, Peter Rossmanith

Theory Comput. Syst., 2008

2007

Dynamic Programming for Minimum Steiner Trees.

Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang

Theory Comput. Syst., 2007

2006

Parameterized power domination complexity.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Inf. Process. Lett., 2006

Divide-and-Color.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

A Faster Algorithm for the Steiner Tree Problem.

Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the STACS 2006, 2006

Intuitive Algorithms and t-Vertex Cover.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants.

Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Algorithms Based on the Treewidth of Sparse Graphs.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

On the Parameterized Complexity of Exact Satisfiability Problems.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Integration theory and random variables.

Stefan Richter

Arch. Formal Proofs, 2004

Formalizing Integration Theory with an Application to Probabilistic Algorithms.

Stefan Richter

Proceedings of the Theorem Proving in Higher Order Logics, 17th International Conference, 2004

Centrality Indices.

Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Stefan Richter, Dagmar Tenfelde-Podehl, Oliver Zlotowski

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004