Martin Fürer - RankMe

105 papers A* 17A 3B 14C 6Misc 5Journal 42Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. Theor. Comput. Sci. Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2025	A	`conf`	Fast Gaussian Elimination for Low Treewidth Matrices. ESA Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2024	J	`jnl`	Optimized 2-Approximation of Treewidth. CoRR Mahdi Belbasi, Martin Fürer, Medha Kumar
2022	J	`jnl`	An Improvement of Reed's Treewidth Approximation. J. Graph Algorithms Appl. Mahdi Belbasi, Martin Fürer
2021	B	`conf`	An Improvement of Reed's Treewidth Approximation. WALCOM Mahdi Belbasi, Martin Fürer
2021	J	`jnl`	Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2021	C	`conf`	Finding All Leftmost Separators of Size $\le k$. COCOA Mahdi Belbasi, Martin Fürer
2021	J	`jnl`	Finding All Leftmost Separators of Size ≤k. CoRR Mahdi Belbasi, Martin Fürer
2020	J	`jnl`	An Improvement of Reed's Treewidth Approximation. CoRR Mahdi Belbasi, Martin Fürer
2020	A*	`conf`	Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2019	Misc	`conf`	A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. CSR Mahdi Belbasi, Martin Fürer
2019	J	`jnl`	A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation. CoRR Mahdi Belbasi, Martin Fürer
2018	B	`conf`	Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan
2017	J	`jnl`	Efficient computation of the characteristic polynomial of a threshold graph. Theor. Comput. Sci. Martin Fürer
2017	A	`conf`	Multi-Clique-Width. ITCS Martin Fürer
2017	C	`conf`	On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. CIAC Martin Fürer
2017	J	`jnl`	On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. CoRR Martin Fürer
2017	J	`jnl`	Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set. CoRR Mahdi Belbasi, Martin Fürer
2017	J	`jnl`	Space Saving by Dynamic Algebraization Based on Tree-Depth. Theory Comput. Syst. Martin Fürer, Huiwen Yu
2017	C	`conf`	Stathis Zachos at 70! CIAC 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
2016	—	`ch.`	Degree-Bounded Trees. Encyclopedia of Algorithms Martin Fürer
2016	C	`conf`	Faster Computation of Path-Width. IWOCA Martin Fürer
2016	J	`jnl`	Faster Computation of Path-Width. CoRR Martin Fürer
2015	Misc	`conf`	Efficient Computation of the Characteristic Polynomial of a Threshold Graph. FAW Martin Fürer
2015	J	`jnl`	Efficient Computation of the Characteristic Polynomial of a Threshold Graph. CoRR Martin Fürer
2015	J	`jnl`	Multi-Clique-Width. CoRR Martin Fürer
2014	B	`conf`	A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. LATIN Martin Fürer
2014	J	`jnl`	A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. CoRR Martin Fürer
2014	J	`jnl`	Approximately Counting Embeddings into Random Graphs. Comb. Probab. Comput. Martin Fürer, Shiva Prasad Kasiviswanathan
2014	C	`conf`	Approximating the k -Set Packing Problem by Local Improvements. ISCO Martin Fürer, Huiwen Yu
2014	J	`jnl`	Counting cliques and clique covers in random graphs. CoRR Kashyap Dixit, Martin Fürer
2014	J	`jnl`	Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. Algorithmica Martin Fürer
2014	B	`conf`	How Fast Can We Multiply Large Integers on an Actual Computer? LATIN Martin Fürer
2014	J	`jnl`	How Fast Can We Multiply Large Integers on an Actual Computer? CoRR Martin Fürer
2014	Misc	`conf`	Space Saving by Dynamic Algebraization. CSR Martin Fürer, Huiwen Yu
2014	J	`jnl`	Space Saving by Dynamic Algebraization. CoRR Martin Fürer, Huiwen Yu
2013	J	`jnl`	An exponential time 2-approximation algorithm for bandwidth. Theor. Comput. Sci. Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
2013	J	`jnl`	Approximate the k-Set Packing Problem by Local Improvements. CoRR Martin Fürer, Huiwen Yu
2013	J	`jnl`	Deterministic Autopoietic Automata. Int. J. Softw. Informatics Martin Fürer
2012	Misc	`conf`	Counting Perfect Matchings in Graphs of Degree 3. FUN Martin Fürer
2012	B	`conf`	Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. LATIN Martin Fürer
2012	J	`jnl`	Spanners for geometric intersection graphs with applications. J. Comput. Geom. Martin Fürer, Shiva Prasad Kasiviswanathan
2011	J	`jnl`	Packing-Based Approximation Algorithm for the k-Set Cover Problem CoRR Martin Fürer, Huiwen Yu
2011	B	`conf`	Packing-Based Approximation Algorithm for the k-Set Cover Problem. ISAAC Martin Fürer, Huiwen Yu
2010	B	`conf`	Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. LATIN Martin Fürer
2009	J	`jnl`	An Exponential Time 2-Approximation Algorithm for Bandwidth CoRR Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
2009	—	`conf`	An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
2009	—	`conf`	Deterministic Autopoietic Automata DCM Martin Fürer
2009	A	`conf`	Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. ESA Martin Fürer
2009	J	`jnl`	Faster Integer Multiplication. SIAM J. Comput. Martin Fürer
2009	—	`ch.`	Parallel Computing: Complexity Classes. Encyclopedia of Optimization Martin Fürer
2008	J	`jnl`	Approximately Counting Embeddings into Random Graphs CoRR Martin Fürer, Shiva Prasad Kasiviswanathan
2008	—	`conf`	Approximately Counting Embeddings into Random Graphs. APPROX-RANDOM Martin Fürer, Shiva Prasad Kasiviswanathan
2008	—	`ch.`	Degree-Bounded Trees. Encyclopedia of Algorithms Martin Fürer
2008	B	`conf`	Solving NP-Complete Problems with Quantum Search. LATIN Martin Fürer
2007	C	`conf`	Algorithms for Counting 2-SatSolutions and Colorings with Applications. AAIM Martin Fürer, Shiva Prasad Kasiviswanathan
2007	—	`conf`	Exact Max 2-Sat: Easier and Faster. SOFSEM (1) Martin Fürer, Shiva Prasad Kasiviswanathan
2007	A*	`conf`	Faster integer multiplication. STOC Martin Fürer
2007	B	`conf`	Spanners for Geometric Intersection Graphs. WADS Martin Fürer, Shiva Prasad Kasiviswanathan
2006	B	`conf`	A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. LATIN Martin Fürer
2006	Misc	`conf`	Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR Piotr Berman, Martin Fürer, Alexander Zelikovsky
2006	B	`conf`	Approximate Distance Queries in Disk Graphs. WAOA Martin Fürer, Shiva Prasad Kasiviswanathan
2006	J	`jnl`	Spanners for Geometric Intersection Graphs CoRR Martin Fürer, Shiva Prasad Kasiviswanathan
2005	J	`jnl`	Algorithms for Counting 2-SAT Solutions and Colorings with Applications Electron. Colloquium Comput. Complex. Martin Fürer, Shiva Prasad Kasiviswanathan
2005	—	`conf`	Approximately Counting Perfect Matchings in General Graphs. ALENEX/ANALCO Martin Fürer, Shiva Prasad Kasiviswanathan
2004	—	`conf`	An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. FSTTCS Martin Fürer, Shiva Prasad Kasiviswanathan
2004	B	`conf`	An Improved Communication-Randomness Tradeo. LATIN Martin Fürer
2004	—	`conf`	Quadratic Convergence for Scaling of Matrices. ALENEX/ANALC Martin Fürer
2001	A*	`conf`	Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations. ICALP Martin Fürer
2000	A*	`conf`	Approximating permanents of complex matrices. STOC Martin Fürer
1999	J	`jnl`	Characterizations of bipartite Steinhaus graphs. Discret. Math. Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom P. Whaley
1999	A*	`conf`	Randomized Splay Trees. SODA Martin Fürer
1998	J	`jnl`	Algorithms for coloring semi-random graphs. Random Struct. Algorithms C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan
1997	A*	`conf`	Approximation of STOC Rong-chii Duh, Martin Fürer
1996	J	`jnl`	Alignment-to-Alignment Editing with "Move Gap" Operations. Int. J. Found. Comput. Sci. Martin Fürer, Webb Miller
1996	J	`jnl`	Parallel Edge Coloring Approximation. Parallel Process. Lett. Martin Fürer, Balaji Raghavachari
1995	J	`jnl`	An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms Martin Fürer, Balaji Raghavachari
1995	A*	`conf`	Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity. SODA Martin Fürer
1995	A*	`conf`	Improved Hardness Results for Approximating the Chromatic Number. FOCS Martin Fürer
1994	A*	`conf`	Approximating Maximum Independent Set in Bounded Degree Graphs. SODA Piotr Berman, Martin Fürer
1994	J	`jnl`	Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms Martin Fürer, Balaji Raghavachari
1994	J	`jnl`	Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discret. Math. Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari
1993	B	`conf`	Coloring Random Graphs in Polynomial Expected Time. ISAAC Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan
1992	J	`jnl`	An optimal lower bound on the number of variables for graph identification. Comb. Jin-Yi Cai, Martin Fürer, Neil Immerman
1992	A*	`conf`	Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA Martin Fürer, Balaji Raghavachari
1992	—	`conf`	Coloring Random Graphs. SWAT Martin Fürer, C. R. Subramanian
1992	B	`conf`	O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SPAA Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari
1991	A*	`conf`	An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. ICALP Martin Fürer
1991	—	`conf`	Contracting Planar Graphs Efficiency in Parallel. FSTTCS Martin Fürer
1989	J	`jnl`	AT²-Optimal Galois Field Multiplier for VLSI. IEEE Trans. Computers Martin Fürer, Kurt Mehlhorn
1989	A*	`conf`	An Optimal Lower Bound on the Number of Variables for Graph Identification FOCS Jin-Yi Cai, Martin Fürer, Neil Immerman
1989	J	`jnl`	On Completeness and Soundness in Interactive Proof Systems. Adv. Comput. Res. Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos
1988	—	`conf`	Universal Hashing in VLSI. AWOC Martin Fürer
1987	—	`conf`	Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS Stathis Zachos, Martin Fürer
1987	A*	`conf`	The Power of Randomness for Communication Complexity (Preliminary Version) STOC Martin Fürer
1986	—	`conf`	AT Aegean Workshop on Computing Martin Fürer, Kurt Mehlhorn
1985	A*	`conf`	Deterministic and Las Vegas Primality Testing Algorithms. ICALP Martin Fürer
1984	J	`jnl`	Data Structures for Distributed Counting. J. Comput. Syst. Sci. Martin Fürer
1983	A*	`conf`	Normal Forms for Trivalent Graphs and Graphs of Bounded Valence STOC Martin Fürer, Walter Schnyder, Ernst Specker
1983	—	`conf`	The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). Logic and Machines Martin Fürer
1982	J	`jnl`	The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth. Theor. Comput. Sci. Martin Fürer
1982	A*	`conf`	The Tight Deterministic Time Hierarchy STOC Martin Fürer
1980	A*	`conf`	The Complexity of the Inequivalence Problem for Regular Expressions with Intersection. ICALP Martin Fürer
1976	—	`conf`	Polynomiale Transformationen und Auswahlaxiom. Komplexität von Entscheidungsproblemen 1976 Martin Fürer
1976	—	`conf`	Simulation von Turingmaschinen mit logischen Netzen. Komplexität von Entscheidungsproblemen 1976 Martin Fürer