default search action
Sven Kosub
Person information
- affiliation: University of Konstanz, Department of Computer & Information Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i9]Nadja Willenborg, Sven Kosub:
Permutation Inequalities for Walks in Graphs. CoRR abs/2303.14810 (2023) - 2022
- [i8]Fabian Spaeh, Sven Kosub:
Global Evaluation for Decision Tree Learning. CoRR abs/2208.04828 (2022) - 2020
- [j16]Julian Müller
, Sven Kosub
A note on the complexity of manipulating weighted Schulze voting. Inf. Process. Lett. 162: 105989 (2020) - [i7]Stefan Eckhardt, Sven Kosub, Johannes Nowak:
Smoothed Analysis of Trie Height by Star-like PFAs. CoRR abs/2003.04101 (2020)
2010 – 2019
- 2019
- [j15]Sven Kosub
A note on the triangle inequality for the Jaccard distance. Pattern Recognit. Lett. 120: 36-38 (2019) - 2018
- [i6]Julian Müller, Sven Kosub:
A Note on the Complexity of Manipulating Weighted Schulze Voting. CoRR abs/1808.09226 (2018) - 2017
- [j14]Manuel Stein
How to Make Sense of Team Sport Data: From Acquisition to Data Modeling and Research Aspects. Data 2(1): 2 (2017) - 2016
- [i5]Sven Kosub:
A note on the triangle inequality for the Jaccard distance. CoRR abs/1612.02696 (2016) - 2015
- [j13]Christopher M. Homan, Sven Kosub
Dichotomy results for fixed point counting in boolean dynamical systems. Theor. Comput. Sci. 573: 16-25 (2015) - 2013
- [j12]Hanjo Täubig, Jeremias Weihmann, Sven Kosub
Inequalities for the Number of Walks in Graphs. Algorithmica 66(4): 804-828 (2013) - 2012
- [j11]Tatsuya Akutsu
Finding a Periodic Attractor of a Boolean Network. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1410-1421 (2012) - [c14]Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann:
Inequalities for the Number of Walks in Graphs. ANALCO 2012: 26-39
2000 – 2009
- 2008
- [j10]Sven Kosub
The boolean hierarchy of NP-partitions. Inf. Comput. 206(5): 538-568 (2008) - [j9]Sven Kosub
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. Math. Comput. Sci. 1(3): 487-505 (2008) - [j8]Stefan Eckhardt, Sven Kosub
Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407(1-3): 1-20 (2008) - [i4]Sven Kosub:
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems. CoRR abs/0801.3802 (2008) - [i3]Christopher M. Homan, Sven Kosub:
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. CoRR abs/0812.0283 (2008) - 2007
- [b2]Sven Kosub:
Computational Analysis of Complex Systems: Discrete Foundations, Algorithms, and the Internet. University of Konstanz, Germany, 2007 - [j7]Lane A. Hemaspaandra
Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007) - [j6]Lane A. Hemaspaandra
The Complexity of Computing the Size of an Interval. SIAM J. Comput. 36(5): 1264-1300 (2007) - [c13]Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak:
All-Pairs Ancestor Problems in Weighted Dags. ESCAPE 2007: 282-293 - [c12]Sven Kosub, Christopher M. Homan:
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. ICTCS 2007: 163-174 - [c11]Benjamin Hummel, Sven Kosub
Acyclic type-of-relationship problems on the internet: an experimental analysis. Internet Measurement Conference 2007: 221-226 - 2006
- [j5]Klaus Holzapfel, Sven Kosub
The complexity of detecting fixed-density clusters. Discret. Appl. Math. 154(11): 1547-1562 (2006) - [c10]Sven Kosub
Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111 - [c9]Lane A. Hemaspaandra
Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294 - 2005
- [j4]Sven 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) - [c8]Stefan Eckhardt, Sven Kosub
Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109 - [i2]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner:
The Complexity of Computing the Size of an Interval. CoRR abs/cs/0502058 (2005) - [i1]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster Computing and the Power of Edge Recognition. CoRR abs/cs/0509060 (2005) - 2004
- [c7]Sven Kosub:
Local Density. Network Analysis 2004: 112-142 - 2003
- [j3]Matthias Galota, Sven Kosub
Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003) - [c6]Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212 - [c5]Sven Kosub:
Boolean NP-Partitions and Projective Closure. DMTCS 2003: 225-236 - 2001
- [b1]Sven Kosub:
Complexity and Partitions (Komplexität von Partitionen). Würzburg University, Germany, 2001 - [c4]Lane A. Hemaspaandra
The Complexity of Computing the Size of an Interval. ICALP 2001: 1040-1051 - 2000
- [j2]Sven Kosub
Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000) - [c3]Sven Kosub
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. MFCS 2000: 467-476 - [c2]Sven Kosub, Klaus W. Wagner:
The Boolean Hierarchy of NP-Partitions. STACS 2000: 157-168
1990 – 1999
- 1999
- [j1]Sven Kosub:
A Note on Unambiguous Function Classes. Inf. Process. Lett. 72(5-6): 197-203 (1999) - 1998
- [c1]Sven Kosub
Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: