University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Sven Kosub XING

Contact

Sven Kosub
address University of Konstanz
Department of Computer & Information Science
Box 67
78457 Konstanz, Germany
office PZ 1004
phone+49 7531 88-5263
fax+49 7531 88-3577
email kosub @ inf.uni-konstanz.de
office hourby appointment
LUKS 2013
 

Personal

02/2015 - Adjunct Professor, Department of Computer and Information Science, University of Konstanz
01/2008 - 01/2015 Senior Lecturer, Department of Computer and Information Science, University of Konstanz

06/2009 Habilitation in Computer Science (Technische Universität München)
08/2001 - 07/2007 Postdoctoral Research Assistant, Lehrstuhl für Effiziente Algorithmen, Fakultät für Informatik, Technische Universität München
09/2003 - 10/2003 Visiting Researcher, Computational Economics Group, The Selim and Rachel Benin School of Computer Science and Engineering, The Hebrew University of Jerusalem

05/2001 Doctorate in Computer Science (Dr. rer. nat.)
01/1997 - 07/2001 Research Assistant, Lehrstuhl für Theoretische Informatik, Fakultät für Mathematik und Informatik, Julius-Maximilians-Universität Würzburg
05/1996 - 12/1996 Research Assistant (wissenschaftliche Hilfskraft), Department of Industrial Engineering, Faculty of Mechanical Engineering, Technische Universität Ilmenau

03/1996 Diploma in Mathematics
10/1991 - 03/1996 Student of Mathematics and Computer Science, Friedrich-Schiller-Universität Jena

Interests


Teaching (mostly in German)

SS 2015 Mathematik: Diskrete Strukturen (Vorlesung und Übung)
Complexity Theory (Vorlesung und Übung)
Theoretical Computer Science (Bachelor-/Masterprojekt)
Brückenkurs Mathematik (Vorlesung und Übung)

WS 2014/15 Mathematische Grundlagen der Informatik (Vorlesung und Übung)
Network Dynamics (Vorlesung)
Theoretical Computer Science (Bachelor-/Masterprojekt)
Brückenkurs Mathematik (Vorlesung unf Übung)

SS 2014 Mathematik: Diskrete Strukturen (Vorlesung und Übung)
Network Analysis (Vorlesung)
Soccer Analytics (Seminar)
Soccer Analytics (Bachelor-/Masterprojekt)
Brückenkurs Mathematik (Vorlesung und Übung)

WS 2013/14 Network Dynamics (Vorlesung und Übung)
Mathematische Grundlagen der Informatik (Vorlesung und Übung)
Ranking (Bachelor-/Masterprojekt)
Brückenkurs Mathematik (Vorlesung und Übung)

SS 2013 Diskrete Strukturen (Vorlesung und Übung)
Theoretische Grundlagen der Informatik (Vorlesung und Übung)
Ranking (Bachelor-/Masterprojekt)
Brückenkurs Mathematik (Vorlesung und Übung)

WS 2012/13 Network Dynamics (Vorlesung und Übung)
Design and Analysis of Algorithms (Vorlesung und Übung)
Ranking (Bachelor-/Masterprojekt)
Brückenkurs Mathematik (Vorlesung und Übung)

SS 2012 Diskrete Strukturen (Vorlesung und Übung)
Brückenkurs Mathematik (Vorlesung und Übung)
Ranking (Seminar)
Software-Projekt (Projekt)

WS 2011/12 Network Dynamics (Vorlesung und Übung)
Mathematische Grundlagen der Informatik (Vorlesung und Übung)
Brückenkurs Mathematik (Vorlesung und Übung)
Ranking (Bachelor-/Masterprojekt)

SS 2011 Complexity Theory (Vorlesung)
Diskrete Strukturen (Vorlesung und Übung)
Brückenkurs Mathematik (Vorlesung und Übung)

WS 2010/11 Network Dynamics (Vorlesung und Übung)
Mathematische Grundlagen der Informatik (Vorlesung und Übung)
Brückenkurs Mathematik (Vorlesung und Übung)

