Projects per year
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
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
EARTHEN STRUCTURES 4.0: A reengineered material for a sustainable and green circular construction
Furer, M. (PI), Kleppe, S. L. S. L. (PI) & Saloustros, S. S. (PI)
5/15/02 → 4/30/27
Project: Research project
-
AF: Small: Algorithms Based on Discrete and Algebraic Methods
Furer, M. (PI)
9/1/13 → 8/31/17
Project: Research project
-
AF: Medium: Algorithms Based on Algebraic and Combinatorial Methods
Furer, M. (PI)
5/1/10 → 4/30/14
Project: Research project
-
AF: Medium: Algorithms Based on Algebraic and Combinatorial Methods
Furer, M. (PI)
5/1/10 → 4/30/14
Project: Research project
-
Algorithms for Algebraic and Combinatorial Problems
Furer, M. (PI)
9/15/07 → 8/31/11
Project: Research project
-
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Fürer, M., Hoppen, C. & Trevisan, V., Jun 22 2025, In: Theoretical Computer Science. 1040, 115187.Research output: Contribution to journal › Article › peer-review
1 Scopus citations -
Fast Gaussian Elimination for Low Treewidth Matrices
Fürer, M., Hoppen, C. & Trevisan, V., Oct 1 2025, 33rd Annual European Symposium on Algorithms, ESA 2025. Benoit, A., Kaplan, H., Wild, S., Wild, S. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 116. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 351).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
An Improvement of Reed’s Treewidth Approximation
Belbasi, M. & Fürer, M., 2022, In: Journal of Graph Algorithms and Applications. 26, 2, p. 257-282 26 p.Research output: Contribution to journal › Article › peer-review
Open Access5 Scopus citations -
An Improvement of Reed’s Treewidth Approximation
Belbasi, M. & Fürer, M., 2021, WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Proceedings. Uehara, R., Hong, S.-H. & Nandy, S. C. (eds.). Springer Science and Business Media Deutschland GmbH, p. 166-181 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12635 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Scopus citations -
Finding All Leftmost Separators of Size ≤ k
Belbasi, M. & Fürer, M., 2021, Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Proceedings. Du, D.-Z., Du, D., Wu, C. & Xu, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 273-287 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13135 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
3 Scopus citations