Martin Fürer

ScholarGPS® ID: 97939633526839

Affiliation

Pennsylvania State University, University Park, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Metrics Summary

Publication Count

Predicted Citations

1,771

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Finding All Leftmost Separators of Size $$\le k$$ (book chapter) In Combinatorial Optimization and Applications Belbasi, Mahdi \| Fürer, Martin Springer International Publishing (2021) 10.1007/978-3-030-92681-6_23 Cited by (2) \| Cite \| Source
An Improvement of Reed’s Treewidth Approximation (book chapter) In WALCOM: Algorithms and Computation Belbasi, Mahdi \| Fürer, Martin Springer International Publishing (2021) 10.1007/978-3-030-68211-8_14 Cited by (1) \| Cite \| Source
A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization (book chapter) In Computer Science – Theory and Applications Belbasi, Mahdi \| Fürer, Martin Springer International Publishing (2019) 10.1007/978-3-030-19955-5_4 Cited by (2) \| Cite \| Source
Eigenvalue location in graphs of small clique-width (journal article) Fürer, Martin \| Hoppen, Carlos \| Jacobs, David P. \| Trevisan, Vilmar Linear Algebra and its Applications, volume 560 (2019). 10.1016/j.laa.2018.09.015 Cited by (3) \| Cite \| Source \| Open Access
Locating the Eigenvalues for Graphs of Small Clique-Width (book chapter) In LATIN 2018: Theoretical Informatics Fürer, Martin \| Hoppen, Carlos \| Jacobs, David P. \| Trevisan, Vilmar Springer International Publishing (2018) 10.1007/978-3-319-77404-6_35 Cited by (2) \| Cite \| Source
Space Saving by Dynamic Algebraization Based on Tree-Depth (journal article) Fürer, Martin \| Yu, Huiwen Theory of Computing Systems, volume 61, issue 2, pages 283-304 (2017). 10.1007/s00224-017-9751-3 Cited by (5) \| Cite \| Source
Efficient computation of the characteristic polynomial of a threshold graph (journal article) Fürer, Martin Theoretical Computer Science, volume 657 (2017). 10.1016/j.tcs.2016.07.013 Cited by (5) \| Cite \| Source \| Open Access
Stathis Zachos at 70! (book chapter) In Algorithms and Complexity Bakali, Eleni \| Cheilaris, Panagiotis \| Fotakis, Dimitris \| Fürer, Martin \| Koutras, Costas D. \| Markou, Euripides \| Nomikos, Christos \| Pagourtzis, Aris \| Papadimitriou, Christos H. \| Papaspyrou, Nikolaos S. \| Potika, Katerina Springer International Publishing (2017) 10.1007/978-3-319-57586-5_39 Cite \| Source
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm (book chapter) In Algorithms and Complexity Fürer, Martin Springer International Publishing (2017) 10.1007/978-3-319-57586-5_22 Cited by (13) \| Cite \| Source \| Open Access
Degree-Bounded Trees (book chapter) In Encyclopedia of Algorithms Fürer, Martin Springer New York (2016) 10.1007/978-1-4939-2864-4_104 Cite \| Source
Faster Computation of Path-Width (book chapter) In Combinatorial Algorithms Fürer, Martin Springer International Publishing (2016) 10.1007/978-3-319-44543-4_30 Cited by (7) \| Cite \| Source \| Open Access
Efficient Computation of the Characteristic Polynomial of a Threshold Graph (book chapter) In Frontiers in Algorithmics Fürer, Martin Springer International Publishing (2015) 10.1007/978-3-319-19647-3_5 Cited by (1) \| Cite \| Source \| Open Access
Approximately Counting Embeddings into Random Graphs (journal article) FÜRER, Martin \| Kasiviswanathan, Shiva Prasad Combinatorics, Probability and Computing, volume 23, issue 6, pages 1028-1056 (2014). 10.1017/S0963548314000339 Cited by (3) \| Cite \| Source \| Open Access
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks (journal article) Fürer, Martin Algorithmica, volume 68, issue 3, pages 626-642 (2014). 10.1007/s00453-012-9688-5 Cited by (4) \| Cite \| Source
Approximating the $$k$$ -Set Packing Problem by Local Improvements (book chapter) In Combinatorial Optimization Fürer, Martin \| Yu, Huiwen Springer International Publishing (2014) 10.1007/978-3-319-14115-2_35 Cited by (4) \| Cite \| Source
Space Saving by Dynamic Algebraization (book chapter) In Computer Science - Theory and Applications Fürer, Martin \| Yu, Huiwen Springer International Publishing (2014) 10.1007/978-3-319-06686-8_29 Cited by (1) \| Cite \| Source \| Open Access
Approximating the $$k$$-Set Packing Problem by Local Improvements (book chapter) In Combinatorial Optimization Fürer, Martin \| Yu, Huiwen Springer International Publishing (2014) 10.1007/978-3-319-09174-7_35 Cited by (18) \| Cite \| Source
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width (book chapter) In LATIN 2014: Theoretical Informatics Fürer, Martin Springer Berlin Heidelberg (2014) 10.1007/978-3-642-54423-1_7 Cited by (3) \| Cite \| Source \| Open Access
How Fast Can We Multiply Large Integers on an Actual Computer? (book chapter) In LATIN 2014: Theoretical Informatics Fürer, Martin Springer Berlin Heidelberg (2014) 10.1007/978-3-642-54423-1_57 Cited by (7) \| Cite \| Source \| Open Access
An exponential time 2-approximation algorithm for bandwidth (journal article) Fürer, Martin \| Gaspers, Serge \| Kasiviswanathan, Shiva Prasad Theoretical Computer Science, volume 511 (2013). 10.1016/j.tcs.2013.03.024 Cited by (8) \| Cite \| Source \| Open Access

Title	Investigators	Year	Expiration	Amount
AF: Small: Algorithms Based on Discrete and Algebraic Methods	Furer, Martin	09-01-2013	08-31-2017	$399,367
Algorithms for Algebraic and Combinatorial Problems	Furer, Martin	09-15-2007	08-31-2011	$300,000
Approximation Algorithms for Problems of Various Complexities	Furer, Martin	05-15-2002	04-30-2006	$236,711
Graph Algorithms and Approximation	Furer, Martin \| Berman, Piotr	09-01-1997	05-31-2001	$149,886
Combinatorial Graph Algorithms and Approximation	Furer, Martin	04-15-1993	03-31-1996	$102,000
Topics in Algorithms and Complexity	Schnitger, Georg \| Furer, Martin \| Berman, Piotr	09-01-1988	08-31-1991	$140,955