| 2025 | ESA | Fast Gaussian Elimination for Low Treewidth Matrices. | Martin Frer, Carlos Hoppen, Vilmar Trevisan |
| 2021 | COCOA | Finding All Leftmost Separators of Size $\le k$. | Mahdi Belbasi, Martin Frer |
| 2021 | WALCOM | An Improvement of Reed's Treewidth Approximation. | Mahdi Belbasi, Martin Frer |
| 2020 | ICALP | Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. | Martin Frer, Carlos Hoppen, Vilmar Trevisan |
| 2019 | CSR | A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. | Mahdi Belbasi, Martin Frer |
| 2018 | LATIN | Locating the Eigenvalues for Graphs of Small Clique-Width. | Martin Frer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan |
| 2017 | CIAC | Stathis Zachos at 70! | Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Frer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika |
| 2017 | CIAC | On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. | Martin Frer |
| 2016 | IWOCA | Faster Computation of Path-Width. | Martin Frer |
| 2015 | FAW | Efficient Computation of the Characteristic Polynomial of a Threshold Graph. | Martin Frer |
| 2014 | CSR | Space Saving by Dynamic Algebraization. | Martin Frer, Huiwen Yu |
| 2014 | LATIN | A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. | Martin Frer |
| 2014 | LATIN | How Fast Can We Multiply Large Integers on an Actual Computer? | Martin Frer |
| 2012 | FUN | Counting Perfect Matchings in Graphs of Degree 3. | Martin Frer |
| 2012 | LATIN | Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. | Martin Frer |
| 2011 | ISAAC | Packing-Based Approximation Algorithm for the k-Set Cover Problem. | Martin Frer, Huiwen Yu |
| 2010 | LATIN | Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. | Martin Frer |
| 2009 | ESA | Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. | Martin Frer |
| 2008 | LATIN | Solving NP-Complete Problems with Quantum Search. | Martin Frer |
| 2007 | AAIM | Algorithms for Counting 2-SatSolutions and Colorings with Applications. | Martin Frer, Shiva Prasad Kasiviswanathan |
| 2007 | STOC | Faster integer multiplication. | Martin Frer |
| 2007 | SOFSEM | Exact Max 2-Sat: Easier and Faster. | Martin Frer, Shiva Prasad Kasiviswanathan |
| 2007 | WADS | Spanners for Geometric Intersection Graphs. | Martin Frer, Shiva Prasad Kasiviswanathan |
| 2006 | CSR | Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. | Piotr Berman, Martin Frer, Alexander Zelikovsky |
| 2006 | LATIN | A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. | Martin Frer |
| 2006 | WAOA | Approximate Distance Queries in Disk Graphs. | Martin Frer, Shiva Prasad Kasiviswanathan |
| 2005 | ALENEX | Approximately Counting Perfect Matchings in General Graphs. | Martin Frer, Shiva Prasad Kasiviswanathan |
| 2004 | ALENEX | Quadratic Convergence for Scaling of Matrices. | Martin Frer |
| 2004 | LATIN | An Improved Communication-Randomness Tradeo. | Martin Frer |
| 2001 | ICALP | Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations. | Martin Frer |
| 2000 | STOC | Approximating permanents of complex matrices. | Martin Frer |
| 1999 | SODA | Randomized Splay Trees. | Martin Frer |
| 1997 | STOC | Approximation of | Rong-chii Duh, Martin Frer |
| 1995 | FOCS | Improved Hardness Results for Approximating the Chromatic Number. | Martin Frer |
| 1995 | SODA | Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity. | Martin Frer |
| 1994 | SODA | Approximating Maximum Independent Set in Bounded Degree Graphs. | Piotr Berman, Martin Frer |
| 1993 | ISAAC | Coloring Random Graphs in Polynomial Expected Time. | Martin Frer, C. R. Subramanian, C. E. Veni Madhavan |
| 1992 | SODA | Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. | Martin Frer, Balaji Raghavachari |
| 1992 | SPAA | O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. | Martin Frer, Xin He, Ming-Yang Kao, Balaji Raghavachari |
| 1991 | ICALP | An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. | Martin Frer |
| 1989 | FOCS | An Optimal Lower Bound on the Number of Variables for Graph Identification | Jin-yi Cai, Martin Frer, Neil Immerman |
| 1987 | STOC | The Power of Randomness for Communication Complexity (Preliminary Version) | Martin Frer |
| 1985 | ICALP | Deterministic and Las Vegas Primality Testing Algorithms. | Martin Frer |
| 1983 | STOC | Normal Forms for Trivalent Graphs and Graphs of Bounded Valence | Martin Frer, Walter Schnyder, Ernst Specker |
| 1982 | STOC | The Tight Deterministic Time Hierarchy | Martin Frer |
| 1980 | ICALP | The Complexity of the Inequivalence Problem for Regular Expressions with Intersection. | Martin Frer |