activity
19992022
most citedThe Group Structure of Pivot and Loop Complementation on Graphs and Set Systems

41 citations · 224 across the 20 of their papers we have counts for

collaborators

23 papers

cs.CC2022

Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths

Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Nataša Jonoska

We consider non-cooperative binding, so-called 'temperature 1', in deterministic or directed (called here confluent) tile self-assembly systems in two dimensions and show a necessa…

cs.CC2019

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute

Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Nataša Jonoska

We consider non cooperative binding in so called `temperature 1', in deterministic (here called {\it confluent}) tile self-assembly systems (1-TAS) and prove the standing conjectur…

cs.FL2018

XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles

Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel

The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of "invisible" pebbles (as opposed to the usual "visible" ones).…

math.CO2018

Counterexamples to a conjecture of Las Vergnas

Robert Brijder, Hendrik Jan Hoogeboom

We present counterexamples to a 30-year-old conjecture of Las Vergnas [J. Combin. Theory Ser. B, 1988] regarding the Tutte polynomial of binary matroids.

math.CO2017★ 21 cited

A Graph Isomorphism Condition and Equivalence of Reaction Systems

Daniela Genova, Hendrik Jan Hoogeboom, Nataša Jonoska

We consider global dynamics of reaction systems as introduced by Ehrenfeucht and Rozenberg. The dynamics is represented by a directed graph, the so-called transition graph, and two…

cs.CC2016

Acyclic Constraint Logic and Games

Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn +1

Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is convenient for the analy…