Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Kosub, Sven"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dichotomy results for fixed point counting in Boolean dynamical systems
Christopher M. Homan
,
Sven Kosub
Theoretical Computer Science
573
, 2015, pp. 16-25
Inequalities for the number of walks in graphs
Hanjo Täubig
,
Jeremias Weihmann
,
Sven Kosub
,
Raymond Hemmecke
,
Ernst W. Mayr
Algorithmica
66
(4), 2013, pp. 804-828
Combinatorial network abstraction by trees and distances
Stefan Eckhardt
,
Sven Kosub
,
Moritz G. Maaß
,
Hanjo Täubig
,
Sebastian Wernicke
Theoretical Computer Science
407
(1-3), 2008, pp. 1-20
The Boolean hierarchy of
NP
-partitions
Sven Kosub
,
Klaus W. Wagner
Information and Computation
206
(5), 2008, pp. 538-568
Cluster computing and the power of edge recognition
Lane A. Hemaspaandra
,
Christopher M. Homan
,
Sven Kosub
Information and Computation
205
(8), 2007, pp. 1274-1293
The complexity of computing the size of an interval
Lane A. Hemaspaandra
,
Christopher M. Homan
,
Sven Kosub
,
Klaus W. Wagner
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1264-1300
Combinatorial network abstraction by trees and distances
Stefan Eckhardt
,
Sven Kosub
,
Moritz G. Maaß
,
Hanjo Täubig
,
Sebastian Wernicke
Lecture Notes in Computer Science
3827
, 2005, pp. 1100-1109
Local density
Sven Kosub
Lecture Notes in Computer Science
3418
, 2005, pp. 112-142
NP
-partitions over posets with an application to reducing the set of solutions of
NP
problems
Sven Kosub
Theory of Computing Systems
38
(1), 2005, pp. 83-113
The complexity of detecting fixed-density clusters
Klaus Holzapfel
,
Sven Kosub
,
Moritz G. MaaMaa{\ss{}
,
Hanjo Täubig
Lecture Notes in Computer Science
2653
, 2003, pp. 201-212
The complexity of computing the size of an interval
Lane A. Hemaspaandra
,
Sven Kosub
,
Klaus W. Wagner
Lecture Notes in Computer Science
2076
, 2001, pp. 1040-1051
Uniform characterizations of complexity classes of functions
Sven Kosub
,
Heinz Schmitz
,
Heribert Vollmer
International Journal of Foundations of Computer Science
11
(4), 2000, pp. 525-551
The Boolean hierarchy of
NP
-partitions
Sven Kosub
,
Klaus W. Wagner
Lecture Notes in Computer Science
1770
, 2000, pp. 157-168
On
NP
-partitions over posets with an application to reducing the set of solutions of
NP
problems
Sven Kosub
Lecture Notes in Computer Science
1893
, 2000, pp. 467-476
A note on unambiguous function classes
Sven Kosub
Information Processing Letters
72
(5-6), 1999, pp. 197-203
Uniformly defining complexity classes of functions
Sven Kosub
,
Heinz Schmitz
,
Heribert Vollmer
Lecture Notes in Computer Science
1373
, 1998, pp. 607-617