Sven Kosub

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Permutation Inequalities for Walks in Graphs	2023-03-26	Paper
A note on the complexity of manipulating weighted Schulze voting	2020-10-07	Paper
Inequalities for the Number of Walks in Graphs	2019-09-17	Paper
Dichotomy results for fixed point counting in Boolean dynamical systems	2015-02-24	Paper
Inequalities for the number of walks in graphs	2013-11-11	Paper
All-Pairs Ancestor Problems in Weighted Dags	2009-03-03	Paper
Combinatorial network abstraction by trees and distances	2008-11-18	Paper
Dichotomy results for fixed-point existence problems for Boolean dynamical systems	2008-05-27	Paper
The Boolean hierarchy of NP-partitions	2008-05-19	Paper
Acyclic Type-of-Relationship Problems on the Internet	2008-04-17	Paper
The Complexity of Computing the Size of an Interval	2007-10-22	Paper
Cluster computing and the power of edge recognition	2007-08-23	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Algorithms and Computation	2006-11-14	Paper
The complexity of detecting fixed-density clusters	2006-08-14	Paper
Network Analysis	2005-11-11	Paper
NP-partitions over posets with an application to reducing the set of solutions of NP problems	2005-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q4452104	2004-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4437509	2003-12-02	Paper
Generic separations and leaf languages	2003-07-31	Paper
A note on unambiguous function classes	2002-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4536382	2002-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q4535082	2002-06-12	Paper
UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS	2001-05-20	Paper
https://portal.mardi4nfdi.de/entity/Q4501530	2001-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4381403	1998-07-27	Paper

Research outcomes over time

This page was built for person: Sven Kosub