The following pages link to Thore Husfeldt (Q407581):
Displaying 45 items.
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- Dynamic nested brackets (Q1882928) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Computing the permanent modulo a prime power (Q2628281) (← links)
- A cell probe lower bound for dynamic nearest-neighbour searching (Q2768380) (← links)
- Graph colouring algorithms (Q2822600) (← links)
- Black box for constant-time insertion in priority queues (note) (Q2944491) (← links)
- Invitation to Algorithmic Uses of Inclusion–Exclusion (Q3012908) (← links)
- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected (Q3058703) (← links)
- (Q3129920) (← links)
- The traveling salesman problem in bounded degree graphs (Q3189059) (← links)
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
- The Travelling Salesman Problem in Bounded Degree Graphs (Q3521919) (← links)
- Fourier meets M\"{o}bius: fast subset convolution (Q3549598) (← links)
- Set Partitioning via Inclusion-Exclusion (Q3558013) (← links)
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (Q3587397) (← links)
- Covering and Packing in Linear Space (Q3587422) (← links)
- Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (Q3613789) (← links)
- Counting Paths and Packings in Halves (Q3639276) (← links)
- Finding a Path of Superlogarithmic Length (Q4429693) (← links)
- (Q4490353) (← links)
- Computing Graph Distances Parameterized by Treewidth and Diameter (Q4634399) (← links)
- New Lower Bound Techniques for Dynamic Partial Sums and Related Problems (Q4706229) (← links)
- (Q4737225) (← links)
- (Q4910710) (← links)
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (Q4962155) (← links)
- Fast Zeta Transforms for Lattices with Few Irreducibles (Q4962203) (← links)
- (Q5009466) (← links)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching (Q5054813) (← links)
- Dynamic algorithms for the Dyck languages (Q5057425) (← links)
- (Q5091007) (← links)
- (Q5091009) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5167743) (← links)
- Extensor-coding (Q5230285) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)
- Automata, Languages and Programming (Q5466464) (← links)
- (Q5743488) (← links)
- (Q5743515) (← links)
- (Q5874426) (← links)
- Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths (Q6075922) (← links)
