Martin Furer

    • 1074 Citations
    • 15 h-Index
    1980 …2019
    If you made any changes in Pure, your changes will be visible here soon.

    Fingerprint Dive into the research topics where Martin Furer is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

    • 1 Similar Profiles
    Graph in graph theory Mathematics
    Polynomials Engineering & Materials Science
    Approximation algorithms Engineering & Materials Science
    Decomposition Engineering & Materials Science
    Counting Mathematics
    Coloring Engineering & Materials Science
    Tree Decomposition Mathematics
    Random Graphs Mathematics

    Network Recent external collaboration on country level. Dive into details by clicking on the dots.

    Research Output 1980 2019

    • 1074 Citations
    • 15 h-Index
    • 44 Conference contribution
    • 19 Article
    • 4 Conference article
    • 1 Paper

    A space-efficient parameterized algorithm for the hamiltonian cycle problem by dynamic algebraization

    Belbasi, M. & Fürer, M., Jan 1 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. van Bevern, R. & Kucherov, G. (eds.). Springer Verlag, p. 38-49 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Parameterized Algorithms
    Hamiltonians
    Hamiltonian circuit
    Dynamic programming
    Traveling salesman problem

    Eigenvalue location in graphs of small clique-width

    Furer, M., Hoppen, C., Jacobs, D. P. & Trevisan, V., Jan 1 2019, In : Linear Algebra and Its Applications. 560, p. 56-85 30 p.

    Research output: Contribution to journalArticle

    Clique-width
    Diagonalization
    Congruent
    Diagonal matrix
    Adjacency Matrix
    1 Citation (Scopus)

    Locating the eigenvalues for graphs of small clique-width

    Furer, M., Hoppen, C., Jacobs, D. P. & Trevisan, V., Jan 1 2018, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. Mosteiro, M. A., Bender, M. A. & Farach-Colton, M. (eds.). Springer Verlag, p. 475-489 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10807 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Clique-width
    Tree Decomposition
    Congruent
    Diagonal matrix
    Adjacency Matrix
    1 Citation (Scopus)

    Efficient computation of the characteristic polynomial of a threshold graph

    Furer, M., Jan 2 2017, In : Theoretical Computer Science. 657, p. 3-10 8 p.

    Research output: Contribution to journalArticle

    Threshold Graph
    Characteristic polynomial
    Polynomials
    Hammers
    Vertex of a graph
    2 Citations (Scopus)

    Space Saving by Dynamic Algebraization Based on Tree-Depth

    Furer, M. & Yu, H., Aug 1 2017, In : Theory of Computing Systems. 61, 2, p. 283-304 22 p.

    Research output: Contribution to journalArticle

    Tree Decomposition
    Dynamic programming
    Decomposition
    Dynamic Programming
    Polynomials