SS 2010 Einführung in die Informatik 2 (Vorlesung und Übung)
Mathematische Grundlagen der Informatik 2 (Vorlesung und Übung)

WS 2009/10 Einführung in die Informatik 1 (Vorlesung und Übung)
Mathematische Grundlagen der Informatik 1 (Vorlesung und Übung)
Brückenkurs Mathematik (Vorlesung)
Netzwerkmodelle (Seminar)

SS 2009 Einführung in die Informatik 2 (Vorlesung und Übung)
Mathematische Grundlagen der Informatik 2 (Vorlesung und Übung)
Algorithmische Spieltheorie (Seminar)

WS 2008/09 Einführung in die Informatik 1 (Vorlesung und Übung)
Mathematische Grundlagen der Informatik 1 (Vorlesung und Übung)

SS 2008 Einführung in die Informatik 2 (Vorlesung und Übung)
Simulationstheorie (Seminar)
Brückenkurs Mathematik (Vorlesung)

For courses taught until WS 2007/08 look here.


Publications

2015 Christopher M. Homan, Sven Kosub. Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. Theoretical Computer Science. Erscheint demnächst.

2013 Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann. Inequalities for the Number of Walks in a Graph. Algorithmica. To appear.

2012 Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura. Finding a Periodic Attractor of a Boolean Network. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(5):1410-1421, 2012.

