default search action
Martin Fürer
- > Home > Persons > Martin Fürer
Publications
- 2017
- [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 - 2014
- [j17]Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs. Comb. Probab. Comput. 23(6): 1028-1056 (2014) - 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) - 2012
- [j14]Martin Fürer, Shiva Prasad Kasiviswanathan:
Spanners for geometric intersection graphs with applications. J. Comput. Geom. 3(1): 31-64 (2012) - 2009
- [c40]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC 2009: 173-184 - [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 - [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 - [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 - [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
- [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 - 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) - 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) - 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) - 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
- [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 - 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) - 1987
- [c10]Stathis Zachos, Martin Fürer:
Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS 1987: 443-455
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 2024-05-02 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint