dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Sven Kosub Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems CoRR abs/0801.3802: (2008)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher M. Homan, Sven Kosub: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems CoRR abs/0812.0283: (2008)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Klaus W. Wagner: The boolean hierarchy of NP-partitions. Inf. Comput. 206(5): 538-568 (2008)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. Mathematics in Computer Science 1(3): 487-505 (2008)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke: Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407(1-3): 1-20 (2008)
2007
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak: All-Pairs Ancestor Problems in Weighted Dags. ESCAPE 2007: 282-293
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Christopher M. Homan: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. ICTCS 2007: 163-174
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Hummel, Sven Kosub: Acyclic type-of-relationship problems on the internet: an experimental analysis. Internet Measurement Comference 2007: 221-226
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. SIAM J. Comput. 36(5): 1264-1300 (2007)
2006
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Moritz G. Maaß, Hanjo Täubig: Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The complexity of detecting fixed-density clusters. Discrete Applied Mathematics 154(11): 1547-1562 (2006)
2005
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke: Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval CoRR abs/cs/0502058: (2005)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition CoRR abs/cs/0509060: (2005)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. Theory Comput. Syst. 38(1): 83-113 (2005)
2004
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: Local Density. Network Analysis 2004: 112-142
2003
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: Boolean NP-Partitions and Projective Closure. DMTCS 2003: 225-236
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Sven Kosub, Heribert Vollmer: Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003)
2001
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. ICALP 2001: 1040-1051
2000
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. MFCS 2000: 467-476
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Klaus W. Wagner: The Boolean Hierarchy of NP-Partitions. STACS 2000: 157-168
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Heinz Schmitz, Heribert Vollmer: Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000)
1999
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub: A Note on Unambiguous Function Classes. Inf. Process. Lett. 72(5-6): 197-203 (1999)
1998
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Heinz Schmitz, Heribert Vollmer: Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617

Coauthor Index

1Matthias Baumgart [22]
2Stefan Eckhardt [14] [22] [23]
3Matthias Galota [7]
4Jan Griebsch [22]
5Lane A. Hemaspaandra (Lane A. Hemachandra) [6] [12] [13] [16] [18] [19]
6Klaus Holzapfel [9] [15]
7Christopher Homan (Christopher M. Homan) [12] [13] [16] [18] [19] [21] [26]
8Benjamin Hummel [20]
9Moritz G. Maaß [9] [14] [15] [17] [23]
10Johannes Nowak [22]
11Heinz Schmitz [1] [3]
12Hanjo Täubig [9] [14] [15] [17] [23]
13Heribert Vollmer [1] [3] [7]
14Klaus W. Wagner [4] [6] [13] [18] [25]
15Sebastian Wernicke [14] [23]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page