Ulrik Brandes, Sven Kosub, Bobo Nick. Was messen Zentralitätsindizes? In: Marina Hennig, Christian Stegbauer (Hrsg.), Die Integration von Theorie und Methode in der Netzwerkforschung, pp. 33-52. VS Verlag für Sozialwissenschaften (Reihe: Netzwerkforschung), Wiesbaden, 2012. In German.

Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann. Inequalities for the Number of Walks in Graphs. In: Proceedings of the SIAM Meeting on Analytic Algorithms and Combinatorics (ANALCO'2012), pp. 28-39. SIAM, 2012.

2011 Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann. Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Conjecture of Erdös and Simonovits. Technischer Bericht TUM-I1109, Institut für Informatik, Technische Universität München, April 2011.

2008 Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, and Sebastian Wernicke. Combinatorial Network Abstraction by Trees and Distances. Theoretical Computer Science, 407(1-3):1-20, 2008.

Sven Kosub. Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. Mathematics in Computer Science, 1(3):487-505, 2008. Special issue on Modeling and Analysis of Complex Systems.

Sven Kosub and Klaus W. Wagner. The boolean hierarchy of NP-partitions. Information and Computation, 206(5):538-568, 2008.

2007 Lane A. Hemaspaandra, Christopher M. Homan, and Sven Kosub. Cluster computing and the power of edge recognition. Information and Computation, 205(8):1274-1293, 2007.

Benjamin Hummel and Sven Kosub. Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis. In Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference (IMC'2007), pages 221-226. ACM Press, New York, 2007.

Sven Kosub and Christopher M. Homan. Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. In Proceedings of the 10th Italian Conference on Theoretical Computer Science (ICTCS'2007), pages 163-174. World Scientific Publishing, Singapore, 2007.

Matthias Baumgart, Stefan Eckhardt. Jan H. Griebsch, Sven Kosub, and Johannes Nowak. All-Pairs Common Ancestor Problems in Weighted Dags. In Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE'2007), volume 4614 of Lectures Notes in Computer Science, pages 282-293. Springer-Verlag, Berlin, 2007.

Sven Kosub. Computational Analysis of Complex Systems. Habilitation thesis, Technische Universität München, May 2007.

Stefan Eckhardt, Sven Kosub, and Johannes Nowak. Smoothed Analysis of Trie Height. Technical Report TUM-I0715, Institut für Informatik, Technische Universität München, July 2007.

Benjamin Hummel and Sven Kosub. Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis. Technical Report TUM-I0709, Institut für Informatik, Technische Universität München, February 2007.

Sven Kosub and Christopher M. Homan. Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. Technical Report TUM-I0706, Institut für Informatik, Technische Universität München, January 2007; revised and updated version as Technical Report arXiv:0812.0283 [cs.CC], ACM Computing Research Repository, December 2008.

Sven Kosub. Dichotomy Results for Fixed-Point Existence Problems in Boolean Dynamical Systems. Technical Report TUM-I0701, Institut für Informatik, Technische Universität München, January 2007, and Technical Report arXiv:0801.3802 [cs.CC], ACM Computing Research Repository, January 2008.

2006 Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, and Klaus W. Wagner. The Complexity of Computing the Size of an Interval. SIAM Journal on Computing, 36(5):1264-1300, 2006.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß:, and Hanjo Täubig. The complexity of detecting fixed-density clusters. Discrete Applied Mathematics, 154(11):1547-1562, 2006.

Sven Kosub, Moritz G. Maaß, and Hanjo Täbig. Acyclic Type-of-Relationship Problems on the Internet. In Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'2006), volume 4235 of Lecture Notes in Computer Science, pages 98-111. Springer-Verlag, Berlin, 2006.

Lane A. Hemaspaandra, Christopher M. Homan, and Sven Kosub. Cluster Computing and the Power of Edge Recognition. In Proceedings of the 3rd Annual Conference on Theory and Applications of Models of Computation (TAMC'2006), volume 3959 of Lecture Notes in Computer Science, pages 283-294. Springer-Verlag, Berlin, 2006.

Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Sven Kosub, and Johannes Nowak. All-Pairs Common-Ancestor Problems in Weighted Dags. Technical Report TUM-I0606, Institut für Informatik, Technische Universität München, April 2006.

Sven Kosub, Moritz G. Maaß and Hanjo Täubig. Acyclic Type-of-Relationship Problems on the Internet. Technical Report TUM-I0605, Institut für Informatik, Technische Universität München, March 2006.

2005 Sven Kosub. Local Density. In Ulrik Brandes and Thomas Erlebach (eds.), Network Analysis - Methodological Foundations, volume 3418 of Lecture Notes in Computer Science, chapter 6, pages 112-142. Springer-Verlag, Berlin, 2005.

Sven Kosub. NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. Theory of Computing Systems, 38(1):83-113, 2005.

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, and Sebastian Wernicke. Combinatorial Network Abstraction by Trees and Distances. In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC'2005), volume 3827 of Lecture Notes in Computer Science, pages 1100-1109. Springer-Verlag, Berlin, 2005.

Lane A. Hemaspaandra, Christopher M. Homan, and Sven Kosub. Cluster Computing and the Power of Edge Recognition. Technical Report URCS-TR-2005-878, Department of Computer Science, University of Rochester, September 2005, and Technical Report cs.CC/0509060, ACM Computing Research Repository, September 2005.

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, and Sebastian Wernicke. Combinatorial Network Abstraction by Trees and Distances. Technical Report TUM-I0502, Institut für Informatik, Technische Universität München, March 2005.

Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, and Klaus W. Wagner. The Complexity of Computing the Size of an Interval. Technical Report URCS-TR-2005-856, Department of Computer Science, University of Rochester, February 2005, and Technical Report cs.CC/0502058, ACM Computing Research Repository, September 2005.

2004 Sven Kosub. Local Density. Technical Report TUM-I0421, Institut für Informatik, Technische Universität München, December 2004.

2003 Matthias Galota, Sven Kosub, and Heribert Vollmer. Generic separations and leaf languages, Mathematical Logic Quarterly, 49(4):353-362, 2003.

Sven Kosub. Boolean NP-Partitions and Projective Closure. In Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS'2003), volume 2731 of Lecture Notes in Computer Science, pages 225-236. Springer-Verlag, Berlin, 2003.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, and Hanjo Täubig. The Complexity of Detecting Fixed-Density Clusters. In Proceedings of the 2nd Italian Conference on Algorithms and Complexity (CIAC'2003), volume 2653 of Lecture Notes in Computer Science, pages 201-212. Springer-Verlag, Berlin, 2003.

2002 Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, and Hanjo Täubig. The Complexity of Detecting Fixed-Density Clusters. Technical Report TUM-I0212, Institut für Informatik, Technische Universität München, December 2002.

2001 Lane A. Hemaspaandra, Sven Kosub, and Klaus W. Wagner. The Complexity of Computing the Size of an Interval, In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'2001), volume 2076 of Lecture Notes in Computer Science, pages 1040-1051. Springer-Verlag, Berlin, 2001.

Matthias Galota, Sven Kosub, Heribert Vollmer. Generic Separations and Leaf Languages. Technical Report TUM-I0104, Institut für Informatik, Technische Universität München, September 2001, and Technical Report No. 281, Institut für Informatik, Julius-Maximilians-Universität Würzburg, September 2001.

2000 Sven Kosub. Complexity and Partitions. Doctoral Dissertation, Fakultät für Mathematik und Informatik, Julius-Maximilians-Universität Würzburg, November 2000.

Sven Kosub, Heinz Schmitz, and Heribert Vollmer. Uniform Characterizations of Complexity Classes of Functions. International Journal of Foundations of Computer Science, 11(4):525-551, 2000.

Sven Kosub. On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. In Proceedings of the 25th Symposium on Mathematical Foundations of Computer Science (MFCS'2000), volume 1893 of Lecture Notes in Computer Science, pages 467-476. Springer-Verlag, Berlin, 2000.

Sven Kosub and Klaus W. Wagner. The Boolean Hierarchy of NP-Partitions. In Proceedings of the 17th Symposium on Theoretical Aspects of Computer Science (STACS'2000), volume 1770 of Lecture Notes in Computer Science, pages 157-168. Springer-Verlag, Berlin, 2000.

Sven Kosub. Types of Separability. Technical Report No. 267, Institut für Informatik, Julius-Maximilians-Universität Würzburg, November 2000.

Sven Kosub. Boolean NP-Partitions and Projective Closure. Technical Report No. 266, Institut für Informatik, Julius-Maximilians-Universität Würzburg, November 2000.

Sven Kosub. On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. Technical Report No. 257, Institut für Informatik, Julius-Maximilians-Universität Würzburg, April 2000.

1999 Sven Kosub. A note on unambiguous function classes. Information Processing Letters, 72(5-6):197-203, 1999.

Daniel Görsch, Sven Kosub, and Klaus-Peter Zocher. Generalized Tolerance-Group Optimization Systems. In Proceedings of the 44 International Scientific Colloquium (IWK'1999), volume 1, pages 411-417. Technische Universität Ilmenau, Ilmenau, 1999. In German.

Klaus-Peter Zocher, Sven Kosub, and Daniel Görsch. Tolerance-Group Optimization in Adaptive and Selective Assembly. In Proceedings of the 44 International Scientific Colloquium (IWK'1999), volume 3, pages 463-469. Technische Universität Ilmenau, Ilmenau, 1999. In German.

Sven Kosub and Klaus W. Wagner. The Boolean Hierarchy of NP-Partitions. Technical Report No. 233, Institut für Informatik, Julius-Maximilians-Universität Würzburg, July 1999. Revised and expanded version as Technical Report TUM-I0209, Institut für Informatik, Technische Universität München, September 2002.

1998 Sven Kosub, Heinz Schmitz, and Heribert Vollmer. Uniformly defining complexity classes of functions. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes in Computer Science, pages 607-617. Springer-Verlag, Berlin, 1998.

Sven Kosub. Persistent Computations. Technical Report No. 217, Institut für Informatik, Julius-Maximilians-Universität Würzburg, December 1998.

1997 Sven Kosub, Heinz Schmitz, and Heribert Vollmer. Uniformly Defining Complexity Classes of Functions. Technical Report No. 183, Institut für Informatik, Julius-Maximilians-Universität Würzburg, September 1997.

Sven Kosub. On Cluster Machines and Function Classes. Technical Report No. 172, Institut für Informatik, Julius-Maximilians-Universität Würzburg, May 1997.

1996 Sven Kosub. Clustermaschinen. Diplomarbeit, Fakultät für Informatik, Friedrich-Schiller-Universität Jena, February 1996.