The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sven Kosub: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sven Kosub, Moritz G. Maaß, Hanjo Täubig
    Acyclic Type-of-Relationship Problems on the Internet. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:98-111 [Conf]
  2. Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
    The Complexity of Detecting Fixed-Density Clusters. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:201-212 [Conf]
  3. Sven Kosub
    Local Density. [Citation Graph (0, 0)][DBLP]
    Network Analysis, 2004, pp:112-142 [Conf]
  4. Sven Kosub
    Boolean NP-Partitions and Projective Closure. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:225-236 [Conf]
  5. Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
    The Complexity of Computing the Size of an Interval. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1040-1051 [Conf]
  6. Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
    Combinatorial Network Abstraction by Trees and Distances. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1100-1109 [Conf]
  7. Sven Kosub
    On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:467-476 [Conf]
  8. Sven Kosub, Heinz Schmitz, Heribert Vollmer
    Uniformly Defining Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:607-617 [Conf]
  9. Sven Kosub, Klaus W. Wagner
    The Boolean Hierarchy of NP-Partitions. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:157-168 [Conf]
  10. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
    Cluster Computing and the Power of Edge Recognition. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:283-294 [Conf]
  11. Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
    The complexity of detecting fixed-density clusters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:11, pp:1547-1562 [Journal]
  12. Sven Kosub, Heinz Schmitz, Heribert Vollmer
    Uniform Characterizations of Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:4, pp:525-551 [Journal]
  13. Sven Kosub
    A Note on Unambiguous Function Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:5-6, pp:197-203 [Journal]
  14. Matthias Galota, Sven Kosub, Heribert Vollmer
    Generic separations and leaf languages. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:4, pp:353-362 [Journal]
  15. Sven Kosub
    NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:1, pp:83-113 [Journal]
  16. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
    The Complexity of Computing the Size of an Interval. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1264-1300 [Journal]
  17. Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak
    All-Pairs Ancestor Problems in Weighted Dags. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:282-293 [Conf]
  18. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
    The Complexity of Computing the Size of an Interval [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  19. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
    Cluster computing and the power of edge recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1274-1293 [Journal]

  20. Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. [Citation Graph (, )][DBLP]


  21. Acyclic type-of-relationship problems on the internet: an experimental analysis. [Citation Graph (, )][DBLP]


  22. Cluster Computing and the Power of Edge Recognition [Citation Graph (, )][DBLP]


  23. Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems [Citation Graph (, )][DBLP]


  24. Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002