Efficient computation of the characteristic polynomial of a threshold graph von Fürer, Martin

Volltext

Space Saving by Dynamic Algebraization Based on Tree-Depth von Fürer, Martin, Yu, Huiwen

Volltext

On the power of combinatorial and spectral invariants von Fürer, Martin

Volltext

On the Combinatorial Power of the Weisfeiler-Lehman Algorithm von Fürer, Martin

Volltext

Eigenvalue location in graphs of small clique-width von Fürer, Martin, Hoppen, Carlos, Jacobs, David P., Trevisan, Vilmar

Volltext

Faster Computation of Path-Width von Fürer, Martin

Volltext

Faster Integer Multiplication von Fuerer, Martin

Volltext

An Improvement of Reed’s Treewidth Approximation von Belbasi, Mahdi, Fürer, Martin

Volltext

A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization von Belbasi, Mahdi, Fürer, Martin

Volltext

A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs von FURER, Martin

Volltext

Solving NP-Complete Problems with Quantum Search von Fürer, Martin

Volltext

Deterministic Autopoietic Automata von Fürer, Martin

Volltext

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks von Fürer, Martin

Volltext

Locating the Eigenvalues for Graphs of Small Clique-Width von Fürer, Martin, Hoppen, Carlos, Jacobs, David P., Trevisan, Vilmar

Volltext

Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees von Berman, Piotr, Fürer, Martin, Zelikovsky, Alexander

Volltext

FASTER INTEGER MULTIPLICATION : Theory of Computing von FÜRER, Martin

Volltext

An Improvement of Reed's Treewidth Approximation von Belbasi, Mahdi, Fürer, Martin

Volltext

How Fast Can We Multiply Large Integers on an Actual Computer? von Fürer, Martin

Volltext

A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width von Fürer, Martin

Volltext

Efficient Computation of the Characteristic Polynomial of a Threshold Graph von Fürer, Martin

Volltext