The following pages link to Martin Fuerer (Q1159189):
Displayed 50 items.
- Item:Q1159189 (redirect page) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Data structures for distributed counting (Q794431) (← links)
- On the power of combinatorial and spectral invariants (Q962126) (← links)
- Alternation and the Ackermann case of the decision problem (Q1159190) (← links)
- The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Finding all leftmost separators of size \(\le k\) (Q2149878) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Locating the eigenvalues for graphs of small clique-width (Q2294708) (← links)
- A space-efficient parameterized algorithm for the Hamiltonian Cycle problem by dynamic algebraization (Q2330550) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Faster Computation of Path-Width (Q2819521) (← links)
- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width (Q2894482) (← links)
- Spanners for geometric intersection graphs with applications (Q2968085) (← links)
- Packing-Based Approximation Algorithm for the k-Set Cover Problem (Q3104644) (← links)
- (Q3128896) (← links)
- Approximating permanents of complex matrices (Q3192039) (← links)
- Approximating the $$k$$-Set Packing Problem by Local Improvements (Q3195350) (← links)
- (Q3341896) (← links)
- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees (Q3434683) (← links)
- Efficient Computation of the Characteristic Polynomial of a Threshold Graph (Q3452551) (← links)
- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs (Q3525784) (← links)
- (Q3549597) (← links)
- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width (Q3557008) (← links)
- Faster Integer Multiplication (Q3575156) (← links)
- Spanners for Geometric Intersection Graphs (Q3603536) (← links)
- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks (Q3639231) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- (Q3688454) (← links)
- (Q3727381) (← links)
- (Q3792245) (← links)
- (Q3888558) (← links)
- (Q3967528) (← links)
- (Q4036583) (← links)
- (Q4110606) (← links)
- (Q4111543) (← links)
- (Q4246713) (← links)
- (Q4252401) (← links)
- (Q4252726) (← links)
- (Q4268434) (← links)
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal (Q4314499) (← links)
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs (Q4317708) (← links)
- An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (Q4327819) (← links)
- (Q4394581) (← links)
- (Q4526990) (← links)
- (Q4527192) (← links)