| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7788477 (Why is no real title available?)
| 2024-01-15 | Paper |
The shortest even cycle problem is tractable
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7563818 (Why is no real title available?)
Theory of Computing | 2022-07-26 | Paper |
scientific article; zbMATH DE number 7561519 (Why is no real title available?)
| 2022-07-21 | Paper |
Counting connected subgraphs with maximum-degree-aware sieving
| 2022-07-21 | Paper |
Tensor network complexity of multilinear maps
| 2022-07-18 | Paper |
Engineering motif search for large motifs
| 2020-12-16 | Paper |
Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
Algorithmica | 2020-10-21 | Paper |
Counting Short Vector Pairs by Inner Product and Relations to the Permanent
| 2020-07-28 | Paper |
Directed Hamiltonicity and out-branchings via generalized Laplacians
| 2020-05-27 | Paper |
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
| 2020-05-27 | Paper |
An adaptive prefix-assignment technique for symmetry reduction
Journal of Symbolic Computation | 2020-01-15 | Paper |
Algebraic methods in the congested clique
Distributed Computing | 2019-11-27 | Paper |
Probabilistic tensors and opportunistic Boolean matrix multiplication
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Engineering Motif Search for Large Graphs
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Engineering a delegatable and error-tolerant algorithm for counting small subgraphs
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Engineering an efficient canonical labeling tool for large and sparse graphs
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Algorithmica | 2019-09-10 | Paper |
Counting thin subgraphs via packings faster than meet-in-the-middle time
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Fast zeta transforms for lattices with few irreducibles
| 2019-05-10 | Paper |
Parameterized single-exponential time polynomial space algorithm for Steiner tree
SIAM Journal on Discrete Mathematics | 2019-02-06 | Paper |
On the number of connected sets in bounded degree graphs
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
A faster subquadratic algorithm for finding outlier correlations
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Counting thin subgraphs via packings faster than meet-in-the-middle time
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Fast Zeta Transforms for Lattices with Few Irreducibles
ACM Transactions on Algorithms | 2018-10-30 | Paper |
A Faster Subquadratic Algorithm for Finding Outlier Correlations
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
scientific article; zbMATH DE number 6846423 (Why is no real title available?)
| 2018-03-02 | Paper |
Dense subset sum may be the hardest
| 2018-01-24 | Paper |
An adaptive prefix-assignment technique for symmetry reduction
Theory and Applications of Satisfiability Testing – SAT 2017 | 2017-11-15 | Paper |
How proofs are prepared at Camelot (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Narrow sieves for parameterized paths and packings
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Probably optimal graph motifs
| 2017-01-30 | Paper |
Subset sum in the absence of concentration
| 2017-01-24 | Paper |
Fast Möbius inversion in semimodular lattices and ER-labelable posets
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Separating OR, SUM, and XOR circuits
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Constrained multilinear detection and generalized graph motifs
Algorithmica | 2016-03-29 | Paper |
Algebraic methods in the congested clique
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Parameterized single-exponential time polynomial space algorithm for Steiner tree
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the Number of Connected Sets in Bounded Degree Graphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Enumeration of Steiner triple systems with subsystems
Mathematics of Computation | 2015-08-13 | Paper |
Fast witness extraction using a decision oracle
Algorithms - ESA 2014 | 2014-10-08 | Paper |
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Switching in one-factorisations of complete graphs
The Electronic Journal of Combinatorics | 2014-09-04 | 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 |
Counting closed trails
Information Processing Letters | 2013-03-21 | 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 |
Local approximability of max-min and min-max linear programs
Theory of Computing Systems | 2012-12-10 | Paper |
Evaluation of permanents in rings and semirings
Information Processing Letters | 2012-03-27 | Paper |
Steiner triple systems satisfying the 4-vertex condition
Designs, Codes and Cryptography | 2012-03-01 | Paper |
The cycle switching graph of the Steiner triple systems of order 19 is connected
Graphs and Combinatorics | 2012-01-24 | Paper |
Conflict propagation and component recursion for canonical labeling
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
Discrete Mathematics | 2011-05-10 | Paper |
The number of Latin squares of order 11
Mathematics of Computation | 2011-04-19 | Paper |
Almost stable matchings by truncating the Gale-Shapley algorithm
Algorithmica | 2010-10-07 | 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 |
A catalogue of the Steiner triple systems of order 19
| 2010-09-02 | Paper |
Properties of the Steiner triple systems of order 19
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Counting Paths and Packings in Halves
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Packing Steiner trees with identical terminal sets
Information Processing Letters | 2009-07-21 | Paper |
There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
Journal of Combinatorial Designs | 2009-04-08 | Paper |
Classification of resolvable balanced incomplete block designs — the unitals on 28 points
Mathematica Slovaca | 2009-03-31 | Paper |
Fourier meets M\"{o}bius: fast subset convolution
| 2009-01-05 | Paper |
An enumeration of graphical designs
Journal of Combinatorial Designs | 2008-11-19 | Paper |
The Travelling Salesman Problem in Bounded Degree Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Steiner triple systems of order 19 and 21 with subsystems of order 7
Discrete Mathematics | 2008-05-29 | Paper |
There are exactly five biplanes with k = 11
Journal of Combinatorial Designs | 2008-03-20 | Paper |
There exists no symmetric configuration with 33 points and line size 6
| 2008-02-22 | Paper |
There are exactly five biplanes with
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
| 2007-03-30 | Paper |
The Steiner quadruple systems of order 16
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
Nonexistence of perfect Steiner triple systems of order 19 and 21
| 2006-09-14 | Paper |
Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs.
Journal of Combinatorial Theory. Series A | 2006-05-18 | Paper |
Classification algorithms for codes and designs
Algorithms and Computation in Mathematics | 2006-04-03 | Paper |
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science | 2005-12-05 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments
Designs, Codes and Cryptography | 2005-08-17 | Paper |
One-factorizations of regular graphs of order 12
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
There exist non‐isomorphic STS(19) with equivalent point codes
Journal of Combinatorial Designs | 2005-02-23 | Paper |
The Steiner triple systems of order 19
Mathematics of Computation | 2004-08-13 | Paper |
Miscellaneous classification results for 2-designs
Discrete Mathematics | 2004-08-06 | Paper |
Enumeration of balanced ternary designs.
Discrete Applied Mathematics | 2004-03-29 | Paper |
scientific article; zbMATH DE number 2061796 (Why is no real title available?)
| 2004-03-25 | Paper |
Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions
Designs, Codes and Cryptography | 2002-09-17 | Paper |
There exists no (15, 5, 4) RBIBD
Journal of Combinatorial Designs | 2002-04-17 | Paper |
There exists no (15,5,4) RBIBD
Journal of Combinatorial Designs | 2002-02-27 | Paper |
A universal sequence of tensors for the asymptotic rank conjecture
| N/A | Paper |
