| Publication | Date of Publication | Type |
|---|
| Payment scheduling in the interval debt model | 2025-01-16 | Paper |
| Colouring perfect planar graphs in parallel | 2024-02-28 | Paper |
| Payment scheduling in the interval debt model | 2023-08-14 | Paper |
| Using semidirect products of groups to build classes of interconnection networks | 2020-06-29 | Paper |
| Variational networks of cube-connected cycles are recursive cubes of rings | 2020-02-18 | Paper |
| Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs | 2019-11-29 | Paper |
| On the combinatorial design of data centre network topologies | 2017-09-07 | Paper |
| Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori | 2017-06-20 | Paper |
| Graph editing to a fixed target | 2016-11-24 | Paper |
| Generalized hex and logical characterizations of polynomial space | 2016-05-26 | Paper |
| Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes | 2016-04-01 | Paper |
| An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar | 2016-02-05 | Paper |
| On the Mathematics of Data Centre Network Topologies | 2015-09-29 | Paper |
| The expressibility of fragments of hybrid graph logic on finite digraphs | 2014-04-17 | Paper |
| Multiswapped networks and their topological and algorithmic properties | 2014-01-27 | Paper |
| Graph Editing to a Fixed Target | 2014-01-17 | Paper |
| ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES | 2012-12-12 | Paper |
| A general technique to establish the asymptotic conditional diagnosability of interconnection networks | 2012-10-11 | Paper |
| Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes | 2011-08-12 | Paper |
| Augmented \(k\)-ary \(n\)-cubes | 2011-01-28 | Paper |
| A class of hierarchical graphs as topologies for interconnection networks | 2010-07-07 | Paper |
| Frameworks for Logically Classifying Polynomial-Time Optimisation Problems | 2010-06-22 | Paper |
| One-to-many node-disjoint paths in \((n,k)\)-star graphs | 2010-05-05 | Paper |
| On the fixed-parameter tractability of parameterized model-checking problems | 2010-04-19 | Paper |
| On the power of deep pushdown stacks | 2009-11-16 | Paper |
| Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws | 2009-06-23 | Paper |
| Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays | 2009-03-02 | Paper |
| The Computational Complexity of the Parallel Knock-Out Problem | 2008-09-18 | Paper |
| Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies | 2008-09-04 | Paper |
| Program Schemes with Deep Pushdown Storage | 2008-06-19 | Paper |
| The computational complexity of the parallel knock-out problem | 2008-04-15 | Paper |
| Constraint Satisfaction, Logic and Forbidden Patterns | 2008-03-28 | Paper |
| An infinite hierarchy in a class of polynomial-time program schemes | 2006-10-16 | Paper |
| The complexity of achievement and maintenance problems in agent-based systems | 2006-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463349 | 2005-08-04 | Paper |
| Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures | 2004-11-18 | Paper |
| Dichotomies for classes of homomorphism problems involving unary functions | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448769 | 2004-02-18 | Paper |
| Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. | 2003-08-17 | Paper |
| A note on first-order projections and games. | 2003-08-17 | Paper |
| Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes | 2003-01-05 | Paper |
| On a hierarchy involving transitive closure logic and existential second-order quantification | 2002-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551343 | 2002-09-05 | Paper |
| Program schemes, arrays, Lindström quantifiers and zero-one laws | 2002-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757847 | 2001-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525293 | 2001-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955351 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945239 | 2000-03-23 | Paper |
| Hierarchies in classes of program schemes | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4240301 | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246717 | 1999-06-16 | Paper |
| On the power of built-in relations in certain classes of program schemes | 1999-03-02 | Paper |
| Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic | 1997-11-05 | Paper |
| On locating cubic subgraphs in bounded-degree connected bipartite graphs | 1997-06-09 | Paper |
| Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic | 1997-04-08 | Paper |
| Complete problems for monotone NP | 1997-02-28 | Paper |
| Finding regular subgraphs in both arbitrary and planar graphs | 1997-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885913 | 1996-12-05 | Paper |
| On the Intersections of Longest Cycles in a Graph | 1996-07-14 | Paper |
| Completeness of path-problems via logical reductions | 1995-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4835904 | 1995-06-08 | Paper |
| Monotonicity and the Expressibility of NP Operators | 1995-06-07 | Paper |
| Logical Description of Monotone NP Problems | 1994-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283250 | 1994-06-13 | Paper |
| Logical and schematic characterization of complexity classes | 1994-06-02 | Paper |
| Context-sensitive transitive closure operators | 1994-04-12 | Paper |
| Deciding whether a planar graph has a cubic subgraph is NP-complete | 1994-04-04 | Paper |
| A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS | 1994-03-27 | Paper |
| ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM | 1994-03-27 | Paper |
| On completeness for NP via projection translations | 1994-03-24 | Paper |
| Methods for proving completeness via logical reductions | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202957 | 1993-09-06 | Paper |
| On parallelizing a greedy heuristic for finding small dominant sets | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694732 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5285980 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5285981 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028122 | 1993-03-28 | Paper |
| Using the Hamiltonian path operator to capture NP | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016524 | 1993-01-16 | Paper |
| Complete problems for symmetric logspace involving free groups | 1992-06-28 | Paper |
| Complete Problems Involving Boolean Labelled Structures and Projection Transactions | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971257 | 1992-06-25 | Paper |
| REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS | 1992-06-25 | Paper |
| Comparing the Expressibility of Languages Formed Using NP-Complete Operators | 1991-01-01 | Paper |
| An algorithm for colouring perfect planar graphs | 1989-01-01 | Paper |
| The paraheight of certain skew linear groups | 1987-01-01 | Paper |
| Hypercentrality and hypercyclicity in skew linear groups | 1987-01-01 | Paper |
| Supersolubility in Certain Skew Linear Groups | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785973 | 1987-01-01 | Paper |
