| Publication | Date of Publication | Type |
|---|
Coloring random graphs
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
An improvement of Reed's treewidth approximation
Journal of Graph Algorithms and Applications | 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 |
Deterministic autopoietic automata
| 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
Linear Algebra and its Applications | 2018-11-29 | Paper |
AT/sup 2/-optimal Galois field multiplier for VLSI
IEEE Transactions on Computers | 2018-09-14 | Paper |
Multi-clique-width
| 2018-05-03 | Paper |
Space saving by dynamic algebraization based on tree-depth
Theory of Computing Systems | 2017-10-20 | Paper |
On the combinatorial power of the Weisfeiler-Lehman algorithm
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Stathis Zachos at 70!
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Efficient computation of the characteristic polynomial of a tree and related tasks
Algorithmica | 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
Theoretical Computer Science | 2017-02-06 | Paper |
Faster computation of path-width
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Efficient computation of the characteristic polynomial of a threshold graph
Frontiers in Algorithmics | 2015-11-12 | Paper |
Approximating the \(k\)-set packing problem by local improvements
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Approximately counting embeddings into random graphs
Combinatorics, Probability and Computing | 2014-11-14 | Paper |
Approximating permanents of complex matrices
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Space saving by dynamic algebraization
Computer Science - Theory and Applications | 2014-06-24 | Paper |
How fast can we multiply large integers on an actual computer?
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science | 2014-01-13 | Paper |
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Packing-based approximation algorithm for the \(k\)-set cover problem
Algorithms and Computation | 2011-12-16 | Paper |
Faster integer multiplication
SIAM Journal on Computing | 2010-07-07 | Paper |
Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
On the power of combinatorial and spectral invariants
Linear Algebra and its Applications | 2010-04-06 | Paper |
An exponential time 2-approximation algorithm for bandwidth
Parameterized and Exact Computation | 2010-01-14 | Paper |
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
Lecture Notes in Computer Science | 2009-10-29 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Spanners for Geometric Intersection Graphs
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Faster integer multiplication
| 2009-01-05 | Paper |
Approximately Counting Embeddings into Random Graphs
Lecture Notes in Computer Science | 2008-11-27 | Paper |
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Solving NP-Complete Problems with Quantum Search
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Circular permutations and genome shuffling
| 2008-04-14 | Paper |
Exact Max 2-Sat: Easier and Faster
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Approximate Distance Queries in Disk Graphs
Approximation and Online Algorithms | 2008-02-21 | Paper |
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
Computer Science – Theory and Applications | 2007-05-02 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
scientific article; zbMATH DE number 1754602 (Why is no real title available?)
| 2002-06-12 | Paper |
scientific article; zbMATH DE number 1560341 (Why is no real title available?)
| 2002-01-13 | Paper |
scientific article; zbMATH DE number 1559541 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1306874 (Why is no real title available?)
| 2000-04-26 | Paper |
Algorithms for coloring semi-random graphs
| 1999-12-19 | Paper |
scientific article; zbMATH DE number 1354121 (Why is no real title available?)
| 1999-10-31 | Paper |
scientific article; zbMATH DE number 1305510 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1300955 (Why is no real title available?)
| 1999-06-16 | Paper |
scientific article; zbMATH DE number 1163093 (Why is no real title available?)
| 1998-10-01 | Paper |
scientific article; zbMATH DE number 1003268 (Why is no real title available?)
| 1997-10-29 | Paper |
scientific article; zbMATH DE number 910921 (Why is no real title available?)
| 1997-03-23 | Paper |
ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
Journal of Algorithms | 1995-11-22 | Paper |
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
Journal of Algorithms | 1995-08-20 | Paper |
scientific article; zbMATH DE number 742978 (Why is no real title available?)
| 1995-04-11 | Paper |
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
scientific article; zbMATH DE number 176753 (Why is no real title available?)
| 1993-05-18 | Paper |
An optimal lower bound on the number of variables for graph identification
Combinatorica | 1993-03-10 | Paper |
scientific article; zbMATH DE number 4057011 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3958728 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3910466 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3876591 (Why is no real title available?)
| 1984-01-01 | Paper |
Data structures for distributed counting
Journal of Computer and System Sciences | 1984-01-01 | Paper |
The complexity of Presburger arithmetic with bounded quantifier alternation depth
Theoretical Computer Science | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3790418 (Why is no real title available?)
| 1982-01-01 | Paper |
Alternation and the Ackermann case of the decision problem
L'Enseignement Mathématique. 2e Série | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3694622 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3536062 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3534068 (Why is no real title available?)
| 1976-01-01 | Paper |
