The following pages link to Stefan Richter (Q844179):
Displaying 18 items.
- Parameterized power domination complexity (Q844180) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- Dynamic programming for minimum Steiner trees (Q2464320) (← links)
- Embedded Online Optimization for Model Predictive Control at Megahertz Rates (Q2982924) (← links)
- Breaking Anonymity by Learning a Unique Minimum Hitting Set (Q3392966) (← links)
- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover (Q3434701) (← links)
- Divide-and-Color (Q3522942) (← links)
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants (Q3591315) (← links)
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms (Q3654388) (← links)
- A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms (Q5189527) (← links)
- Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method (Q5352837) (← links)
- A Faster Algorithm for the Steiner Tree Problem (Q5449830) (← links)
- Intuitive Algorithms and t-Vertex Cover (Q5459154) (← links)
- Theorem Proving in Higher Order Logics (Q5464655) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492890) (← links)
- Network Analysis (Q5703978) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897572) (← links)
