| Publication | Date of Publication | Type |
|---|
Exploration of graphs with excluded minors
| 2025-01-06 | Paper |
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm
| 2024-12-19 | Paper |
Choiceless polynomial time with witnessed symmetric choice
| 2024-12-06 | Paper |
Algorithms transcending the SAT-symmetry interface
| 2024-11-26 | Paper |
scientific article; zbMATH DE number 7788492 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788597 (Why is no real title available?)
| 2024-01-15 | Paper |
A Faster Isomorphism Test for Graphs of Small Degree
SIAM Journal on Computing | 2023-12-19 | Paper |
Parallel Computation of Combinatorial Symmetries.
| 2023-09-20 | Paper |
Graphs Identified by Logics with Counting
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
Choiceless Polynomial Time with Witnessed Symmetric Choice
| 2022-05-27 | Paper |
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension
| 2021-11-23 | Paper |
An improved isomorphism test for bounded-tree-width graphs
| 2021-07-28 | Paper |
An improved isomorphism test for bounded-tree-width graphs
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Engineering a Fast Probabilistic Isomorphism Test
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
On the Weisfeiler-Leman dimension of finite groups
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
The Weisfeiler-Leman dimension of planar graphs is at most 3
| 2021-01-19 | Paper |
Automorphism groups of graphs of bounded Hadwiger number
| 2020-12-28 | Paper |
Classification of Finite Highly Regular Vertex-Coloured Graphs
| 2020-12-02 | Paper |
Space-efficient algorithms for longest increasing subsequence
| 2020-08-05 | Paper |
A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry
| 2020-05-27 | Paper |
Benchmark Graphs for Practical Graph Isomorphism
| 2020-05-27 | Paper |
Space-efficient algorithms for longest increasing subsequence
Theory of Computing Systems | 2020-04-15 | Paper |
Stochastic dominance and the bijective ratio of online algorithms
Algorithmica | 2020-04-01 | Paper |
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
Journal of the ACM | 2020-02-11 | Paper |
A unifying method for the design of algorithms canonizing combinatorial objects
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Canonizing Graphs of Bounded Tree Width in Logspace
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Subgroups of 3-factor direct products
Tatra Mountains Mathematical Publications | 2019-09-30 | Paper |
ScrewBox: a randomized certifying graph-non-isomorphism algorithm
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Upper bounds on the quantifier depth for graph differentiation in first-order logic
Logical Methods in Computer Science | 2019-07-12 | Paper |
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm
| 2019-05-08 | Paper |
Paging and list update under bijective analysis
| 2019-05-06 | Paper |
Upper bounds on the quantifier depth for graph differentiation in first order logic
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Induced minor free graphs: isomorphism and clique-width
Algorithmica | 2018-02-28 | Paper |
Towards an isomorphism dichotomy for hereditary graph classes
Theory of Computing Systems | 2018-02-01 | Paper |
Canonizing graphs of bounded tree width in logspace
| 2018-01-24 | Paper |
Minimal asymmetric graphs
Journal of Combinatorial Theory. Series B | 2017-09-29 | Paper |
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink
IEEE Transactions on Computers | 2017-07-12 | Paper |
Towards an Isomorphism Dichotomy for Hereditary Graph Classes
| 2017-01-24 | Paper |
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Induced minor free graphs: isomorphism and clique-width
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Subgroups of 3-factor direct products
| 2016-07-12 | Paper |
Computing with tangles
SIAM Journal on Discrete Mathematics | 2016-06-23 | Paper |
On quasioutomorphism groups of free groups and their transitivity properties
Journal of Algebra | 2016-01-29 | Paper |
Graphs identified by logics with counting
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Depth-First Search Using $$O(n)$$ Bits
Algorithms and Computation | 2015-09-11 | Paper |
A linear-time algorithm for testing outer-1-planarity
Algorithmica | 2015-09-02 | Paper |
Computing with Tangles
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Isomorphism Testing for Graphs of Bounded Rank Width
| 2015-05-14 | Paper |
Certifying algorithms
Computer Science Review | 2014-10-24 | Paper |
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Switching reconstruction of digraphs
Journal of Graph Theory | 2014-08-07 | Paper |
Competition numbers, quasi-line graphs, and holes
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Iterated open neighborhood graphs and generalizations
Discrete Applied Mathematics | 2014-04-16 | Paper |
Paging and list update under bijective analysis
Journal of the ACM | 2014-02-17 | Paper |
Weisfeiler-Lehman graph kernels
| 2014-02-03 | Paper |
On zero divisors with small support in group rings of torsion-free groups.
Journal of Group Theory | 2014-01-23 | Paper |
Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes
Algorithms and Computation | 2014-01-14 | Paper |
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Theoretical Computer Science | 2014-01-13 | Paper |
A linear-time algorithm for testing outer-1-planarity
Graph Drawing | 2013-12-20 | Paper |
Connecting face hitting sets in planar graphs
Information Processing Letters | 2013-04-04 | Paper |
Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)
Graph Drawing | 2013-04-03 | Paper |
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science | 2013-01-07 | Paper |
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Isomorphism of (mis)Labeled Graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Online Graph Exploration: New Results on Old and New Algorithms
Automata, Languages and Programming | 2011-07-07 | Paper |
Homomorphism-homogeneous graphs
Journal of Graph Theory | 2011-01-19 | Paper |
Progress on certifying algorithms
Frontiers in Algorithmics | 2010-09-07 | Paper |
Isomorphism for graphs of bounded feedback vertex set number
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Using the incompressibility method to obtain local Lemma results for Ramsey-type problems
Information Processing Letters | 2010-06-16 | Paper |
Counting defective parking functions
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The co-word problem for the Higman-Thompson group is context-free
Bulletin of the London Mathematical Society | 2007-07-12 | Paper |
Context-Freeness of Higman-Thompson group's co-word problem
| 2005-07-05 | Paper |
An Upper Bound on the Weisfeiler-Leman Dimension
| N/A | Paper |
