default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Fürer
Person information
- affiliation: Pennsylvania State University, University Park, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i20]Mahdi Belbasi, Martin Fürer, Medha Kumar:
Optimized 2-Approximation of Treewidth. CoRR abs/2411.16918 (2024)- 2022
- [j21]Mahdi Belbasi
, Martin Fürer:
An Improvement of Reed's Treewidth Approximation. J. Graph Algorithms Appl. 26(2): 257-282 (2022) - 2021
- [c59]Mahdi Belbasi, Martin Fürer:
Finding All Leftmost Separators of Size $\le k$. COCOA 2021: 273-287 - [c58]Mahdi Belbasi, Martin Fürer:
An Improvement of Reed's Treewidth Approximation. WALCOM 2021: 166-181 - [i19]Martin Fürer, Carlos Hoppen, Vilmar Trevisan:
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR abs/2109.02515 (2021) - [i18]Mahdi Belbasi, Martin Fürer:
Finding All Leftmost Separators of Size ≤k. CoRR abs/2111.02614 (2021) - 2020
- [c57]Martin Fürer, Carlos Hoppen, Vilmar Trevisan:
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP 2020: 52:1-52:18 - [i17]Mahdi Belbasi, Martin Fürer:
An Improvement of Reed's Treewidth Approximation. CoRR abs/2010.03105 (2020)
2010 – 2019
- 2019
- [c56]Mahdi Belbasi, Martin Fürer:
A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. CSR 2019: 38-49 - [i16]Mahdi Belbasi, Martin Fürer:
A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation. CoRR abs/1901.07118 (2019) - 2018
- [c55]Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan:
Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN 2018: 475-489 - 2017
- [j20]Martin Fürer, Huiwen Yu:
Space Saving by Dynamic Algebraization Based on Tree-Depth. Theory Comput. Syst. 61(2): 283-304 (2017) - [j19]Martin Fürer:
Efficient computation of the characteristic polynomial of a threshold graph. Theor. Comput. Sci. 657: 3-10 (2017) - [c54]Martin Fürer:
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. CIAC 2017: 260-271 - [c53]Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
Stathis Zachos at 70! CIAC 2017: 469-484 - [c52]Martin Fürer:
Multi-Clique-Width. ITCS 2017: 14:1-14:13 - [i15]Martin Fürer:
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. CoRR abs/1704.01023 (2017) - [i14]Mahdi Belbasi, Martin Fürer:
Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set. CoRR abs/1711.10088 (2017) - 2016
- [c51]Martin Fürer:
Faster Computation of Path-Width. IWOCA 2016: 385-396 - [r3]Martin Fürer:
Degree-Bounded Trees. Encyclopedia of Algorithms 2016: 516-519 - [i13]Martin Fürer:
Faster Computation of Path-Width. CoRR abs/1606.06566 (2016) - 2015
- [c50]Martin Fürer:
Efficient Computation of the Characteristic Polynomial of a Threshold Graph. FAW 2015: 45-51 - [i12]Martin Fürer:
Efficient Computation of the Characteristic Polynomial of a Threshold Graph. CoRR abs/1503.00617 (2015) - [i11]Martin Fürer:
Multi-Clique-Width. CoRR abs/1511.04479 (2015) - 2014
- [j18]Martin Fürer:
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. Algorithmica 68(3): 626-642 (2014) - [j17]Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs. Comb. Probab. Comput. 23(6): 1028-1056 (2014) - [c49]Martin Fürer, Huiwen Yu:
Space Saving by Dynamic Algebraization. CSR 2014: 375-388 - [c48]Martin Fürer, Huiwen Yu:
Approximating the k -Set Packing Problem by Local Improvements. ISCO 2014: 408-420 - [c47]Martin Fürer:
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. LATIN 2014: 72-83 - [c46]Martin Fürer:
How Fast Can We Multiply Large Integers on an Actual Computer? LATIN 2014: 660-670 - [i10]Martin Fürer:
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. CoRR abs/1402.1810 (2014) - [i9]Martin Fürer:
How Fast Can We Multiply Large Integers on an Actual Computer? CoRR abs/1402.1811 (2014) - [i8]Martin Fürer, Huiwen Yu:
Space Saving by Dynamic Algebraization. CoRR abs/1406.3414 (2014) - [i7]Kashyap Dixit, Martin Fürer:
Counting cliques and clique covers in random graphs. CoRR abs/1411.6673 (2014) - 2013
- [j16]Martin Fürer:
Deterministic Autopoietic Automata. Int. J. Softw. Informatics 7(4): 605-613 (2013) - [j15]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An exponential time 2-approximation algorithm for bandwidth. Theor. Comput. Sci. 511: 23-31 (2013) - [i6]Martin Fürer, Huiwen Yu:
Approximate the k-Set Packing Problem by Local Improvements. CoRR abs/1307.2262 (2013) - 2012
- [j14]Martin Fürer, Shiva Prasad Kasiviswanathan:
Spanners for geometric intersection graphs with applications. J. Comput. Geom. 3(1): 31-64 (2012) - [c45]Martin Fürer:
Counting Perfect Matchings in Graphs of Degree 3. FUN 2012: 189-197 - [c44]Martin Fürer:
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. LATIN 2012: 387-398 - 2011
- [c43]Martin Fürer, Huiwen Yu:
Packing-Based Approximation Algorithm for the k-Set Cover Problem. ISAAC 2011: 484-493 - [i5]Martin Fürer, Huiwen Yu:
Packing-Based Approximation Algorithm for the k-Set Cover Problem. CoRR abs/1109.3418 (2011) - 2010
- [c42]Martin Fürer:
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. LATIN 2010: 49-59
2000 – 2009
- 2009
- [j13]Martin Fürer:
Faster Integer Multiplication. SIAM J. Comput. 39(3): 979-1005 (2009) - [c41]Martin Fürer:
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. ESA 2009: 11-22 - [c40]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC 2009: 173-184 - [c39]Martin Fürer:
Deterministic Autopoietic Automata. DCM 2009: 49-53 - [r2]Martin Fürer:
Parallel Computing: Complexity Classes. Encyclopedia of Optimization 2009: 2900-2903 - [i4]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An Exponential Time 2-Approximation Algorithm for Bandwidth. CoRR abs/0906.1953 (2009) - 2008
- [c38]Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs. APPROX-RANDOM 2008: 416-429 - [c37]Martin Fürer:
Solving NP-Complete Problems with Quantum Search. LATIN 2008: 784-792 - [r1]Martin Fürer:
Degree-Bounded Trees. Encyclopedia of Algorithms 2008 - [i3]Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs. CoRR abs/0806.2287 (2008) - 2007
- [c36]Martin Fürer, Shiva Prasad Kasiviswanathan:
Algorithms for Counting 2-SatSolutions and Colorings with Applications. AAIM 2007: 47-57 - [c35]Martin Fürer, Shiva Prasad Kasiviswanathan:
Exact Max 2-Sat: Easier and Faster. SOFSEM (1) 2007: 272-283 - [c34]Martin Fürer:
Faster integer multiplication. STOC 2007: 57-66 - [c33]Martin Fürer, Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs. WADS 2007: 312-324 - 2006
- [c32]Piotr Berman, Martin Fürer, Alexander Zelikovsky:
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR 2006: 70-79 - [c31]Martin Fürer:
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. LATIN 2006: 491-501 - [c30]Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximate Distance Queries in Disk Graphs. WAOA 2006: 174-187 - [i2]Martin Fürer, Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs. CoRR abs/cs/0605029 (2006) - 2005
- [c29]Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Perfect Matchings in General Graphs. ALENEX/ANALCO 2005: 263-272 - [i1]Martin Fürer, Shiva Prasad Kasiviswanathan:
Algorithms for Counting 2-SAT Solutions and Colorings with Applications. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c28]Martin Fürer:
Quadratic Convergence for Scaling of Matrices. ALENEX/ANALC 2004: 216-223 - [c27]Martin Fürer, Shiva Prasad Kasiviswanathan:
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. FSTTCS 2004: 263-274 - [c26]Martin Fürer:
An Improved Communication-Randomness Tradeo. LATIN 2004: 444-454 - 2001
- [c25]Martin Fürer:
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations. ICALP 2001: 322-333 - 2000
- [c24]Martin Fürer:
Approximating permanents of complex matrices. STOC 2000: 667-669
1990 – 1999
- 1999
- [j12]Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley:
Characterizations of bipartite Steinhaus graphs. Discret. Math. 199(1-3): 11-25 (1999) - [c23]Martin Fürer:
Randomized Splay Trees. SODA 1999: 903-904 - 1998
- [j11]C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan:
Algorithms for coloring semi-random graphs. Random Struct. Algorithms 13(2): 125-158 (1998) - 1997
- [c22]Rong-chii Duh, Martin Fürer:
Approximation of k-Set Cover by Semi-Local Optimization. STOC 1997: 256-264 - 1996
- [j10]Martin Fürer, Webb Miller:
Alignment-to-Alignment Editing with "Move Gap" Operations. Int. J. Found. Comput. Sci. 7(1): 23-42 (1996) - [j9]Martin Fürer, Balaji Raghavachari:
Parallel Edge Coloring Approximation. Parallel Process. Lett. 6(3): 321-329 (1996) - 1995
- [j8]Martin Fürer, Balaji Raghavachari:
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms 18(2): 203-220 (1995) - [c21]Martin Fürer:
Improved Hardness Results for Approximating the Chromatic Number. FOCS 1995: 414-421 - [c20]Martin Fürer:
Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity. SODA 1995: 624-631 - 1994
- [j7]Martin Fürer, Balaji Raghavachari:
Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms 17(3): 409-423 (1994) - [j6]Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari:
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discret. Math. 7(4): 632-646 (1994) - [c19]Piotr Berman, Martin Fürer:
Approximating Maximum Independent Set in Bounded Degree Graphs. SODA 1994: 365-371 - 1993
- [c18]Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan:
Coloring Random Graphs in Polynomial Expected Time. ISAAC 1993: 31-37 - 1992
- [j5]Jin-yi Cai, Martin Fürer, Neil Immerman:
An optimal lower bound on the number of variables for graph identification. Comb. 12(4): 389-410 (1992) - [c17]Martin Fürer, Balaji Raghavachari:
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA 1992: 317-324 - [c16]Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari:
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SPAA 1992: 410-419 - [c15]Martin Fürer, C. R. Subramanian:
Coloring Random Graphs. SWAT 1992: 284-291 - 1991
- [c14]Martin Fürer:
Contracting Planar Graphs Efficiency in Parallel. FSTTCS 1991: 319-335 - [c13]Martin Fürer:
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. ICALP 1991: 429-440
1980 – 1989
- 1989
- [j4]Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos:
On Completeness and Soundness in Interactive Proof Systems. Adv. Comput. Res. 5: 429-442 (1989) - [j3]Martin Fürer, Kurt Mehlhorn:
AT²-Optimal Galois Field Multiplier for VLSI. IEEE Trans. Computers 38(9): 1333-1336 (1989) - [c12]Jin-yi Cai, Martin Fürer, Neil Immerman:
An Optimal Lower Bound on the Number of Variables for Graph Identification. FOCS 1989: 612-617 - 1988
- [c11]Martin Fürer:
Universal Hashing in VLSI. AWOC 1988: 312-318 - 1987
- [c10]Stathis Zachos, Martin Fürer:
Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS 1987: 443-455 - [c9]Martin Fürer:
The Power of Randomness for Communication Complexity (Preliminary Version). STOC 1987: 178-181 - 1986
- [c8]Martin Fürer, Kurt Mehlhorn:
AT2-Optimal Galois Field Multiplier for VLSI. Aegean Workshop on Computing 1986: 217-225 - 1985
- [c7]Martin Fürer:
Deterministic and Las Vegas Primality Testing Algorithms. ICALP 1985: 199-209 - 1984
- [j2]Martin Fürer:
Data Structures for Distributed Counting. J. Comput. Syst. Sci. 28(2): 231-243 (1984) - 1983
- [c6]Martin Fürer:
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). Logic and Machines 1983: 312-319 - [c5]Martin Fürer, Walter Schnyder, Ernst Specker:
Normal Forms for Trivalent Graphs and Graphs of Bounded Valence. STOC 1983: 161-170 - 1982
- [j1]Martin Fürer:
The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth. Theor. Comput. Sci. 18: 105-111 (1982) - [c4]Martin Fürer:
The Tight Deterministic Time Hierarchy. STOC 1982: 8-16 - 1980
- [c3]Martin Fürer:
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection. ICALP 1980: 234-245
1970 – 1979
- 1976
- [c2]Martin Fürer:
Polynomiale Transformationen und Auswahlaxiom. Komplexität von Entscheidungsproblemen 1976 1976: 86-101 - [c1]Martin Fürer:
Simulation von Turingmaschinen mit logischen Netzen. Komplexität von Entscheidungsproblemen 1976 1976: 163-181
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-15 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
