| Publication | Date of Publication | Type |
|---|
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
Theoretical Computer Science | 2021-12-22 | Paper |
| Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms | 2021-10-04 | Paper |
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Frontiers in Algorithmics | 2019-04-26 | Paper |
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
| scientific article; zbMATH DE number 5997363 (Why is no real title available?) | 2012-01-13 | Paper |
Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise
Theoretical Computer Science | 2011-09-12 | Paper |
Polynomial time identification of strict prefix deterministic finite state transducers
Grammatical Inference: Theoretical Results and Applications | 2010-09-10 | Paper |
A simple and faster branch-and-bound algorithm for finding a maximum clique
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Journal of Global Optimization | 2009-09-01 | Paper |
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
Grammatical Inference: Algorithms and Applications | 2008-11-27 | Paper |
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Journal of Global Optimization | 2007-03-06 | Paper |
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science | 2007-01-09 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Polynomial time learning of simple deterministic languages via queries and a representative sample
Theoretical Computer Science | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2040957 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 1670730 (Why is no real title available?) | 2001-11-11 | Paper |
Polynomial-time learning of regular languages through queries and counterexamples
RIMS Kokyuroku | 2001-09-17 | Paper |
The extended equivalence problem for a class of non-real-time deterministic pushdown automata
Acta Informatica | 1995-12-13 | Paper |
A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
Theoretical Computer Science | 1989-01-01 | Paper |
A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable
Theoretical Computer Science | 1985-01-01 | Paper |
An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
Theoretical Computer Science | 1984-01-01 | Paper |
A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
Theoretical Computer Science | 1983-01-01 | Paper |
A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
Information and Control | 1982-01-01 | Paper |
