| Publication | Date of Publication | Type |
|---|
| Coloring random graphs | 2022-12-09 | Paper |
| An Improvement of Reed’s Treewidth Approximation | 2022-11-14 | Paper |
| Finding all leftmost separators of size \(\le k\) | 2022-06-29 | Paper |
| An improvement of Reed's treewidth approximation | 2021-10-04 | Paper |
| Efficient diagonalization of symmetric matrices associated with graphs of small treewidth | 2021-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146652 | 2021-01-26 | Paper |
| Locating the eigenvalues for graphs of small clique-width | 2020-02-12 | Paper |
| A space-efficient parameterized algorithm for the Hamiltonian Cycle problem by dynamic algebraization | 2019-10-22 | Paper |
| Eigenvalue location in graphs of small clique-width | 2018-11-29 | Paper |
| AT/sup 2/-optimal Galois field multiplier for VLSI | 2018-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638063 | 2018-05-03 | Paper |
| Space saving by dynamic algebraization based on tree-depth | 2017-10-20 | Paper |
| On the Combinatorial Power of the Weisfeiler-Lehman Algorithm | 2017-07-21 | Paper |
| Stathis Zachos at 70! | 2017-07-21 | Paper |
| Efficient computation of the characteristic polynomial of a tree and related tasks | 2017-05-17 | Paper |
| Spanners for geometric intersection graphs with applications | 2017-03-09 | Paper |
| Efficient computation of the characteristic polynomial of a threshold graph | 2017-02-06 | Paper |
| Faster Computation of Path-Width | 2016-09-29 | Paper |
| Efficient Computation of the Characteristic Polynomial of a Threshold Graph | 2015-11-12 | Paper |
| Approximating the $$k$$-Set Packing Problem by Local Improvements | 2015-10-16 | Paper |
| Approximately Counting Embeddings into Random Graphs | 2014-11-14 | Paper |
| Approximating permanents of complex matrices | 2014-09-26 | Paper |
| Space Saving by Dynamic Algebraization | 2014-06-24 | Paper |
| How Fast Can We Multiply Large Integers on an Actual Computer? | 2014-03-31 | Paper |
| A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width | 2014-03-31 | Paper |
| An exponential time 2-approximation algorithm for bandwidth | 2014-01-13 | Paper |
| Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width | 2012-06-29 | Paper |
| Packing-based approximation algorithm for the \(k\)-set cover problem | 2011-12-16 | Paper |
| Faster integer multiplication | 2010-07-07 | Paper |
| Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width | 2010-04-27 | Paper |
| On the power of combinatorial and spectral invariants | 2010-04-06 | Paper |
| An exponential time 2-approximation algorithm for bandwidth | 2010-01-14 | Paper |
| Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks | 2009-10-29 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Spanners for Geometric Intersection Graphs | 2009-02-17 | Paper |
| Faster integer multiplication | 2009-01-05 | Paper |
| Approximately Counting Embeddings into Random Graphs | 2008-11-27 | Paper |
| A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs | 2008-09-18 | Paper |
| Solving NP-Complete Problems with Quantum Search | 2008-04-15 | Paper |
| Circular permutations and genome shuffling | 2008-04-14 | Paper |
| Exact Max 2-Sat: Easier and Faster | 2008-03-07 | Paper |
| Approximate Distance Queries in Disk Graphs | 2008-02-21 | Paper |
| Algorithms for Counting 2-Sat Solutions and Colorings with Applications | 2008-01-04 | Paper |
| Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees | 2007-05-02 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535027 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527192 | 2002-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526990 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252726 | 2000-04-26 | Paper |
| Algorithms for coloring semi-random graphs | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268434 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252401 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246713 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4394581 | 1998-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128896 | 1997-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886098 | 1997-03-23 | Paper |
| ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS | 1996-11-26 | Paper |
| Approximating the Minimum-Degree Steiner Tree to within One of Optimal | 1995-11-22 | Paper |
| An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs | 1995-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763417 | 1995-04-11 | Paper |
| Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs | 1994-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036583 | 1993-05-18 | Paper |
| An optimal lower bound on the number of variables for graph identification | 1993-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792245 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727381 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688454 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341896 | 1984-01-01 | Paper |
| Data structures for distributed counting | 1984-01-01 | Paper |
| The complexity of Presburger arithmetic with bounded quantifier alternation depth | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967528 | 1982-01-01 | Paper |
| Alternation and the Ackermann case of the decision problem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3888558 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111543 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4110606 | 1976-01-01 | Paper |
