| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7759297 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
| Counting connected subgraphs with maximum-degree-aware sieving | 2022-07-21 | Paper |
| A faster tree-decomposition based algorithm for counting linear extensions | 2021-08-04 | Paper |
A faster tree-decomposition based algorithm for counting linear extensions
Algorithmica | 2020-08-12 | Paper |
NP-completeness results for partitioning a graph into total dominating sets
Theoretical Computer Science | 2020-04-07 | Paper |
Learning Bayesian networks with local structure, mixed variables, and exact algorithms
International Journal of Approximate Reasoning | 2020-02-26 | Paper |
Algorithms for learning parsimonious context trees
Machine Learning | 2019-06-26 | Paper |
| Fast zeta transforms for lattices with few irreducibles | 2019-05-10 | Paper |
On the number of connected sets in bounded degree graphs
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
Fast Zeta Transforms for Lattices with Few Irreducibles
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Dense subset sum may be the hardest
(available as arXiv preprint) | 2018-01-24 | Paper |
NP-completeness results for partitioning a graph into total dominating sets
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Narrow sieves for parameterized paths and packings
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Narrow sieves for parameterized paths and packings
Journal of Computer and System Sciences | 2017-05-24 | Paper |
| Subset sum in the absence of concentration | 2017-01-24 | Paper |
Structure discovery in Bayesian networks by sampling partial orders
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Separating OR, SUM, and XOR circuits
Journal of Computer and System Sciences | 2016-04-18 | Paper |
On finding optimal polytrees
Theoretical Computer Science | 2015-10-08 | Paper |
On the Number of Connected Sets in Bounded Degree Graphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
| scientific article; zbMATH DE number 6377994 (Why is no real title available?) | 2014-12-08 | Paper |
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
| A space-time tradeoff for permutation problems | 2014-05-22 | Paper |
Fast monotone summation over disjoint sets
Information Processing Letters | 2014-04-15 | Paper |
Finding efficient circuits for ensemble computation
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Space-time tradeoffs for subset sum: an improved worst case algorithm
Automata, Languages, and Programming | 2013-08-06 | Paper |
Covering and packing in linear space
Information Processing Letters | 2013-04-04 | Paper |
| Trimmed Moebius inversion and graphs of bounded degree | 2013-03-19 | Paper |
Homomorphic hashing for sparse coefficient extraction
Parameterized and Exact Computation | 2013-01-07 | Paper |
Fast Monotone Summation over Disjoint Sets
Parameterized and Exact Computation | 2013-01-07 | Paper |
Evaluation of permanents in rings and semirings
Information Processing Letters | 2012-03-27 | Paper |
| Exact Bayesian structure discovery in Bayesian networks | 2011-10-12 | Paper |
Trimmed Moebius inversion and graphs of bounded degree
Theory of Computing Systems | 2010-10-06 | Paper |
Covering and Packing in Linear Space
Automata, Languages and Programming | 2010-09-07 | Paper |
Set partitioning via inclusion-exclusion
SIAM Journal on Computing | 2010-04-29 | Paper |
Optimal 2-constraint satisfaction via sum-product algorithms
Information Processing Letters | 2010-01-18 | Paper |
Partitioning into sets of bounded cardinality
Parameterized and Exact Computation | 2010-01-14 | Paper |
Counting Paths and Packings in Halves
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Fourier meets M\"{o}bius: fast subset convolution
(available as arXiv preprint) | 2009-01-05 | Paper |
The Travelling Salesman Problem in Bounded Degree Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
| An MDL method for finding haplotype blocks and for estimating the strenght of haplotype block boundaries | 2008-04-14 | Paper |
Parent Assignment Is Hard for the MDL, AIC, and NML Costs
Learning Theory | 2007-09-14 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
