| Publication | Date of Publication | Type |
|---|
The shortest even cycle problem is tractable
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
| 2023-09-20 | Paper |
Fully Dynamic Transitive Closure in plane dags with one source and one sink
Lecture Notes in Computer Science | 2023-05-08 | Paper |
scientific article; zbMATH DE number 7651092 (Why is no real title available?)
| 2023-02-07 | Paper |
Dynamic algorithms for the Dyck languages
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
scientific article; zbMATH DE number 7561373 (Why is no real title available?)
| 2022-07-21 | Paper |
Counting connected subgraphs with maximum-degree-aware sieving
| 2022-07-21 | Paper |
Multivariate analysis of orthogonal range searching and graph distances
| 2021-08-04 | Paper |
Multivariate analysis of orthogonal range searching and graph distances
Algorithmica | 2020-08-12 | Paper |
Shortest two disjoint paths in polynomial time
SIAM Journal on Computing | 2019-11-21 | Paper |
Extensor-coding
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fast zeta transforms for lattices with few irreducibles
| 2019-05-10 | Paper |
scientific article; zbMATH DE number 7053391 (Why is no real title available?)
| 2019-05-10 | Paper |
Fast Zeta Transforms for Lattices with Few Irreducibles
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Exponential Time Complexity of the Permanent and the Tutte Polynomial
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Computing graph distances parameterized by treewidth and diameter
| 2018-04-10 | Paper |
Computing the permanent modulo a prime power
Information Processing Letters | 2017-06-13 | Paper |
Narrow sieves for parameterized paths and packings
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Graph colouring algorithms
| 2016-09-30 | Paper |
The parity of set systems under random restrictions with applications to exponential time problems
Automata, Languages, and Programming | 2015-10-27 | Paper |
Black box for constant-time insertion in priority queues (note)
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Shortest two disjoint paths in polynomial time
Automata, Languages, and Programming | 2014-07-01 | 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 |
Evaluation of permanents in rings and semirings
Information Processing Letters | 2012-03-27 | Paper |
Invitation to Algorithmic Uses of Inclusion–Exclusion
Automata, Languages and Programming | 2011-07-07 | Paper |
The exponential time complexity of computing the probability that a graph is connected
Parameterized and Exact Computation | 2010-12-07 | Paper |
Trimmed Moebius inversion and graphs of bounded degree
Theory of Computing Systems | 2010-10-06 | Paper |
Exponential time complexity of the permanent and the Tutte polynomial (extended abstract)
Automata, Languages and Programming | 2010-09-07 | 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 |
Counting Paths and Packings in Halves
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Automata, Languages and Programming | 2009-03-12 | Paper |
Fourier meets M\"{o}bius: fast subset convolution
| 2009-01-05 | Paper |
Exact algorithms for exact satisfiability and number of perfect matchings
Algorithmica | 2008-12-02 | Paper |
The Travelling Salesman Problem in Bounded Degree Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Dynamic nested brackets
Information and Computation | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2086688 (Why is no real title available?)
| 2004-08-11 | Paper |
Finding a Path of Superlogarithmic Length
SIAM Journal on Computing | 2003-09-28 | Paper |
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
SIAM Journal on Computing | 2003-06-19 | Paper |
Lower bounds for approximate polygon decomposition and minimum gap
Information Processing Letters | 2002-07-14 | Paper |
A cell probe lower bound for dynamic nearest-neighbour searching
| 2002-01-30 | Paper |
scientific article; zbMATH DE number 1476488 (Why is no real title available?)
| 2000-07-14 | Paper |
scientific article; zbMATH DE number 1002202 (Why is no real title available?)
| 1997-05-28 | Paper |
