Martin Fürer

According to our database1, Martin Fürer authored at least 94 papers between 1976 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation.
CoRR, 2019

A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Locating the Eigenvalues for Graphs of Small Clique-Width.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Efficient computation of the characteristic polynomial of a threshold graph.
Theor. Comput. Sci., 2017

Space Saving by Dynamic Algebraization Based on Tree-Depth.
Theory Comput. Syst., 2017

Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set.
CoRR, 2017

On the Combinatorial Power of the Weisfeiler-Lehman Algorithm.
CoRR, 2017

Multi-Clique-Width.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

On the Combinatorial Power of the Weisfeiler-Lehman Algorithm.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Stathis Zachos at 70!
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Faster Computation of Path-Width.
CoRR, 2016

Faster Computation of Path-Width.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
Multi-Clique-Width.
CoRR, 2015

Efficient Computation of the Characteristic Polynomial of a Threshold Graph.
CoRR, 2015

Efficient Computation of the Characteristic Polynomial of a Threshold Graph.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014
Approximately Counting Embeddings into Random Graphs.
Combinatorics, Probability & Computing, 2014

Space Saving by Dynamic Algebraization.
CoRR, 2014

How Fast Can We Multiply Large Integers on an Actual Computer?
CoRR, 2014

A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width.
CoRR, 2014

Counting cliques and clique covers in random graphs.
CoRR, 2014

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks.
Algorithmica, 2014

How Fast Can We Multiply Large Integers on an Actual Computer?
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Approximating the k -Set Packing Problem by Local Improvements.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Space Saving by Dynamic Algebraization.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
An exponential time 2-approximation algorithm for bandwidth.
Theor. Comput. Sci., 2013

Deterministic Autopoietic Automata.
Int. J. Software and Informatics, 2013

Approximate the k-Set Packing Problem by Local Improvements.
CoRR, 2013

2012
Spanners for geometric intersection graphs with applications.
JoCG, 2012

Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Counting Perfect Matchings in Graphs of Degree 3.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Packing-Based Approximation Algorithm for the k-Set Cover Problem
CoRR, 2011

Packing-Based Approximation Algorithm for the k-Set Cover Problem.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
Parallel Computing: Complexity Classes.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Faster Integer Multiplication.
SIAM J. Comput., 2009

Deterministic Autopoietic Automata
Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

An Exponential Time 2-Approximation Algorithm for Bandwidth
CoRR, 2009

An Exponential Time 2-Approximation Algorithm for Bandwidth.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks.
Proceedings of the Algorithms, 2009

2008
Degree-Bounded Trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximately Counting Embeddings into Random Graphs
CoRR, 2008

Solving NP-Complete Problems with Quantum Search.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Approximately Counting Embeddings into Random Graphs.
Proceedings of the Approximation, 2008

2007
Spanners for Geometric Intersection Graphs.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Faster integer multiplication.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Exact Max 2-Sat: Easier and Faster.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Algorithms for Counting 2-SatSolutions and Colorings with Applications.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Spanners for Geometric Intersection Graphs
CoRR, 2006

Approximate Distance Queries in Disk Graphs.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.
Proceedings of the Computer Science, 2006

2005
Algorithms for Counting 2-SAT Solutions and Colorings with Applications
Electronic Colloquium on Computational Complexity (ECCC), 2005

Approximately Counting Perfect Matchings in General Graphs.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
An Improved Communication-Randomness Tradeo.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Quadratic Convergence for Scaling of Matrices.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2001
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Approximating permanents of complex matrices.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Characterizations of bipartite Steinhaus graphs.
Discrete Mathematics, 1999

Randomized Splay Trees.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Algorithms for coloring semi-random graphs.
Random Struct. Algorithms, 1998

1997
Approximation of k-Set Cover by Semi-Local Optimization.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Parallel Edge Coloring Approximation.
Parallel Processing Letters, 1996

Alignment-to-Alignment Editing with "Move Gap" Operations.
Int. J. Found. Comput. Sci., 1996

1995
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
J. Algorithms, 1995

Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Improved Hardness Results for Approximating the Chromatic Number.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
SIAM J. Discrete Math., 1994

Approximating the Minimum-Degree Steiner Tree to within One of Optimal.
J. Algorithms, 1994

Approximating Maximum Independent Set in Bounded Degree Graphs.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Coloring Random Graphs in Polynomial Expected Time.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
An optimal lower bound on the number of variables for graph identifications.
Combinatorica, 1992

Coloring Random Graphs.
Proceedings of the Algorithm Theory, 1992

O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Contracting Planar Graphs Efficiency in Parallel.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1989
AT²-Optimal Galois Field Multiplier for VLSI.
IEEE Trans. Computers, 1989

On Completeness and Soundness in Interactive Proof Systems.
Advances in Computing Research, 1989

An Optimal Lower Bound on the Number of Variables for Graph Identification
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Universal Hashing in VLSI.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
The Power of Randomness for Communication Complexity (Preliminary Version)
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Probabalistic Quantifiers vs. Distrustful Adversaries.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
AT2-Optimal Galois Field Multiplier for VLSI.
Proceedings of the VLSI Algorithms and Architectures, 1986

1985
Deterministic and Las Vegas Primality Testing Algorithms.
Proceedings of the Automata, 1985

1984
Data Structures for Distributed Counting.
J. Comput. Syst. Sci., 1984

1983
Normal Forms for Trivalent Graphs and Graphs of Bounded Valence
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1982
The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth.
Theor. Comput. Sci., 1982

The Tight Deterministic Time Hierarchy
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1980
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection.
Proceedings of the Automata, 1980

1976
Simulation von Turingmaschinen mit logischen Netzen.
Proceedings of the Komplexität von Entscheidungsproblemen, Ein Seminar, 1976

Polynomiale Transformationen und Auswahlaxiom.
Proceedings of the Komplexität von Entscheidungsproblemen, Ein Seminar, 1976


  Loading...