Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Sebastian Forster
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Related publications
Computing Queries on Linear Constraint Databases
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
Comparison and Improvement of Algorithms for Computing Minimal Cut Sets
BMC Bioinformatics
Biochemistry
Applied Mathematics
Computer Science Applications
Structural Biology
Molecular Biology
Computing Walrasian Equilibria: Fast Algorithms and Structural Properties
Mathematical Programming, Series B
Mathematics
Software
Fast Normalized Cut With Linear Constraints
ADaM: Augmenting Existing Approximate Fast Matching Algorithms With Efficient and Exact Range Queries
BMC Bioinformatics
Biochemistry
Applied Mathematics
Computer Science Applications
Structural Biology
Molecular Biology
Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity
Computing Cubic Fields in Quasi-Linear Time
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Level Planarity Testing in Linear Time
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
